* (abs(a.x) + abs(a.y) + abs(b.x) + abs(b.y)));\\n // return sign(cross(a, b), EPS<Float> * (abs<Float>(a.x) + abs<Float>(a.y) + abs<Float>(b.x) + abs<Float>(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<Float> * (abs(a.x) + abs(a.y) + abs(b.x) + abs(b.y)));\\n // return sign(dot(a, b), EPS<Float> * (abs<Float>(a.x) + abs<Float>(a.y) + abs<Float>(b.x) + abs<Float>(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<ld> a(x, y);\\n return std::arg(a);\\n }\\n};\\n\\ntemplate<FloatingPoint Float>\\nstruct arg_less {\\n constexpr bool operator()(const point<Float> &l, const point<Float> &r){\\n using std::atan2;\\n return atan2(l.y, l.x) < atan2(r.y, r.x);\\n }\\n};\\n\\ntemplate<FloatingPoint Float>\\nvoid arg_sort(std::vector<point<Float>> &a){\\n\\tstd::sort(a.begin(), a.end(), arg_less<Float>{});\\n}\\n\\n\\ntemplate<FloatingPoint Float>\\nstd::vector<int> upper_convex_hull_index(const std::vector<point<Float>> &a){\\n\\tif (a.empty()) return {};\\n\\tstd::vector<int> 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<int> 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<FloatingPoint Float>\\nstd::vector<int> lower_convex_hull_index(const std::vector<point<Float>> &a){\\n\\tif (a.empty()) return {};\\n\\tstd::vector<int> 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<int> 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<FloatingPoint Float>\\nstd::vector<int> convex_hull_index(const std::vector<point<Float>> &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<FloatingPoint Float>\\nstruct line {\\n\\tpoint<Float> end0, end1;\\n line () {}\\n\\tline (const point<Float> &_end0, const point<Float> &_end1) : end0(_end0), end1(_end1) {\\n\\t\\tassert(end0 != end1);\\n\\t}\\n\\t// auto operator<=>(const line &) const = default;\\n\\tpoint<Float> 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<Float> &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<Float> 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<Float> projection(const line &a, const point<Float> &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<Float> reflection(const line &a, const point<Float> &b){\\n\\t\\tauto prj = projection(a, b);\\n\\t\\treturn prj + prj - b;\\n\\t}\\n friend line<Float> perpendicular_bisector(const point<Float> &p1, const point<Float> &p2){\\n auto ctr = (p1 + p2) / Float{2};\\n auto dir = rot90(p2 - p1);\\n return line<Float>(ctr, ctr + dir);\\n }\\n};\\n\\ntemplate<FloatingPoint Float>\\nline<Float> perpendicular_bisector(const point<Float> &p1, const point<Float> &p2){\\n auto ctr = (p1 + p2) / Float{2};\\n auto dir = rot90(p2 - p1);\\n return line<Float>(ctr, ctr + dir);\\n}\\n\\n\\ntemplate<FloatingPoint Float>\\nstruct segment {\\n\\tpoint<Float> end0, end1;\\n segment () {}\\n\\tsegment (const point<Float> &_end0, const point<Float> &_end1) : end0(_end0), end1(_end1) {\\n\\t\\tassert(end0 != end1);\\n\\t}\\n\\t// auto operator<=>(const segment &) const = default;\\n\\tpoint<Float> 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<Float> &b){\\n\\t\\treturn ccw(a.end0, a.end1, b) == 0;\\n\\t}\\n\\tfriend point<Float> 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<Float> as_line() const {\\n\\t\\treturn line<Float>(end0, end1);\\n\\t}\\n};\\n\\ntemplate<FloatingPoint Float>\\nstruct circle {\\n point<Float> center;\\n Float radius;\\n circle () {}\\n circle (const point<Float> &_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<Float> &l){\\n point<Float> 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<Float> &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<Float> &p){\\n return sign(abs(p - c.center) - c.radius) == 0;\\n }\\n friend std::vector<point<Float>> 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<Float> 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<Float> 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<point<Float>> common_points(const circle &c, const line<Float> &l) {\\n point<Float> 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<Float> 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<ld>;\\n\\nvoid solve(ll N,ll M) {\\n\\tvector<vec> AP(N);\\n\\trep(i,N){\\n\\t\\tcin>>AP[i];\\n\\t}\\n\\tvector<tuple<ll,ll,ld>> 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<ll> 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<ld> cent(AP[a],abs(AP[a]-AP[b]));\\n\\t\\t\\tvector<ld> cpt;\\n\\t\\t\\tset<ll> 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<ld> 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<vec> 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)<abs(AP[na]-AP[nb])){\\n\\t\\t\\t\\t\\t\\tps^=1LL<<nj;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tES_set.insert(ps);\\n\\t\\t\\t\\tfor (ll nj:same){\\n\\t\\t\\t\\t\\tps^=1LL<<nj;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tES_set.insert(ps);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tld mc=1e18;\\n\\t\\tfor (ll es:ES_set){\\n\\t\\t\\tld c=0;\\n\\t\\t\\trep(j,M){\\n\\t\\t\\t\\tauto [a,b,v]=edge[j];\\n\\t\\t\\t\\tif (~S>>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<ll> 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<ll> 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<<j;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse if (abs(cw)!=1){\\n\\t\\t\\t\\t\\t\\tol.push_back(j);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif ((AP[i]-AP[ni]).x==0){\\n\\t\\t\\t\\t\\tsort(all(ol),[&](ll ii,ll jj){\\n\\t\\t\\t\\t\\t\\treturn (AP[ii].y<AP[jj].y);\\n\\t\\t\\t\\t\\t});\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\tsort(all(ol),[&](ll ii,ll jj){\\n\\t\\t\\t\\t\\t\\treturn (AP[ii].x<AP[jj].x);\\n\\t\\t\\t\\t\\t});\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tfor (ll k:ol){\\n\\t\\t\\t\\t\\tdiv_set.insert(S);\\n\\t\\t\\t\\t\\tS^=1LL<<k;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tfor (ll k:ol){\\n\\t\\t\\t\\t\\tdiv_set.insert(S);\\n\\t\\t\\t\\t\\tS^=1LL<<k;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tld cost=1e18;\\n\\t\\tll mask=1LL<<N;\\n\\t\\tmask--;\\n\\t\\tfor (ll s:div_set){\\n\\t\\t\\tld c=cost_set(s)+cost_set(s^mask);\\n\\t\\t\\tchmin(cost,c);\\n\\t\\t}\\n\\t\\treturn cost;\\n\\t};\\n\\tld ans=pt_div();\\n\\tans/=M;\\n\\tans=sqrt(ans);\\n\\tcout<<setprecision(15)<<fixed;\\n\\tcout<<ans<<endl;\\n return;\\n}\\n\\n\\nint main() {\\n while (true){\\n\\t\\tll N,M;\\n\\t\\tcin>>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 <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\n\\n#define rep(i,n) for(ll i=0;i<n;++i)\\n#define all(a) (a).begin(),(a).end()\\nll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }\\nll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }\\ntemplate<class T> T div_floor(T a, T b) { return a / b - ((a ^ b) < 0 && a % b); }\\ntemplate<class T> T div_ceil(T a, T b) { return a / b + ((a ^ b) > 0 && a % b); }\\ntemplate <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }\\ntemplate <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }\\n\\ntemplate<typename T>\\nostream &operator<<(ostream &os, const vector<T> &a){\\n\\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 <type_traits>\\n#include <concepts>\\n#include <compare>\\n#include <cmath>\\n#include <algorithm>\\n#include <vector>\\n#include <iostream>\\n#include <numeric>\\n#include <cassert>\\n#include <ranges>\\n\\n#if __has_include(<boost/multiprecision/cpp_bin_float.hpp>)\\n\\n#include<boost/multiprecision/cpp_bin_float.hpp>\\n\\n#endif\\n\\nnamespace float_geometry {\\n\\ntemplate<class T>\\nstruct is_floating_point_number : std::bool_constant<false> {};\\n\\ntemplate<std::floating_point F>\\nstruct is_floating_point_number<F> : std::bool_constant<true> {};\\n\\n#if __has_include(<boost/multiprecision/cpp_bin_float.hpp>)\\n\\ntemplate<unsigned D>\\nstruct is_floating_point_number<boost::multiprecision::number<boost::multiprecision::backends::cpp_bin_float<D>>> : std::bool_constant<true> {};\\n\\ntemplate<unsigned D>\\nstruct is_floating_point_number<boost::multiprecision::number<boost::multiprecision::backends::cpp_dec_float<D>>> : std::bool_constant<true> {};\\n\\n#endif\\n\\ntemplate<class F>\\nconcept FloatingPoint = is_floating_point_number<F>::value;\\n\\ntemplate<FloatingPoint Float>\\nconstexpr Float EPS = Float{1e-9};\\n\\ntemplate<FloatingPoint Float>\\nconstexpr int sign(const Float &x, Float eps = EPS<Float>){\\n return (x < -eps ? -1 : x > eps ? 1 : 0);\\n}\\n\\ntemplate<FloatingPoint Float>\\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<Float> * (abs(a.x) + abs(a.y) + abs(b.x) + abs(b.y)));\\n // return sign(cross(a, b), EPS<Float> * (abs<Float>(a.x) + abs<Float>(a.y) + abs<Float>(b.x) + abs<Float>(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<Float> * (abs(a.x) + abs(a.y) + abs(b.x) + abs(b.y)));\\n // return sign(dot(a, b), EPS<Float> * (abs<Float>(a.x) + abs<Float>(a.y) + abs<Float>(b.x) + abs<Float>(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<ld> a(x, y);\\n return std::arg(a);\\n }\\n};\\n\\ntemplate<FloatingPoint Float>\\nstruct arg_less {\\n constexpr bool operator()(const point<Float> &l, const point<Float> &r){\\n using std::atan2;\\n return atan2(l.y, l.x) < atan2(r.y, r.x);\\n }\\n};\\n\\ntemplate<FloatingPoint Float>\\nvoid arg_sort(std::vector<point<Float>> &a){\\n\\tstd::sort(a.begin(), a.end(), arg_less<Float>{});\\n}\\n\\n\\ntemplate<FloatingPoint Float>\\nstd::vector<int> upper_convex_hull_index(const std::vector<point<Float>> &a){\\n\\tif (a.empty()) return {};\\n\\tstd::vector<int> 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<int> 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<FloatingPoint Float>\\nstd::vector<int> lower_convex_hull_index(const std::vector<point<Float>> &a){\\n\\tif (a.empty()) return {};\\n\\tstd::vector<int> 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<int> 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<FloatingPoint Float>\\nstd::vector<int> convex_hull_index(const std::vector<point<Float>> &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<FloatingPoint Float>\\nstruct line {\\n\\tpoint<Float> end0, end1;\\n line () {}\\n\\tline (const point<Float> &_end0, const point<Float> &_end1) : end0(_end0), end1(_end1) {\\n\\t\\tassert(end0 != end1);\\n\\t}\\n\\t// auto operator<=>(const line &) const = default;\\n\\tpoint<Float> 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<Float> &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<Float> 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<Float> projection(const line &a, const point<Float> &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<Float> reflection(const line &a, const point<Float> &b){\\n\\t\\tauto prj = projection(a, b);\\n\\t\\treturn prj + prj - b;\\n\\t}\\n friend line<Float> perpendicular_bisector(const point<Float> &p1, const point<Float> &p2){\\n auto ctr = (p1 + p2) / Float{2};\\n auto dir = rot90(p2 - p1);\\n return line<Float>(ctr, ctr + dir);\\n }\\n};\\n\\ntemplate<FloatingPoint Float>\\nline<Float> perpendicular_bisector(const point<Float> &p1, const point<Float> &p2){\\n auto ctr = (p1 + p2) / Float{2};\\n auto dir = rot90(p2 - p1);\\n return line<Float>(ctr, ctr + dir);\\n}\\n\\n\\ntemplate<FloatingPoint Float>\\nstruct segment {\\n\\tpoint<Float> end0, end1;\\n segment () {}\\n\\tsegment (const point<Float> &_end0, const point<Float> &_end1) : end0(_end0), end1(_end1) {\\n\\t\\tassert(end0 != end1);\\n\\t}\\n\\t// auto operator<=>(const segment &) const = default;\\n\\tpoint<Float> 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<Float> &b){\\n\\t\\treturn ccw(a.end0, a.end1, b) == 0;\\n\\t}\\n\\tfriend point<Float> 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<Float> as_line() const {\\n\\t\\treturn line<Float>(end0, end1);\\n\\t}\\n};\\n\\ntemplate<FloatingPoint Float>\\nstruct circle {\\n point<Float> center;\\n Float radius;\\n circle () {}\\n circle (const point<Float> &_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<Float> &l){\\n point<Float> 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<Float> &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<Float> &p){\\n return sign(abs(p - c.center) - c.radius) == 0;\\n }\\n friend std::vector<point<Float>> 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<Float> 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<Float> 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<point<Float>> common_points(const circle &c, const line<Float> &l) {\\n point<Float> 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<Float> 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<ld>;\\n\\nvoid solve(ll N,ll M) {\\n\\tvector<vec> AP(N);\\n\\trep(i,N){\\n\\t\\tcin>>AP[i];\\n\\t}\\n\\tvector<tuple<ll,ll,ld>> 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<ll> 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<ld> cent(AP[a],abs(AP[a]-AP[b]));\\n\\t\\t\\tvector<ld> cpt;\\n\\t\\t\\tset<ll> 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<ld> 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<vec> 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)<abs(AP[na]-AP[nb])){\\n\\t\\t\\t\\t\\t\\tps^=1LL<<nj;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tES_set.insert(ps);\\n\\t\\t\\t\\tfor (ll nj:same){\\n\\t\\t\\t\\t\\tps^=1LL<<nj;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tES_set.insert(ps);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tld mc=1e18;\\n\\t\\tfor (ll es:ES_set){\\n\\t\\t\\tld c=0;\\n\\t\\t\\trep(j,M){\\n\\t\\t\\t\\tauto [a,b,v]=edge[j];\\n\\t\\t\\t\\tif (~S>>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<ll> 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<ll> 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<<j;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\telse if (abs(cw)!=1){\\n\\t\\t\\t\\t\\t\\tol.push_back(j);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif ((AP[i]-AP[ni]).x==0){\\n\\t\\t\\t\\t\\tsort(all(ol),[&](ll ii,ll jj){\\n\\t\\t\\t\\t\\t\\treturn (AP[ii].y<AP[jj].y);\\n\\t\\t\\t\\t\\t});\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse{\\n\\t\\t\\t\\t\\tsort(all(ol),[&](ll ii,ll jj){\\n\\t\\t\\t\\t\\t\\treturn (AP[ii].x<AP[jj].x);\\n\\t\\t\\t\\t\\t});\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tfor (ll k:ol){\\n\\t\\t\\t\\t\\tdiv_set.insert(S);\\n\\t\\t\\t\\t\\tS^=1LL<<k;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tfor (ll k:ol){\\n\\t\\t\\t\\t\\tdiv_set.insert(S);\\n\\t\\t\\t\\t\\tS^=1LL<<k;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tld cost=1e18;\\n\\t\\tll mask=(1LL<<N)-1;\\n\\t\\tfor (ll s:div_set){\\n\\t\\t\\tld c=cost_set(s)+cost_set(s^mask);\\n\\t\\t\\tchmin(cost,c);\\n\\t\\t}\\n\\t\\treturn cost;\\n\\t};\\n\\tld ans=pt_div();\\n\\tans/=M;\\n\\tans=sqrt(ans);\\n\\tcout<<setprecision(15)<<fixed;\\n\\tcout<<ans<<endl;\\n return;\\n}\\n\\n\\nint main() {\\n while (true){\\n\\t\\tll N,M;\\n\\t\\tcin>>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<bits/stdc++.h>\\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<typename T> bool chmin(T &a, const T &b){\\n if (a <= b) return false;\\n a = b;\\n return true;\\n}\\ntemplate<typename T> 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<ld>;\\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<vec> cross_point(const circle &c, const line &l) {\\n vector<vec> 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<vec> cross_point(const circle &c1, const circle &c2) {\\n vector<vec> 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<typename T>\\nvoid vout(const vector<T> &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<int,int>;\\n\\nvoid input_point(int n, int m, vector<vec> &a, vector<line> &lines, vector<circle> &cirs,\\n vector<P> &es, vector<ld> &vrs, vector<ll> &nmsk){\\n vector<ll> xs(n), ys(n);\\n rep(i,0,n){\\n cin >> xs[i] >> ys[i];\\n a.emplace_back(rot(vec(xs[i],ys[i]),1));\\n }\\n set<Line> prelines;\\n rep(i,0,n-1) rep(j,i+1,n) prelines.insert(Line(xs[i],ys[i],xs[j],ys[j]));\\n for (auto cl : prelines){\\n vec xy1(cl.xp,cl.yp);\\n vec xy2(cl.xq,cl.yq);\\n lines.push_back({rot(xy1,1),rot(xy2,1)});\\n }\\n set<P> 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<vec> a;\\n vector<line> lines;\\n vector<circle> cirs;\\n vector<P> es(m);\\n vector<ld> vrs(m);\\n vector<ll> nmsk(n,0);\\n input_point(n,m,a,lines,cirs,es,vrs,nmsk);\\n cirs.push_back({vec(0,0),5000}); // add large circle\\n int ns = cirs.size();\\n using pvt = pair<vec,int>;\\n // enumerate x, leftmost point of circle, rightmost point of circle, cross point of two circles\\n vector<pvt> vs;\\n rep(i,0,ns){\\n vs.emplace_back(pvt(cirs[i].c - vec(cirs[i].r,0), 0));\\n vs.emplace_back(pvt(cirs[i].c + vec(cirs[i].r,0), 1));\\n rep(j,i+1,ns){\\n for (auto p : cross_point(cirs[i],cirs[j])){\\n vs.emplace_back(pvt(p,2));\\n }\\n }\\n }\\n sort(all(vs),[&](pvt l, pvt r){\\n if (sgn(abs(l.first-r.first)) == 0) return false;\\n return l.first.real() < r.first.real();\\n });\\n // unique x\\n vector<pvt> nvs;\\n vec mae(-100000,0);\\n for (pvt vt : vs){\\n if (sgn(abs(mae-vt.first)) == 0) continue;\\n nvs.emplace_back(vt);\\n mae = vt.first;\\n }\\n swap(nvs,vs);\\n int ms = vs.size();\\n vector<vec> pnt;\\n rep(i,0,ms){\\n if (vs[i].second < 2) continue;\\n int cnt = 0;\\n rep(j,0,ns) if (sgn(cirs[j].r - abs(cirs[j].c - vs[i].first)) == 0) cnt++;\\n vs[i].second = cnt;\\n pnt.emplace_back(vs[i].first);\\n }\\n // enumerate y corresponding each x\\n vector<vector<pvt>> ver(ms);\\n rep(i,0,ms){\\n line l({vec(vs[i].first.real(),0),vec(vs[i].first.real(),1)});\\n ver[i].emplace_back(vs[i]);\\n rep(j,0,ns){\\n for (auto p : cross_point(cirs[j],l)){\\n if (sgn(abs(vs[i].first-p)) == 0) continue;\\n ver[i].emplace_back(pvt(p,-1));\\n }\\n }\\n sort(all(ver[i]),[&](pvt l, pvt r){\\n return l.first.imag() < r.first.imag();\\n });\\n }\\n // enumerate y corresponding middle x = (x1 + x2) / 2, each consecutive x1, x2\\n vector<vector<vec>> mid(ms-1);\\n rep(i,0,ms-1){\\n ld mx = (vs[i].first.real() + vs[i+1].first.real()) / 2;\\n line l({vec(mx,0),vec(mx,1)});\\n rep(j,0,ns){\\n for (auto p : cross_point(cirs[j],l)){\\n mid[i].emplace_back(p);\\n }\\n }\\n sort(all(mid[i]),[&](vec l, vec r){\\n return l.imag() < r.imag();\\n });\\n }\\n // enumerate point which is representing each area\\n rep(itr,0,ms-1){\\n int id = 0;\\n rep(i,0,ver[itr].size()){\\n if (ver[itr][i].second == 1) continue;\\n if (ver[itr][i].second == -1){\\n id++;\\n continue;\\n }\\n rep(j,0,abs(ver[itr][i].second-1)){\\n pnt.emplace_back((mid[itr][id]+mid[itr][id+1])/ld(2));\\n id++;\\n }\\n id++;\\n }\\n }\\n int psiz = pnt.size();\\n vector<ll> pmsk(psiz,0);\\n rep(j,0,psiz){\\n rep(i,0,m){\\n ld d1 = abs(a[es[i].first]-a[es[i].second]);\\n ld d2 = abs(a[es[i].first]-pnt[j]);\\n if (d2 < d1) pmsk[j] |= (1LL<<i);\\n } //cout << pmsk[j] << endl; cout << pnt[j] << endl;\\n }\\n sort(all(pmsk)); pmsk.erase(unique(all(pmsk)),pmsk.end()); psiz = pmsk.size();\\n map<ll,ld> indist, outdist;\\n auto get_indist = [&](ll msk){\\n if (msk == 0) return ld(0);\\n if (indist.find(msk) != indist.end()) return indist[msk];\\n vec rui(0,0);\\n ld wgt = 0;\\n rep(i,0,m){\\n if (msk >> i & 1){\\n rui += a[es[i].first] * vrs[i];\\n wgt += vrs[i];\\n }\\n }\\n rui /= wgt;\\n ld res = 0;\\n rep(i,0,m){\\n if (msk >> i & 1){\\n res += norm(rui-a[es[i].first]) * vrs[i];\\n }\\n }\\n return indist[msk] = res;\\n };\\n auto get_outdist = [&](ll msk){\\n if (msk == 0) return ld(0);\\n if (outdist.find(msk) != outdist.end()) return outdist[msk];\\n ld res = 0;\\n rep(i,0,m){\\n if (msk >> i & 1){\\n res += norm(a[es[i].first]-a[es[i].second]) * vrs[i];\\n }\\n }\\n return outdist[msk] = res;\\n };\\n auto calc = [&](ll msk){\\n ld res = 2e18;\\n rep(j,0,psiz){\\n ll inmsk = pmsk[j]&msk;\\n ll outmsk = inmsk^msk;\\n chmin(res,get_indist(inmsk)+get_outdist(outmsk));\\n }\\n return res;\\n };\\n ld ans = 2e18;\\n for (auto l : lines){\\n vector<int> idc;\\n ll lmsk = 0, rmsk = 0;\\n rep(i,0,n){\\n if (on_line(l,a[i])){\\n idc.emplace_back(i);\\n continue;\\n }\\n (sgn(cross(l.b-l.a,a[i]-l.a)) == 1 ? lmsk : rmsk) |= nmsk[i];\\n }\\n sort(all(idc),[&](int i, int j){\\n return a[i].real() < a[j].real();\\n });\\n int siz = idc.size();\\n vector<ll> lui(siz+1,0), rui(siz+1,0);\\n rep(i,0,siz){\\n lui[i+1] = (lui[i] | nmsk[idc[i]]);\\n }\\n rrep(i,0,siz){\\n rui[i] = (rui[i+1] | nmsk[idc[i]]);\\n }\\n for (int cl = 0; cl <= siz; cl++){\\n chmin(ans,calc(lmsk|lui[cl])+calc(rmsk|rui[cl]));\\n chmin(ans,calc(rmsk|lui[cl])+calc(lmsk|rui[cl]));\\n }\\n }\\n cout << sqrt(ans/m) << endl;\\n}\\n\\nint main(){\\n while (true){\\n int n, m; cin >> n >> m;\\n if (n == 0) break;\\n solve1(n,m);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3070,\n \"memory_kb\": 18792,\n \"score_of_the_acc\": -1.4694,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1614_5965164\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\n#define rep(i,n) for(int i=0;i<int(n);i++)\\n#define rep1(i,n) for(int i=1;i<=int(n);i++)\\n#define per(i,n) for(int i=int(n)-1;i>=0;i--)\\n#define per1(i,n) for(int i=int(n);i>0;i--)\\n#define all(c) c.begin(),c.end()\\n#define si(x) int(x.size())\\n#define pb push_back\\n#define eb emplace_back\\n#define fs first\\n#define sc second\\ntemplate<class T> using V = vector<T>;\\ntemplate<class T> using VV = vector<vector<T>>;\\ntemplate<class T,class U> bool chmax(T& x, U y){\\n\\tif(x<y){ x=y; return true; }\\n\\treturn false;\\n}\\ntemplate<class T,class U> bool chmin(T& x, U y){\\n\\tif(y<x){ x=y; return true; }\\n\\treturn false;\\n}\\ntemplate<class T> void mkuni(V<T>& v){sort(all(v));v.erase(unique(all(v)),v.end());}\\ntemplate<class T> int lwb(const V<T>& v, const T& a){return lower_bound(all(v),a) - v.begin();}\\ntemplate<class T>\\nV<T> Vec(size_t a) {\\n return V<T>(a);\\n}\\ntemplate<class T, class... Ts>\\nauto Vec(size_t a, Ts... ts) {\\n return V<decltype(Vec<T>(ts...))>(a, Vec<T>(ts...));\\n}\\ntemplate<class S,class T> ostream& operator<<(ostream& o,const pair<S,T> &p){\\n\\treturn o<<\\\"(\\\"<<p.fs<<\\\",\\\"<<p.sc<<\\\")\\\";\\n}\\ntemplate<class T> ostream& operator<<(ostream& o,const vector<T> &vc){\\n\\to<<\\\"{\\\";\\n\\tfor(const T& v:vc) o<<v<<\\\",\\\";\\n\\to<<\\\"}\\\";\\n\\treturn o;\\n}\\nconstexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n-1); }\\n\\n#ifdef LOCAL\\n#define show(x) cerr << \\\"LINE\\\" << __LINE__ << \\\" : \\\" << #x << \\\" = \\\" << (x) << endl\\nvoid dmpr(ostream& os){os<<endl;}\\ntemplate<class T,class... Args>\\nvoid dmpr(ostream&os,const T&t,const Args&... args){\\n\\tos<<t<<\\\" ~ \\\";\\n\\tdmpr(os,args...);\\n}\\n#define shows(...) cerr << \\\"LINE\\\" << __LINE__ << \\\" : \\\";dmpr(cerr,##__VA_ARGS__)\\n#define dump(x) cerr << \\\"LINE\\\" << __LINE__ << \\\" : \\\" << #x << \\\" = {\\\"; \\\\\\n\\tfor(auto v: x) cerr << v << \\\",\\\"; cerr << \\\"}\\\" << endl;\\n#else\\n#define show(x) void(0)\\n#define dump(x) void(0)\\n#define shows(...) void(0)\\n#endif\\n\\ntemplate<class D> D divFloor(D a, D b){\\n\\treturn a / b - (((a ^ b) < 0 && a % b != 0) ? 1 : 0);\\n}\\ntemplate<class D> D divCeil(D a, D b) {\\n\\treturn a / b + (((a ^ b) > 0 && a % b != 0) ? 1 : 0);\\n}\\n\\nusing D = double;\\nusing P = complex<D>;\\nusing L = pair<P,P>;\\nusing Pol = vector<P>;\\nstruct C{P p;D r;};\\nD inf=1e50,eps=1e-10,PI=acos(0.0)*2;\\nbool eq(D a, D b) { return abs(a-b)<eps;}\\nbool eq(P a, P b) { return abs(a-b)<eps;}\\nint sig(D a) { return eq(a,0) ? 0 : (a>0 ? 1 : -1);}\\nint large(D a,D b){return eq(a,b)?0:(a>b?1:-1);}\\nbool compxy (const P& l, const P& r){\\n\\treturn eq(l.real(),r.real()) ? l.imag()<r.imag() : l.real() < r.real();\\n}\\nbool compyx (const P& l, const P& r){\\n\\treturn eq(l.imag(),r.imag()) ? l.real()<r.real() : l.imag() < r.imag();\\n}\\ninline D dot(P a, P b) { return real(conj(a)*b);}\\ninline D cro(P a, P b) { return imag(conj(a)*b);}\\n//enum ENCCW{CCW(left)=1, CW(right)=-1, FRONT=-2, BACK=2, ON=0};\\n//ON優先(including endpoint)\\ninline int ccw (P a, P b, P c){\\n\\tif(sig(cro(b-a,c-a))==1) return 1;\\n\\tif(sig(cro(b-a,c-a))==-1) return -1;\\n\\tif(eq(abs(a-c)+abs(c-b),abs(a-b))) return 0;\\n\\tif(eq(abs(a-b)+abs(b-c),abs(a-c))) return -2;\\n\\tif(eq(abs(c-a)+abs(a-b),abs(c-b))) return 2;\\n\\tassert(false);\\n}\\ninline int ccw(L a,P p){return ccw(a.fs,a.sc,p);}\\ninline P proj(P a, P b){\\t\\t//ベクトルaのbへの射影\\n\\treturn (dot(a,b)/norm(b))*b;\\n}\\ninline D verlen(L l,P p){\\t//垂線の長さ(符号付き ccw(左)が正)\\n\\treturn cro(l.sc-l.fs,p-l.fs)/abs(l.sc-l.fs);\\n}\\ninline P perp(L l, P p){\\t\\t//垂線の足\\n\\tD t=dot(p-l.fs,l.fs-l.sc)/norm(l.fs-l.sc);\\n\\treturn l.fs+t*(l.fs-l.sc);\\n}\\ninline P refl(L l, P p){\\n\\treturn p+2.0*(perp(l,p)-p);\\n}\\ninline bool ispal(L a, L b){\\n\\treturn sig(cro(a.fs-a.sc,b.fs-b.sc))==0;\\n}\\ninline bool ovLL(L a, L b){\\n\\treturn ispal(a,b) && sig(cro(a.fs-a.sc,b.fs-a.sc))==0;\\n}\\ninline bool iLL(L a, L b){\\t\\t//intersect or overload\\n\\treturn !ispal(a,b) || ovLL(a,b);\\n}\\ninline bool iLS(L l, L s){\\t\\t//intersect(including endpoint) or overload\\n\\treturn cro(l.sc-l.fs,s.fs-l.fs)*cro(l.sc-l.fs,s.sc-l.fs)<eps;\\n}\\ninline bool iLSex(L l, L s){\\t\\t//intersect(excluding endpoint)\\n\\treturn cro(l.sc-l.fs,s.fs-l.fs)*cro(l.sc-l.fs,s.sc-l.fs)<-eps;\\n}\\ninline bool iLP(L l, P p){\\t\\t//on line\\n\\treturn abs(sig(cro(l.sc-p,l.fs-p)))!=1;\\n}\\ninline bool iSS(L a, L b){\\t\\t//intersect(including endpoint) or overload\\n\\treturn ccw(a.fs,a.sc,b.fs)*ccw(a.fs,a.sc,b.sc)<=0 && ccw(b.fs,b.sc,a.fs)*ccw(b.fs,b.sc,a.sc)<=0;\\n}\\ninline bool iSSex(L a, L b){\\t\\t//intersect(excluding endpoint)\\n\\treturn ccw(a.fs,a.sc,b.fs)*ccw(a.fs,a.sc,b.sc)<0 && ccw(b.fs,b.sc,a.fs)*ccw(b.fs,b.sc,a.sc)<0;\\n}\\ninline bool iSP(L s, P p){\\t\\t//intersect(including endpoint) or overload\\n\\treturn ccw(s.fs,s.sc,p)==0;\\n}\\ninline D dLP(L l, P p) { return abs(perp(l,p)-p);}\\ninline D dLL(L a, L b) { return iLL(a,b) ? 0 : dLP(a,b.fs);}\\ninline D dLS(L l, L s) { return iLS(l,s) ? 0 : min(dLP(l,s.fs),dLP(l,s.sc));}\\ninline D dSP(L s, P p) {\\n\\tP q=perp(s,p);\\n\\treturn iSP(s,q) ? abs(p-q) : min(abs(p-s.fs),abs(p-s.sc));\\n}\\ninline D dSS(L a, L b) {\\n\\tif(iSS(a,b)) return 0;\\n\\treturn min(min(dSP(a,b.fs),dSP(a,b.sc)),min(dSP(b,a.fs),dSP(b,a.sc)));\\n}\\ninline P intLL(L a, L b) {\\t//intersection\\n\\tassert(!ispal(a,b));\\n\\tD t=cro(a.sc-a.fs,a.sc-b.fs)/cro(a.sc-a.fs,b.sc-b.fs);\\n\\treturn b.fs+t*(b.sc-b.fs);\\n}\\n//\\ninline int iCL(C c, L l){\\t\\t//num of intersection(s)\\n\\tD d=dLP(l,c.p);\\n\\treturn eq(d,c.r) ? 1 : (d<c.r ? 2 : 0);\\n}\\nbool containCC(C a,C b){\\t//a contain b? (edge case is true)\\n\\treturn abs(a.p-b.p)+b.r<a.r+eps;\\n}\\nbool containCCex(C a,C b){\\t//a contain b? (edge case is false)\\n\\treturn abs(a.p-b.p)+b.r<a.r-eps;\\n}\\n// 交点が2個のとき、aをbが削ると思うと、削れた部分はret[0] -> res[1] (ccw) の部分\\nvector<P> intCC(C a,C b){\\n\\tif(abs(a.p-b.p) > a.r+b.r + eps) return {};\\n\\tif(containCCex(a,b) || containCCex(b,a)) return {};\\n\\tD d = abs(a.p-b.p);\\n\\tD tmp = (a.r*a.r+d*d-b.r*b.r)/(2.0*a.r*d);\\n\\tif(tmp < -1) tmp = -1;\\n\\tif(tmp > 1) tmp = 1;\\n\\tD theta = acos(tmp);\\n\\tP p1 = a.p+(b.p-a.p)/d*polar(a.r,-theta);\\n\\tP p2 = a.p+(b.p-a.p)/d*polar(a.r,theta);\\n\\tif(eq(p1,p2)) return {p1};\\n\\treturn {p1,p2};\\n}\\ninline vector<L> tanCP(C c,P p){\\n\\tint x=large(c.r,abs(p-c.p));\\n\\tvector<L> ret;\\n\\tif(x==1) return ret;\\n\\tif(x==0){\\n\\t\\tret.pb(L(p,p+(c.p-p)*P(0,1)));\\n\\t\\treturn ret;\\n\\t}\\n\\tD theta=acos(c.r/abs(p-c.p));\\n\\tret.pb(L(p,c.p+(p-c.p)/abs(p-c.p)*polar(c.r,theta)));\\n\\tret.pb(L(p,c.p+(p-c.p)/abs(p-c.p)*polar(c.r,-theta)));\\n\\treturn ret;\\n}\\ninline Pol intCL(C c,L l){\\n\\tint x=large(dLP(l,c.p),c.r);\\n\\tPol ret;\\n\\tif(x==1) return ret;\\n\\tif(x==0){\\n\\t\\tret.pb(perp(l,c.p));\\n\\t\\treturn ret;\\n\\t}\\n\\tD d=dLP(l,c.p);\\n\\tif(d<eps){\\n\\t\\tret.pb(c.p+(l.fs-l.sc)/abs(l.fs-l.sc)*c.r);\\n\\t\\tret.pb(c.p-(l.fs-l.sc)/abs(l.fs-l.sc)*c.r);\\n\\t\\treturn ret;\\n\\t}\\n\\tD theta=acos(d/c.r);\\n\\tP p=perp(l,c.p);\\n\\tret.pb(c.p+(p-c.p)/d*polar(c.r,theta));\\n\\tret.pb(c.p+(p-c.p)/d*polar(c.r,-theta));\\n\\treturn ret;\\n}\\ninline vector<L> intan(C a,C b){\\n\\tP p=(a.r*b.p+b.r*a.p)/(a.r+b.r);\\n\\treturn tanCP(a,p);\\n}\\ninline vector<L> outtan(C a,C b){\\n\\tif(a.r==b.r){\\n\\t\\tvector<L> ret;\\n\\t\\tP p=(a.p-b.p)/abs(a.p-b.p)*polar(a.r,PI/2);\\n\\t\\tret.pb(L(a.p+p,b.p+p));\\n\\t\\tret.pb(L(a.p-p,b.p-p));\\n\\t\\treturn ret;\\n\\t}\\n\\tP p=(a.r*b.p-b.r*a.p)/(a.r-b.r);\\n\\treturn tanCP(a,p);\\n}\\nD aTri(P a, P b, P c){ return cro(b-a,c-a)/2;}\\nD aPol(Pol p){\\t\\t\\t//点集合はCCWに与える\\n\\tint n=p.size();\\n\\tD ret=0;\\n\\trep(i,n) ret+=cro(p[i],p[(i+1)%n])/2;\\n\\treturn ret;\\n}\\nP gPol(Pol p){\\t\\t\\t//多角形内部が一様な重さを持つときの重心\\n\\tint n=p.size();\\n\\tP g;\\n\\tD s=aPol(p);\\n\\tassert(s>eps);\\n\\trep(i,n){\\n\\t\\tD ds=cro(p[i],p[(i+1)%n])/2;\\n\\t\\tg+=ds/3*(p[i]+p[(i+1)%n]);\\n\\t}\\n\\treturn g/s;\\n}\\n//enum ENCONT{INP=1,ONP=0,OUTP=-1};\\nint contain(Pol pol, P p){\\n\\tbool in=false;\\n\\trep(i,pol.size()){\\n\\t\\tP a=pol[i]-p,b=pol[(i+1)%pol.size()]-p;\\n\\t\\tif(ccw(a,b,P(0,0))==0) return 0;\\n\\t\\tif(imag(a)>imag(b)) swap(a,b);\\n\\t\\tif(sig(imag(a))<=0 && 0<sig(imag(b)) && ccw(P(0,0),a,b)==1) in=!in;\\n\\t}\\n\\treturn in ? 1 : -1;\\n}\\nL BL;\\nbool compBL(const P& a,const P& b){\\t\\t\\t//BL上の点をソート(BL.fs側が小さい)\\n\\treturn dot(BL.sc-BL.fs,a-BL.fs)<dot(BL.sc-BL.fs,b-BL.fs);\\n}\\nbool containE(Pol pol,L l){\\t\\t\\t//polは閉集合だと思って.\\n\\tvector<P> ps;\\n\\tps.pb(l.fs);\\n\\tps.pb(l.sc);\\n\\tint N=pol.size();\\n\\trep(i,N){\\n\\t\\tL a(pol[i],pol[(i+1)%N]);\\n\\t\\tif(ispal(a,l)) continue;\\n\\t\\tif(!ispal(a,l)&&iSS(a,l)) ps.pb(intLL(a,l));\\n\\t}\\n\\tBL=l;\\n\\tsort(all(ps),compBL);\\n\\tint K=ps.size();\\n\\trep(i,K-1) ps.pb((ps[i]+ps[i+1])/2.0);\\n\\tfor(P p:ps) if(!contain(pol,p)) return 0;\\n\\treturn 1;\\n}\\ninline D heron(D a, D b, D c){\\n\\tdouble s=(a+b+c)/2;\\n\\tif(s-a<eps || s-b<eps || s-c<eps) return 0;\\t\\t//S=0 || 三角形できない\\n\\treturn sqrt(s*(s-a)*(s-b)*(s-c));\\n}\\ninline Pol conv(Pol p){\\t\\t//convex\\n\\tint n=p.size(),k=0;\\n\\tsort(all(p),compxy);\\n\\tPol ret(2*n);\\n\\trep(i,n){\\n\\t\\twhile(k>=2 && ccw(ret[k-2],ret[k-1],p[i])<=0) --k;\\n\\t\\tret[k++]=p[i];\\n\\t}\\n\\tfor(int i=n-2,t=k+1;i>=0;i--){\\n\\t\\twhile(k>=t && ccw(ret[k-2],ret[k-1],p[i])<=0) --k;\\n\\t\\tret[k++]=p[i];\\n\\t}\\n\\tret.resize(k-1);\\n\\treturn ret;\\n}\\ninline Pol convall(Pol p){\\t\\t//conv上の点全部\\t\\t//点が2回以上出てくる\\n\\tint n=p.size(),k=0;\\n\\tsort(all(p),compxy);\\n\\tPol ret(2*n);\\n\\trep(i,n){\\n\\t\\twhile(k>=2 && ccw(ret[k-2],ret[k-1],p[i])==-1) --k;\\n\\t\\tret[k++]=p[i];\\n\\t}\\n\\tfor(int i=n-2,t=k+1;i>=0;i--){\\n\\t\\twhile(k>=t && ccw(ret[k-2],ret[k-1],p[i])==-1) --k;\\n\\t\\tret[k++]=p[i];\\n\\t}\\n\\tret.resize(k-1);\\n\\tret.erase(unique(all(ret)),ret.end());\\n\\treturn ret;\\n}\\ninline Pol convexcut(Pol p,L l){\\t//ccw,leftが残る\\n\\tPol ret;\\n\\trep(i,p.size()){\\n\\t\\tif(ccw(l.fs,l.sc,p[i])!=-1) ret.pb(p[i]);\\n\\t\\tL s=L(p[i],p[(i+1)%p.size()]);\\n\\t\\tif(iLSex(l,s)) ret.pb(intLL(l,s));\\n\\t}\\n\\treturn ret;\\n}\\ninline Pol interpol(Pol a,Pol b){\\t//ccw,ccw\\n\\trep(j,b.size()){\\n\\t\\ta=convexcut(a,L(b[j],b[(j+1)%b.size()]));\\n\\t}\\n\\treturn a;\\n}\\ninline vector<Pol> makevoronoi(Pol vp,Pol pol){\\t//left\\n\\tvector<Pol> ret;\\n\\tPol polc=pol;\\n\\trep(i,vp.size()){\\n\\t\\tpol=polc;\\n\\t\\trep(j,vp.size()){\\n\\t\\t\\tif(i==j) continue;\\n\\t\\t\\tP p=(vp[i]+vp[j])/2.0,q=p+(vp[j]-vp[i])*P(0,1);\\n\\t\\t\\tpol=convexcut(pol,L(p,q));\\n\\t\\t}\\n\\t\\tret.pb(pol);\\n\\t}\\n\\treturn ret;\\n}\\ninline D pol_diameter(Pol p){\\n\\tp=conv(p);\\n\\tint n=p.size();\\n\\tassert(n>=2);\\n\\tif(n==2) return abs(p[0]-p[1]);\\n\\tint i=0,j=0;\\n\\trep(k,n){\\n\\t\\tif(!compxy(p[i],p[k])) i=k;\\n\\t\\tif(compxy(p[j],p[k])) j=k;\\n\\t}\\n\\tD ret=0;\\n\\tint si=i,sj=j;\\n\\twhile(i!=sj || j!=si){\\n\\t\\tret=max(ret,abs(p[i]-p[j]));\\n\\t\\tif(cro(p[(i+1)%n]-p[i],p[(j+1)%n]-p[j])<0) i=(i+1)%n;\\n\\t\\telse j=(j+1)%n;\\n\\t}\\n\\treturn ret;\\n}\\ninline D closest_pair(P *a, int n){\\n\\tif(n<=1) return inf;\\n\\tint m=n/2;\\n\\tD x=a[m].real();\\n\\tD d=min(closest_pair(a,m),closest_pair(a+m,n-m));\\n\\tinplace_merge(a,a+m,a+n,compyx);\\n\\tvector<P> b;\\n\\trep(i,n){\\n\\t\\tif(abs(x-a[i].real())>=d) continue;\\n\\t\\trep(j,b.size()){\\n\\t\\t\\tP dp=a[i]-b[b.size()-1-j];\\n\\t\\t\\tif(dp.imag()>=d) break;\\n\\t\\t\\td=min(d,abs(dp));\\n\\t\\t}\\n\\t\\tb.pb(a[i]);\\n\\t}\\n\\treturn d;\\n}\\ninline D compute_shortest(P *a,int n){\\n\\tsort(a,a+n,compxy);\\n\\treturn closest_pair(a,n);\\n}\\n\\ndouble rnd(double l,double r){\\n\\tstatic random_device rd;\\n\\tstatic mt19937 gen(rd());\\n\\treturn uniform_real_distribution<double>(l,r)(gen);\\n}\\n\\n// return {p \\\\cap halfplane}\\n// size = O(N^2)\\n// time complexity: O(N^3) slow\\n// bit表現で持ってるので大きい時はvectorに変えようね！\\n// 無駄なのが含まれてるかもしれねえ 自信なし\\n// https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1614\\nV<ll> enumeratePlaneDivision(V<P> p){\\n\\tint N = si(p);\\n\\tV<ll> divs;\\n//\\trep(i,1<<N) divs.pb(i);\\n\\tdivs.pb(0); divs.pb((1LL<<N)-1);\\n\\trep(i,N) rep(j,N) if(i != j){\\n\\t\\tP mid = (p[j]+p[i])/2.0;\\n\\t\\tP vec = (p[j]-p[i]) * polar(1.0,1e-8);\\n\\t\\tll s=0, t=0;\\n\\t\\trep(k,N){\\n\\t\\t\\tif(cro(vec,p[k]-mid) < 0) s |= 1LL<<k;\\n\\t\\t\\telse t |= 1LL<<k;\\n\\t\\t}\\n\\t\\tdivs.pb(s); divs.pb(t);\\n\\t}\\n\\tmkuni(divs);\\n\\treturn divs;\\n}\\n\\n// return { {i s.t. p \\\\in c[i]} | p: point }\\n// 円の集合が与えられるので、どのような領域に分けられるか というのを、円に含まれるか含まれないかの集合で特徴づけて計算する\\n// max: N^2-N+2\\n// とか言ったけどやや嘘で、正の面積をもつ領域しか列挙してない気もするし、あと無駄なのも含まれてる気もする\\n// ロバストにやりたくね～ これで許してくれ\\n// 各領域に対して、境界に交点を含まない場合→境界は円なので内と外をためす\\n// 含む場合、交点と2つの円弧に挟まれた部分を列挙すればよい\\n// と思うじゃん、bがaに内接してたら、a-bの部分は、交点の近傍からは得られないんだよね\\n// よく考えると、このように内接してるやつを避けるには、（他の交点からも得られない i.e. どこでも内接 ということを考慮すると、)\\n// ↑で言った円の内側を試すときにランダムな回転をして一点取れば良いことが示せる\\n// かしこいね～～～ もう一切このライブラリの事信用していません\\n\\n\\nV<ll> enumerateCircleInclusion(V<C> c){\\n\\tint N = si(c);\\n\\tV<ll> inclusions;\\n//\\trep(i,1<<N) inclusions.pb(i);\\n\\tV<P> cands;\\n\\tD eps_here = 1e-8;\\n\\trep(i,N){\\n\\t\\tcands.pb(c[i].p + polar(c[i].r-eps_here, 1.0));\\n\\t\\tcands.pb(c[i].p + polar(c[i].r+eps_here, 1.0));\\n\\t}\\n\\trep(i,N) rep(j,N) if(i!=j){\\n\\t\\tV<P> f = intCC(c[i],c[j]);\\n\\t\\tfor(P p: f){\\n\\t\\t\\tP d1 = (p-c[i].p); d1 /= abs(d1);\\n\\t\\t\\tP d2 = (p-c[j].p); d2 /= abs(d2);\\n\\t\\t\\tP dir = (d1+d2); dir /= abs(dir);\\n\\t\\t\\trep(_,4){\\n\\t\\t\\t\\tcands.pb(p + dir * eps_here);\\n\\t\\t\\t\\tdir *= P(0,1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tfor(P p: cands){\\n\\t\\tll s = 0;\\n\\t\\trep(i,N) if(abs(p-c[i].p) < c[i].r) s |= 1LL<<i;\\n\\t\\tinclusions.pb(s);\\n\\t}\\n\\tmkuni(inclusions);\\n\\treturn inclusions;\\n}\\n\\nint main(){\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(false);\\t\\t//DON'T USE scanf/printf/puts !!\\n\\tcout << fixed << setprecision(20);\\n\\n\\twhile(true){\\n\\t\\tint N,M; cin >> N >> M;\\n\\t\\tif(N == 0) break;\\n\\t\\tV<P> p(N);\\n\\t\\trep(i,N){\\n\\t\\t\\tD x,y; cin >> x >> y;\\n\\t\\t\\tp[i] = P(x,y);\\n\\t\\t}\\n\\t\\tV<int> from(M),to(M);\\n\\t\\tV<D> weight(M);\\n\\t\\trep(i,M){\\n\\t\\t\\tD v;\\n\\t\\t\\tcin >> from[i] >> to[i] >> v;\\n\\t\\t\\tfrom[i]--,to[i]--;\\n\\t\\t\\tweight[i] = 1.0/v/v;\\n\\t\\t}\\n\\t\\tV<C> c(M);\\n\\t\\trep(i,M) c[i] = {p[from[i]], abs(p[from[i]]-p[to[i]])};\\n\\t\\tauto divs = enumeratePlaneDivision(p);\\t\\t// N^2\\n\\t\\tauto inc = enumerateCircleInclusion(c);\\t\\t// M^2\\n\\t\\tshow(divs);show(inc);\\n\\t\\tD ans = inf;\\n\\t\\tfor(ll sl: divs){\\n\\t\\t\\tauto f = [&](ll s){\\n\\t\\t\\t\\tD res = inf;\\n\\t\\t\\t\\tfor(ll usecolor: inc){\\n\\t\\t\\t\\t\\tP red;\\n\\t\\t\\t\\t\\tD rr=0;\\n\\t\\t\\t\\t\\trep(i,M) if(s&1LL<<from[i]){\\n\\t\\t\\t\\t\\t\\tif(usecolor&1LL<<i){\\n\\t\\t\\t\\t\\t\\t\\trr += weight[i];\\n\\t\\t\\t\\t\\t\\t\\tred += p[from[i]] * weight[i];\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif(rr) red /= rr;\\n\\t\\t\\t\\t\\tD tmp = 0;\\n\\t\\t\\t\\t\\trep(i,M) if(s&1LL<<from[i]){\\n\\t\\t\\t\\t\\t\\tif(usecolor&1LL<<i){\\n\\t\\t\\t\\t\\t\\t\\ttmp += weight[i] * norm(red - p[from[i]]);\\n\\t\\t\\t\\t\\t\\t}else{\\t// black\\n\\t\\t\\t\\t\\t\\t\\ttmp += weight[i] * norm(p[to[i]] - p[from[i]]);\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tchmin(res,tmp);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treturn res;\\n\\t\\t\\t};\\n\\t\\t\\tll sr = ((1LL<<N)-1) ^ sl;\\n\\t\\t\\tchmin(ans,f(sl) + f(sr));\\n\\t\\t}\\n\\t\\tcout << sqrt(ans/M) << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1640,\n \"memory_kb\": 4472,\n \"score_of_the_acc\": -0.2214,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1614_5442144\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\\n#define MOD 1000000007\\n//#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define EPS 0.00000001\\n#define SIZE 41\\n\\nstruct Point{\\n\\tPoint(double arg_x,double arg_y){\\n\\t\\tx = arg_x;\\n\\t\\ty = arg_y;\\n\\t}\\n\\n\\tPoint(){\\n\\t\\tx = y = 0.0;\\n\\t}\\n\\n\\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\\n\\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\\n\\tPoint operator * (double a){ return Point(a*x,a*y); }\\n\\tPoint operator / (double a){ return Point(x/a,y/a); }\\n\\n\\tdouble abs(){ return sqrt(norm()); }\\n\\tdouble norm(){ return x*x + y*y; }\\n\\n\\tbool operator<(const Point &p) const{\\n\\n\\t\\tif(fabs(x-p.x) > EPS){\\n\\n\\t\\t\\treturn x < p.x;\\n\\t\\t}else{\\n\\n\\t\\t\\treturn y < p.y;\\n\\t\\t}\\n\\t}\\n\\n\\tbool operator == (const Point &p) const{\\n\\t\\treturn fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\\n\\t}\\n\\n\\n\\tvoid debug(){\\n\\n\\t\\tprintf(\\\"(%.3lf,%.3lf)\\\\n\\\",x,y);\\n\\t}\\n\\n\\tdouble x,y;\\n};\\n\\ntypedef Point Vector;\\ntypedef vector<Point> Polygon;\\n\\nstruct Line{\\n\\tLine(){\\n\\n\\t}\\n\\tLine(Point a,Point b){\\n\\t\\tp[0] = a;\\n\\t\\tp[1] = b;\\n\\t}\\n\\t/*void outPut(){\\n\\n\\t\\tprintf(\\\"(%.3lf,%.3lf)-(%.3lf,%.3lf)\\\\n\\\",p[0].x,p[0].y,p[1].x,p[1].y);\\n\\t}*/\\n\\tPoint p[2];\\n};\\n\\nstruct Info{\\n\\tint from,to;\\n\\tdouble V,D,rev_V2;\\n};\\n\\nstruct DATA{\\n\\tDATA(Point arg_p,double arg_rad){\\n\\t\\tp = arg_p;\\n\\t\\trad = arg_rad;\\n\\t}\\n\\tDATA(){\\n\\t\\trad = 0;\\n\\t}\\n\\tbool operator<(const struct DATA &arg) const{\\n\\n\\t\\treturn rad < arg.rad;\\n\\t}\\n\\tPoint p;\\n\\tdouble rad;\\n};\\n\\n\\nstruct Circle{\\n\\tPoint center;\\n\\tdouble r;\\n};\\n\\nll POW[SIZE];\\nint N,M,table[SIZE];\\nvector<int> STATE;\\nvector<int> INFO[SIZE];\\ndouble dp[1024*1024];\\ndouble DIST[SIZE],NUM = 100000;\\nPoint point[SIZE];\\nInfo info[SIZE];\\nCircle C[SIZE];\\nbool check[SIZE];\\nvector<DATA> ON_P[SIZE];\\n\\n\\ndouble calc_dist(Point A,Point B){\\n\\n\\treturn sqrt((A.x-B.x)*(A.x-B.x)+(A.y-B.y)*(A.y-B.y));\\n}\\n\\ndouble norm(Vector a){\\n\\treturn a.x*a.x+a.y*a.y;\\n}\\n\\ndouble abs(Vector a){\\n\\treturn sqrt(norm(a));\\n}\\n\\ndouble cross(Vector a,Vector b){\\n return a.x*b.y-a.y*b.x;\\n}\\n\\ndouble dot(Vector a,Vector b){\\n return a.x*b.x + a.y*b.y;\\n}\\n\\nstatic const int COUNTER_CLOCKWISE = 1;\\nstatic const int CLOCKWISE = -1;\\nstatic const int ONLINE_BACK = 2;\\nstatic const int ONLINE_FRONT = -2;\\nstatic const int ON_SEGMENT = 0;\\n\\n/*\\n * p0を基準点として、p1から見てp2が\\n * 反時計回り側にあれば\\n * COUNTER_CLOCKWISE\\n * */\\nint ccw(Point p0,Point p1,Point p2){\\n\\n\\tVector a = p1 - p0;\\n\\tVector b = p2 - p0;\\n\\n\\tif(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\\n\\tif(cross(a,b) < -EPS)return CLOCKWISE;\\n\\tif(dot(a,b) < -EPS)return ONLINE_BACK;\\n\\tif(a.norm() < b.norm())return ONLINE_FRONT;\\n\\n\\treturn ON_SEGMENT;\\n}\\n\\nint func(double x1,double y1,double x2, double y2, double xp, double yp){\\n\\tdouble naiseki,norm1,norm2,gaiseki;\\n\\tnorm1 = sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));\\n\\tnorm2 = sqrt((xp-x1)*(xp-x1)+(yp-y1)*(yp-y1));\\n\\tnaiseki = (xp-x1)*(x2-x1)+(yp-y1)*(y2-y1);\\n\\tgaiseki = (x2-x1)*(yp-y1)-(xp-x1)*(y2-y1);\\n\\tif(gaiseki > EPS){\\n\\t\\treturn 1;\\n\\t}else if(gaiseki < -EPS){\\n\\t\\treturn -1;\\n\\t}\\n\\tif(naiseki < -EPS){\\n\\t\\treturn 2;\\n\\t}\\n\\n\\tif(norm1 < norm2){\\n\\t\\treturn -2;\\n\\t}\\n\\treturn 0;\\n}\\n\\n\\n//★★直線ではなく、線分の交差判定★★\\nbool is_Cross(Line a,Line b){\\n\\n\\tif(func(a.p[0].x,a.p[0].y,a.p[1].x,a.p[1].y,b.p[0].x,b.p[0].y)*\\n\\t\\t\\tfunc(a.p[0].x,a.p[0].y,a.p[1].x,a.p[1].y,b.p[1].x,b.p[1].y) <= 0 &&\\n\\t\\t\\tfunc(b.p[0].x,b.p[0].y,b.p[1].x,b.p[1].y,a.p[0].x,a.p[0].y)*\\n\\t\\t\\tfunc(b.p[0].x,b.p[0].y,b.p[1].x,b.p[1].y,a.p[1].x,a.p[1].y) <= 0){\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\n\\ndouble calc_len(Vector a){\\n return sqrt(a.x*a.x+a.y*a.y);\\n}\\n\\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\\n//線分ではなく直線と点の距離\\ndouble getDistanceLP(Line l,Point p){\\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\\n}\\n\\n//点と線分の距離\\ndouble getDistanceSP(Line l,Point p){\\n\\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\\n\\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\\n\\treturn getDistanceLP(l,p);\\n}\\n\\n//線分と線分の距離\\ndouble getDistance(Line A,Line B){\\n\\tif(is_Cross(A,B))return 0.0;\\n\\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\\n\\t\\t\\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\\n}\\n\\n\\ndouble calc_slope(Line A){\\n\\n\\tif(fabs(A.p[0].x-A.p[1].x) < EPS){\\n\\n\\t\\treturn DBL_MAX;\\n\\n\\t}else if(fabs(A.p[0].y-A.p[1].y) < EPS){\\n\\n\\t\\treturn 0;\\n\\n\\t}else{\\n\\n\\t\\treturn (A.p[1].y-A.p[0].y)/(A.p[1].x-A.p[0].x);\\n\\t}\\n}\\n\\ndouble arg(Vector p){\\n\\treturn atan2(p.y,p.x);\\n}\\n\\nVector polar(double a,double r){\\n\\treturn Point(cos(r)*a,sin(r)*a);\\n}\\n\\n//円と円の交点\\nvector<Point> getCrossPoints(Circle c1,Circle c2){\\n\\n\\tvector<Point> res;\\n\\n\\tdouble d = abs(c1.center-c2.center);\\n\\tdouble a = acos((c1.r*c1.r+d*d-c2.r*c2.r)/(2*c1.r*d));\\n\\tdouble t = arg(c2.center-c1.center);\\n\\n\\tres.push_back(Point(c1.center+polar(c1.r,t+a)));\\n\\tres.push_back(Point(c1.center+polar(c1.r,t-a)));\\n\\n\\treturn res;\\n}\\n\\n//t^2を求める\\ndouble getT(Point a,Point b,double V){\\n\\n\\tdouble A = (a.x-b.x)*(a.x-b.x) + (a.y-b.y)*(a.y-b.y);\\n\\treturn A/(V*V);\\n}\\n\\n/*点moveをbaseを中心にradラジアン回転させる\\nrad > 0なら反時計回り、rad < 0なら時計周り\\n*/\\nPoint rotate(Point base,Point move,double rad){\\n\\n\\tPoint ret;\\n\\tmove = move-base;\\n\\n\\tret.x = move.x*cos(rad)-move.y*sin(rad);\\n\\tret.y = move.x*sin(rad)+move.y*cos(rad);\\n\\n\\tret = ret+base;\\n\\n\\treturn ret;\\n}\\n\\n//点のradを求める関数\\ndouble calc_rad(Point p){\\n\\n\\tif(p.y == 0){\\n\\n\\t\\tif(p.x > 0){\\n\\n\\t\\t\\treturn 0;\\n\\n\\t\\t}else{ //p.x < 0\\n\\n\\t\\t\\treturn M_PI;\\n\\t\\t}\\n\\n\\t}else if(p.x == 0){\\n\\n\\t\\tif(p.y > 0){\\n\\n\\t\\t\\treturn M_PI/2.0;\\n\\t\\t}else{\\n\\n\\n\\t\\t\\treturn 3*M_PI/2.0;\\n\\t\\t}\\n\\n\\t}else{\\n\\n\\t\\tdouble base = atan(fabs(p.y)/fabs(p.x));\\n\\n\\t\\tif(p.x > 0){\\n\\n\\t\\t\\tif(p.y > 0){\\n\\n\\t\\t\\t\\treturn base;\\n\\n\\t\\t\\t}else{ //p.y < 0\\n\\n\\t\\t\\t\\treturn 2*M_PI-base;\\n\\t\\t\\t}\\n\\n\\t\\t}else{ //p.x < 0\\n\\n\\t\\t\\tif(p.y > 0){\\n\\n\\t\\t\\t\\treturn M_PI-base;\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\treturn base+M_PI;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\n\\nvoid func(){\\n\\n\\tSTATE.clear();\\n\\n\\tfor(int i = 0; i < SIZE; i++){\\n\\n\\t\\tINFO[i].clear();\\n\\t\\tDIST[i] = 0;\\n\\t\\tON_P[i].clear();\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%lf %lf\\\",&point[i].x,&point[i].y);\\n\\t}\\n\\n\\tfor(int i = 0; i < M; i++){\\n\\n\\t\\tscanf(\\\"%d %d %lf\\\",&info[i].from,&info[i].to,&info[i].V);\\n\\t\\tinfo[i].from--;\\n\\t\\tinfo[i].to--;\\n\\n\\t\\tinfo[i].rev_V2 = 1.0/(info[i].V*info[i].V);\\n\\t\\tdouble tmp_dist = calc_dist(point[info[i].from],point[info[i].to]);\\n\\t\\tinfo[i].D = tmp_dist*tmp_dist;\\n\\n\\t\\tC[i].center = point[info[i].from];\\n\\t\\tC[i].r = tmp_dist;\\n\\n\\t\\tINFO[info[i].from].push_back(i);\\n\\n\\t\\tDIST[i] = getT(point[info[i].from],point[info[i].to],info[i].V);\\n\\t}\\n\\n\\tfor(int i = 0; i < N-1; i++){\\n\\t\\tfor(int k = i+1; k < N; k++){\\n\\n\\t\\t\\tPoint mid_p = (point[i]+point[k])/2;\\n\\n\\t\\t\\tLine base_line;\\n\\n\\t\\t\\tif(fabs(point[i].x-point[k].x) < EPS){\\n\\n\\t\\t\\t\\tbase_line = Line(Point(-NUM,mid_p.y),Point(NUM,mid_p.y));\\n\\n\\t\\t\\t}else if(fabs(point[i].y-point[k].y) < EPS){\\n\\n\\t\\t\\t\\tbase_line = Line(Point(mid_p.x,-NUM),Point(mid_p.x,NUM));\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tdouble tmp_slope = calc_slope(Line(point[i],point[k]));\\n\\t\\t\\t\\ttmp_slope = (-1.0)/tmp_slope;\\n\\n\\t\\t\\t\\tbase_line = Line(Point(mid_p.x-NUM,mid_p.y-NUM*tmp_slope),Point(mid_p.x+NUM,mid_p.y+NUM*tmp_slope));\\n\\t\\t\\t}\\n\\n\\t\\t\\tvector<int> I,K,MID;\\n\\t\\t\\tI.push_back(i);\\n\\t\\t\\tK.push_back(k);\\n\\n\\t\\t\\tfor(int a = 0; a < N; a++){\\n\\t\\t\\t\\tif(a == i || a == k)continue;\\n\\n\\t\\t\\t\\tif(getDistanceSP(base_line,point[a]) < EPS){\\n\\n\\t\\t\\t\\t\\tMID.push_back(a);\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tLine work_line = Line(point[a],point[i]);\\n\\t\\t\\t\\t\\tif(is_Cross(base_line,work_line)){\\n\\n\\t\\t\\t\\t\\t\\tK.push_back(a);\\n\\n\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\tI.push_back(a);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tint state_I = 0,state_K = 0;\\n\\t\\t\\tfor(int a = 0; a < I.size(); a++){\\n\\n\\t\\t\\t\\tstate_I += POW[I[a]];\\n\\t\\t\\t}\\n\\t\\t\\tfor(int a = 0; a < K.size(); a++){\\n\\n\\t\\t\\t\\tstate_K += POW[K[a]];\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(MID.size() == 0){\\n\\n\\t\\t\\t\\tSTATE.push_back(state_I);\\n\\t\\t\\t\\tSTATE.push_back(state_K);\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\n\\t\\t\\tfor(int state = 0; state < POW[MID.size()]; state++){\\n\\t\\t\\t\\tint work_I = state_I;\\n\\t\\t\\t\\tint work_K = state_K;\\n\\t\\t\\t\\tfor(int loop = 0; loop < MID.size(); loop++){\\n\\t\\t\\t\\t\\tif(state&POW[loop]){\\n\\n\\t\\t\\t\\t\\t\\twork_I += POW[MID[loop]];\\n\\n\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\twork_K += POW[MID[loop]];\\n\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tSTATE.push_back(work_I);\\n\\t\\t\\t\\tSTATE.push_back(work_K);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tsort(STATE.begin(),STATE.end());\\n\\tSTATE.erase(unique(STATE.begin(),STATE.end()),STATE.end());\\n\\n\\n\\tfor(int i = 0; i < M-1; i++){\\n\\t\\tfor(int k = i+1; k < M; k++){\\n\\n\\t\\t\\tdouble tmp_dist = calc_dist(C[i].center,C[k].center);\\n\\n\\t\\t\\tif(tmp_dist > C[i].r+C[k].r+EPS)continue;\\n\\t\\t\\tif(min(C[i].r,C[k].r)+tmp_dist+EPS < max(C[i].r,C[k].r)){\\n\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\n\\t\\t\\tvector<Point> ret = getCrossPoints(C[i],C[k]);\\n\\t\\t\\tfor(int a = 0; a < ret.size(); a++){\\n\\n\\t\\t\\t\\tON_P[i].push_back(DATA(ret[a],calc_rad(ret[a]-C[i].center)));\\n\\t\\t\\t\\tON_P[k].push_back(DATA(ret[a],calc_rad(ret[a]-C[k].center)));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < M; i++){\\n\\n\\t\\tON_P[i].push_back(DATA(Point(C[i].center.x+C[i].r,C[i].center.y),0));\\n\\t\\tON_P[i].push_back(DATA(Point(C[i].center.x,C[i].center.y+C[i].r),M_PI/2));\\n\\t\\tON_P[i].push_back(DATA(Point(C[i].center.x-C[i].r,C[i].center.y),M_PI));\\n\\t\\tON_P[i].push_back(DATA(Point(C[i].center.x,C[i].center.y-C[i].r),(M_PI*3)/2.0));\\n\\t}\\n\\n\\tfor(int i = 0; i < M; i++){\\n\\t\\tif(ON_P[i].size() == 0)continue;\\n\\n\\t\\tsort(ON_P[i].begin(),ON_P[i].end());\\n\\t}\\n\\n\\n\\tvector<ll> cross_STATE;\\n\\n\\tfor(int i = 0; i < M; i++){\\n\\n\\t\\tvector<Point> ret;\\n\\t\\tret.push_back(C[i].center);\\n\\n\\t\\tfor(int k = 0; k < ON_P[i].size(); k++){\\n\\n\\t\\t\\tPoint tmp_p = ON_P[i][k].p;\\n\\n\\t\\t\\tint size = ON_P[i].size();\\n\\t\\t\\tdouble tmp_rad = ON_P[i][(k+1)%size].rad-ON_P[i][k].rad;\\n\\t\\t\\tif((k+1) == size){\\n\\n\\t\\t\\t\\ttmp_rad += 2*M_PI;\\n\\t\\t\\t}\\n\\t\\t\\ttmp_rad /= 2;\\n\\n\\t\\t\\tPoint calc_P = rotate(C[i].center,tmp_p,tmp_rad);\\n\\n\\t\\t\\tVector tmp_vec = calc_P-C[i].center;\\n\\t\\t\\ttmp_vec = tmp_vec/abs(tmp_vec);\\n\\n\\t\\t\\tret.push_back(calc_P+tmp_vec*10*EPS);\\n\\t\\t\\tret.push_back(calc_P-tmp_vec*10*EPS);\\n\\t\\t}\\n\\n\\n\\t\\tfor(int a = 0; a < ret.size(); a++){\\n\\n\\t\\t\\tll tmp_S = 0;\\n\\n\\t\\t\\tfor(int b = 0; b < M; b++){\\n\\t\\t\\t\\tdouble tmp_dist = calc_dist(C[b].center,ret[a]);\\n\\t\\t\\t\\tif(tmp_dist > C[b].r+EPS)continue;\\n\\n\\t\\t\\t\\ttmp_S += POW[b];\\n\\t\\t\\t}\\n\\t\\t\\tcross_STATE.push_back(tmp_S);\\n\\t\\t}\\n\\t}\\n\\n\\tsort(cross_STATE.begin(),cross_STATE.end());\\n\\tcross_STATE.erase(unique(cross_STATE.begin(),cross_STATE.end()),cross_STATE.end());\\n\\n\\n\\tdp[0] = 0;\\n\\tfor(int state = 1; state < POW[N]; state++){\\n\\n\\t\\tdp[state] = HUGE_NUM;\\n\\t}\\n\\n\\tfor(int i = 0; i < STATE.size(); i++){\\n\\n\\t\\tint base_state = STATE[i];\\n\\n\\t\\tvector<int> BIN;\\n\\t\\tint count = 0;\\n\\n\\t\\tll MASK = 0;\\n\\n\\t\\tfor(int k = 0; k < N; k++){\\n\\t\\t\\tif(base_state&POW[k]){\\n\\t\\t\\t\\tfor(int a = 0; a < INFO[k].size(); a++){\\n\\n\\t\\t\\t\\t\\tBIN.push_back(INFO[k][a]);\\n\\t\\t\\t\\t\\tMASK += POW[INFO[k][a]];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tset<ll> SET;\\n\\n\\t\\tfor(int a = 0; a < BIN.size(); a++){\\n\\n\\t\\t\\tSET.insert(POW[BIN[a]]);\\n\\t\\t}\\n\\t\\tfor(int a = 0; a < cross_STATE.size(); a++){\\n\\n\\t\\t\\tSET.insert(MASK&cross_STATE[a]);\\n\\t\\t}\\n\\n\\t\\tfor(auto tmp_S: SET){\\n\\n\\t\\t\\tdouble sum = 0;\\n\\n\\t\\t\\tvector<int> warp_vec;\\n\\n\\t\\t\\tfor(int k = 0; k < BIN.size(); k++){\\n\\t\\t\\t\\tif(tmp_S&POW[BIN[k]]){\\n\\n\\t\\t\\t\\t\\twarp_vec.push_back(BIN[k]);\\n\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tsum += DIST[BIN[k]];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tdouble X = 0,Y = 0;\\n\\n\\t\\t\\tfor(int E = 0; E < 2; E++){\\n\\n\\t\\t\\t\\tdouble bunshi = 0;\\n\\t\\t\\t\\tdouble bunbo = 0;\\n\\n\\t\\t\\t\\tfor(int b = 0; b < warp_vec.size(); b++){\\n\\n\\t\\t\\t\\t\\tint tmp_from = info[warp_vec[b]].from;\\n\\n\\t\\t\\t\\t\\tif(E == 0){\\n\\n\\t\\t\\t\\t\\t\\tbunshi += point[tmp_from].x*info[warp_vec[b]].rev_V2;\\n\\n\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\tbunshi += point[tmp_from].y*info[warp_vec[b]].rev_V2;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tbunbo += info[warp_vec[b]].rev_V2;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(E == 0){\\n\\n\\t\\t\\t\\t\\tX = bunshi/bunbo;\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tY = bunshi/bunbo;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tPoint WARP_P = Point(X,Y);\\n\\t\\t\\tfor(int b = 0; b < warp_vec.size(); b++){\\n\\t\\t\\t\\tif(tmp_S&POW[warp_vec[b]]){\\n\\t\\t\\t\\t\\tsum += getT(point[info[warp_vec[b]].from],WARP_P,info[warp_vec[b]].V);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tdp[base_state] = min(dp[base_state],sum);\\n\\t\\t}\\n\\n\\t}\\n\\n\\tdouble ans = HUGE_NUM;\\n\\n\\tfor(int state = 0; state < POW[N]; state++){\\n\\n\\t\\tans = min(ans,dp[state]+dp[(POW[N]-1)-state]);\\n\\t}\\n\\n\\tprintf(\\\"%.12lf\\\\n\\\",sqrt(ans/M));\\n}\\n\\nint main(){\\n\\n\\tPOW[0] = 1;\\n\\tfor(int i = 1; i < SIZE; i++){\\n\\n\\t\\tPOW[i] = POW[i-1]*2;\\n\\t}\\n\\n\\twhile(true){\\n\\n\\t\\tscanf(\\\"%d %d\\\",&N,&M);\\n\\t\\tif(N == 0 && M == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4300,\n \"memory_kb\": 16056,\n \"score_of_the_acc\": -1.5377,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1614_5442133\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define HUGE_NUM 4000000000000000000 //オーバーフローに注意\\n#define MOD 1000000007\\n//#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define EPS 0.00000001\\n#define SIZE 41\\n\\nstruct Point{\\n\\tPoint(double arg_x,double arg_y){\\n\\t\\tx = arg_x;\\n\\t\\ty = arg_y;\\n\\t}\\n\\n\\tPoint(){\\n\\t\\tx = y = 0.0;\\n\\t}\\n\\n\\tPoint operator + (Point p){ return Point(x+p.x,y+p.y); }\\n\\tPoint operator - (Point p){ return Point(x-p.x,y-p.y);}\\n\\tPoint operator * (double a){ return Point(a*x,a*y); }\\n\\tPoint operator / (double a){ return Point(x/a,y/a); }\\n\\n\\tdouble abs(){ return sqrt(norm()); }\\n\\tdouble norm(){ return x*x + y*y; }\\n\\n\\tbool operator<(const Point &p) const{\\n\\n\\t\\tif(fabs(x-p.x) > EPS){\\n\\n\\t\\t\\treturn x < p.x;\\n\\t\\t}else{\\n\\n\\t\\t\\treturn y < p.y;\\n\\t\\t}\\n\\t}\\n\\n\\tbool operator == (const Point &p) const{\\n\\t\\treturn fabs(x-p.x) < EPS && fabs(y-p.y) < EPS;\\n\\t}\\n\\n\\n\\tvoid debug(){\\n\\n\\t\\tprintf(\\\"(%.3lf,%.3lf)\\\\n\\\",x,y);\\n\\t}\\n\\n\\tdouble x,y;\\n};\\n\\ntypedef Point Vector;\\ntypedef vector<Point> Polygon;\\n\\nstruct Line{\\n\\tLine(){\\n\\n\\t}\\n\\tLine(Point a,Point b){\\n\\t\\tp[0] = a;\\n\\t\\tp[1] = b;\\n\\t}\\n\\t/*void outPut(){\\n\\n\\t\\tprintf(\\\"(%.3lf,%.3lf)-(%.3lf,%.3lf)\\\\n\\\",p[0].x,p[0].y,p[1].x,p[1].y);\\n\\t}*/\\n\\tPoint p[2];\\n};\\n\\nstruct Info{\\n\\tint from,to;\\n\\tdouble V,D,rev_V2;\\n};\\n\\nstruct DATA{\\n\\tDATA(Point arg_p,double arg_rad){\\n\\t\\tp = arg_p;\\n\\t\\trad = arg_rad;\\n\\t}\\n\\tDATA(){\\n\\t\\trad = 0;\\n\\t}\\n\\tbool operator<(const struct DATA &arg) const{\\n\\n\\t\\treturn rad < arg.rad;\\n\\t}\\n\\tPoint p;\\n\\tdouble rad;\\n};\\n\\n\\nstruct Circle{\\n\\tPoint center;\\n\\tdouble r;\\n};\\n\\nll POW[SIZE];\\nint N,M,table[SIZE];\\nvector<int> STATE;\\nvector<int> INFO[SIZE];\\ndouble MULT = 10;\\ndouble dp[1024*1024],diff_x[3] = {-MULT*EPS,0,MULT*EPS},diff_y[3] = {-MULT*EPS,0,MULT*EPS};\\ndouble DIST[SIZE],NUM = 100000;\\nPoint point[SIZE];\\nInfo info[SIZE];\\nCircle C[SIZE];\\nbool check[SIZE];\\nvector<DATA> ON_P[SIZE];\\n\\n\\ndouble calc_dist(Point A,Point B){\\n\\n\\treturn sqrt((A.x-B.x)*(A.x-B.x)+(A.y-B.y)*(A.y-B.y));\\n}\\n\\ndouble norm(Vector a){\\n\\treturn a.x*a.x+a.y*a.y;\\n}\\n\\ndouble abs(Vector a){\\n\\treturn sqrt(norm(a));\\n}\\n\\ndouble cross(Vector a,Vector b){\\n return a.x*b.y-a.y*b.x;\\n}\\n\\ndouble dot(Vector a,Vector b){\\n return a.x*b.x + a.y*b.y;\\n}\\n\\nstatic const int COUNTER_CLOCKWISE = 1;\\nstatic const int CLOCKWISE = -1;\\nstatic const int ONLINE_BACK = 2;\\nstatic const int ONLINE_FRONT = -2;\\nstatic const int ON_SEGMENT = 0;\\n\\n/*\\n * p0を基準点として、p1から見てp2が\\n * 反時計回り側にあれば\\n * COUNTER_CLOCKWISE\\n * */\\nint ccw(Point p0,Point p1,Point p2){\\n\\n\\tVector a = p1 - p0;\\n\\tVector b = p2 - p0;\\n\\n\\tif(cross(a,b) > EPS)return COUNTER_CLOCKWISE;\\n\\tif(cross(a,b) < -EPS)return CLOCKWISE;\\n\\tif(dot(a,b) < -EPS)return ONLINE_BACK;\\n\\tif(a.norm() < b.norm())return ONLINE_FRONT;\\n\\n\\treturn ON_SEGMENT;\\n}\\n\\nint func(double x1,double y1,double x2, double y2, double xp, double yp){\\n\\tdouble naiseki,norm1,norm2,gaiseki;\\n\\tnorm1 = sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));\\n\\tnorm2 = sqrt((xp-x1)*(xp-x1)+(yp-y1)*(yp-y1));\\n\\tnaiseki = (xp-x1)*(x2-x1)+(yp-y1)*(y2-y1);\\n\\tgaiseki = (x2-x1)*(yp-y1)-(xp-x1)*(y2-y1);\\n\\tif(gaiseki > EPS){\\n\\t\\treturn 1;\\n\\t}else if(gaiseki < -EPS){\\n\\t\\treturn -1;\\n\\t}\\n\\tif(naiseki < -EPS){\\n\\t\\treturn 2;\\n\\t}\\n\\n\\tif(norm1 < norm2){\\n\\t\\treturn -2;\\n\\t}\\n\\treturn 0;\\n}\\n\\n\\n//★★直線ではなく、線分の交差判定★★\\nbool is_Cross(Line a,Line b){\\n\\n\\tif(func(a.p[0].x,a.p[0].y,a.p[1].x,a.p[1].y,b.p[0].x,b.p[0].y)*\\n\\t\\t\\tfunc(a.p[0].x,a.p[0].y,a.p[1].x,a.p[1].y,b.p[1].x,b.p[1].y) <= 0 &&\\n\\t\\t\\tfunc(b.p[0].x,b.p[0].y,b.p[1].x,b.p[1].y,a.p[0].x,a.p[0].y)*\\n\\t\\t\\tfunc(b.p[0].x,b.p[0].y,b.p[1].x,b.p[1].y,a.p[1].x,a.p[1].y) <= 0){\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\n\\ndouble calc_len(Vector a){\\n return sqrt(a.x*a.x+a.y*a.y);\\n}\\n\\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\\n//線分ではなく直線と点の距離\\ndouble getDistanceLP(Line l,Point p){\\n return fabs(cross(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0]))/calc_len(calc_minus(l.p[1],l.p[0])));\\n}\\n\\n//点と線分の距離\\ndouble getDistanceSP(Line l,Point p){\\n\\tif(dot(calc_minus(l.p[1],l.p[0]),calc_minus(p,l.p[0])) < 0.0)return calc_len(calc_minus(p,l.p[0]));\\n\\tif(dot(calc_minus(l.p[0],l.p[1]),calc_minus(p,l.p[1])) < 0.0)return calc_len(calc_minus(p,l.p[1]));\\n\\treturn getDistanceLP(l,p);\\n}\\n\\n//線分と線分の距離\\ndouble getDistance(Line A,Line B){\\n\\tif(is_Cross(A,B))return 0.0;\\n\\treturn min(min(getDistanceSP(A,B.p[0]),getDistanceSP(A,B.p[1])),\\n\\t\\t\\tmin(getDistanceSP(B,A.p[0]),getDistanceSP(B,A.p[1])));\\n}\\n\\n\\ndouble calc_slope(Line A){\\n\\n\\tif(fabs(A.p[0].x-A.p[1].x) < EPS){\\n\\n\\t\\treturn DBL_MAX;\\n\\n\\t}else if(fabs(A.p[0].y-A.p[1].y) < EPS){\\n\\n\\t\\treturn 0;\\n\\n\\t}else{\\n\\n\\t\\treturn (A.p[1].y-A.p[0].y)/(A.p[1].x-A.p[0].x);\\n\\t}\\n}\\n\\ndouble arg(Vector p){\\n\\treturn atan2(p.y,p.x);\\n}\\n\\nVector polar(double a,double r){\\n\\treturn Point(cos(r)*a,sin(r)*a);\\n}\\n\\n//円と円の交点\\nvector<Point> getCrossPoints(Circle c1,Circle c2){\\n\\n\\tvector<Point> res;\\n\\n\\tdouble d = abs(c1.center-c2.center);\\n\\tdouble a = acos((c1.r*c1.r+d*d-c2.r*c2.r)/(2*c1.r*d));\\n\\tdouble t = arg(c2.center-c1.center);\\n\\n\\tres.push_back(Point(c1.center+polar(c1.r,t+a)));\\n\\tres.push_back(Point(c1.center+polar(c1.r,t-a)));\\n\\n\\treturn res;\\n}\\n\\n//t^2を求める\\ndouble getT(Point a,Point b,double V){\\n\\n\\tdouble A = (a.x-b.x)*(a.x-b.x) + (a.y-b.y)*(a.y-b.y);\\n\\treturn A/(V*V);\\n}\\n\\n/*点moveをbaseを中心にradラジアン回転させる\\nrad > 0なら反時計回り、rad < 0なら時計周り\\n*/\\nPoint rotate(Point base,Point move,double rad){\\n\\n\\tPoint ret;\\n\\tmove = move-base;\\n\\n\\tret.x = move.x*cos(rad)-move.y*sin(rad);\\n\\tret.y = move.x*sin(rad)+move.y*cos(rad);\\n\\n\\tret = ret+base;\\n\\n\\treturn ret;\\n}\\n\\n//点のradを求める関数\\ndouble calc_rad(Point p){\\n\\n\\tif(p.y == 0){\\n\\n\\t\\tif(p.x > 0){\\n\\n\\t\\t\\treturn 0;\\n\\n\\t\\t}else{ //p.x < 0\\n\\n\\t\\t\\treturn M_PI;\\n\\t\\t}\\n\\n\\t}else if(p.x == 0){\\n\\n\\t\\tif(p.y > 0){\\n\\n\\t\\t\\treturn M_PI/2.0;\\n\\t\\t}else{\\n\\n\\n\\t\\t\\treturn 3*M_PI/2.0;\\n\\t\\t}\\n\\n\\t}else{\\n\\n\\t\\tdouble base = atan(fabs(p.y)/fabs(p.x));\\n\\n\\t\\tif(p.x > 0){\\n\\n\\t\\t\\tif(p.y > 0){\\n\\n\\t\\t\\t\\treturn base;\\n\\n\\t\\t\\t}else{ //p.y < 0\\n\\n\\t\\t\\t\\treturn 2*M_PI-base;\\n\\t\\t\\t}\\n\\n\\t\\t}else{ //p.x < 0\\n\\n\\t\\t\\tif(p.y > 0){\\n\\n\\t\\t\\t\\treturn M_PI-base;\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\treturn base+M_PI;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\n\\nvoid func(){\\n\\n\\tSTATE.clear();\\n\\n\\tfor(int i = 0; i < SIZE; i++){\\n\\n\\t\\tINFO[i].clear();\\n\\t\\tDIST[i] = 0;\\n\\t\\tON_P[i].clear();\\n\\t}\\n\\n\\tfor(int i = 0; i < N; i++){\\n\\n\\t\\tscanf(\\\"%lf %lf\\\",&point[i].x,&point[i].y);\\n\\t}\\n\\n\\tfor(int i = 0; i < M; i++){\\n\\n\\t\\tscanf(\\\"%d %d %lf\\\",&info[i].from,&info[i].to,&info[i].V);\\n\\t\\tinfo[i].from--;\\n\\t\\tinfo[i].to--;\\n\\n\\t\\tinfo[i].rev_V2 = 1.0/(info[i].V*info[i].V);\\n\\t\\tdouble tmp_dist = calc_dist(point[info[i].from],point[info[i].to]);\\n\\t\\tinfo[i].D = tmp_dist*tmp_dist;\\n\\n\\t\\tC[i].center = point[info[i].from];\\n\\t\\tC[i].r = tmp_dist;\\n\\n\\t\\tINFO[info[i].from].push_back(i);\\n\\n\\t\\tDIST[i] = getT(point[info[i].from],point[info[i].to],info[i].V);\\n\\t}\\n\\n\\t/*2空港間の垂直二等分線を使い、空港の集合を二分割して、\\n\\t 同じワープポイントを使う可能性のある集合を全列挙する\\n\\t (垂直二等分線上に空港が並ぶ場合あり)\\n\\t 同じ空港に属する別の便が、異なるワープポイントを使うことはない\\n\\t 使うなら近いほうがいいから。ただし、目的地の方が近ければ、ワープポイントを使わない\\n\\t */\\n\\tfor(int i = 0; i < N-1; i++){\\n\\t\\tfor(int k = i+1; k < N; k++){\\n\\n\\t\\t\\tPoint mid_p = (point[i]+point[k])/2;\\n\\n\\t\\t\\tLine base_line; //垂直二等分線\\n\\n\\t\\t\\tif(fabs(point[i].x-point[k].x) < EPS){ //垂直\\n\\n\\t\\t\\t\\tbase_line = Line(Point(-NUM,mid_p.y),Point(NUM,mid_p.y));\\n\\n\\t\\t\\t}else if(fabs(point[i].y-point[k].y) < EPS){ //水平\\n\\n\\t\\t\\t\\tbase_line = Line(Point(mid_p.x,-NUM),Point(mid_p.x,NUM));\\n\\n\\t\\t\\t}else{\\n\\n\\t\\t\\t\\tdouble tmp_slope = calc_slope(Line(point[i],point[k]));\\n\\t\\t\\t\\ttmp_slope = (-1.0)/tmp_slope;\\n\\n\\t\\t\\t\\tbase_line = Line(Point(mid_p.x-NUM,mid_p.y-NUM*tmp_slope),Point(mid_p.x+NUM,mid_p.y+NUM*tmp_slope));\\n\\t\\t\\t}\\n\\n\\t\\t\\tvector<int> I,K,MID;\\n\\t\\t\\tI.push_back(i);\\n\\t\\t\\tK.push_back(k);\\n\\n\\t\\t\\tfor(int a = 0; a < N; a++){\\n\\t\\t\\t\\tif(a == i || a == k)continue;\\n\\n\\t\\t\\t\\tif(getDistanceSP(base_line,point[a]) < EPS){ //垂直二等分線上にある空港\\n\\n\\t\\t\\t\\t\\tMID.push_back(a);\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tLine work_line = Line(point[a],point[i]); //iへの直線\\n\\t\\t\\t\\t\\tif(is_Cross(base_line,work_line)){\\n\\n\\t\\t\\t\\t\\t\\tK.push_back(a);\\n\\n\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\tI.push_back(a);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tint state_I = 0,state_K = 0;\\n\\t\\t\\tfor(int a = 0; a < I.size(); a++){\\n\\n\\t\\t\\t\\tstate_I += POW[I[a]];\\n\\t\\t\\t}\\n\\t\\t\\tfor(int a = 0; a < K.size(); a++){\\n\\n\\t\\t\\t\\tstate_K += POW[K[a]];\\n\\t\\t\\t}\\n\\n\\t\\t\\tif(MID.size() == 0){\\n\\n\\t\\t\\t\\tSTATE.push_back(state_I);\\n\\t\\t\\t\\tSTATE.push_back(state_K);\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\n\\t\\t\\t//垂直二等分線上の空港を、IまたはKに振り分ける\\n\\t\\t\\tfor(int state = 0; state < POW[MID.size()]; state++){\\n\\t\\t\\t\\tint work_I = state_I;\\n\\t\\t\\t\\tint work_K = state_K;\\n\\t\\t\\t\\tfor(int loop = 0; loop < MID.size(); loop++){\\n\\t\\t\\t\\t\\tif(state&POW[loop]){\\n\\n\\t\\t\\t\\t\\t\\twork_I += POW[MID[loop]];\\n\\n\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\twork_K += POW[MID[loop]];\\n\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tSTATE.push_back(work_I);\\n\\t\\t\\t\\tSTATE.push_back(work_K);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tsort(STATE.begin(),STATE.end());\\n\\tSTATE.erase(unique(STATE.begin(),STATE.end()),STATE.end());\\n\\n\\n\\t//円弧上の点の回転角度を計算するため、ある円上にある交点を計算\\n\\tfor(int i = 0; i < M-1; i++){\\n\\t\\tfor(int k = i+1; k < M; k++){\\n\\n\\t\\t\\t//交差しない\\n\\t\\t\\tdouble tmp_dist = calc_dist(C[i].center,C[k].center);\\n\\n\\t\\t\\t//片方がもう片方を含む\\n\\t\\t\\tif(tmp_dist > C[i].r+C[k].r+EPS)continue;\\n\\t\\t\\tif(min(C[i].r,C[k].r)+tmp_dist+EPS < max(C[i].r,C[k].r)){\\n\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\n\\t\\t\\tvector<Point> ret = getCrossPoints(C[i],C[k]);\\n\\t\\t\\tfor(int a = 0; a < ret.size(); a++){\\n\\n\\t\\t\\t\\tON_P[i].push_back(DATA(ret[a],calc_rad(ret[a]-C[i].center)));\\n\\t\\t\\t\\tON_P[k].push_back(DATA(ret[a],calc_rad(ret[a]-C[k].center)));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tfor(int i = 0; i < M; i++){\\n\\n\\t\\tON_P[i].push_back(DATA(Point(C[i].center.x+C[i].r,C[i].center.y),0));\\n\\t\\tON_P[i].push_back(DATA(Point(C[i].center.x,C[i].center.y+C[i].r),M_PI/2));\\n\\t\\tON_P[i].push_back(DATA(Point(C[i].center.x-C[i].r,C[i].center.y),M_PI));\\n\\t\\tON_P[i].push_back(DATA(Point(C[i].center.x,C[i].center.y-C[i].r),(M_PI*3)/2.0));\\n\\t}\\n\\n\\tfor(int i = 0; i < M; i++){\\n\\t\\tif(ON_P[i].size() == 0)continue;\\n\\n\\t\\tsort(ON_P[i].begin(),ON_P[i].end());\\n\\t}\\n\\n\\n\\tvector<ll> cross_STATE;\\n\\n\\t//ある2円を交差させた際に、その共通領域を同じ共通領域とする便の集合を前計算\\n\\tfor(int i = 0; i < M; i++){\\n\\n\\t\\tvector<Point> ret;\\n\\t\\tret.push_back(C[i].center);\\n\\n\\t\\tfor(int k = 0; k < ON_P[i].size(); k++){\\n\\n\\t\\t\\tPoint tmp_p = ON_P[i][k].p;\\n\\n\\t\\t\\tint size = ON_P[i].size();\\n\\t\\t\\tdouble tmp_rad = ON_P[i][(k+1)%size].rad-ON_P[i][k].rad;\\n\\t\\t\\tif((k+1) == size){\\n\\n\\t\\t\\t\\ttmp_rad += 2*M_PI;\\n\\t\\t\\t}\\n\\t\\t\\ttmp_rad /= 2;\\n\\n\\t\\t\\tPoint calc_P = rotate(C[i].center,tmp_p,tmp_rad);\\n\\n\\t\\t\\tVector tmp_vec = calc_P-C[i].center;\\n\\t\\t\\ttmp_vec = tmp_vec/abs(tmp_vec);\\n\\n\\t\\t\\tret.push_back(calc_P+tmp_vec*10*EPS);\\n\\t\\t\\tret.push_back(calc_P-tmp_vec*10*EPS);\\n\\n\\t\\t\\t/*//誤差が出るので、適当に近傍の点を入れる\\n\\t\\t\\tfor(int e = 0; e < 3; e++){\\n\\t\\t\\t\\tfor(int f = 0; f < 3; f++){\\n\\n\\t\\t\\t\\t\\tPoint adj_p = Point(calc_P.x+diff_x[e],calc_P.y+diff_y[f]);\\n\\n\\t\\t\\t\\t\\tif(calc_dist(C[i].center,adj_p) > C[i].r+EPS || calc_dist(C[k].center,adj_p) > C[k].r+EPS)continue;\\n\\n\\t\\t\\t\\t\\tret.push_back(adj_p);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tcalc_P = rotate(C[i].center,tmp_p,-tmp_rad);\\n\\n\\n\\t\\t\\t//誤差が出るので、適当に近傍の点を入れる\\n\\t\\t\\tfor(int e = 0; e < 3; e++){\\n\\t\\t\\t\\tfor(int f = 0; f < 3; f++){\\n\\n\\t\\t\\t\\t\\tPoint adj_p = Point(calc_P.x+diff_x[e],calc_P.y+diff_y[f]);\\n\\n\\t\\t\\t\\t\\tif(calc_dist(C[i].center,adj_p) > C[i].r+EPS || calc_dist(C[k].center,adj_p) > C[k].r+EPS)continue;\\n\\n\\t\\t\\t\\t\\tret.push_back(adj_p);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n*/\\n\\t\\t}\\n\\n\\n\\t\\tfor(int a = 0; a < ret.size(); a++){\\n\\n\\t\\t\\tll tmp_S = 0;\\n\\n\\t\\t\\tfor(int b = 0; b < M; b++){\\n\\t\\t\\t\\tdouble tmp_dist = calc_dist(C[b].center,ret[a]);\\n\\t\\t\\t\\tif(tmp_dist > C[b].r+EPS)continue;\\n\\n\\t\\t\\t\\ttmp_S += POW[b];\\n\\t\\t\\t}\\n\\t\\t\\tcross_STATE.push_back(tmp_S);\\n\\t\\t}\\n\\t}\\n\\n\\tsort(cross_STATE.begin(),cross_STATE.end());\\n\\tcross_STATE.erase(unique(cross_STATE.begin(),cross_STATE.end()),cross_STATE.end());\\n\\n\\t/*for(int a = 0; a < cross_STATE.size(); a++){\\n\\n\\t\\tprintf(\\\"%lld\\\\n\\\",cross_STATE[a]);\\n\\t}\\n\\n\\treturn;*/\\n\\n\\n\\tdp[0] = 0; //空集合\\n\\tfor(int state = 1; state < POW[N]; state++){\\n\\n\\t\\tdp[state] = HUGE_NUM;\\n\\t}\\n\\n\\n\\t//ある状態について、ワープを使う空港と使わない空港の組み合わせを全探索する\\n\\tfor(int i = 0; i < STATE.size(); i++){\\n\\n\\t\\tint base_state = STATE[i]; //空港の集合\\n\\t\\t//printf(\\\"\\\\nbase_state:%d\\\\n\\\",base_state);\\n\\n\\t\\tfor(int k = 0; k < M; k++){\\n\\n\\t\\t\\tcheck[k] = false;\\n\\t\\t\\ttable[k] = -1;\\n\\t\\t}\\n\\n\\t\\tvector<int> BIN; //便のindex\\n\\t\\tint count = 0;\\n\\n\\t\\tll MASK = 0;\\n\\n\\t\\tfor(int k = 0; k < N; k++){\\n\\t\\t\\tif(base_state&POW[k]){\\n\\t\\t\\t\\tfor(int a = 0; a < INFO[k].size(); a++){\\n\\n\\t\\t\\t\\t\\tBIN.push_back(INFO[k][a]);\\n\\t\\t\\t\\t\\tcheck[INFO[k][a]] = true;\\n\\t\\t\\t\\t\\ttable[INFO[k][a]] = count++; //この集合での、便のindex\\n\\t\\t\\t\\t\\tMASK += POW[INFO[k][a]];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tset<ll> SET; //ワープ地点を使う便の集合\\n\\n\\t\\tfor(int a = 0; a < BIN.size(); a++){\\n\\n\\t\\t\\tSET.insert(POW[BIN[a]]);\\n\\t\\t}\\n\\t\\tfor(int a = 0; a < cross_STATE.size(); a++){\\n\\n\\t\\t\\tSET.insert(MASK&cross_STATE[a]);\\n\\t\\t}\\n\\n\\t\\t/*for(int a = 0; a < BIN.size()-1; a++){\\n\\t\\t\\tfor(int b = a+1; b < BIN.size(); b++){\\n\\n\\t\\t\\t\\tSET.insert(MASK&ADJ[BIN[a]][BIN[b]]);\\n\\t\\t\\t}\\n\\t\\t}*/\\n\\n\\t\\tfor(auto tmp_S: SET){\\n\\n\\t\\t\\tdouble sum = 0;\\n\\n\\t\\t\\tvector<int> warp_vec;\\n\\n\\t\\t\\tfor(int k = 0; k < BIN.size(); k++){\\n\\t\\t\\t\\tif(tmp_S&POW[BIN[k]]){ //ワープを使う\\n\\n\\t\\t\\t\\t\\twarp_vec.push_back(BIN[k]);\\n\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tsum += DIST[BIN[k]];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tdouble X = 0,Y = 0;\\n\\n\\t\\t\\tfor(int E = 0; E < 2; E++){\\n\\n\\t\\t\\t\\tdouble bunshi = 0;\\n\\t\\t\\t\\tdouble bunbo = 0;\\n\\n\\t\\t\\t\\tfor(int b = 0; b < warp_vec.size(); b++){\\n\\n\\t\\t\\t\\t\\tint tmp_from = info[warp_vec[b]].from;\\n\\n\\t\\t\\t\\t\\tif(E == 0){\\n\\n\\t\\t\\t\\t\\t\\tbunshi += point[tmp_from].x*info[warp_vec[b]].rev_V2;\\n\\n\\t\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\t\\tbunshi += point[tmp_from].y*info[warp_vec[b]].rev_V2;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tbunbo += info[warp_vec[b]].rev_V2;\\n\\t\\t\\t\\t}\\n\\n\\t\\t\\t\\tif(E == 0){\\n\\n\\t\\t\\t\\t\\tX = bunshi/bunbo;\\n\\t\\t\\t\\t}else{\\n\\n\\t\\t\\t\\t\\tY = bunshi/bunbo;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tPoint WARP_P = Point(X,Y); //ワープ地点\\n\\t\\t\\tfor(int b = 0; b < warp_vec.size(); b++){\\n\\t\\t\\t\\tif(tmp_S&POW[warp_vec[b]]){\\n\\t\\t\\t\\t\\tsum += getT(point[info[warp_vec[b]].from],WARP_P,info[warp_vec[b]].V);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tdp[base_state] = min(dp[base_state],sum);\\n\\t\\t}\\n\\n\\t}\\n\\n\\tdouble ans = HUGE_NUM;\\n\\n\\tfor(int state = 0; state < POW[N]; state++){\\n\\n\\t\\tans = min(ans,dp[state]+dp[(POW[N]-1)-state]);\\n\\t}\\n\\n\\tprintf(\\\"%.12lf\\\\n\\\",sqrt(ans/M));\\n}\\n\\nint main(){\\n\\n\\tPOW[0] = 1;\\n\\tfor(int i = 1; i < SIZE; i++){\\n\\n\\t\\tPOW[i] = POW[i-1]*2;\\n\\t}\\n\\n\\twhile(true){\\n\\n\\t\\tscanf(\\\"%d %d\\\",&N,&M);\\n\\t\\tif(N == 0 && M == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4280,\n \"memory_kb\": 16128,\n \"score_of_the_acc\": -1.5384,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1614_3117995\",\n \"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(n,m) (abs((n)-(m)) < EPS)\\n#define X real()\\n#define Y imag()\\n\\ntypedef complex<double> P;\\ntypedef vector<P> VP;\\nstruct L : array<P, 2>{\\n L(const P& a, const P& b){ at(0)=a; at(1)=b; }\\n L(){}\\n};\\nstruct C{\\n P p;\\n double r;\\n C(const P& p, const double& r) : p(p), r(r) {}\\n C(){}\\n};\\n\\nnamespace std{\\n bool operator < (const P& a, const P& b){\\n return !EQ(a.X,b.X) ? a.X<b.X : a.Y+EPS<b.Y;\\n }\\n bool operator == (const P& a, const P& b){\\n return abs(a-b) < EPS;\\n }\\n}\\n\\ndouble dot(P a, P b){\\n return (conj(a)*b).X;\\n}\\ndouble cross(P a, P b){\\n return (conj(a)*b).Y;\\n}\\nint ccw(P a, P b, P c){\\n b -= a;\\n c -= a;\\n if(cross(b,c) > EPS) return +1; //ccw\\n if(cross(b,c) < -EPS) return -1; //cw\\n if(dot(b,c) < -EPS) return +2; //c-a-b\\n if(abs(c)-abs(b) > EPS) return -2; //a-b-c\\n return 0; //a-c-b\\n}\\nP unit(const P &p){\\n return p/abs(p);\\n}\\nP rotate(const P &p, double rad){\\n return p *P(cos(rad), sin(rad));\\n}\\n\\nVP crosspointCC(C a, C b){\\n VP ret;\\n if(a.p == b.p && a.r == b.r){\\n return ret;\\n }\\n if(a.r < b.r) swap(a,b);\\n double dist = abs(b.p-a.p);\\n P dir = a.r*unit(b.p-a.p);\\n if(EQ(dist, a.r+b.r) || EQ(dist, a.r-b.r)){\\n ret.push_back(a.p +dir);\\n }else if(a.r-b.r < dist && dist < a.r+b.r){\\n double cos = (a.r*a.r +dist*dist -b.r*b.r)/(2*a.r*dist);\\n double sin = sqrt(1 -cos*cos);\\n ret.push_back(a.p +dir*P(cos, sin));\\n ret.push_back(a.p +dir*P(cos, -sin));\\n }\\n return ret;\\n}\\n\\nstruct edge{\\n int from,to;\\n double v;\\n edge(int f, int t, double v):from(f),to(t),v(v){}\\n edge(){};\\n};\\n\\nvector<int> linear_division(const VP &p){\\n int n = p.size();\\n vector<int> ret;\\n for(int i=0; i<n; i++){\\n for(int j=i+1; j<n; j++){\\n int div = 0;\\n vector<pair<P, int> > online;\\n for(int k=0; k<n; k++){\\n if(ccw(p[i], p[j], p[k]) == 1){\\n div |= 1<<k;\\n }else if(ccw(p[i], p[j], p[k]) != -1){\\n online.emplace_back(p[k], k);\\n }\\n }\\n sort(online.begin(), online.end());\\n for(int d=0; d<2; d++){\\n for(int k=0; k<(int)online.size(); k++){\\n div ^= 1<<online[k].second;\\n if((div & 1) == 0){\\n ret.push_back(div ^ ((1<<n) -1));\\n }else{\\n ret.push_back(div);\\n }\\n }\\n }\\n }\\n }\\n sort(ret.begin(), ret.end());\\n ret.erase(unique(ret.begin(), ret.end()), ret.end());\\n return ret;\\n}\\n\\nvector<long long int> circle_division(const VP &p, const vector<edge> &e){\\n int m = e.size();\\n vector<C> c(m);\\n for(int i=0; i<m; i++){\\n c[i] = C(p[e[i].from], abs(p[e[i].from] -p[e[i].to]));\\n }\\n vector<vector<double> > cpa(m);\\n for(int i=0; i<m; i++){\\n for(int j=0; j<m; j++){\\n VP cp = crosspointCC(c[i], c[j]);\\n for(const P &point: cp){\\n cpa[i].push_back(arg(point -c[i].p));\\n }\\n }\\n cpa[i].push_back(-PI);\\n cpa[i].push_back(PI);\\n sort(cpa[i].begin(), cpa[i].end());\\n }\\n\\n VP cand;\\n for(int i=0; i<m; i++){\\n for(int j=0; j<(int)cpa[i].size()-1; j++){\\n double angle = (cpa[i][j] +cpa[i][j+1]) /2;\\n P rot = rotate(P(c[i].r, 0), angle);\\n cand.push_back(c[i].p +rot +unit(rot)*EPS*10.0);\\n cand.push_back(c[i].p +rot -unit(rot)*EPS*10.0);\\n }\\n }\\n\\n vector<long long int> ret;\\n for(const P &point: cand){\\n long long int div = 0;\\n for(int i=0; i<m; i++){\\n if(abs(point -c[i].p) < c[i].r +EPS){\\n div |= 1LL<<i;\\n }\\n }\\n ret.push_back(div);\\n }\\n sort(ret.begin(), ret.end());\\n ret.erase(unique(ret.begin(), ret.end()), ret.end());\\n return ret;\\n}\\n\\ndouble solve_onewarp(const VP &p, const vector<edge> &e, long long int ldiv, const vector<long long int> &cdiv){\\n int m = e.size();\\n double ret = INF;\\n for(long long int inout: cdiv){\\n double weight = 0;\\n P g(0, 0);\\n for(int i=0; i<m; i++){\\n if((1<<e[i].from & ldiv) == 0) continue;\\n if((1LL<<i & inout) != 0){\\n double w = 1/e[i].v /e[i].v;\\n g += w *p[e[i].from];\\n weight += w;\\n }\\n }\\n g /= weight;\\n double sub = 0;\\n for(int i=0; i<m; i++){\\n if((1<<e[i].from & ldiv) == 0) continue;\\n if((1LL<<i & inout) != 0){\\n sub += norm((p[e[i].from] -g) /e[i].v);\\n }else{\\n sub += norm((p[e[i].from] -p[e[i].to]) /e[i].v);\\n }\\n }\\n ret = min(ret, sub);\\n }\\n return ret;\\n}\\n\\ndouble solve_twowarp(const VP &p, const vector<edge> &e){\\n vector<int> ldiv = linear_division(p);\\n vector<long long int> cdiv = circle_division(p, e);\\n double ret = INF;\\n for(int bit: ldiv){\\n int revbit = bit ^((1<<p.size()) -1);\\n ret = min(ret, solve_onewarp(p, e, bit, cdiv) +solve_onewarp(p, e, revbit, cdiv));\\n }\\n return sqrt(ret /e.size());\\n}\\n\\nint main(){\\n while(1){\\n int n,m;\\n cin >> n >> m;\\n if(n==0) break;\\n\\n VP p(n);\\n for(int i=0; i<n; i++){\\n double x,y;\\n cin >> x >> y;\\n p[i] = P(x, y);\\n }\\n vector<edge> e(m);\\n for(int i=0; i<m; i++){\\n cin >> e[i].from >> e[i].to >> e[i].v;\\n e[i].from--; e[i].to--;\\n }\\n cout << fixed << setprecision(10);\\n cout << solve_twowarp(p, e) << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1490,\n \"memory_kb\": 3964,\n \"score_of_the_acc\": -0.1568,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1614_3117977\",\n \"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(n,m) (abs((n)-(m)) < EPS)\\n#define X real()\\n#define Y imag()\\n\\ntypedef complex<double> P;\\ntypedef vector<P> VP;\\nstruct L : array<P, 2>{\\n L(const P& a, const P& b){ at(0)=a; at(1)=b; }\\n L(){}\\n};\\nstruct C{\\n P p;\\n double r;\\n C(const P& p, const double& r) : p(p), r(r) {}\\n C(){}\\n};\\n\\nnamespace std{\\n bool operator < (const P& a, const P& b){\\n return !EQ(a.X,b.X) ? a.X<b.X : a.Y+EPS<b.Y;\\n }\\n bool operator == (const P& a, const P& b){\\n return abs(a-b) < EPS;\\n }\\n}\\n\\ndouble dot(P a, P b){\\n return (conj(a)*b).X;\\n}\\ndouble cross(P a, P b){\\n return (conj(a)*b).Y;\\n}\\nint ccw(P a, P b, P c){\\n b -= a;\\n c -= a;\\n if(cross(b,c) > EPS) return +1; //ccw\\n if(cross(b,c) < -EPS) return -1; //cw\\n if(dot(b,c) < -EPS) return +2; //c-a-b\\n if(abs(c)-abs(b) > EPS) return -2; //a-b-c\\n return 0; //a-c-b\\n}\\nP unit(const P &p){\\n return p/abs(p);\\n}\\nP rotate(const P &p, double rad){\\n return p *P(cos(rad), sin(rad));\\n}\\n\\nVP crosspointCC(C a, C b){\\n VP ret;\\n if(a.p == b.p && a.r == b.r){\\n return ret;\\n }\\n if(a.r < b.r) swap(a,b);\\n double dist = abs(b.p-a.p);\\n P dir = a.r*unit(b.p-a.p);\\n if(EQ(dist, a.r+b.r) || EQ(dist, a.r-b.r)){\\n ret.push_back(a.p +dir);\\n }else if(a.r-b.r < dist && dist < a.r+b.r){\\n double cos = (a.r*a.r +dist*dist -b.r*b.r)/(2*a.r*dist);\\n double sin = sqrt(1 -cos*cos);\\n ret.push_back(a.p +dir*P(cos, sin));\\n ret.push_back(a.p +dir*P(cos, -sin));\\n }\\n return ret;\\n}\\n\\nstruct edge{\\n int from,to;\\n double v;\\n edge(int f, int t, double v):from(f),to(t),v(v){}\\n edge(){};\\n};\\n\\nvector<int> linear_division(const VP &p){\\n int n = p.size();\\n vector<int> ret;\\n for(int i=0; i<n; i++){\\n for(int j=i+1; j<n; j++){\\n int ccwbit = 0;\\n vector<pair<P, int> > online;\\n for(int k=0; k<n; k++){\\n if(ccw(p[i], p[j], p[k]) == 1){\\n ccwbit |= 1<<k;\\n }else if(ccw(p[i], p[j], p[k]) != -1){\\n online.emplace_back(p[k], k);\\n }\\n }\\n sort(online.begin(), online.end());\\n for(int d=0; d<2; d++){\\n for(int k=0; k<(int)online.size(); k++){\\n ccwbit ^= 1<<online[k].second;\\n if((ccwbit & 1) == 0){\\n ret.push_back(ccwbit ^ ((1<<n) -1));\\n }else{\\n ret.push_back(ccwbit);\\n }\\n }\\n }\\n }\\n }\\n sort(ret.begin(), ret.end());\\n ret.erase(unique(ret.begin(), ret.end()), ret.end());\\n return ret;\\n}\\n\\ndouble solve_onewarp(const VP &p, const vector<edge> &e){\\n int m = e.size();\\n if(m == 0) return 0.0;\\n\\n vector<C> c(m);\\n for(int i=0; i<m; i++){\\n c[i] = C(p[e[i].from], abs(p[e[i].from] -p[e[i].to]));\\n }\\n vector<vector<double> > cpa(m);\\n for(int i=0; i<m; i++){\\n for(int j=0; j<m; j++){\\n VP cp = crosspointCC(c[i], c[j]);\\n for(const P &point: cp){\\n cpa[i].push_back(arg(point -c[i].p));\\n }\\n }\\n cpa[i].push_back(-PI);\\n cpa[i].push_back(PI);\\n sort(cpa[i].begin(), cpa[i].end());\\n }\\n\\n VP cand;\\n for(int i=0; i<m; i++){\\n for(int j=0; j<(int)cpa[i].size()-1; j++){\\n double angle = (cpa[i][j] +cpa[i][j+1]) /2;\\n P rot = rotate(P(c[i].r, 0), angle);\\n cand.push_back(c[i].p +rot +unit(rot)*EPS*10.0);\\n cand.push_back(c[i].p +rot -unit(rot)*EPS*10.0);\\n }\\n }\\n\\n double ret = INF;\\n for(const P &point: cand){\\n long long int inout = 0;\\n double weight = 0;\\n P g(0, 0);\\n for(int i=0; i<m; i++){\\n if(abs(point -c[i].p) < c[i].r +EPS){\\n double w = 1/e[i].v /e[i].v;\\n g += w *c[i].p;\\n inout |= 1LL<<i;\\n weight += w;\\n }\\n }\\n g /= weight;\\n double sub = 0;\\n for(int i=0; i<m; i++){\\n if((1LL<<i & inout) != 0){\\n sub += norm((p[e[i].from] -g) /e[i].v);\\n }else{\\n sub += norm((p[e[i].from] -p[e[i].to]) /e[i].v);\\n }\\n }\\n ret = min(ret, sub);\\n }\\n return ret;\\n}\\n\\ndouble solve_twowarp(const VP &p, const vector<edge> &e){\\n vector<int> division = linear_division(p);\\n double ret = INF;\\n for(int bit: division){\\n vector<vector<edge> > newe(2);\\n for(const edge &ed: e){\\n newe[(1<<ed.from & bit) != 0].push_back(ed);\\n }\\n ret = min(ret, solve_onewarp(p, newe[0]) +solve_onewarp(p, newe[1]));\\n }\\n return sqrt(ret /e.size());\\n}\\n\\nint main(){\\n while(1){\\n int n,m;\\n cin >> n >> m;\\n if(n==0) break;\\n\\n VP p(n);\\n for(int i=0; i<n; i++){\\n double x,y;\\n cin >> x >> y;\\n p[i] = P(x, y);\\n }\\n vector<edge> e(m);\\n for(int i=0; i<m; i++){\\n cin >> e[i].from >> e[i].to >> e[i].v;\\n e[i].from--; e[i].to--;\\n }\\n cout << fixed << setprecision(10);\\n cout << solve_twowarp(p, e) << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5670,\n \"memory_kb\": 3816,\n \"score_of_the_acc\": -1,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1614_2160066\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing VI = vector<int>;\\nusing VVI = vector<VI>;\\nusing PII = pair<int, int>;\\nusing LL = long long;\\nusing VL = vector<LL>;\\nusing VVL = vector<VL>;\\nusing PLL = pair<LL, LL>;\\nusing VS = vector<string>;\\n\\n#define ALL(a) begin((a)),end((a))\\n#define RALL(a) (a).rbegin(), (a).rend()\\n#define PB push_back\\n#define EB emplace_back\\n#define MP make_pair\\n#define SZ(a) int((a).size())\\n#define SORT(c) sort(ALL((c)))\\n#define RSORT(c) sort(RALL((c)))\\n\\n#define FOR(i,a,b) for(int i=(a);i<(b);++i)\\n#define REP(i,n) FOR(i,0,n)\\n\\n#define FF first\\n#define SS second\\ntemplate<class S, class T>\\nistream& operator>>(istream& is, pair<S,T>& p){\\n return is >> p.FF >> p.SS;\\n}\\ntemplate<class S, class T>\\nostream& operator<<(ostream& os, pair<S,T>& p){\\n return os << p.FF << \\\" \\\" << p.SS;\\n}\\ntemplate<class T>\\nvoid maxi(T& x, T y){\\n if(x < y) x = y;\\n}\\ntemplate<class T>\\nvoid mini(T& x, T y){\\n if(x > y) x = y;\\n}\\n\\nconst double EPS = 1e-10;\\nconst double PI = acos(-1.0);\\nconst LL MOD = 1e9+7;\\n\\nclass Point{\\npublic:\\n double x, y;\\n\\n Point(double x = 0.0, double y = 0.0) : x(x), y(y){}\\n\\n Point operator + (const Point& p) const{ return Point(x + p.x, y + p.y); }\\n Point& operator += (const Point& p){ x += p.x; y += p.y; return *this;}\\n Point operator - (const Point& p) const{ return Point(x - p.x, y - p.y); }\\n Point& operator -= (const Point& p){ x -= p.x; y -= p.y; return *this;}\\n Point operator * (double a) const{ return Point(a*x, a*y); }\\n Point& operator *= (double a){ x *= a; y *= a; return *this;}\\n Point operator / (double a) const{ return Point(x / a, y / a); }\\n Point& operator /= (double a){ x /= a; y /= a; return *this;}\\n\\n double abs(){ return sqrt(norm()); }\\n double norm(){ return x*x + y*y; }\\n};\\n\\nclass Circle{\\npublic:\\n\\tPoint c;\\n\\tdouble r;\\n};\\ntypedef Point Vector;\\n\\ndouble dot(Vector a, Vector b){\\n\\treturn a.x*b.x + a.y*b.y;\\n}\\ndouble cross(Vector a, Vector b){\\n\\treturn a.x*b.y - a.y*b.x;\\n}\\nPoint rotate(Point p,double angle){\\n return Point(p.x*cos(angle) - p.y*sin(angle),\\n\\t\\t\\t p.x*sin(angle) + p.y*cos(angle));\\n}\\n\\npair<Point, Point> getCrossPoints(const Circle& c1, const Circle& c2){\\n double d = (c2.c - c1.c).abs();\\n double a = (c1.r*c1.r + d*d - c2.r*c2.r) / (2*d);\\n Vector e = (c2.c - c1.c) / d;\\n Vector h = rotate(e, PI/2) * sqrt(max(c1.r*c1.r - a*a, 0.));\\n if(d + min(c1.r, c2.r) <= max(c1.r, c2.r))\\n\\treturn MP(c1.c + e*c1.r, c1.c + e*c1.r);\\n\\n return MP(c1.c + e*a + h, c1.c + e*a - h);\\n}\\n\\n// ??????????????§?????¢???????????????\\n// ?????????????????°???O(N^2)\\nvoid partCircles(const vector<Circle>& cs, set<LL>& res){\\n int N = SZ(cs);\\n vector<Point> ps;\\n REP(i,N) REP(j,N){\\n\\tif(i == j) continue;\\n\\tauto cc = getCrossPoints(cs[i], cs[j]);\\n\\tPoint crossPoints[2] = {cc.FF, cc.SS};\\n\\tREP(k,2){\\n\\t Vector delta = crossPoints[1-k] - crossPoints[k];\\n\\t if(delta.abs() == 0)\\n\\t\\tdelta = crossPoints[k] - cs[i].c;\\n\\t delta /= delta.abs();\\n\\t REP(d,4){\\n\\t\\tps.PB(crossPoints[k] + delta*EPS);\\n\\t\\tdelta = rotate(delta, PI/2);\\n\\t }\\n\\t}\\n }\\n\\n for(auto&& p: ps){\\n\\tLL bit = 0;\\n\\tREP(i,N)\\n\\t if((cs[i].c - p).abs() < cs[i].r)\\n\\t\\tbit |= 1LL<<i;\\n\\tres.insert(bit);\\n }\\n}\\n\\n// ?????¢?????´?????§??????????????¨????????????????????????????????????\\n// ????????????O(N^2)\\nvoid partPoints(vector<Point> ps, set<PLL>& res){\\n int N = SZ(ps);\\n REP(i,N){\\n\\tVector e(0,1);\\n\\tREP(d,4){\\n\\t ps.PB(ps[i]+e*EPS);\\n\\t e = rotate(e, PI/2);\\n\\t}\\n }\\n \\n REP(i,SZ(ps)) REP(j,SZ(ps)){\\n\\tif(i == j) continue;\\n\\tPoint p1 = ps[i];\\n\\tPoint p2 = ps[j];\\n\\tVector e = p2 - p1;\\n\\te /= e.abs();\\n\\te = rotate(e, PI/2);\\n\\tLL b1 = 0, b2 = 0;\\n\\tREP(k,N)\\n\\t if(dot(e, ps[k]-p1) >= 0)\\n\\t\\tb1 |= 1LL<<k;\\n\\t else\\n\\t\\tb2 |= 1LL<<k;\\n\\tif(b1 > b2) swap(b1, b2);\\n\\tres.insert(MP(b1,b2));\\n }\\n}\\n\\nint N, M;\\ndouble calcBest(LL bps, LL bcs, VI& as, vector<double>& vs, vector<Circle>& cs){\\n Point q(0, 0);\\n double inv = 0.;\\n REP(i,M){\\n\\tif((bcs>>i&1) == 0 || (bps>>as[i]&1) == 0) continue;\\n\\tdouble tmp = 1. / (vs[i] * vs[i]);\\n\\tq.x += cs[i].c.x * tmp;\\n\\tq.y += cs[i].c.y * tmp;\\n\\tinv += tmp;\\n }\\n if(inv <= 0) return 0;\\n q.x /= inv;\\n q.y /= inv;\\n\\n double res = 0.;\\n REP(i,M){\\n\\tif((bcs>>i&1) == 0 || (bps>>as[i]&1) == 0) continue;\\n\\tres += ((cs[i].c - q).norm() - (cs[i].r * cs[i].r)) / (vs[i] * vs[i]);\\n }\\n return res;\\n}\\n\\nint main(){\\n cin.tie(0);\\n ios_base::sync_with_stdio(false);\\n\\n while(cin>>N>>M,N){\\n\\tvector<Point> ps(N);\\n\\tREP(i,N) cin >> ps[i].x >> ps[i].y;\\n\\tVI as(M), bs(M);\\n\\tvector<double> vs(M);\\n\\tvector<Circle> cs(M);\\n\\tREP(i,M){\\n\\t cin >> as[i] >> bs[i] >> vs[i];\\n\\t --as[i];\\n\\t --bs[i];\\n\\t cs[i].c = ps[as[i]];\\n\\t cs[i].r = (ps[bs[i]] - ps[as[i]]).abs();\\n\\t}\\n\\tif(M <= 2){\\n\\t cout << fixed << setprecision(9) << 0. << endl;\\n\\t continue;\\n\\t}\\n\\n\\tset<LL> planes;\\n\\tset<PLL> points;\\n\\tpartCircles(cs, planes);\\n\\tpartPoints(ps, points);\\n\\n\\tdouble best = 0.;\\n\\tfor(auto&& bpos: points){\\n\\t double d1 = 0, d2 = 0;\\n\\t for(auto&& bpls: planes){\\n\\t\\tmini(d1, calcBest(bpos.FF, bpls, as, vs, cs));\\n\\t\\tmini(d2, calcBest(bpos.SS, bpls, as, vs, cs));\\n\\t }\\n\\t mini(best, d1+d2);\\n\\t}\\n\\n\\tdouble ans = 0;\\n\\tREP(i,M) ans += pow(cs[i].r / vs[i], 2);\\n\\tcout << fixed << setprecision(9) << sqrt((ans+best)/M) << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 780,\n \"memory_kb\": 3928,\n \"score_of_the_acc\": -0.0095,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1614_2160062\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n \\nusing VI = vector<int>;\\nusing VVI = vector<VI>;\\nusing PII = pair<int, int>;\\nusing LL = long long;\\nusing VL = vector<LL>;\\nusing VVL = vector<VL>;\\nusing PLL = pair<LL, LL>;\\nusing VS = vector<string>;\\n \\n#define ALL(a) begin((a)),end((a))\\n#define RALL(a) (a).rbegin(), (a).rend()\\n#define PB push_back\\n#define EB emplace_back\\n#define MP make_pair\\n#define SZ(a) int((a).size())\\n#define SORT(c) sort(ALL((c)))\\n#define RSORT(c) sort(RALL((c)))\\n \\n#define FOR(i,a,b) for(int i=(a);i<(b);++i)\\n#define REP(i,n) FOR(i,0,n)\\n \\n#define FF first\\n#define SS second\\ntemplate<class S, class T>\\nistream& operator>>(istream& is, pair<S,T>& p){\\n return is >> p.FF >> p.SS;\\n}\\ntemplate<class S, class T>\\nostream& operator<<(ostream& os, pair<S,T>& p){\\n return os << p.FF << \\\" \\\" << p.SS;\\n}\\ntemplate<class T>\\nvoid maxi(T& x, T y){\\n if(x < y) x = y;\\n}\\ntemplate<class T>\\nvoid mini(T& x, T y){\\n if(x > y) x = y;\\n}\\n \\nconst double EPS = 1e-10;\\nconst double PI = acos(-1.0);\\nconst LL MOD = 1e9+7;\\n \\nclass Point{\\npublic:\\n double x, y;\\n \\n Point(double x = 0.0, double y = 0.0) : x(x), y(y){}\\n \\n Point operator + (const Point& p) const{ return Point(x + p.x, y + p.y); }\\n Point& operator += (const Point& p){ x += p.x; y += p.y; return *this;}\\n Point operator - (const Point& p) const{ return Point(x - p.x, y - p.y); }\\n Point& operator -= (const Point& p){ x -= p.x; y -= p.y; return *this;}\\n Point operator * (double a) const{ return Point(a*x, a*y); }\\n Point& operator *= (double a){ x *= a; y *= a; return *this;}\\n Point operator / (double a) const{ return Point(x / a, y / a); }\\n Point& operator /= (double a){ x /= a; y /= a; return *this;}\\n \\n double abs(){ return sqrt(norm()); }\\n double norm(){ return x*x + y*y; }\\n};\\n \\nclass Circle{\\npublic:\\n Point c;\\n double r;\\n};\\ntypedef Point Vector;\\n \\ndouble dot(Vector a, Vector b){\\n return a.x*b.x + a.y*b.y;\\n}\\ndouble cross(Vector a, Vector b){\\n return a.x*b.y - a.y*b.x;\\n}\\nPoint rotate(Point p,double angle){\\n return Point(p.x*cos(angle) - p.y*sin(angle),\\n p.x*sin(angle) + p.y*cos(angle));\\n}\\n \\npair<Point, Point> getCrossPoints(const Circle& c1, const Circle& c2){\\n double d = (c2.c - c1.c).abs();\\n double a = (c1.r*c1.r + d*d - c2.r*c2.r) / (2*d);\\n Vector e = (c2.c - c1.c) / d;\\n Vector h = rotate(e, PI/2) * sqrt(max(c1.r*c1.r - a*a, 0.));\\n\\n return MP(c1.c + e*a + h, c1.c + e*a - h);\\n}\\n\\nvoid partCircles(const vector<Circle>& cs, set<LL>& res){\\n int N = SZ(cs);\\n vector<Point> ps;\\n REP(i,N) REP(j,N){\\n if(i == j) continue;\\n auto cc = getCrossPoints(cs[i], cs[j]);\\n Point crossPoints[2] = {cc.FF, cc.SS};\\n REP(k,2){\\n Vector delta = crossPoints[1-k] - crossPoints[k];\\n if(delta.abs() == 0)\\n delta = crossPoints[k] - cs[i].c;\\n delta /= delta.abs();\\n REP(d,4){\\n ps.PB(crossPoints[k] + delta*EPS);\\n delta = rotate(delta, PI/2);\\n }\\n }\\n }\\n \\n for(auto&& p: ps){\\n LL bit = 0;\\n REP(i,N)\\n if((cs[i].c - p).abs() < cs[i].r)\\n bit |= 1LL<<i;\\n res.insert(bit);\\n }\\n}\\n \\n\\nvoid partPoints(vector<Point> ps, set<PLL>& res){\\n int N = SZ(ps);\\n REP(i,N){\\n Vector e(0,1);\\n REP(d,4){\\n ps.PB(ps[i]+e*EPS);\\n e = rotate(e, PI/2);\\n }\\n }\\n \\n REP(i,SZ(ps)) REP(j,SZ(ps)){\\n if(i == j) continue;\\n Point p1 = ps[i];\\n Point p2 = ps[j];\\n Vector e = p2 - p1;\\n e /= e.abs();\\n e = rotate(e, PI/2);\\n LL b1 = 0, b2 = 0;\\n REP(k,N)\\n if(dot(e, ps[k]-p1) >= 0)\\n b1 |= 1LL<<k;\\n else\\n b2 |= 1LL<<k;\\n if(b1 > b2) swap(b1, b2);\\n res.insert(MP(b1,b2));\\n }\\n}\\n \\nint N, M;\\ndouble calcBest(LL bps, LL bcs, VI& as, vector<double>& vs, vector<Circle>& cs){\\n Point q(0, 0);\\n double inv = 0.;\\n REP(i,M){\\n if((bcs>>i&1) == 0 || (bps>>as[i]&1) == 0) continue;\\n double tmp = 1. / (vs[i] * vs[i]);\\n q.x += cs[i].c.x * tmp;\\n q.y += cs[i].c.y * tmp;\\n inv += tmp;\\n }\\n if(inv <= 0) return 0;\\n q.x /= inv;\\n q.y /= inv;\\n \\n double res = 0.;\\n REP(i,M){\\n if((bcs>>i&1) == 0 || (bps>>as[i]&1) == 0) continue;\\n res += ((cs[i].c - q).norm() - (cs[i].r * cs[i].r)) / (vs[i] * vs[i]);\\n }\\n return res;\\n}\\n \\nint main(){\\n cin.tie(0);\\n ios_base::sync_with_stdio(false);\\n \\n while(cin>>N>>M,N){\\n vector<Point> ps(N);\\n REP(i,N) cin >> ps[i].x >> ps[i].y;\\n VI as(M), bs(M);\\n vector<double> vs(M);\\n vector<Circle> cs(M);\\n REP(i,M){\\n cin >> as[i] >> bs[i] >> vs[i];\\n --as[i];\\n --bs[i];\\n cs[i].c = ps[as[i]];\\n cs[i].r = (ps[bs[i]] - ps[as[i]]).abs();\\n }\\n if(M <= 2){\\n cout << fixed << setprecision(9) << 0. << endl;\\n continue;\\n }\\n \\n set<LL> planes;\\n set<PLL> points;\\n partCircles(cs, planes);\\n partPoints(ps, points);\\n \\n double best = 0.;\\n for(auto&& bpos: points){\\n double d1 = 0, d2 = 0;\\n for(auto&& bpls: planes){\\n mini(d1, calcBest(bpos.FF, bpls, as, vs, cs));\\n mini(d2, calcBest(bpos.SS, bpls, as, vs, cs));\\n }\\n mini(best, d1+d2);\\n }\\n \\n double ans = 0;\\n REP(i,M) ans += pow(cs[i].r / vs[i], 2);\\n cout << fixed << setprecision(9) << sqrt((ans+best)/M) << endl;\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 770,\n \"memory_kb\": 3968,\n \"score_of_the_acc\": -0.0101,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1614_2160045\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing VI = vector<int>;\\nusing VVI = vector<VI>;\\nusing PII = pair<int, int>;\\nusing LL = long long;\\nusing VL = vector<LL>;\\nusing VVL = vector<VL>;\\nusing PLL = pair<LL, LL>;\\nusing VS = vector<string>;\\n\\n#define ALL(a) begin((a)),end((a))\\n#define RALL(a) (a).rbegin(), (a).rend()\\n#define PB push_back\\n#define EB emplace_back\\n#define MP make_pair\\n#define SZ(a) int((a).size())\\n#define SORT(c) sort(ALL((c)))\\n#define RSORT(c) sort(RALL((c)))\\n\\n#define FOR(i,a,b) for(int i=(a);i<(b);++i)\\n#define REP(i,n) FOR(i,0,n)\\n\\n#define FF first\\n#define SS second\\ntemplate<class S, class T>\\nistream& operator>>(istream& is, pair<S,T>& p){\\n return is >> p.FF >> p.SS;\\n}\\ntemplate<class S, class T>\\nostream& operator<<(ostream& os, pair<S,T>& p){\\n return os << p.FF << \\\" \\\" << p.SS;\\n}\\ntemplate<class T>\\nvoid maxi(T& x, T y){\\n if(x < y) x = y;\\n}\\ntemplate<class T>\\nvoid mini(T& x, T y){\\n if(x > y) x = y;\\n}\\n\\nconst double EPS = 1e-10;\\nconst double PI = acos(-1.0);\\nconst LL MOD = 1e9+7;\\n\\nclass Point{\\npublic:\\n double x, y;\\n\\n Point(double x = 0.0, double y = 0.0) : x(x), y(y){}\\n\\n Point operator + (const Point& p) const{ return Point(x + p.x, y + p.y); }\\n Point& operator += (const Point& p){ x += p.x; y += p.y; return *this;}\\n Point operator - (const Point& p) const{ return Point(x - p.x, y - p.y); }\\n Point& operator -= (const Point& p){ x -= p.x; y -= p.y; return *this;}\\n Point operator * (double a) const{ return Point(a*x, a*y); }\\n Point& operator *= (double a){ x *= a; y *= a; return *this;}\\n Point operator / (double a) const{ return Point(x / a, y / a); }\\n Point& operator /= (double a){ x /= a; y /= a; return *this;}\\n\\n double abs(){ return sqrt(norm()); }\\n double norm(){ return x*x + y*y; }\\n};\\n\\nclass Circle{\\npublic:\\n\\tPoint c;\\n\\tdouble r;\\n};\\ntypedef Point Vector;\\n\\ndouble dot(Vector a, Vector b){\\n\\treturn a.x*b.x + a.y*b.y;\\n}\\ndouble cross(Vector a, Vector b){\\n\\treturn a.x*b.y - a.y*b.x;\\n}\\nPoint rotate(Point p,double angle){\\n return Point(p.x*cos(angle) - p.y*sin(angle),\\n\\t\\t\\t p.x*sin(angle) + p.y*cos(angle));\\n}\\n\\npair<Point, Point> getCrossPoints(const Circle& c1, const Circle& c2){\\n double d = (c2.c - c1.c).abs();\\n double a = (c1.r*c1.r + d*d - c2.r*c2.r) / (2*d);\\n Vector e = (c2.c - c1.c) / d;\\n Vector h = rotate(e, PI/2) * sqrt(max(c1.r*c1.r - a*a, 0.));\\n if(d + min(c1.r, c2.r) <= max(c1.r, c2.r))\\n\\treturn MP(c1.c + e*c1.r, c1.c + e*c1.r);\\n\\n return MP(c1.c + e*a + h, c1.c + e*a - h);\\n}\\n\\n// ??????????????§?????¢???????????????\\n// ?????????????????°???O(N^2)\\nvoid partCircles(const vector<Circle>& cs, set<LL>& res){\\n int N = SZ(cs);\\n vector<Point> ps;\\n REP(i,N) REP(j,N){\\n\\tif(i == j) continue;\\n\\tauto cc = getCrossPoints(cs[i], cs[j]);\\n\\tPoint crossPoints[2] = {cc.FF, cc.SS};\\n\\tREP(k,2){\\n\\t Vector delta = crossPoints[1-k] - crossPoints[k];\\n\\t if(delta.abs() == 0)\\n\\t\\tdelta = crossPoints[k] - cs[i].c;\\n\\t delta /= delta.abs();\\n\\t REP(d,4){\\n\\t\\tps.PB(crossPoints[k] + delta*EPS);\\n\\t\\tdelta = rotate(delta, PI/2);\\n\\t }\\n\\t}\\n }\\n\\n for(auto&& p: ps){\\n\\tLL bit = 0;\\n\\tREP(i,N)\\n\\t if((cs[i].c - p).abs() < cs[i].r)\\n\\t\\tbit |= 1LL<<i;\\n\\tres.insert(bit);\\n }\\n}\\n\\n// ?????¢?????´?????§??????????????¨????????????????????????????????????\\n// ????????????O(N^2)\\nvoid partPoints(vector<Point> ps, set<PLL>& res){\\n int N = SZ(ps);\\n REP(i,N){\\n\\tVector e(0,1);\\n\\tREP(d,4){\\n\\t ps.PB(ps[i]+e*EPS);\\n\\t e = rotate(e, PI/2);\\n\\t}\\n }\\n \\n REP(i,SZ(ps)) REP(j,SZ(ps)){\\n\\tif(i == j) continue;\\n\\tPoint p1 = ps[i];\\n\\tPoint p2 = ps[j];\\n\\tVector e = p2 - p1;\\n\\te /= e.abs();\\n\\te = rotate(e, PI/2);\\n\\tLL b1 = 0, b2 = 0;\\n\\tREP(k,N)\\n\\t if(dot(e, ps[k]-p1) >= 0)\\n\\t\\tb1 |= 1LL<<k;\\n\\t else\\n\\t\\tb2 |= 1LL<<k;\\n\\tif(b1 > b2) swap(b1, b2);\\n\\tres.insert(MP(b1,b2));\\n }\\n}\\n\\nint N, M;\\ndouble calcBest(LL bps, LL bcs, VI& as, vector<double>& vs, vector<Circle>& cs){\\n Point q(0, 0);\\n double inv = 0.;\\n REP(i,M){\\n\\tif((bcs>>i&1) == 0 || (bps>>as[i]&1) == 0) continue;\\n\\tdouble tmp = 1. / (vs[i] * vs[i]);\\n\\tq.x += cs[i].c.x * tmp;\\n\\tq.y += cs[i].c.y * tmp;\\n\\tinv += tmp;\\n }\\n if(inv <= 0) return 0;\\n q.x /= inv;\\n q.y /= inv;\\n\\n double res = 0.;\\n REP(i,M){\\n\\tif((bcs>>i&1) == 0 || (bps>>as[i]&1) == 0) continue;\\n\\tres += ((cs[i].c - q).norm() - (cs[i].r * cs[i].r)) / (vs[i] * vs[i]);\\n }\\n return res;\\n}\\n\\nint main(){\\n cin.tie(0);\\n ios_base::sync_with_stdio(false);\\n\\n while(cin>>N>>M,N){\\n\\tvector<Point> ps(N);\\n\\tREP(i,N) cin >> ps[i].x >> ps[i].y;\\n\\tVI as(M), bs(M);\\n\\tvector<double> vs(M);\\n\\tvector<Circle> cs(M);\\n\\tREP(i,M){\\n\\t cin >> as[i] >> bs[i] >> vs[i];\\n\\t --as[i];\\n\\t --bs[i];\\n\\t cs[i].c = ps[as[i]];\\n\\t cs[i].r = (ps[bs[i]] - ps[as[i]]).abs();\\n\\t}\\n\\n\\tset<LL> planes;\\n\\tset<PLL> points;\\n\\tpartCircles(cs, planes);\\n\\tpartPoints(ps, points);\\n\\n\\tdouble best = 0.;\\n\\tfor(auto&& bpos: points){\\n\\t double d1 = 0, d2 = 0;\\n\\t for(auto&& bpls: planes){\\n\\t\\tmini(d1, calcBest(bpos.FF, bpls, as, vs, cs));\\n\\t\\tmini(d2, calcBest(bpos.SS, bpls, as, vs, cs));\\n\\t }\\n\\t mini(best, d1+d2);\\n\\t}\\n\\n\\tdouble ans = 0;\\n\\tREP(i,M) ans += pow(cs[i].r / vs[i], 2);\\n\\tcout << fixed << setprecision(9) << sqrt((ans+best)/M) << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 0.5,\n \"time_ms\": 840,\n \"memory_kb\": 4024,\n \"score_of_the_acc\": -0.0282,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1614_2160034\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing VI = vector<int>;\\nusing VVI = vector<VI>;\\nusing PII = pair<int, int>;\\nusing LL = long long;\\nusing VL = vector<LL>;\\nusing VVL = vector<VL>;\\nusing PLL = pair<LL, LL>;\\nusing VS = vector<string>;\\n\\n#define ALL(a) begin((a)),end((a))\\n#define RALL(a) (a).rbegin(), (a).rend()\\n#define PB push_back\\n#define EB emplace_back\\n#define MP make_pair\\n#define SZ(a) int((a).size())\\n#define SORT(c) sort(ALL((c)))\\n#define RSORT(c) sort(RALL((c)))\\n\\n#define FOR(i,a,b) for(int i=(a);i<(b);++i)\\n#define REP(i,n) FOR(i,0,n)\\n\\n#define FF first\\n#define SS second\\ntemplate<class S, class T>\\nistream& operator>>(istream& is, pair<S,T>& p){\\n return is >> p.FF >> p.SS;\\n}\\ntemplate<class S, class T>\\nostream& operator<<(ostream& os, pair<S,T>& p){\\n return os << p.FF << \\\" \\\" << p.SS;\\n}\\ntemplate<class T>\\nvoid maxi(T& x, T y){\\n if(x < y) x = y;\\n}\\ntemplate<class T>\\nvoid mini(T& x, T y){\\n if(x > y) x = y;\\n}\\n\\nconst double EPS = 1e-10;\\nconst double PI = acos(-1.0);\\nconst LL MOD = 1e9+7;\\n\\nclass Point{\\npublic:\\n double x, y;\\n\\n Point(double x = 0.0, double y = 0.0) : x(x), y(y){}\\n\\n Point operator + (const Point& p) const{ return Point(x + p.x, y + p.y); }\\n Point& operator += (const Point& p){ x += p.x; y += p.y; return *this;}\\n Point operator - (const Point& p) const{ return Point(x - p.x, y - p.y); }\\n Point& operator -= (const Point& p){ x -= p.x; y -= p.y; return *this;}\\n Point operator * (double a) const{ return Point(a*x, a*y); }\\n Point& operator *= (double a){ x *= a; y *= a; return *this;}\\n Point operator / (double a) const{ return Point(x / a, y / a); }\\n Point& operator /= (double a){ x /= a; y /= a; return *this;}\\n\\n double abs(){ return sqrt(norm()); }\\n double norm(){ return x*x + y*y; }\\n};\\n\\nclass Circle{\\npublic:\\n\\tPoint c;\\n\\tdouble r;\\n};\\ntypedef Point Vector;\\n\\ndouble dot(Vector a, Vector b){\\n\\treturn a.x*b.x + a.y*b.y;\\n}\\ndouble cross(Vector a, Vector b){\\n\\treturn a.x*b.y - a.y*b.x;\\n}\\nPoint rotate(Point p,double angle){\\n return Point(p.x*cos(angle) - p.y*sin(angle),\\n\\t\\t\\t p.x*sin(angle) + p.y*cos(angle));\\n}\\n\\npair<Point, Point> getCrossPoints(const Circle& c1, const Circle& c2){\\n double d = (c2.c - c1.c).abs();\\n double a = (c1.r*c1.r + d*d - c2.r*c2.r) / (2*d);\\n Vector e = (c2.c - c1.c) / d;\\n Vector h = rotate(e, PI/2) * sqrt(max(c1.r*c1.r - a*a, 0.));\\n return make_pair(c1.c + e*a + h, c1.c + e*a - h);\\n}\\n\\n// ??????????????§?????¢???????????????\\n// ?????????????????°???O(N^2)\\nvoid partCircles(const vector<Circle>& cs, set<LL>& res){\\n int N = SZ(cs);\\n vector<Point> ps;\\n REP(i,N) REP(j,N){\\n\\tif(i == j) continue;\\n\\tauto cc = getCrossPoints(cs[i], cs[j]);\\n\\tPoint crossPoints[2] = {cc.FF, cc.SS};\\n\\tREP(k,2){\\n\\t Vector delta = crossPoints[1-k] - crossPoints[k];\\n\\t if(delta.abs() == 0) delta.x = 1;\\n\\t delta /= delta.abs();\\n\\t REP(d,4){\\n\\t\\tps.PB(crossPoints[k] + delta*EPS);\\n\\t\\tdelta = rotate(delta, PI/2);\\n\\t }\\n\\t}\\n }\\n\\n for(auto&& p: ps){\\n\\tLL bit = 0;\\n\\tREP(i,N)\\n\\t if((cs[i].c - p).abs() < cs[i].r)\\n\\t\\tbit |= 1LL<<i;\\n\\tres.insert(bit);\\n }\\n}\\n\\n// ?????¢?????´?????§??????????????¨????????????????????????????????????\\n// ????????????O(N^2)\\nvoid partPoints(vector<Point> ps, set<PLL>& res){\\n int N = SZ(ps);\\n REP(i,N){\\n\\tVector e(0,1);\\n\\tREP(d,4){\\n\\t ps.PB(ps[i]+e*EPS);\\n\\t e = rotate(e, PI/2);\\n\\t}\\n }\\n \\n REP(i,SZ(ps)) REP(j,SZ(ps)){\\n\\tif(i == j) continue;\\n\\tPoint p1 = ps[i];\\n\\tPoint p2 = ps[j];\\n\\tVector e = p2 - p1;\\n\\te /= e.abs();\\n\\te = rotate(e, PI/2);\\n\\tLL b1 = 0, b2 = 0;\\n\\tREP(k,N)\\n\\t if(dot(e, ps[k]-p1) >= 0)\\n\\t\\tb1 |= 1LL<<k;\\n\\t else\\n\\t\\tb2 |= 1LL<<k;\\n\\tif(b1 > b2) swap(b1, b2);\\n\\tres.insert(MP(b1,b2));\\n }\\n}\\n\\nint N, M;\\ndouble calcBest(LL bps, LL bcs, VI& as, vector<double>& vs, vector<Circle>& cs){\\n Point q(0, 0);\\n double inv = 0.;\\n REP(i,M){\\n\\tif((bcs>>i&1) == 0 || (bps>>as[i]&1) == 0) continue;\\n\\tdouble tmp = 1. / (vs[i] * vs[i]);\\n\\tq.x += cs[i].c.x * tmp;\\n\\tq.y += cs[i].c.y * tmp;\\n\\tinv += tmp;\\n }\\n if(inv <= 0) return 0;\\n q.x /= inv;\\n q.y /= inv;\\n\\n double res = 0.;\\n REP(i,M){\\n\\tif((bcs>>i&1) == 0 || (bps>>as[i]&1) == 0) continue;\\n\\tres += ((cs[i].c - q).norm() - (cs[i].r * cs[i].r)) / (vs[i] * vs[i]);\\n }\\n return res;\\n}\\nPoint calcBestQ(LL bps, LL bcs, VI& as, vector<double>& vs, vector<Circle>& cs){\\n Point q(0, 0);\\n double inv = 0.;\\n REP(i,M){\\n\\tif((bcs>>i&1) == 0 || (bps>>as[i]&1) == 0) continue;\\n\\tdouble tmp = 1. / (vs[i] * vs[i]);\\n\\tq.x += cs[i].c.x * tmp;\\n\\tq.y += cs[i].c.y * tmp;\\n\\tinv += tmp;\\n }\\n if(inv <= 0) return 0;\\n q.x /= inv;\\n q.y /= inv;\\n\\n return q;\\n}\\n\\nint main(){\\n cin.tie(0);\\n ios_base::sync_with_stdio(false);\\n\\n int ccc=0;\\n while(cin>>N>>M,N){\\n\\t++ccc;\\n\\tvector<Point> ps(N);\\n\\tREP(i,N) cin >> ps[i].x >> ps[i].y;\\n\\tVI as(M), bs(M);\\n\\tvector<double> vs(M);\\n\\tvector<Circle> cs(M);\\n\\tREP(i,M){\\n\\t cin >> as[i] >> bs[i] >> vs[i];\\n\\t --as[i];\\n\\t --bs[i];\\n\\t cs[i].c = ps[as[i]];\\n\\t cs[i].r = (ps[bs[i]] - ps[as[i]]).abs();\\n\\t}\\n\\n\\tset<LL> planes;\\n\\tset<PLL> points;\\n\\tpartCircles(cs, planes);\\n\\tpartPoints(ps, points);\\n\\n\\tdouble best = 0.;\\n\\tfor(auto&& bpos: points){\\n\\t double d1 = 0, d2 = 0;\\n\\t for(auto&& bpls: planes){\\n\\t\\tmini(d1, calcBest(bpos.FF, bpls, as, vs, cs));\\n\\t\\tmini(d2, calcBest(bpos.SS, bpls, as, vs, cs));\\n\\t }\\n\\t mini(best, d1+d2);\\n\\t}\\n\\n\\tdouble ans = 0;\\n\\tREP(i,M) ans += pow(cs[i].r / vs[i], 2);\\n\\tcout << fixed << setprecision(9) << sqrt((ans+best)/M) << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 0.5,\n \"time_ms\": 830,\n \"memory_kb\": 4024,\n \"score_of_the_acc\": -0.0261,\n \"final_rank\": 11\n }\n]","isConversational":false}}},{"rowIdx":984,"cells":{"group_id":{"kind":"string","value":"aoj_1612_cpp"},"problem_description":{"kind":"string","value":"3D Printing\nWe are designing an installation art piece consisting of \na number of cubes with 3D printing technology for submitting one to\nInstallation art Contest with Printed Cubes (ICPC).\nAt this time, we are trying to model a piece consisting of exactly\nk\ncubes \nof the same size facing the same direction.\nFirst, using a CAD system, \nwe prepare\nn\n(\nn\n≥\nk\n) positions as candidates\nin the 3D space where cubes can be placed.\n\nWhen cubes would be placed at all the candidate positions, \nthe following three conditions are satisfied.\nEach cube may overlap zero, one or two other cubes, but not three or more.\nWhen a cube overlap two other cubes, those two cubes do not overlap.\nTwo non-overlapping cubes do not touch at their surfaces, edges or corners.\nSecond, choosing appropriate\nk\ndifferent positions from\nn\ncandidates\nand placing cubes there, \nwe obtain a connected polyhedron as a union of the\nk\ncubes. \n\nWhen we use a 3D printer,\nwe usually print only the thin surface of a 3D object.\n\nIn order to save the amount of filament material for the 3D printer, \nwe want to find the polyhedron with the minimal surface area.\nYour job is to find the polyhedron with the minimal surface area\nconsisting of\nk\nconnected\ncubes placed at\nk\nselected positions among\nn\ngiven ones.\nFigure E1. A polyhedron formed with connected identical cubes.\nInput\nThe input consists of multiple datasets. \nThe number of datasets is at most 100.\nEach dataset is in the following format.\nn\nk\ns\nx\n1\ny\n1\nz\n1\n...\nx\nn\ny\nn\nz\nn\nIn the first line of a dataset,\nn\nis the number of the candidate positions,\nk\nis the number of the cubes to form the connected polyhedron,\nand\ns\nis the edge length of cubes.\nn, k\nand\ns\nare integers separated by a space. \nThe following\nn\nlines specify the\nn\ncandidate positions.\nIn the\ni\n-th line, there are three integers\nx\ni\n,\ny\ni\nand\nz\ni\nthat specify the coordinates of a position, \nwhere the corner of the cube with the smallest coordinate values\nmay be placed.\nEdges of the cubes are to be aligned with either of three axes.\nAll the values of coordinates are integers separated by a space.\n\nThe three conditions on the candidate positions mentioned above are satisfied.\nThe parameters satisfy the following conditions:\n1 ≤\nk\n≤\nn\n≤ 2000, 3 ≤\ns\n≤ 100, and\n-4×10\n7\n≤\nx\ni\n,\ny\ni\n,\nz\ni\n≤ 4×10\n7\n.\nThe end of the input is indicated by a line containing three zeros\nseparated by a space.\nOutput\nFor each dataset, output a single line containing one integer\nindicating the surface area of the connected polyhedron with \nthe minimal surface area.\n\nWhen no\nk\ncubes form a connected polyhedron, output -1.\nSample Input\n1 1 100\n100 100 100\n6 4 10\n100 100 100\n106 102 102\n112 110 104\n104 116 102\n100 114 104\n92 107 100\n10 4 10\n-100 101 100\n-108 102 120\n-116 103 100\n-124 100 100\n-132 99 100\n-92 98 100\n-84 100 140\n-76 103 100\n-68 102 100\n-60 101 100\n10 4 10\n100 100 100\n108 101 100\n116 102 100\n124 100 100\n132 102 100\n200 100 103\n192 100 102\n184 100 101\n176 100 100\n168 100 103\n4 4 10\n100 100 100\n108 94 100\n1\n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1612_10578406","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nnamespace atcoder {\n\n// Implement (union by size) + (path compression)\n// Reference:\n// Zvi Galil and Giuseppe F. Italiano,\n// Data structures and algorithms for disjoint set union problems\nstruct dsu {\n public:\n dsu() : _n(0) {}\n explicit dsu(int n) : _n(n), parent_or_size(n, -1) {}\n\n int merge(int a, int b) {\n assert(0 <= a && a < _n);\n assert(0 <= b && b < _n);\n int x = leader(a), y = leader(b);\n if (x == y) return x;\n if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);\n parent_or_size[x] += parent_or_size[y];\n parent_or_size[y] = x;\n return x;\n }\n\n bool same(int a, int b) {\n assert(0 <= a && a < _n);\n assert(0 <= b && b < _n);\n return leader(a) == leader(b);\n }\n\n int leader(int a) {\n assert(0 <= a && a < _n);\n if (parent_or_size[a] < 0) return a;\n return parent_or_size[a] = leader(parent_or_size[a]);\n }\n\n int size(int a) {\n assert(0 <= a && a < _n);\n return -parent_or_size[leader(a)];\n }\n\n std::vector<std::vector<int>> groups() {\n std::vector<int> leader_buf(_n), group_size(_n);\n for (int i = 0; i < _n; i++) {\n leader_buf[i] = leader(i);\n group_size[leader_buf[i]]++;\n }\n std::vector<std::vector<int>> result(_n);\n for (int i = 0; i < _n; i++) {\n result[i].reserve(group_size[i]);\n }\n for (int i = 0; i < _n; i++) {\n result[leader_buf[i]].push_back(i);\n }\n result.erase(\n std::remove_if(result.begin(), result.end(),\n [&](const std::vector<int>& v) { return v.empty(); }),\n result.end());\n return result;\n }\n\n private:\n int _n;\n // root node: -1 * component size\n // otherwise: parent\n std::vector<int> parent_or_size;\n};\n\n} // namespace atcoder\n/* BOOST MULTIPRECISION\n#include<boost/multiprecision/cpp_int.hpp>\nusing namespace boost::multiprecision;\n//*/\n\ntypedef long long ll;\n\n#define rep(i, s, n) for (int i = (int)(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) begin(v),end(v)\n\ntemplate <typename T> bool chmin(T &a, const T &b) {\n\tif (a <= b) return false;\n\ta = b;\n\treturn true;\n}\n\ntemplate <typename T> bool chmax(T &a, const T &b) {\n\tif (a >= b) return false;\n\ta = b;\n\treturn true;\n}\n\ntemplate <typename T> T max(vector<T> &a){\n\tassert(!a.empty());\n\tT ret = a[0];\n\tfor (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);\n\treturn ret;\n}\n\ntemplate <typename T> T min(vector<T> &a){\n\tassert(!a.empty());\n\tT ret = a[0];\n\tfor (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);\n\treturn ret;\n}\n\ntemplate <typename T> T sum(vector<T> &a){\n\tT ret = 0;\n\tfor (int i=0; i<(int)a.size(); i++) ret += a[i];\n\treturn ret;\n}\n\n// importbisect\ntemplate <typename T>\nint bisect_left(vector<T> &X, T v){\n\treturn lower_bound(X.begin(), X.end(), v) - X.begin();\n}\n\ntemplate <typename T>\nint bisect_right(vector<T> &X, T v){\n\treturn upper_bound(X.begin(), X.end(), v) - X.begin();\n}\n// ----\n\n// defcomp\ntemplate <typename T>\nvector<T> compress(vector<T> &X) {\n\tvector<T> vals = X;\n\tsort(vals.begin(), vals.end());\n\tvals.erase(unique(vals.begin(), vals.end()), vals.end());\n\treturn vals;\n}\n// -----\n\n// makediv\nvector<ll> makediv(ll n){\n\tvector<ll> ld, ud;\n\tfor (ll i=1; i*i<=n; i++){\n\t\tif (n%i == 0){\n\t\t\tld.push_back(i);\n\t\t\tif (i != n/i){\n\t\t\t\tud.push_back(n/i);\n\t\t\t}\n\t\t}\n\t}\n\treverse(ud.begin(), ud.end());\n\tld.insert(ld.end(), ud.begin(), ud.end());\n\treturn ld;\n}\n// -----\n\n// Fast Factorization\n// https://judge.yosupo.jp/submission/38126\n// !!! CHANGED THE PRIMARY TEST !!!\ntypedef unsigned int uint;\n\nstruct Mint {\n\tuint64_t n;\n\tstatic uint64_t mod, inv, r2;\n\tMint() : n(0) { }\n\tMint(const uint64_t &x) : n(init(x)) { }\n\tstatic uint64_t init(const uint64_t &w) { return reduce(__uint128_t(w) * r2); }\n\tstatic void set_mod(const uint64_t &m) {\n\t\tmod = inv = m;\n\t\tfor(int i = 0; i < 5; i++)\tinv *= 2 - inv * m;\n\t\tr2 = -__uint128_t(m) % m;\n\t}\n\tstatic uint64_t reduce(const __uint128_t &x) {\n\t\tuint64_t y = uint64_t(x >> 64) - uint64_t((__uint128_t(uint64_t(x) * inv) * mod) >> 64);\n\t\treturn int64_t(y) < 0 ? y + mod : y;\n\t}\n\tMint& operator+= (const Mint &x) { n += x.n - mod; if(int64_t(n) < 0) n += mod; return *this; }\n\tMint& operator+ (const Mint &x) const { return Mint(*this) += x; }\n\tMint& operator*= (const Mint &x) { n = reduce(__uint128_t(n) * x.n); return *this; }\n\tMint& operator* (const Mint &x) const { return Mint(*this) *= x; }\n\tuint64_t val() const { return reduce(n); }\n};\n\nuint64_t Mint::mod, Mint::inv, Mint::r2;\n\nbool suspect(const uint64_t &a, const uint64_t &s, uint64_t d, const uint64_t &n) {\n\tif(Mint::mod != n)\tMint::set_mod(n);\n\tMint x(1), xx(a), o(x), m(n - 1);\n\twhile(d > 0) {\n\t\tif(d & 1)\tx *= xx;\n\t\txx *= xx;\n\t\td >>= 1;\n\t}\n\tif(x.n == o.n)\treturn true;\n\tfor(uint r = 0; r < s; r++) {\n\t\tif(x.n == m.n)\treturn true;\n\t\tx *= x;\n\t}\n\treturn false;\n}\n\nbool is_prime(const uint64_t &n) {\n\tif(n <= 1 || (n > 2 && (~n & 1)))\treturn false;\n\tuint64_t d = n - 1, s = 0;\n\twhile(~d & 1)\ts++, d >>= 1;\n\tstatic const uint64_t a_big[] = {2, 325, 9375, 28178, 450775, 9780504, 1795265022};\n\tstatic const uint64_t a_smo[] = {2, 7, 61};\n\tif(n < 4759123141LL) {\n\t\tfor(auto &&p : a_smo) {\n\t\t\tif(p >= n)\tbreak;\n\t\t\tif(!suspect(p, s, d, n))\treturn false;\n\t\t}\n\t} else {\n\t\tfor(auto &&p : a_big) {\n\t\t\tif(p >= n)\tbreak;\n\t\t\tif(!suspect(p, s, d, n))\treturn false;\n\t\t}\n\t}\n\treturn true;\n}\n\nuint64_t rho_pollard(const uint64_t &n) {\n\tif(~n & 1)\treturn 2u;\n\tstatic random_device rng;\n\tuniform_int_distribution<uint64_t> rr(1, n - 1);\n\tif(Mint::mod != n)\tMint::set_mod(n);\n\tfor(;;) {\n\t\tuint64_t c_ = rr(rng), g = 1, r = 1, m = 500;\n\t\tMint y(rr(rng)), xx(0), c(c_), ys(0), q(1);\n\t\twhile(g == 1) {\n\t\t\txx.n = y.n;\n\t\t\tfor(uint i = 1; i <= r; i++)\ty *= y, y += c;\n\t\t\tuint64_t k = 0; g = 1;\n\t\t\twhile(k < r && g == 1) {\n\t\t\t\tfor(uint i = 1; i <= (m > (r - k) ? (r - k) : m); i++) {\n\t\t\t\t\tys.n = y.n;\n\t\t\t\t\ty *= y; y += c;\n\t\t\t\t\tuint64_t xxx = xx.val(), yyy = y.val();\n\t\t\t\t\tq *= Mint(xxx > yyy ? xxx - yyy : yyy - xxx);\n\t\t\t\t}\n\t\t\t\tg = __gcd<uint64_t>(q.val(), n);\n\t\t\t\tk += m;\n\t\t\t}\n\t\t\tr *= 2;\n\t\t}\n\t\tif(g == n)\tg = 1;\n\t\twhile(g == 1) {\n\t\t\tys *= ys; ys += c;\n\t\t\tuint64_t xxx = xx.val(), yyy = ys.val();\n\t\t\tg = __gcd<uint64_t>(xxx > yyy ? xxx - yyy : yyy - xxx, n);\n\t\t}\n\t\tif(g != n && is_prime(g))\treturn g;\n\t}\n\tassert(69 == 420);\n}\n\ntemplate <typename T>\nvector<T> inter_factor(const T &n) {\n\tif(n < 2)\treturn { };\n\tif(is_prime(n))\treturn {n};\n\tT d = rho_pollard(static_cast<uint64_t>(n));\n\tvector<T> l = inter_factor(d), r = inter_factor(n / d);\n\tl.insert(l.end(), r.begin(), r.end());\n\treturn l;\n}\n\ntemplate <typename T>\nvector<T> factor(T n) {\n\tvector<T> f1;\n\tfor(uint i = 2; i < 100; i += (i & 1) + 1)\n\t\twhile(n % i == 0)\tf1.push_back(i), n /= i;\n\tvector<T> f2 = inter_factor(n);\n\tf1.insert(f1.end(), f2.begin(), f2.end());\n\tsort(f1.begin(), f1.end());\n\treturn f1;\n}\n\n\nvoid solve(int n, int k, ll s) {\n\tvector<ll> x(n), y(n), z(n);\n\trep(i,0,n) {\n\t\tcin >> x[i] >> y[i] >> z[i];\n\t}\n\n\tauto hyomen_sub = [&](ll ax, ll ay, ll bx, ll by) {\n\t\tll xl = max(ax, bx);\n\t\tll xr = min(ax + s, bx + s);\n\t\tll yl = max(ay, by);\n\t\tll yr = min(ay + s, by + s);\n\t\tll xlen = max(0LL, xr - xl);\n\t\tll ylen = max(0LL, yr - yl);\n\t\treturn ylen * xlen * 2;\n\t};\n\n\t// common hyomen of (i, j)\n\tauto hyomen = [&](int i, int j) -> ll {\n\t\t// x[i], y[i], z[i];\n\t\t// x[j], y[j], z[j];\n\t\tll ans = 0;\n\t\tans += hyomen_sub(x[i], y[i], x[j], y[j]);\n\t\tans += hyomen_sub(y[i], z[i], y[j], z[j]);\n\t\tans += hyomen_sub(z[i], x[i], z[j], x[j]);\n\t\treturn ans;\n\t};\n\n\tauto is_linked = [&](int i, int j) -> bool {\n\t\tif (hyomen_sub(x[i], y[i], x[j], y[j]) == 0) return false;\n\t\tif (hyomen_sub(y[i], z[i], y[j], z[j]) == 0) return false;\n\t\tif (hyomen_sub(z[i], x[i], z[j], x[j]) == 0) return false;\n\t\treturn true;\n\t};\n\n\tvector ikeru(n, vector<int>(0));\n\trep(i,0,n) {\n\t\trep(j,i+1,n) {\n\t\t\tif (i == j) continue;\n\t\t\tif (is_linked(i, j)) {\n\t\t\t\tikeru[i].push_back(j);\n\t\t\t\tikeru[j].push_back(i);\n\t\t\t}\n\t\t}\n\t}\n\n\tatcoder::dsu uf(n);\n\trep(i,0,n){\n\t\tfor (int j: ikeru[i]) {\n\t\t\tuf.merge(i, j);\n\t\t}\n\t}\n\t\n\tvector<int> deg_sum(n);\n\trep(i,0,n){\n\t\tdeg_sum[uf.leader(i)] += (int)ikeru[i].size();\n\t}\n\n\t// minimum answer\n\tll ans = 1e18;\n\n\trep(st,0,n) {\n\t\tif (uf.leader(st) != st) continue;\n\t\t//cout << deg_sum[st] << ' ' << uf.size(st) << endl;\n\t\tif (deg_sum[st] == uf.size(st) * 2) {\n\t\t\t// circle;\n\t\t\tint genten = st;\n\t\t\tvector<int> renketsu_list;\n\t\t\tvector<bool> seen(n);\n\t\t\tseen[genten] = 1;\n\t\t\t\n\t\t\tvector<int> mada(0);\n\t\t\tmada.push_back(genten);\n\t\t\twhile(!mada.empty()){\n\t\t\t\tint i = mada.back();\n\t\t\t\tmada.pop_back();\n\t\t\t\trenketsu_list.push_back(i);\n\t\t\t\tfor (int j: ikeru[i]) {\n\t\t\t\t\tif (seen[j]) continue;\n\t\t\t\t\tmada.push_back(j);\n\t\t\t\t\tseen[j] = 1;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\t\n\t\t\tint m = (int)renketsu_list.size();\n\t\t\trep(i,0,m-1) {\n\t\t\t\tassert(is_linked(renketsu_list[i],renketsu_list[i+1]));\n\t\t\t}\n\t\t\tassert(is_linked(renketsu_list[m-1],renketsu_list[0]));\n\t\t\t//cout << m << endl;\n\n\t\t\t// unused with originally genten -> 0\n\t\t\tvector dp_sub0(2*m, vector<ll>(m+1, (ll)1e18));\n\t\t\t// used with originally genten -> 0\n\t\t\tvector dp_sub1(2*m, vector<ll>(m+1, (ll)1e18));\n\t\t\tvector dp_sub2(2*m, vector<ll>(m+1, (ll)1e18));\n\t\t\tdp_sub0[0][0] = 0;\n\t\t\tdp_sub1[0][1] = 6*s*s;\n\t\t\trep(i,1,2*m) {\n\t\t\t\trep(j,0,m+1) {\n\t\t\t\t\tchmin(dp_sub0[i][j], dp_sub0[i-1][j]);\n\t\t\t\t\tchmin(dp_sub2[i][j], dp_sub1[i-1][j]);\n\t\t\t\t\tchmin(dp_sub2[i][j], dp_sub2[i-1][j]);\n\t\t\t\t}\n\t\t\t\trep(j,0,m) {\n\t\t\t\t\tchmin(dp_sub1[i][j+1], dp_sub0[i-1][j] + 6*s*s);\n\t\t\t\t\tchmin(dp_sub1[i][j+1], dp_sub1[i-1][j] + 6*s*s - hyomen(renketsu_list[(i-1)%m], renketsu_list[i%m]));\n\t\t\t\t}\n\t\t\t}\n\t\t\tll val = 0;\n\t\t\trep(i,0,m) {\n\t\t\t\tval += 6 * s * s;\n\t\t\t\tval -= hyomen(renketsu_list[i], renketsu_list[(i+1)%m]);\n\t\t\t}\n\t\t\tif (m==k) chmin(ans, val);\n\t\t\tif (m>k) {\n\t\t\t\tchmin(ans,dp_sub1[2*m-1][k]);\n\t\t\t\tchmin(ans,dp_sub2[2*m-1][k]);\n\t\t\t\t\n\t\t\t}\n\t\t}else if (deg_sum[st] == uf.size(st) * 2 - 2){\n\t\t\tif (deg_sum[st] == 0) {\n\t\t\t\tif (k == 1) {\n\t\t\t\t\tchmin(ans,6*s*s);\n\t\t\t\t}\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\t// path;\n\t\t\tint genten = -1;\n\t\t\trep(i,0,n) {\n\t\t\t\tif (!uf.same(i,st)) continue;\n\t\t\t\tif ((int)ikeru[i].size() == 1) {\n\t\t\t\t\tgenten = i;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tassert(genten != -1);\n\t\t\t\n\t\t\tvector<int> renketsu_list;\n\t\t\tvector<bool> seen(n);\n\t\t\tseen[genten] = 1;\n\t\t\t\n\t\t\tvector<int> mada(0);\n\t\t\tmada.push_back(genten);\n\t\t\twhile(!mada.empty()){\n\t\t\t\tint i = mada.back();\n\t\t\t\tmada.pop_back();\n\t\t\t\trenketsu_list.push_back(i);\n\t\t\t\tfor (int j: ikeru[i]) {\n\t\t\t\t\tif (seen[j]) continue;\n\t\t\t\t\tmada.push_back(j);\n\t\t\t\t\tseen[j] = 1;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\tint m = (int)renketsu_list.size();\n\t\t\t// unused\n\t\t\tvector dp_sub0(m, vector<ll>(m+1, (ll)1e18));\n\t\t\t// used\n\t\t\tvector dp_sub1(m, vector<ll>(m+1, (ll)1e18));\n\t\t\t// end\n\t\t\tvector dp_sub2(m, vector<ll>(m+1, (ll)1e18));\n\t\t\tdp_sub0[0][0] = 0;\n\t\t\tdp_sub1[0][1] = 6 * s * s;\n\t\t\trep(i,1,m) {\n\t\t\t\trep(j,0,m+1) {\n\t\t\t\t\tchmin(dp_sub0[i][j], dp_sub0[i-1][j]);\n\t\t\t\t\tchmin(dp_sub2[i][j], dp_sub1[i-1][j]);\n\t\t\t\t\tchmin(dp_sub2[i][j], dp_sub2[i-1][j]);\n\t\t\t\t}\n\t\t\t\trep(j,0,m) {\n\t\t\t\t\tchmin(dp_sub1[i][j+1], dp_sub0[i-1][j] + 6*s*s);\n\t\t\t\t\tchmin(dp_sub1[i][j+1], dp_sub1[i-1][j] + 6*s*s - hyomen(renketsu_list[i-1], renketsu_list[i]));\n\t\t\t\t}\n\t\t\t}\n//\t\t\tvector<ll> ret(m+1,(ll)1e18);\n\t\t\tif (m>=k) {\n\t\t\t\tchmin(ans,dp_sub1[m-1][k]);\n\t\t\t\tchmin(ans,dp_sub2[m-1][k]);\n\t\t\t}\n\t\t\t\n\n\t\t}else{\n\t\t\tassert(false);\n\t\t}\n\t}\n\n\t/*\n\n\tvector<ll> ans(1,0LL);\n\n\tfor (auto a: gogo_list) {\n\t\tvector<ll> nans((int)a.size()+(int)ans.size()-1,(ll)1e18);\n\t\trep(i,0,(int)a.size()) {\n\t\t\trep(j,0,(int)ans.size()) {\n\t\t\t\tchmin(nans[i+j],a[i]+ans[j]);\n\t\t\t}\n\t\t}\n\t\tswap(ans,nans);\n\t}\n\t\t*/\n\tif (ans<1e17){\n\t\tcout<<ans<<endl;\n\t}else{\n\t\tcout<<-1<<endl;\n\t}\n}\n\nint main(){\n\tios_base::sync_with_stdio(false);\n\tcin.tie(NULL);\n\twhile(true) {\n\t\tint n; cin >> n;\n\t\tint k; cin >> k;\n\t\tll s; cin >> s;\n\t\tif (n == 0) break;\n\t\tsolve(n, k, s);\n\t}\n}","accuracy":1,"time_ms":10,"memory_kb":5376,"score_of_the_acc":-0.5676,"final_rank":15},{"submission_id":"aoj_1612_10494495","code_snippet":"# include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nconst double pi = acos(-1);\ntemplate<class T>constexpr T inf() { return ::std::numeric_limits<T>::max(); }\ntemplate<class T>constexpr T hinf() { return inf<T>() / 2; }\ntemplate <typename T_char>T_char TL(T_char cX) { return tolower(cX); }\ntemplate <typename T_char>T_char TU(T_char cX) { return toupper(cX); }\ntemplate<class T> bool chmin(T& a,T b) { if(a > b){a = b; return true;} return false; }\ntemplate<class T> bool chmax(T& a,T b) { if(a < b){a = b; return true;} return false; }\nint popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }\nint d_sum(ll n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }\nint d_cnt(ll n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }\nll gcd(ll a, ll b) { if (b == 0)return a; return gcd(b, a%b); };\nll lcm(ll a, ll b) { ll g = gcd(a, b); return a / g*b; };\nll MOD(ll x, ll m){return (x%m+m)%m; }\nll FLOOR(ll x, ll m) {ll r = (x%m+m)%m; return (x-r)/m; }\ntemplate<class T> using dijk = priority_queue<T, vector<T>, greater<T>>;\n# define all(qpqpq) (qpqpq).begin(),(qpqpq).end()\n# define UNIQUE(wpwpw) (wpwpw).erase(unique(all((wpwpw))),(wpwpw).end())\n# define LOWER(epepe) transform(all((epepe)),(epepe).begin(),TL<char>)\n# define UPPER(rprpr) transform(all((rprpr)),(rprpr).begin(),TU<char>)\n# define rep(i,upupu) for(ll i = 0, i##_len = (upupu);(i) < (i##_len);(i)++)\n# define reps(i,opopo) for(ll i = 1, i##_len = (opopo);(i) <= (i##_len);(i)++)\n# define len(x) ((ll)(x).size())\n# define bit(n) (1LL << (n))\n# define pb push_back\n# define eb emplace_back\n# define exists(c, e) ((c).find(e) != (c).end())\n\nstruct INIT{\n\tINIT(){\n\t\tstd::ios::sync_with_stdio(false);\n\t\tstd::cin.tie(0);\n\t\tcout << fixed << setprecision(20);\n\t}\n}INIT;\n\nnamespace mmrz {\n\tvoid solve();\n}\n\nint main(){\n\tmmrz::solve();\n}\n#define debug(...) (static_cast<void>(0))\n\nusing namespace mmrz;\n#define rep2(i,a,n) for(int i=a;i<n;i++)\nbool SOLVE(){\n\tll n, k, s; cin >> n >> k >> s;\n\tif(n==0) return true;\n\t\n\tvector<tuple<ll,ll,ll>> v(n);\n\trep(i,n) {\n\t\tll x, y, z; cin >> x >> y >> z;\n\t\tv[i] = {x, y, z};\n\t}\n\n\t// auto calc_d = [&](ll l, ll r) -> ll {\n\t// \tll ret = -1;\n\t// \tif(l > r)swap(l, r);\n\t// \tif(r <= l + s){\n\t// \t\treturn l+s-r;\n\t// \t}\n\t// \treturn ret;\n\t// };\n\n\tvector<vector<pair<ll,ll>>> g(n);\n\trep(i,n) {\n\t\tauto [x1, y1, z1] = v[i];\n\t\tll xs = x1 + s;\n\t\tll ys = y1 + s;\n\t\tll zs = z1 + s;\n\t\trep2(j,i+1,n) {\n\t\t\tauto [x2,y2,z2] = v[j];\n\t\t\tbool isAlreadyChecked = false;\n\t\t\trep(x_mul, 2) rep(y_mul, 2) rep(z_mul, 2) {\n\t\t\t\tif(isAlreadyChecked) break;\n\t\t\t\tll px = x2 + s*x_mul;\n\t\t\t\tll py = y2 + s*y_mul;\n\t\t\t\tll pz = z2 + s*z_mul;\n\t\t\t\tif(x1 <= px && px <= xs && y1 <= py && py <= ys && z1 <= pz && pz <= zs) {\n\t\t\t\t\tisAlreadyChecked = true;\n\t\t\t\t\tll dx = x_mul == 0 ? xs-px: px-x1;\n\t\t\t\t\tll dy = y_mul == 0 ? ys-py: py-y1;\n\t\t\t\t\tll dz = z_mul == 0 ? zs-pz: pz-z1;\n\t\t\t\t\tll weight = 2ll*dx*dy + 2ll*dx*dz + 2ll*dy*dz;\n\t\t\t\t\tg[i].push_back({j, weight});\n\t\t\t\t\tg[j].push_back({i, weight});\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t// rep(j, n) {\n\t\t// // for(int j = i+1;j < n;j++) {\n\t\t// \tif(i == j)continue;\n\t\t// \tauto [x2, y2, z2] = v[j];\n\n\t\t// \tll xs = x1 + s;\n\t\t// \tll ys = y1 + s;\n\t\t// \tll zs = z1 + s;\n\n\t\t// \t// ll dx = calc_d(x1, x2);\n\t\t// \t// ll dy = calc_d(y1, y2);\n\t\t// \t// ll dz = calc_d(z1, z2);\n\n\t\t// \t// if(dx == -1 || dy == -1 || dz == -1)continue;\n\n\t\t// \t// ll weight = 2ll*dx*dy + 2ll*dx*dz + 2ll*dy*dz;\n\n\t\t// \t// g[i].push_back({j,weight});\n\t\t// \t// g[j].push_back({i,weight});\n\t\t\t\n\t\t// \tif(x1 <= x2 && x2 <= xs && y1 <= y2 && y2 <= ys && z1 <= z2 && z2 <= zs) {\n\n\t\t// \t\tll dx = xs - x2;\n\t\t// \t\tll dy = ys - y2;\n\t\t// \t\tll dz = zs - z2;\n\n\t\t// \t\tll weight = 2ll*dx*dy + 2ll*dx*dz + 2ll*dy*dz;\n\n\t\t// \t\tg[i].push_back({j,weight});\n\t\t// \t\tg[j].push_back({i,weight});\n\t\t\t\n\t\t// \t}\n\t\t// }\n\t}\n\n\tdebug(g);\n\n\tif(k == 1){\n\t\tcout << 6ll*s*s << '\\n';\n\t\treturn 0;\n\t}\n\t\n\tif(k == 2){\n\t\tll ans = hinf<ll>();\n\t\trep(i, n){\n\t\t\tfor(auto [to, e] : g[i]){\n\t\t\t\tchmin(ans, 6ll*s*s*2 - e);\n\t\t\t}\n\t\t}\n\t\tcout << (ans == hinf<ll>() ? -1 : ans) << '\\n';\n\t\treturn 0;\n\t}\n\n\tdebug(g);\n\tll ans = hinf<ll>();\n\t\n\trep(i, n){\n\t\tfor(auto [TO, E] : g[i]){\n\t\t\tll sm = E;\n\t\t\tunordered_set<int> st;\n\t\t\tst.emplace(i);\n\t\t\tst.emplace(TO);\n\t\t\tint cur = TO, pre = i;\n\t\t\tbool flg = true;\n\t\t\tfor(int rem = k-2;rem >= 0;rem--){\n\t\t\t\t\n\t\t\t\tbool update = false;\n\t\t\t\tfor(auto [to, e] : g[cur]){\n\t\t\t\t\tif(to == pre)continue;\n\t\t\t\t\tif(rem != 0 && st.contains(to))continue;\n\t\t\t\t\tif(rem != 0 || st.contains(to))sm += e;\n\t\t\t\t\tst.emplace(to);\n\t\t\t\t\tpre = cur;\n\t\t\t\t\tcur = to;\n\t\t\t\t\tupdate = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tdebug(pre, cur, sm, rem, st, update);\n\t\t\t\tif(rem && not update){\n\t\t\t\t\tflg = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(flg){\n\t\t\t\tchmin(ans, 6ll*s*s*k - sm);\n\t\t\t\tdebug(st, sm);\n\t\t\t}\n\t\t}\n\t}\n\tcout << (ans == hinf<ll>() ? -1 : ans) << '\\n';\n\treturn 0;\n}\n\nvoid mmrz::solve(){\n\t// int t = 1;\n\t//cin >> t;\n\twhile(!SOLVE());\n}","accuracy":1,"time_ms":20,"memory_kb":3584,"score_of_the_acc":-0.1814,"final_rank":13},{"submission_id":"aoj_1612_9412332","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\nbool connect(vector<int> v1, vector<int> v2, int S){\n if(abs(v1[0]-v2[0])<S&&abs(v1[1]-v2[1])<S&&abs(v1[2]-v2[2])<S) return true;\n else return false;\n}\n\nint add(vector<int> v1, vector<int> v2, int S){\n vector<int> dr(3);\n for(int i=0;i<3;i++) dr[i]=S-abs(v1[i]-v2[i]);\n int ret=6*S*S-2*(dr[0]*dr[1]+dr[1]*dr[2]+dr[2]*dr[0]);\n return ret;\n}\n\nint epoint(int s,vector<vector<int>> &side){\n set<int> itta;\n queue<vector<int>> que;\n int last=s;\n que.push({s,-1});//{今の位置,前の位置}\n itta.insert(s);\n while(!que.empty()){\n auto v=que.front();\n que.pop();\n int now=v[0],pre=v[1];\n for(int next:side[now]){\n if(next==pre) continue;\n if(itta.count(next)){\n last=-1;\n break;\n }\n else{\n itta.insert(next);\n last=next;\n que.push({next,now});\n }\n }\n if(last==-1) break;\n }\n return last;\n}\n\n\nvoid solve(int N, int K, int S,vector<int> &ANS){\n \n vector<vector<int>> pos(N,vector<int>(3));\n for(int i=0;i<N;i++){\n for(int j=0;j<3;j++){\n cin >> pos[i][j];\n }\n }\n if(K==1){\n ANS.push_back(6*S*S);\n return;\n }\n vector<vector<int>> side(N,vector<int>(0));\n for(int i=0;i<N;i++){\n for(int j=i+1;j<N;j++){\n if(connect(pos[i],pos[j],S)){\n side[i].push_back(j);\n side[j].push_back(i);\n //cout << i<<\"と\"<<j<<\"は連結\"<<endl;//\n }\n }\n }\n vector<bool> used(N,false);\n int ans=INT_MAX;\n for(int i=0;i<N;i++){\n if(!used[i]){\n int start=epoint(i,side);\n if(start==-1){\n vector<int> con;\n con.push_back(i);\n used[i]=true;\n int sec=side[i][0];\n con.push_back(sec);\n used[sec]=true;\n\n queue<int> hai;\n hai.push(sec);\n while(!hai.empty()){\n int now=hai.front();\n hai.pop();\n for(int next:side[now]){\n if(!used[next]){\n used[next]=true;\n con.push_back(next);\n hai.push(next);\n }\n } \n }\n int sz=con.size();\n if(sz==K){\n int area=0;\n for(int j=0;j<K;j++){\n area+=add(pos[con[j]],pos[con[(j+1)%K]],S);\n }\n ans=min(ans,area);\n }\n if(sz>K){\n int area=6*S*S;\n for(int j=1;j<K;j++){\n area+=add(pos[con[j-1]],pos[con[j]],S);\n }\n ans=min(ans,area);\n //cout << \"ループの場合\"<<area<<endl;//\n for(int j=1;j<sz;j++){\n area+=add(pos[con[(K-2+j)%sz]],pos[con[(K-1+j)%sz]],S);\n area-=add(pos[con[j-1]],pos[con[j]],S);\n ans=min(ans,area);\n //cout << \"ループの場合\"<<area<<endl;//\n }\n }\n }\n else{\n queue<int> hai;\n hai.push(start);\n used[start]=true;\n vector<int> con;\n con.push_back(start);\n while(!hai.empty()){\n int now=hai.front();\n hai.pop();\n for(int next:side[now]){\n if(!used[next]){\n used[next]=true;\n con.push_back(next);\n hai.push(next);\n }\n } \n }\n int sz=con.size();\n //for(int x:con) cout << x <<' ';//\n //cout <<\"これらは連結\"<<endl;//\n if(sz>=K){\n int area=6*S*S;\n for(int j=1;j<K;j++){\n area+=add(pos[con[j-1]],pos[con[j]],S);\n }\n ans=min(ans,area);\n //cout << \"鎖状の場合\"<<area<<endl;//\n for(int j=K;j<sz;j++){\n area+=add(pos[con[j-1]],pos[con[j]],S);\n area-=add(pos[con[j-K]],pos[con[j-K+1]],S);\n ans=min(ans,area);\n //cout << \"鎖状の場合\"<<area<<endl;//\n }\n }\n }\n }\n }\n if(ans==INT_MAX) ans=-1;\n ANS.push_back(ans);\n\n}\n\n\n\nint main() {\n vector<int> ANS;\n while(true){\n int N,K,S;\n cin>>N>>K>>S;\n if(N==0) break;\n solve(N,K,S,ANS);\n }\n for(int a:ANS) cout << a << endl;\n \n}","accuracy":1,"time_ms":20,"memory_kb":3432,"score_of_the_acc":-0.141,"final_rank":10},{"submission_id":"aoj_1612_9239661","code_snippet":"#include <bits/stdc++.h>\n\nbool solve() {\n long long N, K, S;\n std::cin >> N >> K >> S;\n if (N == 0) return false;\n std::array<std::vector<long long>, 3> P;\n for (int i{} ; i < 3 ; i++) P[i] = std::vector<long long>(N);\n for (int i{} ; i < N ; i++) {\n for (int j{} ; j < 3 ; j++) std::cin >> P[j][i];\n }\n std::vector<std::vector<std::pair<int, long long>>> g(N);\n for (int i{} ; i < N ; i++) {\n for (int j{} ; j < N ; j++) {\n if (i == j) continue;\n bool ok{true};\n long long len[3];\n for (int k{} ; k < 3 ; k++) {\n long long l{std::max(P[k][i], P[k][j])}, r{std::min(P[k][i], P[k][j]) + S};\n ok &= (l < r);\n len[k] = r - l;\n }\n if (!ok) continue;\n long long cost{}; \n for (int i{} ; i < 3 ; i++) {\n long long area{len[i + 1 == 3 ? 0 : i + 1] * len[i]};\n cost += 2 * area;\n }\n g[i].emplace_back(j, cost);\n }\n }\n std::vector<bool> used(N);\n int start{-1};\n auto rec{[&](auto rec, int v, int cnt, long long sum) -> long long {\n long long res{(cnt == K ? sum : -1)};\n for (auto [x, w] : g[v]) {\n if (!used[x] and cnt < K) {\n used[x] = true;\n res = std::max(res, rec(rec, x, cnt + 1, sum + w));\n used[x] = false;\n }\n else if (K != 2 and cnt == K and x == start) {\n assert(used[x]);\n res += w;\n }\n }\n return res;\n }};\n long long ans{-1};\n for (int v{} ; v < N ; v++) {\n used[v] = true;\n start = v;\n ans = std::max(ans, rec(rec, v, 1, 0LL)); \n used[v] = false;\n }\n if (ans == -1) {\n std::cout << ans << '\\n';\n }\n else {\n ans = (long long)K * 6 * S * S - ans;\n std::cout << ans << '\\n';\n }\n return true;\n}\n\nint main() {\n std::cin.tie(nullptr)->sync_with_stdio(false);\n while (solve()) ;\n}","accuracy":1,"time_ms":20,"memory_kb":3456,"score_of_the_acc":-0.1474,"final_rank":11},{"submission_id":"aoj_1612_9122008","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define ALL(v) v.begin(),v.end()\ntemplate<class F, class S>\nostream& operator<<(ostream& os, const pair<F,S>& p) {\n os << '(' << p.first << ',' << p.second << ')';\n return os;\n}\ntemplate<class Iter>\nvoid print(Iter begin, Iter end) {\n for (auto itr = begin; itr != end; ++itr) {\n cerr << (*itr) << ' ';\n }\n cerr << '\\n';\n}\n#define dbg(v) cerr << #v << \": \" << v << '\\n';\nint N,K,S;\nvector<array<int,3>> P;\nusing Graph = vector<vector<int>>;\nGraph G;\nvector<vector<int>> W;\n\nint cycle(vector<int>& vert) {\n if (vert.size() == K) {\n int sum = 0;\n for (int i : vert) {\n for (int j : vert) {\n sum += W[i][j];\n }\n }\n assert(sum % 2 == 0);\n return sum / 2;\n }\n int n = vert.size();\n map<int, bool> used;\n int start = vert[0];\n vert.clear();\n vert.push_back(start);\n used[start] = true;\n for (int i = 0; i < n-1; ++i) {\n int pos = vert.back();\n for (int to : G[pos]) {\n if (!used[to]) {\n vert.push_back(to);\n used[to] = true;\n break;\n }\n }\n }\n for (int i = 0; i < n; ++i) {\n vert.push_back(vert[i]);\n }\n\n vector<int> rui(2*n);\n for (int i = 1; i < 2*n; ++i) {\n rui[i] = rui[i-1] + W[vert[i]][vert[i-1]];\n }\n int res = 0;\n for (int i = K-1; i < 2*n; ++i) {\n res = max(res, rui[i] - rui[i-K+1]);\n }\n return res;\n}\n\nint path(vector<int>& vert) {\n int start = -1;\n for (int v : vert) {\n if (G[v].size() <= 1) {\n start = v;\n break;\n }\n }\n int n = vert.size();\n map<int, bool> used;\n vert.clear();\n vert.push_back(start);\n used[start] = true;\n for (int i = 0; i < n-1; ++i) {\n int pos = vert.back();\n for (int to : G[pos]) {\n if (!used[to]) {\n vert.push_back(to);\n used[to] = true;\n break;\n }\n }\n }\n\n vector<int> rui(n);\n for (int i = 1; i < n; ++i) {\n rui[i] = rui[i-1] + W[vert[i]][vert[i-1]];\n }\n int res = 0;\n for (int i = K-1; i < n; ++i) {\n res = max(res, rui[i] - rui[i-K+1]);\n }\n return res;\n}\n\nint calc(int x1, int y1, int z1, int x2, int y2, int z2)\n{\n if (x1 > x2) swap(x1, x2);\n int dx = max(0, x1 + S - x2);\n if (y1 > y2) swap(y1, y2);\n int dy = max(0, y1 + S - y2);\n if (z1 > z2) swap(z1, z2);\n int dz = max(0, z1 + S - z2);\n if (dx==0 || dy==0 || dz==0) return 0;\n return (dx * dy + dy * dz + dz * dx) * 2;\n}\n\nint solve() {\n cin >> N >> K >> S;\n if (N+K+S == 0) exit(0);\n P.resize(N);\n for (int i = 0; i < N; ++i) {\n for (int j = 0; j < 3; ++j) {\n cin >> P[i][j];\n }\n }\n\n G.clear();\n G.resize(N);\n W.clear();\n W.resize(N, vector<int>(N,0));\n for (int i = 0; i < N; ++i) {\n for (int j = i+1; j < N; ++j) {\n // calc weight of edge i-j\n auto [x1, y1, z1] = P[i];\n auto [x2, y2, z2] = P[j];\n int diff = calc(x1,y1,z1, x2,y2,z2);\n W[i][j] = W[j][i] = diff;\n if (diff > 0) {\n G[i].emplace_back(j);\n G[j].emplace_back(i);\n }\n }\n }\n // for (int i = 0; i < N; ++i) {\n // cerr << i << \":\";\n // print(ALL(G[i]));\n // }\n vector<bool> used(N);\n int ans = -1;\n for (int i = 0; i < N; ++i) {\n if (used[i]) continue;\n vector<int> vert;\n queue<int> q;\n used[i] = true;\n q.push(i);\n vert.push_back(i);\n while (q.size()) {\n int v = q.front();\n q.pop();\n for (auto to : G[v]) {\n if (!used[to]) {\n used[to] = true;\n q.push(to);\n vert.push_back(to);\n }\n }\n }\n\n bool isCycle = true;\n for (int v : vert) {\n if (G[v].size() != 2) {\n isCycle = false;\n }\n }\n if (vert.size() < K) {continue;}\n\n if (isCycle) {\n ans = max(ans, cycle(vert));\n } else {\n ans = max(ans, path(vert));\n }\n }\n if (ans == -1) return -1;\n return K * S*S*6 - ans;\n}\n\nint main() {\n while (true) {\n cout << solve() << '\\n';\n }\n}","accuracy":1,"time_ms":10,"memory_kb":7000,"score_of_the_acc":-1,"final_rank":19},{"submission_id":"aoj_1612_8031034","code_snippet":"#include \"bits/stdc++.h\"\n\nusing namespace std;\n\nusing i64 = long long;\nusing ll = long long;\n\nbool solve(){\n int n, k, s;\n cin >> n >> k >> s;\n if (n == 0) {\n return false;\n }\n vector<ll> x(n);\n vector<ll> y(n);\n vector<ll> z(n);\n for (int i = 0; i < n; i++) {\n cin >> x[i] >> y[i] >> z[i];\n }\n ll base = s * s * 6 * k;\n if (k == 1) {\n cout << base << endl;\n return true;\n }\n vector<int> e1(n, -1);\n vector<int> e2(n, -1);\n vector<ll> s1(n, -1);\n vector<ll> s2(n, -1);\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n if (i == j) {\n continue;\n }\n ll ix = s + min(x[i], x[j]) - max(x[i], x[j]);\n ll iy = s + min(y[i], y[j]) - max(y[i], y[j]);\n ll iz = s + min(z[i], z[j]) - max(z[i], z[j]);\n if (ix > 0 && iy > 0 && iz > 0) {\n ll siz = (ix * iy + ix * iz + iy * iz) * 2;\n if (e1[i] == -1) {\n e1[i] = j;\n s1[i] = siz;\n } else {\n e2[i] = j;\n s2[i] = siz;\n }\n }\n }\n }\n ll ans = 0;\n bool any = false;\n for (int i = 0; i < n; i++) {\n if (e1[i] != -1) {\n int p = i;\n int c = e1[i];\n ll su = 0;\n ll ns = s1[i];\n bool ok = true;\n //cout << i << \"_2\" << endl;\n for (int j = 1; j < k; j++) {\n //cout << c << \", \" << p << endl;\n if (c == -1) {\n ok = false;\n break;\n }\n su += ns;\n if (e1[c] == p && e2[c] != -1) {\n ns = s2[c];\n p = c;\n c = e2[c];\n } else if (e2[c] == p && e1[c] != -1) {\n ns = s1[c];\n p = c;\n c = e1[c];\n } else {\n p = c;\n c = -1;\n }\n if (p == i) {\n ok = false;\n break;\n }\n }\n if (c == i) {\n su += ns;\n }\n if (ok) {\n any = true;\n ans = max(ans, su);\n }\n }\n if (e2[i] != -1) {\n int p = i;\n int c = e2[i];\n ll su = 0;\n ll ns = s2[i];\n bool ok = true;\n //cout << i << \"_2\" << endl;\n for (int j = 1; j < k; j++) {\n //cout << c << \", \" << p << endl;\n if (c == -1) {\n ok = false;\n break;\n }\n su += ns;\n if (e1[c] == p && e2[c] != -1) {\n ns = s2[c];\n p = c;\n c = e2[c];\n } else if (e2[c] == p && e1[c] != -1) {\n ns = s1[c];\n p = c;\n c = e1[c];\n } else {\n p = c;\n c = -1;\n }\n if (p == i) {\n ok = false;\n break;\n }\n }\n if (c == i) {\n su += ns;\n }\n if (ok) {\n any = true;\n ans = max(ans, su);\n }\n }\n }\n if (any) {\n cout << base - ans << endl;\n } else {\n cout << -1 << endl;\n }\n return true;\n}\n\nint main() {\n while(solve());\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3432,"score_of_the_acc":-0.0501,"final_rank":2},{"submission_id":"aoj_1612_8026061","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n\nstruct Unionfind{\nprivate:\n int n;\n std::vector<int> parents;\n\npublic:\n Unionfind(int n):n(n), parents(n,-1) {}\n\n int find(int x) {\n if(parents[x] < 0) return x;\n return parents[x] = find(parents[x]);\n }\n\n void unite(int x,int y) {\n x = find(x);\n y = find(y);\n\n if(x == y) return;\n if(parents[x] > parents[y]) std::swap(x, y);\n parents[x] += parents[y];\n parents[y] = x;\n return;\n } \n\n int size(int x) {\n return -parents[find(x)];\n }\n\n bool same(int x, int y) {\n return find(x) == find(y);\n }\n\n std::vector<int> members(int x) {\n int root = find(x);\n std::vector<int> member;\n for(int i = 0;i < n; i++){\n if(find(i) == root ){\n member.push_back(i);\n }\n }\n return member;\n }\n\n int group_cnt(void) {\n int c = 0;\n for(int i = 0;i < n; i++){\n if(parents[i] < 0) ++c;\n }\n return c;\n }\n};\n\nlong long calc(vector<vector<pair<int,long long>>>& G, Unionfind& uf, vector<bool> in_circle, int n, int k, int s){\n long long ans = -1;\n vector<bool> done(G.size());\n for(int i = 0; i < G.size(); i++){\n if(done[i]) continue;\n auto member = uf.members(i);\n if(member.size() < k) continue;\n\n\n bool circle = false;\n int start = i;\n for(int j = 0; j < member.size(); j++){\n int m = member[j];\n done[m] = 1, circle |= in_circle[m];\n if(G[m].size() == 1) start = m;\n }\n\n // cout << circle << endl;\n // for(int i = 0; i < member.size(); i++) cout << member[i] << \" \";\n //cout << endl;\n\n vector<long long> a;\n vector<bool> visited(member.size());\n auto dfs = [&](auto&& self, int v, int prev = -1)->void{\n visited[v] = true;\n for(auto[nv, rew] : G[v]){\n if(visited[nv]){\n if(prev != start && nv == start) a.push_back(rew);\n continue;\n }\n a.push_back(rew);\n self(self, nv, v);\n }\n };\n dfs(dfs, start);\n\n //for(int i = 0; i < a.size(); i++){\n // cout << a[i] << \" \";\n //}\n //cout << endl;\n\n if(member.size() == k){\n ans = max(ans, accumulate(a.begin(), a.end(), 0ll));\n }\n else{\n if(circle){\n vector<long long> sum(3*a.size() + 1);\n for(int i = 0; i < sum.size() - 1; i++){\n sum[i + 1] = sum[i] + a[i % a.size()];\n }\n for(int i = k - 1; i <= a.size() + k; i++){\n ans = max(ans, sum[i] - sum[i - (k - 1)]);\n }\n }\n else{\n vector<long long> sum(a.size() + 1);\n for(int i = 0; i < a.size(); i++){\n sum[i + 1] = sum[i] + a[i % a.size()];\n }\n for(int i = k - 1; i < sum.size(); i++){\n ans = max(ans, sum[i] - sum[i - (k - 1)]);\n }\n }\n }\n }\n return ans;\n} \n\n\nvoid solve(int n, int k, long long s){\n vector<int> x(n), y(n), z(n);\n Unionfind uf(n);\n vector<bool> in_circle(n);\n vector<vector<pair<int, long long>>> G(n);\n for(int i = 0; i < n; i++) cin >> x[i] >> y[i] >> z[i];\n auto process = [&](int i, int j)->void{\n long long area = 0;\n for(int mask = 0; mask < 1<<3; mask++){\n vector<int> co(3);\n co[0] = x[i], co[1] = y[i], co[2] = z[i];\n for(int p = 0; p < 3; p++){\n if(mask >> p & 1) co[p] += s;\n }\n if(x[j] <= co[0] && co[0] <= x[j] + s && y[j] <= co[1] && co[1] <= y[j] + s && z[j] <= co[2] && co[2] <= z[j] + s){\n long long tate = ((mask >> 0 & 1) ? co[0] - x[j] : x[j] + s - co[0]);\n long long yoko = ((mask >> 1 & 1) ? co[1] - y[j] : y[j] + s - co[1]);\n long long takasa = ((mask >> 2 & 1) ? co[2] - z[j] : z[j] + s - co[2]);\n area = 2 * (tate * yoko + tate * takasa + yoko * takasa);\n } \n }\n if(area != 0){\n G[i].push_back({j, area}), G[j].push_back({i, area});\n if(uf.same(i, j)) in_circle[i] = in_circle[j] = 1;\n uf.unite(i, j);\n }\n };\n for(int i = 0; i < n; i++) for(int j = 0; j < i; j++) process(i, j);\n //for(int i = 0; i < n; i++){\n // for(auto[j, cost]:G[i]) cout << i << \" \" << j << \" \" << cost << endl;\n //}\n long long tmp = calc(G, uf, in_circle, n, k, s);\n if(tmp == -1) cout << tmp << endl;\n else cout << 6*s*s*k - tmp << endl;\n}\n\nint main() {\n while(1){\n int n, k, s; cin >> n >> k >> s;\n if(n == 0 && k == 0 && s == 0) break;\n solve(n, k, s);\n }\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":3544,"score_of_the_acc":-0.7162,"final_rank":17},{"submission_id":"aoj_1612_7720545","code_snippet":"#include<bits/stdc++.h>\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 ull = unsigned long long;\n\ntemplate<typename T> bool chmin(T &a, const T &b){\n if (a <= b) return false;\n a = b;\n return true;\n}\ntemplate<typename T> bool chmax(T &a, const T &b){\n if (a >= b) return false;\n a = b;\n return true;\n}\n\nint main() {\n const int INF = std::numeric_limits<int>::max();\n int n,k,s;\n while(std::cin >> n >> k >> s, n != 0) {\n using P = std::array<int, 3>;\n std::vector<P> ps(n);\n for(auto &p: ps) {\n rep(i,0,3) {\n std::cin >> p[i];\n }\n }\n auto is_connect = [&](P a, P b) -> bool {\n rep(bit,0,1<<3) {\n bool is_ok = true;\n rep(i,0,3) {\n int ret = a[i];\n if((bit >> i) & 1) {\n ret += s;\n }\n is_ok &= b[i] <= ret && ret <= b[i] + s;\n }\n if(is_ok) return true;\n }\n return false;\n };\n auto f = [&](P a, P b) -> int {\n P diff;\n rep(i,0,3) diff[i] = s - std::abs(a[i] - b[i]);\n int ret = 0;\n rep(i,0,3) ret += 2 * diff[i] * diff[(i + 1) % 3];\n return ret;\n };\n if(k == 1) {\n std::cout << 6 * s * s << '\\n';\n continue;\n }\n if(k == 2) {\n int ans = INF;\n rep(i,0,n) {\n rep(j,i+1,n) {\n if(is_connect(ps[i], ps[j])) chmin(ans, 6*s*s*2 - f(ps[i], ps[j]));\n }\n }\n if(ans == INF) ans = -1;\n std::cout << ans << '\\n';\n continue;\n }\n\n std::vector g(n, std::vector<int>());\n rep(i,0,n) rep(j,i+1,n) {\n if(is_connect(ps[i], ps[j])) {\n g[i].emplace_back(j);\n g[j].emplace_back(i);\n }\n }\n std::vector<std::vector<int>> groups;\n {\n std::vector<int> deg1;\n std::vector<int> seen(n, -1);\n std::vector<int> group;\n auto dfs = [&](auto &&self, int v) -> void {\n seen[v] = 1;\n group.emplace_back(v);\n for(auto nv: g[v]) if(seen[nv] < 0) {\n self(self, nv);\n }\n };\n rep(i,0,n) if(g[i].size() == 1 && seen[i] < 0) {\n dfs(dfs, i);\n groups.emplace_back(group);\n group.clear();\n }\n rep(i,0,n) if(seen[i] < 0) {\n dfs(dfs, i);\n groups.emplace_back(group);\n group.clear();\n }\n }\n int ans = INF;\n for(auto group: groups) {\n int sz = group.size();\n if(sz < k) continue;\n std::vector<int> diffs;\n rep(i,0,sz-1) {\n int idx = group[i];\n int jdx = group[i+1];\n diffs.emplace_back(f(ps[idx], ps[jdx]));\n }\n bool is_loop = is_connect(ps[group[0]], ps[group.back()]);\n int w = k-1;\n if(is_loop) {\n diffs.emplace_back(f(ps[group[0]], ps[group.back()]));\n if(sz == k) w = k;\n }\n sz = diffs.size();\n int ret = 0;\n rep(i,0,w) {\n ret += diffs[i];\n }\n chmin(ans, 6 * s * s * k - ret);\n rep(i,0,sz) {\n if(!is_loop && i + w >= sz) break;\n ret -= diffs[i];\n ret += diffs[(i + w) % sz];\n chmin(ans, 6 * s * s * k - ret);\n }\n }\n if(ans == INF) ans = -1;\n std::cout << ans << '\\n';\n }\n}","accuracy":1,"time_ms":20,"memory_kb":3572,"score_of_the_acc":-0.1782,"final_rank":12},{"submission_id":"aoj_1612_7720139","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nbool is_connect(int i, int j, int s, vector<int>&x, vector<int>&y, vector<int>&z){\n\tint px,py,pz,qx,qy,qz;\n\tfor (int k=0; k<8; k++){\n\t\tif (k&1){\n\t\t\tpx=i;\n\t\t\tqx=j;\n\t\t}else{\n\t\t\tpx=j;\n\t\t\tqx=i;\n\t\t}\n\t\tif (k&2){\n\t\t\tpy=i;\n\t\t\tqy=j;\n\t\t}else{\n\t\t\tpy=j;\n\t\t\tqy=i;\n\t\t}\n\t\tif (k&4){\n\t\t\tpz=i;\n\t\t\tqz=j;\n\t\t}else{\n\t\t\tpz=j;\n\t\t\tqz=i;\n\t\t}\n\t\tif (!(x[px] <= x[qx] && x[qx] <= x[px]+s)) continue;\n\t\tif (!(y[py] <= y[qy] && y[qy] <= y[py]+s)) continue;\n\t\tif (!(z[pz] <= z[qz] && z[qz] <= z[pz]+s)) continue;\n\t\treturn true;\n\t}\n\treturn false;\n}\n\nint kasane(int i, int j, int s, vector<int>&x, vector<int>&y, vector<int>&z){\n\tint px,py,pz;\n\tif (x[i] <= x[j]){\n\t\tpx = x[i]+s-x[j];\n\t}else{\n\t\tpx = x[j]+s-x[i];\n\t}\n\tif (y[i] <= y[j]){\n\t\tpy = y[i]+s-y[j];\n\t}else{\n\t\tpy = y[j]+s-y[i];\n\t}\n\tif (z[i] <= z[j]){\n\t\tpz = z[i]+s-z[j];\n\t}else{\n\t\tpz = z[j]+s-z[i];\n\t}\n\treturn 2*(px*py+py*pz+pz*px);\n}\n\nvoid solve(int n, int k, int s){\n\tvector<int> x(n), y(n), z(n);\n\tfor (int i=0; i<n; i++){\n\t\tcin >> x[i] >> y[i] >> z[i];\n\t}\n\n\tvector<vector<int>> ikeru(n, vector<int>(0));\n\tvector<int> deg(n);\n\tfor (int i=0; i<n; i++){\n\t\tfor (int j=i+1; j<n; j++){\n\t\t\tif (is_connect(i, j, s, x, y, z)){\n\t\t\t\tikeru[i].push_back(j);\n\t\t\t\tikeru[j].push_back(i);\n\t\t\t\tdeg[i] += 1;\n\t\t\t\tdeg[j] += 1;\n\t\t\t}\n\t\t}\n\t}\n\t\n\tvector<int> deg1(0);\n\tvector<bool> tansaku(n);\n\tfor (int i=0; i<n; i++){\n\t\tif (deg[i] <= 1) deg1.push_back(i);\n\t}\n\tvector<vector<int>> groups(0,vector<int>(0));\n\tint cnt = 0;\n\tvector<bool> isen(0);\n\tfor (int st: deg1){\n\t\tvector<int> mada = {st};\n\t\ttansaku[st] = true;\n\t\tgroups.push_back(vector<int>(0));\n\t\tgroups[cnt].push_back(st);\n\t\tisen.push_back(false);\n\t\twhile(!mada.empty()){\n\t\t\tint i = mada.back(); mada.pop_back();\n\t\t\tfor (int j: ikeru[i]){\n\t\t\t\tif(!tansaku[j]){\n\t\t\t\t\ttansaku[j] = true;\n\t\t\t\t\tgroups[cnt].push_back(j);\n\t\t\t\t\tmada.push_back(j);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcnt += 1;\n\t}\n\tfor (int st=0; st<n; st++){\n\t\tif (tansaku[st]) continue;\n\t\tvector<int> mada = {st};\n\t\tgroups.push_back(vector<int>(0));\n\t\tisen.push_back(true);\n\t\twhile(!mada.empty()){\n\t\t\tint i = mada.back(); mada.pop_back();\n\t\t\tif(tansaku[i]) continue;\n\t\t\tgroups[cnt].push_back(i);\n\t\t\ttansaku[i] = true;\n\t\t\tfor (int j: ikeru[i]){\n\t\t\t\tif(!tansaku[j]){\n\t\t\t\t\tmada.push_back(j);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcnt += 1;\n\t}\n\n\tint ans = 1e9;\n\tfor (int xx=0; xx<cnt; xx++){\n\t\tint m = groups[xx].size();\n\t\tif (m < k) continue;\t\n\t\tint w = k-1;\n\t\tif (isen[xx]){\n\t\t\tif (m==k) w=k;\n\t\t\tvector<int> dif(2*m);\n\t\t\tfor (int i=0; i<2*m; i++){\n\t\t\t\tdif[i] = kasane(groups[xx][i%m], groups[xx][(i+1)%m], s, x, y, z);\n\t\t\t}\n\t\t\tvector<int> rui(2*m+1);\n\t\t\tfor (int i=0; i<2*m; i++){\n\t\t\t\trui[i+1] = rui[i] + dif[i];\n\t\t\t}\n\t\t\tfor (int i=0; i<=2*m-w; i++){\n\t\t\t\tans = min(ans, 6*s*s*k - (rui[i+w] - rui[i]));\n\t\t\t}\n\t\t}else{\n\t\t\tvector<int> dif(m-1);\n\t\t\tfor (int i=0; i<m-1; i++){\n\t\t\t\tdif[i] = kasane(groups[xx][i%m], groups[xx][(i+1)%m], s, x, y, z);\n\t\t\t}\n\t\t\tvector<int> rui(m);\n\t\t\tfor (int i=0; i<m-1; i++){\n\t\t\t\trui[i+1] = rui[i] + dif[i];\n\t\t\t}\n\t\t\tfor (int i=0; i<m-w; i++){\n\t\t\t\tans = min(ans, 6*s*s*k - (rui[i+w] - rui[i]));\n\t\t\t}\n\t\t}\n\t}\n\tif (ans == 1e9) ans = -1;\n\tcout << ans << \"\\n\";\n}\n\nint main(){\n\twhile(true){\n\t\tint n,k,s; cin >> n >> k >> s;\n\t\tif (n == 0) break;\n\t\tsolve(n,k,s);\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3572,"score_of_the_acc":-0.0873,"final_rank":9},{"submission_id":"aoj_1612_7720114","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i,x,n) for(int i = (int)x; i < (int)n; i++)\n#define rrep(i,x,n) for(int i = int(n) - 1; i >= x; i--)\n#define all(a) a.begin(), a.end()\n\nusing ll = long long;\nusing ull = unsigned long long;\n\ntemplate<class T>\nbool chmin(T &a, T b) {\n if(a <= b) return false;\n a = b;\n return true;\n}\n\ntemplate<class T>\nbool chmax(T &a, T b) {\n if(a >= b) return false;\n a = b;\n return true;\n}\n\nint main() {\n using pv = array<ll,3>;\n auto cnct = [](pv a, pv b, ll w){\n rep(s,0,8){\n pv c = {0,0,0};\n rep(i,0,3) c[i] = b[i] + (s >> i & 1) * w;\n bool ok = true;\n rep(i,0,3){\n if (c[i] < a[i] || a[i]+w < c[i]) ok = false;\n }\n if (ok) return true;\n }\n return false;\n };\n auto cov = [&](pv a, pv b, ll w){\n pv c = {0,0,0};\n rep(i,0,3) c[i] = w - abs(a[i]-b[i]);\n ll res = 0;\n rep(i,0,3){\n res += 2 * c[i] * c[(i+1)%3];\n }\n return res;\n };\n while (true){\n int n, k; cin >> n >> k;\n ll s; cin >> s;\n if (n == 0) break;\n vector<pv> a(n);\n rep(i,0,n){\n ll x, y, z; cin >> x >> y >> z;\n a[i] = {x,y,z};\n }\n if (k == 1){\n cout << 6*s*s << endl;\n continue;\n }\n if (k == 2){\n set<pv> st;\n bool ok = false;\n rep(i,0,n){\n if (st.find(a[i]) == st.end()){\n st.insert(a[i]);\n }\n else {\n ok = true; \n }\n }\n if (ok){\n cout << 6*s*s << endl;\n continue;\n }\n }\n vector<vector<int>> es(n);\n vector<int> deg(n,0);\n rep(i,0,n) rep(j,0,n){\n if (i == j) continue;\n if (cnct(a[i],a[j],s)) es[i].emplace_back(j), deg[i]++;\n }\n vector<int> vis(n,0);\n const ll inf = 1'000'000'000'000'000'000;\n ll ans = inf;\n rep(i,0,n){\n if (vis[i] == 1) continue;\n vector<int> ids;\n ids.emplace_back(i);\n vis[i] = 1;\n queue<int> que;\n que.push(i);\n while (!que.empty()){\n int p = que.front(); que.pop(); //cout << p << endl;\n for (int q : es[p]){\n if (vis[q] == 1) continue;\n vis[q] = 1;\n ids.emplace_back(q);\n que.push(q);\n }\n }\n int nsiz = ids.size(); //cout << nsiz << endl; cout << endl;\n if (nsiz < k) continue;\n bool ng = true;\n int id = ids[0];\n for (int j : ids){\n if (deg[j] == 1) id = j, ng = false;\n }\n for (int j : ids) vis[j] = 0;\n ids.clear();\n ids.emplace_back(id);\n vis[id] = 1;\n que.push(id);\n while (!que.empty()){\n int p = que.front(); que.pop();\n for (int q : es[p]){\n if (vis[q] == 1) continue;\n vis[q] = 1;\n ids.emplace_back(q);\n que.push(q);\n break;\n }\n }\n int siz = ids.size(); //cout << nsiz << endl;\n if (siz < k) continue;\n int cs = k-1;\n if (ng){\n if (siz == k){\n ll cur = 6*s*s*k;\n rep(j,0,siz) cur -= cov(a[ids[j]],a[ids[(j+1)%siz]],s);\n if (k == 2) cur += cov(a[ids[0]],a[ids[1]],s);\n chmin(ans,cur);\n continue;\n }\n rep(j,0,siz){\n ids.emplace_back(ids[j]);\n }\n }\n siz = ids.size();\n vector<ll> cum(siz, 0);\n rep(j,0,siz-1) {\n cum[j+1] = cum[j] + cov(a[ids[j]],a[ids[j+1]],s);\n }\n rep(j,0,siz) {\n if(j + cs >= siz) break;\n chmin(ans, 6*s*s*k - (cum[j+cs] - cum[j]));\n }\n }\n if (ans == inf) ans = -1;\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":60,"memory_kb":3432,"score_of_the_acc":-0.5046,"final_rank":14},{"submission_id":"aoj_1612_7719767","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\n#define rep(i,x,n) for(int i = (int)x; i < (int)n; i++)\n#define rrep(i,x,n) for(int i = int(n) - 1; i >= x; i--)\n#define all(a) a.begin(), a.end()\n\nusing ll = long long;\nusing ull = unsigned long long;\n\ntemplate<class T>\nbool chmin(T &a, T b) {\n if(a <= b) return false;\n a = b;\n return true;\n}\n\ntemplate<class T>\nbool chmax(T &a, T b) {\n if(a >= b) return false;\n a = b;\n return true;\n}\n\nconst ll inf = ll(1) << ll(60);\n\nint main() {\n ll n,k,s;\n using P = std::vector<ll>;\n while(std::cin >> n >> k >> s, !(n == 0)) {\n auto is_connect = [&](P a, P b){\n ll w = s;\n rep(ss,0,8){\n P c = {0,0,0};\n rep(i,0,3) c[i] = b[i] + (ss >> i & 1) * w;\n bool ok = true;\n rep(i,0,3){\n if (c[i] < a[i] || a[i]+w < c[i]) ok = false;\n }\n if (ok) return true;\n }\n return false;\n };\n auto cover_sum = [&](P a, P b) -> ll {\n std::vector<ll> diff(3);\n rep(i,0,3) {\n ll x1 = a[i];\n ll x2 = b[i];\n if(x1 > x2) std::swap(x1, x2);\n diff[i] = x1 + s - x2;\n }\n ll sum = 0;\n rep(i,0,3) sum += 2 * diff[i] * diff[(i + 1) % 3];\n return sum;\n };\n std::vector<P> ps(n, P(3));\n for(auto &p: ps) {\n rep(i,0,3) std::cin >> p[i];\n }\n if(k == 1) {\n std::cout << 6 * s * s << '\\n';\n continue;\n }\n if (k == 2){\n set<P> st;\n bool ok = false;\n rep(i,0,n){\n if (st.find(ps[i]) == st.end()){\n st.insert(ps[i]);\n }\n else {\n ok = true; \n }\n }\n if (ok){\n cout << 6*s*s << endl;\n continue;\n }\n ll ans = inf;\n rep(i,0,n) {\n rep(j,i+1,n) {\n if(is_connect(ps[i], ps[j])) {\n chmin(ans, 6*s*s*2 - cover_sum(ps[i], ps[j]));\n }\n }\n }\n if(ans == inf) ans = -1;\n std::cout << ans << '\\n';\n continue;\n }\n std::vector g(n, std::vector<int>());\n rep(i,0,n) {\n rep(j,i+1,n) {\n if(is_connect(ps[i], ps[j])) {\n g[i].emplace_back(j);\n g[j].emplace_back(i);\n }\n }\n }\n std::vector<std::vector<int>> groups;\n {\n std::vector<int> deg1;\n rep(i,0,n) if(g[i].size() == 1) deg1.emplace_back(i);\n std::vector<int> group, seen(n, -1);\n auto dfs = [&](auto &&self, int idx) -> void {\n for(auto v: g[idx]) {\n if(seen[v] < 0) {\n seen[v] = 1;\n group.emplace_back(v);\n self(self, v);\n }\n }\n };\n for(auto i: deg1) {\n if(seen[i] > 0) continue;\n group.clear();\n group.emplace_back(i);\n seen[i] = 1;\n dfs(dfs, i);\n groups.emplace_back(group);\n }\n rep(i,0,n) {\n if(seen[i] > 0) continue;\n group.clear();\n seen[i] = 1;\n group.emplace_back(i);\n dfs(dfs, i);\n groups.emplace_back(group);\n }\n }\n ll ans = inf;\n for(auto group: groups) {\n int sz = group.size();\n if(sz < k) continue;\n std::vector<ll> diffs;\n rep(i,0,sz-1) {\n int idx = group[i];\n int jdx = group[i+1];\n diffs.emplace_back(cover_sum(ps[idx], ps[jdx]));\n }\n int w = k-1;\n {\n int idx = group[0];\n int jdx = group.back();\n if(is_connect(ps[idx], ps[jdx])) {\n if(group.size() == k) w = k;\n int c = diffs.size();\n diffs.emplace_back(cover_sum(ps[idx], ps[jdx]));\n rep(i,0,c) diffs.emplace_back(diffs[i]);\n }\n }\n sz = diffs.size();\n std::vector<ll> cum(sz+1, 0);\n rep(i,0,sz) {\n cum[i+1] = cum[i] + diffs[i];\n }\n rep(i,0,sz) {\n if(i + w > sz) break;\n chmin(ans, 6 * s * s * k - (cum[i+w] - cum[i]));\n }\n }\n if (ans == inf) ans = -1;\n std::cout << ans << '\\n';\n }\n}","accuracy":1,"time_ms":110,"memory_kb":3536,"score_of_the_acc":-0.9868,"final_rank":18},{"submission_id":"aoj_1612_6775373","code_snippet":"#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <chrono>\n#include <climits>\n#include <cmath>\n#include <cstddef>\n#include <cstdint>\n#include <cstdlib>\n#include <cstring>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <limits>\n#include <map>\n#include <memory>\n#include <numeric>\n#include <optional>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <type_traits>\n#include <unordered_map>\n#include <unordered_set>\n#include <utility>\n#include <vector>\n\n/* macro */\n\n#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)\n#define rrep(i, a, n) for (int i = ((int)(n - 1)); i >= (int)(a); i--)\n#define Rep(i, a, n) for (i64 i = (i64)(a); i < (i64)(n); i++)\n#define RRep(i, a, n) for (i64 i = ((i64)(n - i64(1))); i >= (i64)(a); i--)\n#define all(v) (v).begin(), (v).end()\n#define rall(v) (v).rbegin(), (v).rend()\n#define Bit(n) (1LL << (n))\n\n/* macro end */\n\n/* template */\n\nnamespace ebi {\n\n#ifdef LOCAL\n#define debug(...) \\\n std::cerr << \"LINE: \" << __LINE__ << \" [\" << #__VA_ARGS__ << \"]:\", \\\n debug_out(__VA_ARGS__)\n#else\n#define debug(...)\n#endif\n\nvoid debug_out() { std::cerr << std::endl; }\n\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head h, Tail... t) {\n std::cerr << \" \" << h;\n if (sizeof...(t) > 0) std::cout << \" :\";\n debug_out(t...);\n}\n\ntemplate <typename T1, typename T2>\nstd::ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &pa) {\n return os << pa.first << \" \" << pa.second;\n}\n\ntemplate <typename T1, typename T2>\nstd::istream &operator>>(std::istream &os, std::pair<T1, T2> &pa) {\n return os >> pa.first >> pa.second;\n}\n\ntemplate <typename T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &vec) {\n for (std::size_t i = 0; i < vec.size(); i++)\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \" \");\n return os;\n}\n\ntemplate <typename T>\nstd::istream &operator>>(std::istream &os, std::vector<T> &vec) {\n for (T &e : vec) std::cin >> e;\n return os;\n}\n\ntemplate <typename T>\nstd::ostream &operator<<(std::ostream &os, const std::optional<T> &opt) {\n if (opt) {\n os << opt.value();\n } else {\n os << \"invalid value\";\n }\n return os;\n}\n\nusing std::size_t;\nusing i32 = std::int32_t;\nusing u32 = std::uint32_t;\nusing i64 = std::int64_t;\nusing u64 = std::uint64_t;\n\ntemplate <class T, T init>\nauto make_vector(int n) {\n return std::vector<T>(n, init);\n}\n\ntemplate <class T, T init, typename Head, typename... Tail>\nauto make_vector(Head n, Tail... ts) {\n return std::vector(n, make_vector<T, init>(ts...));\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\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>\nT pow(T x, i64 n) {\n T res = 1;\n while (n > 0) {\n if (n & 1) res = res * x;\n x = x * x;\n n >>= 1;\n }\n return res;\n}\n\ntemplate <class T>\nT mod_pow(T x, i64 n, i64 mod) {\n T res = 1;\n while (n > 0) {\n if (n & 1) res = (res * x) % mod;\n x = (x * x) % mod;\n n >>= 1;\n }\n return res;\n}\n\ntemplate <class T>\nT scan() {\n T val;\n std::cin >> val;\n return val;\n}\n\ntemplate <class T>\nstruct Edge {\n int to;\n T cost;\n Edge(int _to, T _cost = 1) : to(_to), cost(_cost) {}\n};\n\ntemplate <class T>\nstruct Graph : std::vector<std::vector<Edge<T>>> {\n using std::vector<std::vector<Edge<T>>>::vector;\n void add_edge(int u, int v, T w, bool directed = false) {\n (*this)[u].emplace_back(v, w);\n if (directed) return;\n (*this)[v].emplace_back(u, w);\n }\n};\n\nstruct graph : std::vector<std::vector<int>> {\n using std::vector<std::vector<int>>::vector;\n void add_edge(int u, int v, bool directed = false) {\n (*this)[u].emplace_back(v);\n if (directed) return;\n (*this)[v].emplace_back(u);\n }\n};\n\nconstexpr i64 LNF = std::numeric_limits<i64>::max() / 4;\n\nconstexpr int INF = std::numeric_limits<int>::max() / 2;\n\nconst std::vector<int> dy = {1, 0, -1, 0, 1, 1, -1, -1};\nconst std::vector<int> dx = {0, 1, 0, -1, 1, -1, 1, -1};\n\n} // namespace ebi\n\nnamespace ebi {\n\nvoid main_() {\n int n, k, s;\n while (std::cin >> n >> k >> s, !(n == 0 && k == 0 && s == 0)) {\n std::vector<std::tuple<i64, i64, i64>> ps(n);\n for (auto &[x, y, z] : ps) {\n std::cin >> x >> y >> z;\n }\n if(k == 1) {\n std::cout << i64(s) * i64(s) * 6 << '\\n';\n continue;\n }\n Graph<i64> g(n);\n auto f = [&](int i, int j) -> std::vector<std::tuple<i64, i64, i64>> {\n std::vector<std::tuple<i64, i64, i64>> ret;\n auto [x, y, z] = ps[i];\n auto [nx, ny, nz] = ps[j];\n rep(a, 0, 2) {\n rep(b, 0, 2) {\n rep(c, 0, 2) {\n int px = nx + s * a;\n int py = ny + s * b;\n int pz = nz + s * c;\n if (x <= px && px <= x + s && y <= py && py <= y + s &&\n z <= pz && pz <= z + s) {\n ret.emplace_back(px, py, pz);\n }\n }\n }\n }\n return ret;\n };\n rep(i, 0, n) {\n for (int j = i + 1; j < n; j++) {\n auto ret = f(i, j);\n if (ret.size() == 0) continue;\n auto rhs = f(j, i);\n assert(rhs.size() == ret.size());\n ret.insert(ret.end(), all(rhs));\n\n i64 res = 0;\n\n\n if (ret.size() == 2) {\n auto [x, y, z] = ret[0];\n auto [nx, ny, nz] = ret[1];\n res = 2 * (std::abs(nx - x) * std::abs(ny - y) +\n std::abs(ny - y) * std::abs(nz - z) +\n std::abs(nz - z) * std::abs(nx - x));\n } else if (ret.size() == 4 || ret.size() == 8) {\n auto [x, y, z] = ret[0];\n int idx = ret.size() / 2;\n while (idx < (int)ret.size()) {\n auto [nx, ny, nz] = ret[idx];\n if (x == nx || y == ny || z == nz) {\n idx++;\n }\n else {\n break;\n }\n }\n auto [nx, ny, nz] = ret[idx];\n res = 2 * (std::abs(nx - x) * std::abs(ny - y) +\n std::abs(ny - y) * std::abs(nz - z) +\n std::abs(nz - z) * std::abs(nx - x));\n } else {\n assert(0);\n }\n g.add_edge(i, j, res);\n }\n }\n std::vector<int> seen(n, -1);\n i64 ans = -1;\n std::vector<i64> a;\n int root = -1;\n auto dfs = [&](auto &&self, int v, int par = -1) -> void {\n seen[v] = 1;\n for (auto [nv, cost] : g[v]) {\n if (nv == par) continue;\n if(nv == root) {\n a.emplace_back(cost);\n continue;\n }\n if (seen[nv] < 0) {\n a.emplace_back(cost);\n self(self, nv, v);\n }\n }\n return;\n };\n rep(i, 0, n) {\n if (g[i].size() == 1 && seen[i] < 0) {\n a.clear();\n dfs(dfs, i);\n if ((int)a.size() < k - 1) continue;\n i64 sum = 0;\n rep(j,0,k-1) {\n sum += a[j];\n }\n chmax(ans, sum);\n int l = 0, r = k-1;\n while(r < (int)a.size()) {\n sum -= a[l++];\n sum += a[r++];\n chmax(ans, sum);\n }\n }\n }\n rep(i,0,n) {\n if(seen[i] < 0) {\n a.clear();\n root = i;\n dfs(dfs, i);\n if((int)a.size() < k-1) continue;\n if((int)a.size() == k) {\n chmax(ans, std::accumulate(all(a), i64(0)));\n continue;\n }\n {\n auto b = a;\n a.insert(a.end(), all(b));\n }\n i64 sum = 0;\n rep(j,0,k-1) {\n sum += a[j];\n }\n int l = 0, r = k-1;\n while(r < (int)a.size()) {\n sum -= a[l++];\n sum += a[r++];\n chmax(ans, sum);\n }\n }\n }\n if(ans > 0) {\n ans = i64(s) * i64(s) * 6 * k - ans;\n }\n std::cout << ans << '\\n';\n }\n}\n\n} // namespace ebi\n\nint main() {\n std::cout << std::fixed << std::setprecision(15);\n std::cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n int t = 1;\n // std::cin >> t;\n while (t--) {\n ebi::main_();\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3480,"score_of_the_acc":-0.0628,"final_rank":6},{"submission_id":"aoj_1612_6717176","code_snippet":"using namespace std;\n#include <bits/stdc++.h>\n\n#define ll long long\n#define ul unsigned long\n#define dd long double\n#define MAX 9223372036854775807\n#define REP(i,st,N) for(ll i=st; i<N; i++)\n\nll sp;\n\nll solve(vector<ll>& sq1, vector<ll>& sq2, ll s) {\n\tvector<ll> e(3);\n\tREP(i, 0, 3) {\n\t\tll mi = min(sq1[i], sq2[i]);\n\t\tll ma = max(sq1[i], sq2[i]);\n\t\te[i] = max(mi + s - ma, 0LL);\n\t\tif (e[i] == 0) return 0;\n\t}\n\tll sum = 0;\n\tREP(i, 0, 3) sum += 2 * e[i] * e[(i + 1) % 3];\n\treturn sum;\n}\n\nll dfs(vector<vector<pair<ll, ll>>>& g, ll st, ll pre, ll k, ll initK, vector<bool>& done) {\n\tll ans = -1;\n\tif (k == 0) {\n\t\tfor (pair<ll, ll> p : g[st]) if (p.first == sp && initK != 2) return p.second;\n\t\treturn 0;\n\t}\n\n\tfor (pair<ll, ll> p : g[st]) if (p.first != pre && !done[p.first]) {\n\t\tdone[p.first] = true;\n\t\tll t = dfs(g, p.first, st, k - 1, initK, done);\n\t\tif (t >= 0) t += p.second;\n\t\tans = max(ans, t);\n\t\tdone[p.first] = false;\n\t}\n\treturn ans;\n}\n\nint main() {\n\twhile (1) {\n\t\tll n, k, s; cin >> n >> k >> s;\n\t\tif (!(n || k || s)) break;\n\t\tvector<vector<ll>> sq;\n\t\tll ma = 6 * s * s * k;\n\t\tREP(i, 0, n) {\n\t\t\tvector<ll> c(3);\n\t\t\tcin >> c[0] >> c[1] >> c[2];\n\t\t\tsq.push_back(c);\n\t\t}\n\t\tif (n == 1 || k == 1) {\n\t\t\tcout << ma << endl;\n\t\t\tcontinue;\n\t\t}\n\t\tvector<vector<pair<ll, ll>>> g(n);\n\t\tREP(i, 0, n) REP(j, i + 1, n) {\n\t\t\tll x = solve(sq[i], sq[j], s);\n\t\t\tif (x > 0) {\n\t\t\t\tg[i].push_back({ j,x });\n\t\t\t\tg[j].push_back({ i,x });\n\t\t\t}\n\t\t}\n\t\tll x = 0;\n\t\tvector<bool> done(n, false);\n\t\tREP(i, 0, n) {\n\t\t\tsp = i;\n\t\t\tx = max(x, dfs(g, i, -1, k - 1,k, done));\n\t\t}\n\t\tif (x <= 0) cout << -1 << endl;\n\t\telse cout << ma - x << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3456,"score_of_the_acc":-0.0564,"final_rank":5},{"submission_id":"aoj_1612_6637783","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\nusing vl = vector<ll>;\ntemplate<class T> using vc = vector<T>;\ntemplate<class T> using vvc = vector<vector<T>>;\n\n#define eb emplace_back\n#define all(x) (x).begin(), (x).end()\n#define rep(i, n) for (ll i = 0; i < (n); i++)\n#define repr(i, n) for (ll i = (n)-1; i >= 0; i--)\n#define repe(i, l, r) for (ll i = (l); i < (r); i++)\n#define reper(i, l, r) for (ll i = (r)-1; i >= (l); i--)\n#define repa(i,n) for (auto& i: n)\n\ntemplate<class T1, class T2> inline bool chmax(T1 &a, const T2 &b) {if (a<b) { a=b; return 1;} return 0;}\ntemplate<class T1, class T2> inline bool chmin(T1 &a, const T2 &b) {if (b<a) { a=b; return 1;} return 0;}\n\nstruct init{init(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);cerr<<fixed<<setprecision(15);}}init_;\n\ntemplate <typename T, typename U> ostream& operator<<(ostream&out,const pair<T, U>&a){return out<<a.first<<' '<<a.second;}\ntemplate <typename T> ostream& operator<<(ostream&out, const vector<T>&a){for(auto it=a.begin();it!= a.end();){out<<*it;if(++it!=a.end())out<<' ';}return out;}\ntemplate <typename T, size_t N> ostream& operator<<(ostream&out, const array<T, N>&a){for(auto it=a.begin();it!= a.end();){out<<*it;if(++it!=a.end())out<<' ';}return out;}\ntemplate <typename T> ostream& operator<<(ostream&out, const set<T>&a){for(auto it=a.begin();it!=a.end();){out<<*it;if(++it!=a.end())out<<' ';}return out;}\ntemplate <typename T, typename U> ostream& operator<<(ostream&out, const map<T, U>&a){for(auto it=a.begin();it!=a.end();){out<<*it;if(++it!=a.end())out<<'\\n';}return out;}\n\n#ifdef DEBUG\ntemplate <class T, class N> void verr(const vector<T>& a, const N& n) { rep(i, n) cerr << a[i] << \" \"; cerr << endl; }\ntemplate <class T, class N, size_t AN> void verr(const array<T, AN>& a, const N& n) { rep(i, n) cerr << a[i] << \" \"; cerr << endl; }\nll dbgt = 1; void err() { cerr << \"passed \" << dbgt++ << endl; }\ntemplate<class H, class... T> void err(H&& h,T&&... t){ cerr<< h << (sizeof...(t)?\" \":\"\\n\") << flush; if(sizeof...(t)>0) err(forward<T>(t)...); }\n#else\nvoid err(){}\ntemplate <class H, class... T>\nvoid err(H &&h, T &&...t) {}\ntemplate <class H, class... T>\nvoid verr(H &&h, T &&...t) {}\n#endif\n\nconst ll INF = 4e18;\nconst ld EPS = 1e-11;\nconst ld PI = acos(-1.0L);\n// const ll MOD = 1e9 + 7;\nconst ll MOD = 998244353;\n//--------------------------------------------------------------------------------//\nstruct point {\n int x, y, z;\n point(){}\n point(int x, int y, int z): x(x), y(y), z(z){}\n};\n\nstruct UnionFind {\nprivate:\n vector<int> par;\n vector<int> count;\n vector<int> rank;\npublic:\n UnionFind(int N) {\n count.assign(N, 1);\n rank.assign(N, 0);\n par.assign(N, 0);\n rep(i, N) par[i] = i;\n }\n\n int root(int x) {\n if (par[x] == x)\n return x;\n else {\n par[x] = root(par[x]);\n return par[x];\n }\n }\n\n void unite(int x, int y) {\n x = root(x), y = root(y);\n if (x == y) return;\n if (rank[x] < rank[y])\n swap(x, y);\n else if (rank[x] == rank[y])\n rank[y]++;\n par[y] = x;\n count[x] += count[y];\n return;\n }\n\n int size(int x) {\n return count[root(x)];\n }\n\n bool issame(int x, int y) {\n return root(x) == root(y);\n }\n};\nusing UF = struct UnionFind;\n\n\nvoid solve(int N, int K, int S){\n // err(N, K, S);\n vc<point> ps(N);\n rep(i, N) cin >> ps[i].x >> ps[i].y >> ps[i].z;\n if(K == 1) {\n cout << 6 * S * S << endl;\n return;\n }\n\n auto dup = [&](point p1, point p2) -> int {\n ll s = 1, ssum = 0;\n if (p1.x >= p2.x + S or p2.x >= p1.x + S) return 0;\n int dx = min(p1.x + S - p2.x, p2.x + S - p1.x);\n if(p1.y >= p2.y + S or p2.y >= p1.y + S) return 0;\n int dy = min(p1.y + S - p2.y, p2.y + S - p1.y);\n if (p1.z >= p2.z + S or p2.z >= p1.z + S) return 0;\n int dz = min(p1.z + S - p2.z, p2.z + S - p1.z);\n ssum = 2 * (dx * dy + dy * dz + dz * dx);\n return ssum;\n };\n\n UF ufall(N);\n vvc<pair<int, int>> G(N);\n rep(i, N) repe(j, i + 1, N) {\n auto s = dup(ps[i], ps[j]);\n if(s > 0) {\n G[i].eb(j, s);\n G[j].eb(i, s);\n ufall.unite(i, j);\n }\n }\n\n ll ans = INF;\n rep(rt, N) {\n if (ufall.size(rt) < K) continue;\n\n bool iscycle = true;\n int v1;\n rep(i, N) {\n if (!ufall.issame(i, rt)) continue;\n if (G[i].size() < 2) {\n iscycle = false;\n v1 = i;\n }\n }\n\n if (iscycle) {\n vl es;\n int cur = rt, par = G[cur][0].first;\n int ncur, npar;\n do {\n for(auto[to, ts]: G[cur]) {\n if (to == par) continue;\n es.eb(ts);\n tie(ncur, npar) = {to, cur};\n }\n // err(\"cp\", cur, par);\n tie(cur, par) = {ncur, npar};\n } while (cur != rt);\n int en = es.size();\n if(ufall.size(rt) == K) {\n chmin(ans, K * 6 * S * S - accumulate(all(es), 0ll));\n // err(\"pass\", K * 6 * S * S - accumulate(all(es), 0ll), en);\n continue;\n }\n vl acc(en * 2 + 1);\n rep(i, 2 * en) acc[i + 1] = acc[i] + es[i % en];\n repe(i, K - 1, en * 2) chmin(ans, K * 6 * S * S - (acc[i] - acc[i - K + 1]));\n } else {\n vl es;\n int cur = v1, par = -1;\n int ncur, npar;\n while (true) {\n bool update = false;\n for(auto[to, ts]: G[cur]) {\n if (to == par) continue;\n es.eb(ts);\n update = true;\n tie(ncur, npar) = {to, cur};\n }\n if (!update) break;\n tie(cur, par) = {ncur, npar};\n }\n int en = es.size();\n vl acc(en + 1);\n rep(i, en) acc[i + 1] = acc[i] + es[i];\n repe(i, K - 1, en + 1) chmin(ans, K * 6 * S * S - (acc[i] - acc[i - K + 1]));\n }\n }\n cout << (ans == INF ? -1 : ans) << endl;\n}\n\nint main() {\n int counter = 0;\n while (true) {\n int N, K, S;\n cin >> N >> K >> S;\n counter++;\n if (N == 0) break;\n solve(N, K, S);\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3440,"score_of_the_acc":-0.0522,"final_rank":4},{"submission_id":"aoj_1612_6026797","code_snippet":"//Let's join Kaede Takagaki Fan Club !!\n#pragma GCC optimize(\"Ofast\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <cstdio>\n#include <cstring>\n#include <cstdlib>\n#include <cmath>\n#include <ctime>\n#include <cassert>\n#include <string>\n#include <algorithm>\n#include <vector>\n#include <queue>\n#include <stack>\n#include <functional>\n#include <iostream>\n#include <map>\n#include <set>\n#include <unordered_map>\n#include <unordered_set>\n#include <cassert>\n#include <iomanip>\n#include <chrono>\n#include <random>\n#include <bitset>\n#include <complex>\n#include <ext/pb_ds/assoc_container.hpp>\n#include <ext/pb_ds/tree_policy.hpp>\nusing namespace std;\n#define int long long\n//#define L __int128\ntypedef long long ll;\ntypedef pair<int,int> P;\ntypedef pair<int,P> P1;\ntypedef pair<P,P> P2;\n#define pu push\n#define pb push_back\n#define eb emplace_back\n#define mp make_pair\n#define eps 1e-7\n#define INF 1000000000\n#define a first\n#define b second\n#define fi first\n#define sc second\n#define rng(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define rep(i,x) for(int i=0;i<x;i++)\n#define repn(i,x) for(int i=1;i<=x;i++)\n#define SORT(x) sort(x.begin(),x.end())\n#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())\n#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())\n#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())\n#define all(x) x.begin(),x.end()\n#define si(x) int(x.size())\n \n#ifdef LOCAL\n#define dmp(x) cerr<<__LINE__<<\" \"<<#x<<\" \"<<x<<endl\n#else\n#define dmp(x) void(0)\n#endif\n \ntemplate<class t,class u> bool chmax(t&a,u b){if(a<b){a=b;return true;}else return false;}\ntemplate<class t,class u> bool chmin(t&a,u b){if(b<a){a=b;return true;}else return false;}\n \ntemplate<class t> using vc=vector<t>;\n \ntemplate<class t,class u>\nostream& operator<<(ostream& os,const pair<t,u>& p){\n\treturn os<<\"{\"<<p.fi<<\",\"<<p.sc<<\"}\";\n}\n \ntemplate<class t> ostream& operator<<(ostream& os,const vc<t>& v){\n\tos<<\"{\";\n\tfor(auto e:v)os<<e<<\",\";\n\treturn os<<\"}\";\n}\n \n\ntemplate<class T>\nvoid o(const T &a,bool space=false){\n\tcout << a << (space?' ':'\\n');\n}\n//ios::sync_with_stdio(false);\n//const ll mod = 998244353;\nconst ll mod = 1000000007;\nmt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());\ntemplate<class T>\nvoid add(T&a,T b){\n\ta+=b;\n\tif(a >= mod) a-=mod;\n}\nll modpow(ll x,ll n){\n\tll res=1;\n\twhile(n>0){\n\t\tif(n&1) res=res*x%mod;\n\t\tx=x*x%mod;\n\t\tn>>=1;\n\t}\n\treturn res;\n}\n#define _sz 1\nll F[_sz],R[_sz];\nvoid make(){\n\tF[0] = 1;\n\tfor(int i=1;i<_sz;i++) F[i] = F[i-1]*i%mod;\n\tR[_sz-1] = modpow(F[_sz-1], mod-2);\n\tfor(int i=_sz-2;i>=0;i--) R[i] = R[i+1] * (i+1) % mod;\n}\nll C(int a,int b){\n\tif(b < 0 || a < b) return 0;\n\treturn F[a]*R[b]%mod*R[a-b]%mod;\n}\n//複数テストケースなので積み上げる変数はローカルに！\n//置けないなら必ず初期化！\nint n, k, s, x[2005], y[2005], z[2005];\nvoid solve(){\n\t//最初の入力は済んでいる\n\trep(i, n) cin >> x[i] >> y[i] >> z[i];\n\tauto area = [&](P p, P q){\n\t\tint x = min(p.a + s, q.a + s) - max(p.a, q.a);\n\t\tint y = min(p.b + s, q.b + s) - max(p.b, q.b);\n\t\tchmax(x, 0LL);\n\t\tchmax(y, 0LL);\n\t\treturn x*y;\n\t};\n\tvc<vc<P>>edge(n);\n\trep(i, n){\n\t\trep(j, i){\n\t\t\tint f = area(mp(x[j], y[j]), mp(x[i], y[i]));\n\t\t\tint g = area(mp(x[j], z[j]), mp(x[i], z[i]));\n\t\t\tint h = area(mp(z[j], y[j]), mp(z[i], y[i]));\n\t\t\tif(!f or !g or !h) continue;\n\t\t\t\n\t\t\tedge[i].eb(j, f + g + h);\n\t\t\tedge[j].eb(i, f + g + h);\n\t\t}\n\t}\n\tint ans = -1e18;\n\trep(i, n){\n\t\tif(k == 1){\n\t\t\tchmax(ans, 0LL);\n\t\t\tcontinue;\n\t\t}\n\t\tfor(auto a:edge[i]){\n\t\t\tvc<int>vis(n, 0);\n\t\t\tvis[i] = 1;\n\t\t\t\n\t\t\tint cur = a.a;\n\t\t\tint tmp = a.b;\n\t\t\tint zan = k-1;\n\t\t\twhile(1){\n\t\t\t\tif(vis[cur]) break;\n\t\t\t\tvis[cur] = 1;\n\t\t\t\tzan --;\n\t\t\t\tif(zan == 0) {\n\t\t\t\t\tif(k > 2){\n\t\t\t\t\t\tfor(auto a:edge[cur]){\n\t\t\t\t\t\t\tif(a.a == i){\n\t\t\t\t\t\t\t\ttmp += a.b;\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tfor(auto a:edge[cur]){\n\t\t\t\t\tif(!vis[a.a]) {\n\t\t\t\t\t\tcur = a.a;\n\t\t\t\t\t\ttmp += a.b;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t\tif(!zan) chmax(ans, tmp);\n\t\t}\n\t}\n\tif(ans < 0) o(-1);\n\telse o(2LL * (3LL*s*s*k - ans));\n}\nsigned main(){\n\t//cin.tie(0);\n\tios::sync_with_stdio(0);\n\tcout<<fixed<<setprecision(20);\n\twhile(true){\n\t\tcin>>n>>k>>s;\n\t\t//終了条件\n\t\tif(!n) return 0;\n\t\tsolve();\n\t}\n}","accuracy":1,"time_ms":10,"memory_kb":3244,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_1612_6022554","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <bitset>\n#include <climits>\n#include <string>\n#include <cmath>\n#include <bitset>\n#include <complex>\n#include <functional>\n#include <ctime>\n#include <cassert>\n#include <fstream>\n#include <stack>\n#include <random>\n#include <iomanip>\n#include <time.h>\n#include <list>\n#include <unordered_map>\n\n#include <algorithm>\n#include <array>\n\nusing namespace std;\ntypedef long long ll;\ntypedef long double dd;\ntypedef vector<ll> vl;\ntypedef vector<dd> vd;\ntypedef vector<vector<ll>> vvl;\ntypedef vector<vector<dd>> vvd;\n//#define i_7 (ll)(1E9+7)\n#define i_7 998244353\n#define i_5 i_7-2\nll mod(ll a){\n ll c=a%i_7;\n if(c>=0)return c;\n return c+i_7;\n}\ntypedef pair<ll,ll> l_l;\ntypedef pair<dd,dd> d_d;\nll inf=(ll)1E18;\n#define rep(i,l,r) for(ll i=l;i<=r;i++)\n#define pb push_back\nll max(ll a,ll b){if(a<b)return b;else return a;}\nll min(ll a,ll b){if(a>b)return b;else return a;}\ndd EPS=1E-6;\ndd PI=acos(-1);\n#define endl \"\\n\"\n#define fastio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);\n\n\n\nstruct Edge{\n ll to,cost;\n Edge(ll to, ll cost){\n this->to = to;\n this->cost = cost;\n }\n};\n\nll hoge;\n\nvoid dfs(ll idx, vector<bool> &seen, const vector<vector<Edge>> &v, vector<ll> &tmp){\n seen[idx] = true;\n hoge=idx;\n for(Edge e : v[idx]){\n if(seen[e.to])continue;\n tmp.pb(e.cost);\n dfs(e.to, seen, v, tmp);\n }\n}\n\n\nsigned main(){fastio\n while(true){\n ll n,K,s;cin>>n>>K>>s;\n if(n==0)break;\n vvl x(n);\n rep(i,0,n-1){\n x[i].resize(3);\n cin>>x[i][0]>>x[i][1]>>x[i][2];\n }\n vector<vector<Edge>> v(n);\n rep(i,0,n-1){\n rep(j,0,n-1){\n if(i>=j)continue;\n bool ok = true;\n vl u;\n rep(k,0,2){\n if(x[j][k]<=x[i][k] && x[i][k]<=x[j][k]+s){\n u.pb(x[j][k]+s-x[i][k]);\n }else if(x[i][k]<=x[j][k] && x[j][k]<=x[i][k]+s){\n u.pb(x[i][k]+s-x[j][k]);\n }else{\n ok = false;\n }\n }\n if(ok){\n ll pro=0;\n rep(k,0,2){\n rep(l,0,2){\n if(k<l){\n pro += 2*u[k]*u[l];\n }\n }\n }\n ll cost = pro;\n v[i].pb(Edge(j,cost));\n v[j].pb(Edge(i,cost));\n }\n }\n }\n vector<bool> seen(n, false);\n ll ans=inf;\n rep(i,0,n-1){\n if(seen[i])continue;\n if(v[i].size() == 0){\n if(K==1){\n ans = min(ans, 6*s*s);\n }\n continue;\n }\n vector<ll> tm;\n bool loop = false;\n if(v[i].size() == 1){\n dfs(i, seen, v, tm);\n }else{\n seen[i] = true;\n vector<ll> tmp;\n tmp.pb(v[i][0].cost);\n dfs(v[i][0].to, seen, v, tmp);\n if(hoge == v[i][1].to)loop = true;\n vector<ll> tmp2;\n tmp2.pb(v[i][1].cost);\n if(!seen[v[i][1].to]){\n dfs(v[i][1].to, seen, v, tmp2);\n }\n reverse(tmp2.begin(), tmp2.end());\n for(ll co : tmp2){\n tm.pb(co);\n }\n for(ll co : tmp){\n tm.pb(co);\n }\n }\n ll num;\n if(loop){\n num = tm.size();\n }else{\n num = tm.size() + 1;\n }\n if(num < K){\n continue;\n }\n ll m = tm.size();\n vl sum(m+1,0);\n rep(i,1,m){\n sum[i] = sum[i-1] + tm[i-1];\n }\n ll maxi = 0;\n if(loop){\n if(K==num){\n maxi = sum[m];\n }else{\n rep(j,K-1,m+(K-1)-1){\n if(j<=m){\n maxi = max(maxi, sum[j]-sum[j-(K-1)]);\n }else{\n maxi = max(maxi, sum[m]-sum[j-(K-1)]+sum[j-m]);\n }\n }\n }\n }else{\n rep(j,K-1,m){\n maxi = max(maxi, sum[j]-sum[j-(K-1)]);\n }\n }\n ans = min(ans, 6*s*s*K - maxi);\n }\n if(ans == inf){\n cout<<-1<<endl;\n }else{\n cout<<ans<<endl;\n }\n }\n \n \n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3508,"score_of_the_acc":-0.0703,"final_rank":7},{"submission_id":"aoj_1612_6015570","code_snippet":"#include<bits/stdc++.h>\nusing ll = long long;\n#define var auto\nconst char newl = '\\n';\n\nusing namespace std;\n\ntemplate<typename T1, typename T2> inline void chmin(T1& a, T2 b) { if (a > b) a = b; }\ntemplate<typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }\n\nconst ll inf = INT32_MAX;\n\nstruct Box;\nbool ow(Box a, Box b);\n\nll w;\n\nstruct Box {\n ll x, y, z;\n ll s() {\n return w * w * 6;\n }\n ll eats(Box& a) {\n if (not ow(*this, a)) return 0;\n var dx = w - abs(x - a.x);\n var dy = w - abs(y - a.y);\n var dz = w - abs(z - a.z);\n assert(dx <= w && dy <= w && dz <= w);\n ll res = 0;\n return (dx * dy + dy * dz + dz * dx) * 2;\n }\n};\n\nbool ow(Box a, Box b) {\n ll maxdist = 0;\n chmax(maxdist, abs(a.x - b.x));\n chmax(maxdist, abs(a.y - b.y));\n chmax(maxdist, abs(a.z - b.z));\n assert(maxdist != w);\n return maxdist < w;\n}\n\nstruct Boxes {\n ll s = 0;\n deque<Box> q;\n Box prev2;\n Box prev1;\n\n void check() {\n ll res = 0;\n for (int i = 0; i < q.size(); i++) {\n res += q[i].s();\n if (i == 0) continue;\n res -= q[i].eats(q[i - 1]);\n }\n if (res != s) {\n cout << \"\";\n }\n assert(res == s);\n }\n\n void push(Box cur) {\n check();\n if (q.size() != 0) {\n s -= cur.eats(q.back());\n }\n s += cur.s();\n q.emplace_back(cur);\n }\n void pop() {\n check();\n assert(!q.empty());\n var popped = q.front(); q.pop_front();\n s -= popped.s();\n if (q.size() == 0) return;\n s += popped.eats(q.front());\n }\n};\n\nstruct UnionFind {\n int num;\n vector<int> rs, ps;\n UnionFind(int n) :num(n), rs(n, 1), ps(n, 0) {\n iota(ps.begin(), ps.end(), 0);\n }\n int find(int x) {\n return (x == ps[x] ? x : ps[x] = find(ps[x]));\n }\n bool same(int x, int y) {\n return find(x) == find(y);\n }\n void unite(int x, int y) {\n x = find(x); y = find(y);\n if (x == y) return;\n if (rs[x] < rs[y]) swap(x, y);\n rs[x] += rs[y];\n ps[y] = x;\n num--;\n }\n int size(int x) {\n return rs[find(x)];\n }\n int count() const {\n return num;\n }\n};\n\nbool solve() {\n int n, k;\n cin >> n >> k >> w;\n if (n == 0) return false;\n vector<Box> v(n);\n for (var&& item : v) cin >> item.x >> item.y >> item.z;\n\n vector<vector<int>> graph(n);\n UnionFind uf(n);\n for (int i = 0; i < n; i++) {\n for (int j = i + 1; j < n; j++) {\n if (ow(v[i], v[j])) {\n uf.unite(i, j);\n graph[i].emplace_back(j);\n graph[j].emplace_back(i);\n }\n }\n }\n\n\n const ll inf = LLONG_MAX;\n ll res = inf;\n\n for (int id = 0; id < n; id++) {\n bool has_point = false;\n int first = -1;\n for (int i = 0; i < n; i++) {\n if (uf.find(i) != id) continue;\n if (graph[i].size() == 1) {\n if (not has_point) {\n first = i;\n }\n has_point = true;\n continue;\n }\n if (not has_point) {\n first = i;\n }\n }\n\n if (first == -1) continue;\n if (uf.size(first) < k) continue;\n\n int last = -1;\n int cur = first;\n Boxes b; b.push(v[cur]);\n\n while (b.q.size() < k) {\n for (var&& adj : graph[cur]) {\n if (adj == last) continue;\n b.push(v[adj]);\n last = cur;\n cur = adj;\n break;\n }\n }\n\n assert(b.q.size() == k);\n\n if (k != 1 && uf.size(first) == k && not has_point) {\n b.s -= b.q.front().eats(b.q.back());\n chmin(res, b.s);\n continue;\n }\n\n ll curres = b.s;\n\n int cnt = has_point ? (uf.size(first) - k) : (uf.size(first) - 1);\n for (int _ = 0; _ < cnt; _++) {\n b.pop();\n for (var&& adj : graph[cur]) {\n if (adj == last) continue;\n b.push(v[adj]);\n last = cur;\n cur = adj;\n break;\n }\n assert(b.q.size() == k);\n chmin(curres, b.s);\n }\n\n chmin(res, curres);\n }\n if (res == inf) res = -1;\n cout << res << endl;\n return true;\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n while (solve());\n}","accuracy":1,"time_ms":10,"memory_kb":3432,"score_of_the_acc":-0.0501,"final_rank":2},{"submission_id":"aoj_1612_6011336","code_snippet":"#include <bits/stdc++.h>\n//#include <atcoder/all>\n//using namespace atcoder;\n#pragma GCC target (\"avx2\")\n#pragma GCC optimization (\"O3\")\n#pragma GCC optimization (\"unroll-loops\")\nusing namespace std;\n \ntypedef vector<int> VI;\ntypedef vector<VI> VVI;\ntypedef vector<string> VS;\ntypedef pair<int, int> PII;\ntypedef pair<int, int> pii;\ntypedef pair<long long, long long> PLL;\ntypedef pair<int, PII> TIII;\n \ntypedef long long ll;\ntypedef long double ld;\ntypedef unsigned long long ull;\n \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 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 \n#define MOD 1000000007\n \ntemplate<class T1, class T2> inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;}\ntemplate<class T1, class T2> inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;}\nconst double EPS = 1e-8, PI = acos(-1);\nconst double pi = 3.141592653589793238462643383279;\n//ここから編集 \ntypedef string::const_iterator State;\nll GCD(ll a, ll b){\n return (b==0)?a:GCD(b, a%b);\n}\nll LCM(ll a, ll b){\n return a/GCD(a, b) * b;\n}\ntemplate< int mod >\nstruct ModInt {\n int x;\n \n ModInt() : x(0) {}\n \n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\n \n ModInt &operator+=(const ModInt &p) {\n if((x += p.x) >= mod) x -= mod;\n return *this;\n }\n \n ModInt &operator-=(const ModInt &p) {\n if((x += mod - p.x) >= mod) x -= mod;\n return *this;\n }\n \n ModInt &operator*=(const ModInt &p) {\n x = (int) (1LL * x * p.x % mod);\n return *this;\n }\n \n ModInt &operator/=(const ModInt &p) {\n *this *= p.inverse();\n return *this;\n }\n \n ModInt operator-() const { return ModInt(-x); }\n \n ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\n \n ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\n \n ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\n \n ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\n \n bool operator==(const ModInt &p) const { return x == p.x; }\n \n bool operator!=(const ModInt &p) const { return x != p.x; }\n \n ModInt inverse() const {\n int a = x, b = mod, u = 1, v = 0, t;\n while(b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return ModInt(u);\n }\n \n ModInt pow(int64_t n) const {\n ModInt ret(1), mul(x);\n while(n > 0) {\n if(n & 1) ret *= mul;\n mul *= mul;\n n >>= 1;\n }\n return ret;\n }\n \n friend ostream &operator<<(ostream &os, const ModInt &p) {\n return os << p.x;\n }\n \n friend istream &operator>>(istream &is, ModInt &a) {\n int64_t t;\n is >> t;\n a = ModInt< mod >(t);\n return (is);\n }\n \n static int get_mod() { return mod; }\n};\n \nusing modint = ModInt< 998244353 >;\ntemplate< typename T >\nstruct Combination {\n vector< T > _fact, _rfact, _inv;\n \n Combination(int sz) : _fact(sz + 1), _rfact(sz + 1), _inv(sz + 1) {\n _fact[0] = _rfact[sz] = _inv[0] = 1;\n for(int i = 1; i <= sz; i++) _fact[i] = _fact[i - 1] * i;\n _rfact[sz] /= _fact[sz];\n for(int i = sz - 1; i >= 0; i--) _rfact[i] = _rfact[i + 1] * (i + 1);\n for(int i = 1; i <= sz; i++) _inv[i] = _rfact[i] * _fact[i - 1];\n }\n \n inline T fact(int k) const { return _fact[k]; }\n \n inline T rfact(int k) const { return _rfact[k]; }\n \n inline T inv(int k) const { return _inv[k]; }\n \n T P(int n, int r) const {\n if(r < 0 || n < r) return 0;\n return fact(n) * rfact(n - r);\n }\n \n T C(int p, int q) const {\n if(q < 0 || p < q) return 0;\n return fact(p) * rfact(q) * rfact(p - q);\n }\n \n T H(int n, int r) const {\n if(n < 0 || r < 0) return (0);\n return r == 0 ? 1 : C(n + r - 1, r);\n }\n};\n \nll modpow(ll x, ll n, ll mod) {\n ll res = 1;\n x %= mod;\n if(x == 0) return 0;\n while(n) {\n if(n&1) res = (res * x) % mod;\n x = (x * x) % mod;\n n >>= 1;\n }\n return res;\n} \ninline long long mod(long long a, long long m) {\n return (a % m + m) % m;\n}\ntemplate<typename T> \nstruct BIT{\n int N;\n std::vector<T> node;\n BIT(){}\n BIT(int n){\n N = n;\n node.resize(N+10);\n }\n void build(int n) {\n N = n;\n node.resize(N+10);\n }\n /* a: 1-indexed */\n void add(int a, T x){\n for(int i=a; i<(int)node.size(); i += i & -i) node[i] += x;\n }\n\n /* [1, a] */\n T sum(int a){\n T res = 0;\n for(int x=a; x>0; x -= x & -x) res += node[x];\n return res;\n }\n\n /* [l, r] */\n T rangesum(int l, int r){\n return sum(r) - sum(l-1);\n }\n\n /* \n a1+a2+...+aw >= valとなるような最小のwを返す\n @verify https://codeforces.com/contest/992/problem/E\n */\n int lower_bound(T val) {\n if(val < 0) return 0;\n\n int res = 0;\n int n = 1; \n while (n < N) n *= 2;\n\n T tv=0;\n for (int k = n; k > 0; k /= 2) {\n if(res + k < N && node[res + k] < val){\n val -= node[res+k];\n res += k;\n }\n }\n return res+1; \n }\n};\nstruct UnionFind{\n std::vector<int> par;\n std::vector<int> siz;\n\n UnionFind(int sz_): par(sz_), siz(sz_) {\n for(int i=0; i<sz_; ++i) par[i] = i, siz[i] = 1;\n }\n\n void init(int sz_){\n par.resize(sz_);\n siz.resize(sz_);\n for(int i=0; i<sz_; ++i) par[i] = i, siz[i] = 1;\n }\n\n int root(int x){\n if(x == par[x]) return x;\n return par[x] = root(par[x]);\n }\n\n bool merge(int x, int y){\n x = root(x), y = root(y);\n if(x == y) return false;\n if(siz[x] < siz[y]) std::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};\nstruct RollingHash{\n\n using ull = unsigned long long;\n const ull mod = (1ULL << 61) - 1;\n const ull MASK30 = (1ULL << 30) - 1;\n const ull MASK31 = (1ULL << 31) - 1;\n\n const ull MASK61 = mod;\n\n ull base;\n int n;\n vector<ull> hash, pow;\n\n RollingHash(const string &s)\n {\n random_device rnd;\n mt19937_64 mt(rnd());\n base = 1001;\n \n n = (int)s.size();\n hash.assign(n+1, 0);\n pow.assign(n+1, 1);\n \n for(int i=0; i<n; i++){\n hash[i+1] = calc_mod(mul(hash[i], base) + s[i]);\n pow[i+1] = calc_mod(mul(pow[i], base));\n }\n }\n\n ull calc_mod(ull x){\n ull xu = x >> 61;\n ull xd = x & MASK61;\n ull res = xu + xd;\n if(res >= mod) res -= mod;\n return res;\n }\n\n ull mul(ull a, ull b){\n ull au = a >> 31;\n ull ad = a & MASK31;\n ull bu = b >> 31;\n ull bd = b & MASK31;\n ull mid = ad * bu + au * bd;\n ull midu = mid >> 30;\n ull midd = mid & MASK30;\n return calc_mod(au * bu * 2 + midu + (midd << 31) + ad * bd);\n }\n\n //[l,r)のハッシュ値\n inline ull get(int l, int r){\n ull res = calc_mod(hash[r] + mod*3-mul(hash[l], pow[r-l]));\n return res;\n }\n //string tのハッシュ値\n inline ull get(string t){\n ull res = 0;\n for(int i=0; i<t.size(); i++){\n res = calc_mod(mul(res, base)+t[i]);\n }\n return res;\n }\n //string s中のtの数をカウント\n inline int count(string t) {\n if(t.size() > n) return 0;\n auto hs = get(t);\n int res = 0;\n for(int i=0; i<n-t.size()+1; i++){\n if(get(i, i+t.size()) == hs) res++; \n }\n return res;\n }\n\n /* \n concat \n @verify https://codeforces.com/problemset/problem/514/C\n */\n inline ull concat(ull h1, ull h2, int h2len){\n return calc_mod(h2 + mul(h1, pow[h2len]));\n }\n\n // LCPを求める S[a:] T[b:]\n inline int LCP(int a, int b){\n int len = min((int)hash.size()-a, (int)hash.size()-b);\n \n int lb = -1, ub = len;\n while(ub-lb>1){\n int mid = (lb+ub)/2;\n\n if(get(a, a+mid) == get(b, b+mid)) lb = mid;\n else ub = mid;\n }\n return lb;\n }\n};\nint h;\nll ans = (1LL<<60);\nll x[2010], y[2010], z[2010];\nint n, k, s;\nset<int> st;\nvoid dfs(int v, int p, int nokori, vector<vector<pair<ll,ll>>> &g, ll sum) {\n ll t = sum;\n for(auto[u, cost]: g[v]) {\n if(u != p && st.find(u) != st.end()) t -= cost;\n }\n\n if(nokori == 0) {\n ans = min(ans, t);\n return ;\n }\n \n for(auto[u, cost]: g[v]) {\n if(p == u) continue;\n if(st.find(u) != st.end()) continue;\n st.insert(u);\n dfs(u, v, nokori-1, g, t + 6 * s * s - cost);\n st.erase(u);\n }\n\n}\nint main() { \n cin.tie(0);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(12);\n\n while(cin >> n >> k >> s) {\n if(n == 0 && k == 0 && s == 0) break;\n REP(i,n) cin >> x[i] >> y[i] >> z[i];\n vector<vector<pair<ll,ll>>> g(n);\n st.clear();\n ans = (1LL<<60);\n for(int i=0; i<n; i++) {\n for(int j=i+1; j<n; j++) {\n\n int ax = x[i], bx = x[i] + s, cx = x[j], dx = x[j] + s;\n if(bx < cx) continue;\n if(dx < ax) continue;\n int ay = y[i], by = y[i] + s, cy = y[j], dy = y[j] + s;\n if(by < cy) continue;\n if(dy < ay) continue;\n int az = z[i], bz = z[i] + s, cz = z[j], dz = z[j] + s;\n if(bz < cz) continue;\n if(dz < az) continue;\n\n \n vector<ll> a;\n if(ax <= cx && cx <= bx) a.push_back(bx-cx);\n else a.push_back(dx-ax);\n if(ay <= cy && cy <= by) a.push_back(by-cy);\n else a.push_back(dy-ay);\n if(az <= cz && cz <= bz) a.push_back(bz-cz);\n else a.push_back(dz-az);\n ll t = 2*a[0]*a[1]+2*a[0]*a[2]+2*a[1]*a[2];\n g[i].push_back({j,t});\n g[j].push_back({i,t});\n }\n }\n for(int i=0; i<n; i++) {\n st.insert(i);\n dfs(i, -1, k-1, g, 6 * s * s);\n st.erase(i);\n }\n if(ans == (1LL<<60)) ans = -1;\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":70,"memory_kb":3480,"score_of_the_acc":-0.6083,"final_rank":16},{"submission_id":"aoj_1612_5990703","code_snippet":"#include <bits/stdc++.h>\n#define rep(i,n) for(int i = 0; i < (n); i++)\nusing namespace std;\ntypedef long long ll;\n\nint main(){\n cin.tie(0);\n ios::sync_with_stdio(0);\n \n while(true) {\n int n,k,s; cin >> n >> k >> s; if(n == 0) break;\n vector<vector<pair<int,int>>> G(n);\n vector<int> x(n), y(n), z(n);\n rep(i,n) cin >> x[i] >> y[i] >> z[i];\n\n if(k == 1) { cout << 6 * s * s << endl; continue; }\n\n auto calc = [&](int i, int j) {\n int dx = s - abs(x[i] - x[j]);\n int dy = s - abs(y[i] - y[j]);\n int dz = s - abs(z[i] - z[j]);\n if(dx <= 0 || dy <= 0 || dz <= 0) return 0;\n return 2 * (dx * dy + dy * dz + dz * dx);\n };\n\n rep(i,n)rep(j,n)if(i < j) {\n int cost = calc(i, j);\n if(cost != 0) {\n G[i].push_back({j, cost});\n G[j].push_back({i, cost});\n }\n }\n\n int ans = 0;\n rep(S,n) {\n for(auto to : G[S]) {\n int T = to.first;\n vector<int> can;\n vector<bool> used(n, false);\n can.push_back(T); used[T] = true;\n can.push_back(S); used[S] = true;\n\n bool f = (k == 2);\n rep(_,k-2) {\n f = false;\n for(auto nt : G[T]) {\n if(!used[nt.first]) {\n f = true;\n used[nt.first] = true;\n T = nt.first;\n can.push_back(T);\n break;\n }\n }\n }\n\n if(!f) continue;\n int sum = 0;\n for(int i : can) for(int j : can) \n if(i < j) sum += calc(i, j);\n ans = max(ans, sum);\n }\n }\n \n cout << (ans == 0 ? -1 : 6 * s * s * k - ans) << endl;\n }\n}","accuracy":1,"time_ms":120,"memory_kb":3520,"score_of_the_acc":-1.0735,"final_rank":20},{"submission_id":"aoj_1612_5943625","code_snippet":"//#include<atcoder/all>\n\n#ifndef ATCODER_MODINT_HPP\n#define ATCODER_MODINT_HPP 1\n\n//#include <atcoder/internal_math>\n#ifndef ATCODER_INTERNAL_MATH_HPP\n#define ATCODER_INTERNAL_MATH_HPP 1\n\n#include <utility>\n\nnamespace atcoder {\n\nnamespace internal {\n\n// @param m `1 <= m`\n// @return x mod m\nconstexpr long long safe_mod(long long x, long long m) {\n x %= m;\n if (x < 0) x += m;\n return x;\n}\n\n// Fast moduler by barrett reduction\n// Reference: https://en.wikipedia.org/wiki/Barrett_reduction\n// NOTE: reconsider after Ice Lake\nstruct barrett {\n unsigned int _m;\n unsigned long long im;\n\n // @param m `1 <= m`\n barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}\n\n // @return m\n unsigned int umod() const { return _m; }\n\n // @param a `0 <= a < m`\n // @param b `0 <= b < m`\n // @return `a * b % m`\n unsigned int mul(unsigned int a, unsigned int b) const {\n // [1] m = 1\n // a = b = im = 0, so okay\n\n // [2] m >= 2\n // im = ceil(2^64 / m)\n // -> im * m = 2^64 + r (0 <= r < m)\n // let z = a*b = c*m + d (0 <= c, d < m)\n // a*b * im = (c*m + d) * im = c*(im*m) + d*im = c*2^64 + c*r + d*im\n // c*r + d*im < m * m + m * im < m * m + 2^64 + m <= 2^64 + m * (m + 1) < 2^64 * 2\n // ((ab * im) >> 64) == c or c + 1\n unsigned long long z = a;\n z *= b;\n#ifdef _MSC_VER\n unsigned long long x;\n _umul128(z, im, &x);\n#else\n unsigned long long x =\n (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\n#endif\n unsigned int v = (unsigned int)(z - x * _m);\n if (_m <= v) v += _m;\n return v;\n }\n};\n\n// @param n `0 <= n`\n// @param m `1 <= m`\n// @return `(x ** n) % m`\nconstexpr long long pow_mod_constexpr(long long x, long long n, int m) {\n if (m == 1) return 0;\n unsigned int _m = (unsigned int)(m);\n unsigned long long r = 1;\n unsigned long long y = safe_mod(x, m);\n while (n) {\n if (n & 1) r = (r * y) % _m;\n y = (y * y) % _m;\n n >>= 1;\n }\n return r;\n}\n\n// Reference:\n// M. Forisek and J. Jancina,\n// Fast Primality Testing for Integers That Fit into a Machine Word\n// @param n `0 <= n`\nconstexpr bool is_prime_constexpr(int n) {\n if (n <= 1) return false;\n if (n == 2 || n == 7 || n == 61) return true;\n if (n % 2 == 0) return false;\n long long d = n - 1;\n while (d % 2 == 0) d /= 2;\n for (long long a : {2, 7, 61}) {\n long long t = d;\n long long y = pow_mod_constexpr(a, t, n);\n while (t != n - 1 && y != 1 && y != n - 1) {\n y = y * y % n;\n t <<= 1;\n }\n if (y != n - 1 && t % 2 == 0) {\n return false;\n }\n }\n return true;\n}\ntemplate <int n> constexpr bool is_prime = is_prime_constexpr(n);\n\n// @param b `1 <= b`\n// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g\nconstexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\n a = safe_mod(a, b);\n if (a == 0) return {b, 0};\n\n // Contracts:\n // [1] s - m0 * a = 0 (mod b)\n // [2] t - m1 * a = 0 (mod b)\n // [3] s * |m1| + t * |m0| <= b\n long long s = b, t = a;\n long long m0 = 0, m1 = 1;\n\n while (t) {\n long long u = s / t;\n s -= t * u;\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\n\n // [3]:\n // (s - t * u) * |m1| + t * |m0 - m1 * u|\n // <= s * |m1| - t * u * |m1| + t * (|m0| + |m1| * u)\n // = s * |m1| + t * |m0| <= b\n\n auto tmp = s;\n s = t;\n t = tmp;\n tmp = m0;\n m0 = m1;\n m1 = tmp;\n }\n // by [3]: |m0| <= b/g\n // by g != b: |m0| < b/g\n if (m0 < 0) m0 += b / s;\n return {s, m0};\n}\n\n// Compile time primitive root\n// @param m must be prime\n// @return primitive root (and minimum in now)\nconstexpr int primitive_root_constexpr(int m) {\n if (m == 2) return 1;\n if (m == 167772161) return 3;\n if (m == 469762049) return 3;\n if (m == 754974721) return 11;\n if (m == 998244353) return 3;\n int divs[20] = {};\n divs[0] = 2;\n int cnt = 1;\n int x = (m - 1) / 2;\n while (x % 2 == 0) x /= 2;\n for (int i = 3; (long long)(i)*i <= x; i += 2) {\n if (x % i == 0) {\n divs[cnt++] = i;\n while (x % i == 0) {\n x /= i;\n }\n }\n }\n if (x > 1) {\n divs[cnt++] = x;\n }\n for (int g = 2;; g++) {\n bool ok = true;\n for (int i = 0; i < cnt; i++) {\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\n ok = false;\n break;\n }\n }\n if (ok) return g;\n }\n}\ntemplate <int m> constexpr int primitive_root = primitive_root_constexpr(m);\n\n} // namespace internal\n\n} // namespace atcoder\n\n#endif // ATCODER_INTERNAL_MATH_HPP\n\n//#include <atcoder/internal_type_traits>\n#ifndef ATCODER_INTERNAL_TYPE_TRAITS_HPP\n#define ATCODER_INTERNAL_TYPE_TRAITS_HPP 1\n\n#include <cassert>\n#include <numeric>\n#include <type_traits>\n\nnamespace atcoder {\n\nnamespace internal {\n\n#ifndef _MSC_VER\ntemplate <class T>\nusing is_signed_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value ||\n std::is_same<T, __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int128 =\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\n std::is_same<T, unsigned __int128>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing make_unsigned_int128 =\n typename std::conditional<std::is_same<T, __int128_t>::value,\n __uint128_t,\n unsigned __int128>;\n\ntemplate <class T>\nusing is_integral = typename std::conditional<std::is_integral<T>::value ||\n is_signed_int128<T>::value ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_signed_int = typename std::conditional<(is_integral<T>::value &&\n std::is_signed<T>::value) ||\n is_signed_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<(is_integral<T>::value &&\n std::is_unsigned<T>::value) ||\n is_unsigned_int128<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<\n is_signed_int128<T>::value,\n make_unsigned_int128<T>,\n typename std::conditional<std::is_signed<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type>::type;\n\n#else\n\ntemplate <class T> using is_integral = typename std::is_integral<T>;\n\ntemplate <class T>\nusing is_signed_int =\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing is_unsigned_int =\n typename std::conditional<is_integral<T>::value &&\n std::is_unsigned<T>::value,\n std::true_type,\n std::false_type>::type;\n\ntemplate <class T>\nusing to_unsigned = typename std::conditional<is_signed_int<T>::value,\n std::make_unsigned<T>,\n std::common_type<T>>::type;\n\n#endif\n\ntemplate <class T>\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\n\ntemplate <class T>\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\n\ntemplate <class T> using to_unsigned_t = typename to_unsigned<T>::type;\n\n} // namespace internal\n\n} // namespace atcoder\n\n#endif // ATCODER_INTERNAL_TYPE_TRAITS_HPP\n\n#include <cassert>\n#include <numeric>\n#include <type_traits>\n\n#ifdef _MSC_VER\n#include <intrin.h>\n#endif\n\nnamespace atcoder {\n\nnamespace internal {\n\nstruct modint_base {};\nstruct static_modint_base : modint_base {};\n\ntemplate <class T> using is_modint = std::is_base_of<modint_base, T>;\ntemplate <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\n\n} // namespace internal\n\ntemplate <int m, std::enable_if_t<(1 <= m)>* = nullptr>\nstruct static_modint : internal::static_modint_base {\n using mint = static_modint;\n\n public:\n static constexpr int mod() { return m; }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n static_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n static_modint(T v) {\n long long x = (long long)(v % (long long)(umod()));\n if (x < 0) x += umod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n static_modint(T v) {\n _v = (unsigned int)(v % umod());\n }\n static_modint(bool v) { _v = ((unsigned int)(v) % umod()); }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v -= rhs._v;\n if (_v >= umod()) _v += umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n unsigned long long z = _v;\n z *= rhs._v;\n _v = (unsigned int)(z % umod());\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n if (prime) {\n assert(_v);\n return pow(umod() - 2);\n } else {\n auto eg = internal::inv_gcd(_v, m);\n assert(eg.first == 1);\n return eg.second;\n }\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static constexpr unsigned int umod() { return m; }\n static constexpr bool prime = internal::is_prime<m>;\n};\n\ntemplate <int id> struct dynamic_modint : internal::modint_base {\n using mint = dynamic_modint;\n\n public:\n static int mod() { return (int)(bt.umod()); }\n static void set_mod(int m) {\n assert(1 <= m);\n bt = internal::barrett(m);\n }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n\n dynamic_modint() : _v(0) {}\n template <class T, internal::is_signed_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n long long x = (long long)(v % (long long)(mod()));\n if (x < 0) x += mod();\n _v = (unsigned int)(x);\n }\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\n dynamic_modint(T v) {\n _v = (unsigned int)(v % mod());\n }\n dynamic_modint(bool v) { _v = ((unsigned int)(v) % mod()); }\n\n unsigned int val() const { return _v; }\n\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n\n mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator-=(const mint& rhs) {\n _v += mod() - rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n mint& operator*=(const mint& rhs) {\n _v = bt.mul(_v, rhs._v);\n return *this;\n }\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n\n mint operator+() const { return *this; }\n mint operator-() const { return mint() - *this; }\n\n mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n mint inv() const {\n auto eg = internal::inv_gcd(_v, mod());\n assert(eg.first == 1);\n return eg.second;\n }\n\n friend mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n\n private:\n unsigned int _v;\n static internal::barrett bt;\n static unsigned int umod() { return bt.umod(); }\n};\ntemplate <int id> internal::barrett dynamic_modint<id>::bt = 998244353;\n\nusing modint998244353 = static_modint<998244353>;\nusing modint1000000007 = static_modint<1000000007>;\nusing modint = dynamic_modint<-1>;\n\nnamespace internal {\n\ntemplate <class T>\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\n\ntemplate <class T>\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\n\ntemplate <class> struct is_dynamic_modint : public std::false_type {};\ntemplate <int id>\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\n\ntemplate <class T>\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\n\n} // namespace internal\n\n} // namespace atcoder\n\n#endif // ATCODER_MODINT_HPP\n\n\n////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\n\n#ifndef ATCODER_DSU_HPP\n#define ATCODER_DSU_HPP 1\n\n#include <algorithm>\n#include <cassert>\n#include <vector>\n\nnamespace atcoder {\n\n// Implement (union by size) + (path compression)\n// Reference:\n// Zvi Galil and Giuseppe F. Italiano,\n// Data structures and algorithms for disjoint set union problems\nstruct dsu {\n public:\n dsu() : _n(0) {}\n dsu(int n) : _n(n), parent_or_size(n, -1) {}\n\n int merge(int a, int b) {\n assert(0 <= a && a < _n);\n assert(0 <= b && b < _n);\n int x = leader(a), y = leader(b);\n if (x == y) return x;\n if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);\n parent_or_size[x] += parent_or_size[y];\n parent_or_size[y] = x;\n return x;\n }\n\n bool same(int a, int b) {\n assert(0 <= a && a < _n);\n assert(0 <= b && b < _n);\n return leader(a) == leader(b);\n }\n\n int leader(int a) {\n assert(0 <= a && a < _n);\n if (parent_or_size[a] < 0) return a;\n return parent_or_size[a] = leader(parent_or_size[a]);\n }\n\n int size(int a) {\n assert(0 <= a && a < _n);\n return -parent_or_size[leader(a)];\n }\n\n std::vector<std::vector<int>> groups() {\n std::vector<int> leader_buf(_n), group_size(_n);\n for (int i = 0; i < _n; i++) {\n leader_buf[i] = leader(i);\n group_size[leader_buf[i]]++;\n }\n std::vector<std::vector<int>> result(_n);\n for (int i = 0; i < _n; i++) {\n result[i].reserve(group_size[i]);\n }\n for (int i = 0; i < _n; i++) {\n result[leader_buf[i]].push_back(i);\n }\n result.erase(\n std::remove_if(result.begin(), result.end(),\n [&](const std::vector<int>& v) { return v.empty(); }),\n result.end());\n return result;\n }\n\n private:\n int _n;\n // root node: -1 * component size\n // otherwise: parent\n std::vector<int> parent_or_size;\n};\n\n} // namespace atcoder\n\n#endif // ATCODER_DSU_HPP\n\n\n\n\n\n\n\n\n\nusing namespace atcoder;\n\n#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n//typedef int ll;\n\nvoid mod_print(ll k){\n // const ll i_7=998244353;\n const ll i_7 =(ll)(1E9+7);\n auto mod=[&](ll a){\n ll c=a%i_7;\n if(c>=0)return c;\n return c+i_7;\n };\n ll P=50000;\n for(ll y=1;y<=P;y++){\n ll x=mod(y*k);\n if(abs(x)<=P||x+P>=i_7){\n if(x+P>=i_7){\n x-=i_7;\n }\n cerr<<x<<\"/\"<<y<<\" \";\n //cerr<<setprecision(5)<<(dd)x/(dd)y<<\" \";\n return;\n }\n }\n cerr<<\"nun\"<<endl;\n}\n/*\n#include <boost/multiprecision/cpp_int.hpp>\n#include <boost/multiprecision/cpp_dec_float.hpp>\nnamespace multi = boost::multiprecision;\ntypedef multi::cpp_int LL;\ntypedef multi::number<multi::cpp_dec_float<1024>> DD;// 仮数部が1024ビットの浮動小数点数型(TLEしたら小さくする)\n//*/\ntypedef long double dd;\ntypedef pair<ll,ll> l_l;\ntypedef pair<dd,dd> d_d;\nll inf=(ll)1E18;\n#define rep(i,l,r) for(ll i=l;i<=r;i++)\n#define rrep(i,r,l) for(ll i=r;i>=l;i--)\n#define pb push_back\nll max(ll a,ll b){if(a<b)return b;else return a;}\nll min(ll a,ll b){if(a>b)return b;else return a;}\ndd EPS=1E-12;\n#define fi first\n#define se second\n\n#define SORT(v) sort(v.begin(),v.end())\n#define ERASE(v) sort(v.begin(),v.end()); v.erase(unique(v.begin(),v.end()),v.end())\n#define POSL(v,x) (lower_bound(v.begin(),v.end(),x)-v.begin())\n#define POSU(v,x) (upper_bound(v.begin(),v.end(),x)-v.begin())\ntemplate<class T,class S>\ninline bool chmax(T &a, S b) {\n if(a < b) {\n a = (T)b;\n return true;\n }\n return false;\n}\ntemplate<class T,class S>\ninline bool chmin(T &a, S b) {\n if(a > b) {\n a = (T)b;\n return true;\n }\n return false;\n}\n#define all(c) c.begin(),c.end()\n\n//using mint = modint998244353;\nusing mint = modint1000000007;\n//using mint=modint;\n//using mint=static_modint<100>;\n//using mint=dd;\n//using mint=ll;\n\ntypedef vector<ll> vl;\ntypedef vector<vl> vvl;\ntypedef vector<vvl>vvvl;\ntypedef vector<mint>vi;\ntypedef vector<vi>vvi;\ntypedef vector<vvi>vvvi;\ntypedef vector<vvvi>vvvvi;\ntypedef vector<l_l>vl_l;\ntypedef vector<vl_l>vvl_l;\ntypedef vector<string>vs;\ntypedef vector<vs>vvs;\ntypedef vector<dd> vd;\ntypedef vector<vd> vvd;\ntypedef vector<vvd> vvvd;\ntypedef vector<d_d>vd_d;\ndd PI=acos((dd)-1);\n\n#define fastio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cout<<setprecision(20);\ntemplate <class T> using pq = priority_queue<T>;\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\n\n// g++ -std=gnu++17 -Wall -Wextra -O2 -DONLINE_JUDGE main.cpp && ./a.out\n#define endl \"\\n\" //インタラクティブで消す！！！！！！！！！！！！！！！！！！！！！\n#define popcount __builtin_popcountll\n#define SHUFFLE(v) shuffle(all(v),default_random_engine(chrono::system_clock::now().time_since_epoch().count()))\n//////////////////////////////////////////////////////////////////////////////\ntemplate<class S>\nvoid DEBUG_PRINT(S x){\n cerr<<x<<endl;\n}\ntemplate<class S,class T>\nvoid DEBUG_PRINT(pair<S,T>x){\n cerr<<\"(\"<<x.fi<<\",\"<<x.se<<\")\"<<endl;\n}\ntemplate<class S>\nvoid DEBUG_PRINT(vector<S> x){\n for(auto y:x)cerr<<setw(2)<<y<<\" \";\n cerr<<endl;\n}\ntemplate<class S,class T>\nvoid DEBUG_PRINT(vector<pair<S,T>>x){\n for(auto y:x)cerr<<\"(\"<<y.fi<<\",\"<<y.se<<\") \";\n cerr<<endl;\n}\ntemplate<class S>\nvoid DEBUG_PRINT(vector<vector<S>> x){\n cerr<<endl;\n for(auto y:x){\n for(auto z:y){\n cerr<<setw(2)<<z<<\" \";\n }cerr<<endl;\n }cerr<<endl;\n}\n\n#define TO_STRING_FOR_DEBUG(VariableName) # VariableName\n#ifdef LOCAL\n#define DEB(V) cerr<< TO_STRING_FOR_DEBUG(V) << \": \"; DEBUG_PRINT(V);\n#else\n#define DEB(V) void(0)\n#endif\n/////////////////////////////////////////////////////////////////////////////////////////\n\nvoid solve(){\n ll n,k,s;cin>>n>>k>>s;\n if(n==0)exit(0);\n vvl a(n,vl(3));\n rep(i,0,n-1)rep(j,0,2)cin>>a[i][j];\n \n if(k==1){\n cout<<6*s*s<<endl;return ;\n }\n \n vvl_l v(n);\n rep(i,0,n-1){\n rep(j,i+1,n-1){\n auto calc=[](vl a,vl b,ll s){\n vl v;\n rep(i,0,2){\n ll dis=abs(a[i]-b[i]);\n if(dis>=s){\n return 0ll;\n }else{\n v.pb(s-dis);\n }\n }\n ll ans=0;\n rep(i,0,2){\n rep(j,i+1,2){\n ans += v[i]*v[j];\n }\n }\n return ans*2;\n };\n ll E=calc(a[i],a[j],s);\n if(E==0)continue;\n v[i].pb({j,E});\n v[j].pb({i,E});\n }\n }\n rep(i,0,n-1){\n cerr<<i<<\":\";\n DEB(v[i]);\n }\n dsu d(n);\n rep(i,0,n-1){\n for(auto x:v[i]){\n d.merge(i,x.fi);\n }\n }\n map<l_l,ll>mp;\n rep(i,0,n-1){\n for(auto x:v[i]){\n mp[{i,x.fi}] = x.se;\n }\n }\n auto G=d.groups();\n vl used(n);\n ll MAX =0;\n for(auto g:G){\n ll sz=g.size();\n ll edge_cnt=0;\n for(auto x:g){\n for(auto y:v[x]){\n if(x>y.fi)continue;\n edge_cnt ++;\n }\n }\n assert(edge_cnt == sz || edge_cnt == sz-1);\n \n if(sz<k)continue;\n \n ll pos=g[0];\n if(edge_cnt == sz-1){\n for(auto x:g){\n if((int)v[x].size()==1){\n pos=x;\n break;\n }\n }\n assert((int)v[pos].size()==1);\n }\n \n vl vec={pos};\n used[pos]=true;\n while(1){\n bool bre=true;\n for(auto x:v[pos]){\n if(used[x.fi])continue;\n used[x.fi]=true;\n pos=x.fi;\n vec.pb(x.fi);\n bre=false;\n break;\n }\n if(bre)break;\n }\n assert((int)vec.size() == sz);\n \n auto callast=[&](vl v){\n rep(i,0,(int)v.size()-1){\n ll sum=0;\n rep(j,i,i+k-2){//k-1個\n if(j>=(int)v.size()){\n return;\n }\n sum += v[j];\n }\n chmax(MAX,sum);\n }\n };\n if(edge_cnt == sz-1){\n vl v;\n rep(i,0,sz-2){\n v.pb(mp[{vec[i],vec[i+1]}]);\n }\n callast(v);\n }else{\n if(sz==k){\n ll sum=0;\n rep(i,0,sz-1){//k個\n sum += mp[{vec[i%sz],vec[(i+1)%sz]}];\n }\n chmax(MAX,sum);\n }else{\n vl v;\n rep(i,0,2*sz){\n v.pb(mp[{vec[i%sz],vec[(i+1)%sz]}]);\n }\n callast(v);\n }\n }\n }\n if(MAX==0){\n cout<<-1<<endl;\n }else{\n cout<<k*6*s*s - MAX<<endl;\n }\n}\n\nsigned main(){fastio\n \n while(1){\n solve();\n }\n \n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3564,"score_of_the_acc":-0.0852,"final_rank":8}],"string":"[\n {\n \"submission_id\": \"aoj_1612_10578406\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nnamespace atcoder {\\n\\n// Implement (union by size) + (path compression)\\n// Reference:\\n// Zvi Galil and Giuseppe F. Italiano,\\n// Data structures and algorithms for disjoint set union problems\\nstruct dsu {\\n public:\\n dsu() : _n(0) {}\\n explicit dsu(int n) : _n(n), parent_or_size(n, -1) {}\\n\\n int merge(int a, int b) {\\n assert(0 <= a && a < _n);\\n assert(0 <= b && b < _n);\\n int x = leader(a), y = leader(b);\\n if (x == y) return x;\\n if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);\\n parent_or_size[x] += parent_or_size[y];\\n parent_or_size[y] = x;\\n return x;\\n }\\n\\n bool same(int a, int b) {\\n assert(0 <= a && a < _n);\\n assert(0 <= b && b < _n);\\n return leader(a) == leader(b);\\n }\\n\\n int leader(int a) {\\n assert(0 <= a && a < _n);\\n if (parent_or_size[a] < 0) return a;\\n return parent_or_size[a] = leader(parent_or_size[a]);\\n }\\n\\n int size(int a) {\\n assert(0 <= a && a < _n);\\n return -parent_or_size[leader(a)];\\n }\\n\\n std::vector<std::vector<int>> groups() {\\n std::vector<int> leader_buf(_n), group_size(_n);\\n for (int i = 0; i < _n; i++) {\\n leader_buf[i] = leader(i);\\n group_size[leader_buf[i]]++;\\n }\\n std::vector<std::vector<int>> result(_n);\\n for (int i = 0; i < _n; i++) {\\n result[i].reserve(group_size[i]);\\n }\\n for (int i = 0; i < _n; i++) {\\n result[leader_buf[i]].push_back(i);\\n }\\n result.erase(\\n std::remove_if(result.begin(), result.end(),\\n [&](const std::vector<int>& v) { return v.empty(); }),\\n result.end());\\n return result;\\n }\\n\\n private:\\n int _n;\\n // root node: -1 * component size\\n // otherwise: parent\\n std::vector<int> parent_or_size;\\n};\\n\\n} // namespace atcoder\\n/* BOOST MULTIPRECISION\\n#include<boost/multiprecision/cpp_int.hpp>\\nusing namespace boost::multiprecision;\\n//*/\\n\\ntypedef long long ll;\\n\\n#define rep(i, s, n) for (int i = (int)(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) begin(v),end(v)\\n\\ntemplate <typename T> bool chmin(T &a, const T &b) {\\n\\tif (a <= b) return false;\\n\\ta = b;\\n\\treturn true;\\n}\\n\\ntemplate <typename T> bool chmax(T &a, const T &b) {\\n\\tif (a >= b) return false;\\n\\ta = b;\\n\\treturn true;\\n}\\n\\ntemplate <typename T> T max(vector<T> &a){\\n\\tassert(!a.empty());\\n\\tT ret = a[0];\\n\\tfor (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);\\n\\treturn ret;\\n}\\n\\ntemplate <typename T> T min(vector<T> &a){\\n\\tassert(!a.empty());\\n\\tT ret = a[0];\\n\\tfor (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);\\n\\treturn ret;\\n}\\n\\ntemplate <typename T> T sum(vector<T> &a){\\n\\tT ret = 0;\\n\\tfor (int i=0; i<(int)a.size(); i++) ret += a[i];\\n\\treturn ret;\\n}\\n\\n// importbisect\\ntemplate <typename T>\\nint bisect_left(vector<T> &X, T v){\\n\\treturn lower_bound(X.begin(), X.end(), v) - X.begin();\\n}\\n\\ntemplate <typename T>\\nint bisect_right(vector<T> &X, T v){\\n\\treturn upper_bound(X.begin(), X.end(), v) - X.begin();\\n}\\n// ----\\n\\n// defcomp\\ntemplate <typename T>\\nvector<T> compress(vector<T> &X) {\\n\\tvector<T> vals = X;\\n\\tsort(vals.begin(), vals.end());\\n\\tvals.erase(unique(vals.begin(), vals.end()), vals.end());\\n\\treturn vals;\\n}\\n// -----\\n\\n// makediv\\nvector<ll> makediv(ll n){\\n\\tvector<ll> ld, ud;\\n\\tfor (ll i=1; i*i<=n; i++){\\n\\t\\tif (n%i == 0){\\n\\t\\t\\tld.push_back(i);\\n\\t\\t\\tif (i != n/i){\\n\\t\\t\\t\\tud.push_back(n/i);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treverse(ud.begin(), ud.end());\\n\\tld.insert(ld.end(), ud.begin(), ud.end());\\n\\treturn ld;\\n}\\n// -----\\n\\n// Fast Factorization\\n// https://judge.yosupo.jp/submission/38126\\n// !!! CHANGED THE PRIMARY TEST !!!\\ntypedef unsigned int uint;\\n\\nstruct Mint {\\n\\tuint64_t n;\\n\\tstatic uint64_t mod, inv, r2;\\n\\tMint() : n(0) { }\\n\\tMint(const uint64_t &x) : n(init(x)) { }\\n\\tstatic uint64_t init(const uint64_t &w) { return reduce(__uint128_t(w) * r2); }\\n\\tstatic void set_mod(const uint64_t &m) {\\n\\t\\tmod = inv = m;\\n\\t\\tfor(int i = 0; i < 5; i++)\\tinv *= 2 - inv * m;\\n\\t\\tr2 = -__uint128_t(m) % m;\\n\\t}\\n\\tstatic uint64_t reduce(const __uint128_t &x) {\\n\\t\\tuint64_t y = uint64_t(x >> 64) - uint64_t((__uint128_t(uint64_t(x) * inv) * mod) >> 64);\\n\\t\\treturn int64_t(y) < 0 ? y + mod : y;\\n\\t}\\n\\tMint& operator+= (const Mint &x) { n += x.n - mod; if(int64_t(n) < 0) n += mod; return *this; }\\n\\tMint& operator+ (const Mint &x) const { return Mint(*this) += x; }\\n\\tMint& operator*= (const Mint &x) { n = reduce(__uint128_t(n) * x.n); return *this; }\\n\\tMint& operator* (const Mint &x) const { return Mint(*this) *= x; }\\n\\tuint64_t val() const { return reduce(n); }\\n};\\n\\nuint64_t Mint::mod, Mint::inv, Mint::r2;\\n\\nbool suspect(const uint64_t &a, const uint64_t &s, uint64_t d, const uint64_t &n) {\\n\\tif(Mint::mod != n)\\tMint::set_mod(n);\\n\\tMint x(1), xx(a), o(x), m(n - 1);\\n\\twhile(d > 0) {\\n\\t\\tif(d & 1)\\tx *= xx;\\n\\t\\txx *= xx;\\n\\t\\td >>= 1;\\n\\t}\\n\\tif(x.n == o.n)\\treturn true;\\n\\tfor(uint r = 0; r < s; r++) {\\n\\t\\tif(x.n == m.n)\\treturn true;\\n\\t\\tx *= x;\\n\\t}\\n\\treturn false;\\n}\\n\\nbool is_prime(const uint64_t &n) {\\n\\tif(n <= 1 || (n > 2 && (~n & 1)))\\treturn false;\\n\\tuint64_t d = n - 1, s = 0;\\n\\twhile(~d & 1)\\ts++, d >>= 1;\\n\\tstatic const uint64_t a_big[] = {2, 325, 9375, 28178, 450775, 9780504, 1795265022};\\n\\tstatic const uint64_t a_smo[] = {2, 7, 61};\\n\\tif(n < 4759123141LL) {\\n\\t\\tfor(auto &&p : a_smo) {\\n\\t\\t\\tif(p >= n)\\tbreak;\\n\\t\\t\\tif(!suspect(p, s, d, n))\\treturn false;\\n\\t\\t}\\n\\t} else {\\n\\t\\tfor(auto &&p : a_big) {\\n\\t\\t\\tif(p >= n)\\tbreak;\\n\\t\\t\\tif(!suspect(p, s, d, n))\\treturn false;\\n\\t\\t}\\n\\t}\\n\\treturn true;\\n}\\n\\nuint64_t rho_pollard(const uint64_t &n) {\\n\\tif(~n & 1)\\treturn 2u;\\n\\tstatic random_device rng;\\n\\tuniform_int_distribution<uint64_t> rr(1, n - 1);\\n\\tif(Mint::mod != n)\\tMint::set_mod(n);\\n\\tfor(;;) {\\n\\t\\tuint64_t c_ = rr(rng), g = 1, r = 1, m = 500;\\n\\t\\tMint y(rr(rng)), xx(0), c(c_), ys(0), q(1);\\n\\t\\twhile(g == 1) {\\n\\t\\t\\txx.n = y.n;\\n\\t\\t\\tfor(uint i = 1; i <= r; i++)\\ty *= y, y += c;\\n\\t\\t\\tuint64_t k = 0; g = 1;\\n\\t\\t\\twhile(k < r && g == 1) {\\n\\t\\t\\t\\tfor(uint i = 1; i <= (m > (r - k) ? (r - k) : m); i++) {\\n\\t\\t\\t\\t\\tys.n = y.n;\\n\\t\\t\\t\\t\\ty *= y; y += c;\\n\\t\\t\\t\\t\\tuint64_t xxx = xx.val(), yyy = y.val();\\n\\t\\t\\t\\t\\tq *= Mint(xxx > yyy ? xxx - yyy : yyy - xxx);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tg = __gcd<uint64_t>(q.val(), n);\\n\\t\\t\\t\\tk += m;\\n\\t\\t\\t}\\n\\t\\t\\tr *= 2;\\n\\t\\t}\\n\\t\\tif(g == n)\\tg = 1;\\n\\t\\twhile(g == 1) {\\n\\t\\t\\tys *= ys; ys += c;\\n\\t\\t\\tuint64_t xxx = xx.val(), yyy = ys.val();\\n\\t\\t\\tg = __gcd<uint64_t>(xxx > yyy ? xxx - yyy : yyy - xxx, n);\\n\\t\\t}\\n\\t\\tif(g != n && is_prime(g))\\treturn g;\\n\\t}\\n\\tassert(69 == 420);\\n}\\n\\ntemplate <typename T>\\nvector<T> inter_factor(const T &n) {\\n\\tif(n < 2)\\treturn { };\\n\\tif(is_prime(n))\\treturn {n};\\n\\tT d = rho_pollard(static_cast<uint64_t>(n));\\n\\tvector<T> l = inter_factor(d), r = inter_factor(n / d);\\n\\tl.insert(l.end(), r.begin(), r.end());\\n\\treturn l;\\n}\\n\\ntemplate <typename T>\\nvector<T> factor(T n) {\\n\\tvector<T> f1;\\n\\tfor(uint i = 2; i < 100; i += (i & 1) + 1)\\n\\t\\twhile(n % i == 0)\\tf1.push_back(i), n /= i;\\n\\tvector<T> f2 = inter_factor(n);\\n\\tf1.insert(f1.end(), f2.begin(), f2.end());\\n\\tsort(f1.begin(), f1.end());\\n\\treturn f1;\\n}\\n\\n\\nvoid solve(int n, int k, ll s) {\\n\\tvector<ll> x(n), y(n), z(n);\\n\\trep(i,0,n) {\\n\\t\\tcin >> x[i] >> y[i] >> z[i];\\n\\t}\\n\\n\\tauto hyomen_sub = [&](ll ax, ll ay, ll bx, ll by) {\\n\\t\\tll xl = max(ax, bx);\\n\\t\\tll xr = min(ax + s, bx + s);\\n\\t\\tll yl = max(ay, by);\\n\\t\\tll yr = min(ay + s, by + s);\\n\\t\\tll xlen = max(0LL, xr - xl);\\n\\t\\tll ylen = max(0LL, yr - yl);\\n\\t\\treturn ylen * xlen * 2;\\n\\t};\\n\\n\\t// common hyomen of (i, j)\\n\\tauto hyomen = [&](int i, int j) -> ll {\\n\\t\\t// x[i], y[i], z[i];\\n\\t\\t// x[j], y[j], z[j];\\n\\t\\tll ans = 0;\\n\\t\\tans += hyomen_sub(x[i], y[i], x[j], y[j]);\\n\\t\\tans += hyomen_sub(y[i], z[i], y[j], z[j]);\\n\\t\\tans += hyomen_sub(z[i], x[i], z[j], x[j]);\\n\\t\\treturn ans;\\n\\t};\\n\\n\\tauto is_linked = [&](int i, int j) -> bool {\\n\\t\\tif (hyomen_sub(x[i], y[i], x[j], y[j]) == 0) return false;\\n\\t\\tif (hyomen_sub(y[i], z[i], y[j], z[j]) == 0) return false;\\n\\t\\tif (hyomen_sub(z[i], x[i], z[j], x[j]) == 0) return false;\\n\\t\\treturn true;\\n\\t};\\n\\n\\tvector ikeru(n, vector<int>(0));\\n\\trep(i,0,n) {\\n\\t\\trep(j,i+1,n) {\\n\\t\\t\\tif (i == j) continue;\\n\\t\\t\\tif (is_linked(i, j)) {\\n\\t\\t\\t\\tikeru[i].push_back(j);\\n\\t\\t\\t\\tikeru[j].push_back(i);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tatcoder::dsu uf(n);\\n\\trep(i,0,n){\\n\\t\\tfor (int j: ikeru[i]) {\\n\\t\\t\\tuf.merge(i, j);\\n\\t\\t}\\n\\t}\\n\\t\\n\\tvector<int> deg_sum(n);\\n\\trep(i,0,n){\\n\\t\\tdeg_sum[uf.leader(i)] += (int)ikeru[i].size();\\n\\t}\\n\\n\\t// minimum answer\\n\\tll ans = 1e18;\\n\\n\\trep(st,0,n) {\\n\\t\\tif (uf.leader(st) != st) continue;\\n\\t\\t//cout << deg_sum[st] << ' ' << uf.size(st) << endl;\\n\\t\\tif (deg_sum[st] == uf.size(st) * 2) {\\n\\t\\t\\t// circle;\\n\\t\\t\\tint genten = st;\\n\\t\\t\\tvector<int> renketsu_list;\\n\\t\\t\\tvector<bool> seen(n);\\n\\t\\t\\tseen[genten] = 1;\\n\\t\\t\\t\\n\\t\\t\\tvector<int> mada(0);\\n\\t\\t\\tmada.push_back(genten);\\n\\t\\t\\twhile(!mada.empty()){\\n\\t\\t\\t\\tint i = mada.back();\\n\\t\\t\\t\\tmada.pop_back();\\n\\t\\t\\t\\trenketsu_list.push_back(i);\\n\\t\\t\\t\\tfor (int j: ikeru[i]) {\\n\\t\\t\\t\\t\\tif (seen[j]) continue;\\n\\t\\t\\t\\t\\tmada.push_back(j);\\n\\t\\t\\t\\t\\tseen[j] = 1;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\t\\t\\tint m = (int)renketsu_list.size();\\n\\t\\t\\trep(i,0,m-1) {\\n\\t\\t\\t\\tassert(is_linked(renketsu_list[i],renketsu_list[i+1]));\\n\\t\\t\\t}\\n\\t\\t\\tassert(is_linked(renketsu_list[m-1],renketsu_list[0]));\\n\\t\\t\\t//cout << m << endl;\\n\\n\\t\\t\\t// unused with originally genten -> 0\\n\\t\\t\\tvector dp_sub0(2*m, vector<ll>(m+1, (ll)1e18));\\n\\t\\t\\t// used with originally genten -> 0\\n\\t\\t\\tvector dp_sub1(2*m, vector<ll>(m+1, (ll)1e18));\\n\\t\\t\\tvector dp_sub2(2*m, vector<ll>(m+1, (ll)1e18));\\n\\t\\t\\tdp_sub0[0][0] = 0;\\n\\t\\t\\tdp_sub1[0][1] = 6*s*s;\\n\\t\\t\\trep(i,1,2*m) {\\n\\t\\t\\t\\trep(j,0,m+1) {\\n\\t\\t\\t\\t\\tchmin(dp_sub0[i][j], dp_sub0[i-1][j]);\\n\\t\\t\\t\\t\\tchmin(dp_sub2[i][j], dp_sub1[i-1][j]);\\n\\t\\t\\t\\t\\tchmin(dp_sub2[i][j], dp_sub2[i-1][j]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\trep(j,0,m) {\\n\\t\\t\\t\\t\\tchmin(dp_sub1[i][j+1], dp_sub0[i-1][j] + 6*s*s);\\n\\t\\t\\t\\t\\tchmin(dp_sub1[i][j+1], dp_sub1[i-1][j] + 6*s*s - hyomen(renketsu_list[(i-1)%m], renketsu_list[i%m]));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tll val = 0;\\n\\t\\t\\trep(i,0,m) {\\n\\t\\t\\t\\tval += 6 * s * s;\\n\\t\\t\\t\\tval -= hyomen(renketsu_list[i], renketsu_list[(i+1)%m]);\\n\\t\\t\\t}\\n\\t\\t\\tif (m==k) chmin(ans, val);\\n\\t\\t\\tif (m>k) {\\n\\t\\t\\t\\tchmin(ans,dp_sub1[2*m-1][k]);\\n\\t\\t\\t\\tchmin(ans,dp_sub2[2*m-1][k]);\\n\\t\\t\\t\\t\\n\\t\\t\\t}\\n\\t\\t}else if (deg_sum[st] == uf.size(st) * 2 - 2){\\n\\t\\t\\tif (deg_sum[st] == 0) {\\n\\t\\t\\t\\tif (k == 1) {\\n\\t\\t\\t\\t\\tchmin(ans,6*s*s);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tcontinue;\\n\\t\\t\\t}\\n\\n\\t\\t\\t// path;\\n\\t\\t\\tint genten = -1;\\n\\t\\t\\trep(i,0,n) {\\n\\t\\t\\t\\tif (!uf.same(i,st)) continue;\\n\\t\\t\\t\\tif ((int)ikeru[i].size() == 1) {\\n\\t\\t\\t\\t\\tgenten = i;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tassert(genten != -1);\\n\\t\\t\\t\\n\\t\\t\\tvector<int> renketsu_list;\\n\\t\\t\\tvector<bool> seen(n);\\n\\t\\t\\tseen[genten] = 1;\\n\\t\\t\\t\\n\\t\\t\\tvector<int> mada(0);\\n\\t\\t\\tmada.push_back(genten);\\n\\t\\t\\twhile(!mada.empty()){\\n\\t\\t\\t\\tint i = mada.back();\\n\\t\\t\\t\\tmada.pop_back();\\n\\t\\t\\t\\trenketsu_list.push_back(i);\\n\\t\\t\\t\\tfor (int j: ikeru[i]) {\\n\\t\\t\\t\\t\\tif (seen[j]) continue;\\n\\t\\t\\t\\t\\tmada.push_back(j);\\n\\t\\t\\t\\t\\tseen[j] = 1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\n\\t\\t\\tint m = (int)renketsu_list.size();\\n\\t\\t\\t// unused\\n\\t\\t\\tvector dp_sub0(m, vector<ll>(m+1, (ll)1e18));\\n\\t\\t\\t// used\\n\\t\\t\\tvector dp_sub1(m, vector<ll>(m+1, (ll)1e18));\\n\\t\\t\\t// end\\n\\t\\t\\tvector dp_sub2(m, vector<ll>(m+1, (ll)1e18));\\n\\t\\t\\tdp_sub0[0][0] = 0;\\n\\t\\t\\tdp_sub1[0][1] = 6 * s * s;\\n\\t\\t\\trep(i,1,m) {\\n\\t\\t\\t\\trep(j,0,m+1) {\\n\\t\\t\\t\\t\\tchmin(dp_sub0[i][j], dp_sub0[i-1][j]);\\n\\t\\t\\t\\t\\tchmin(dp_sub2[i][j], dp_sub1[i-1][j]);\\n\\t\\t\\t\\t\\tchmin(dp_sub2[i][j], dp_sub2[i-1][j]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\trep(j,0,m) {\\n\\t\\t\\t\\t\\tchmin(dp_sub1[i][j+1], dp_sub0[i-1][j] + 6*s*s);\\n\\t\\t\\t\\t\\tchmin(dp_sub1[i][j+1], dp_sub1[i-1][j] + 6*s*s - hyomen(renketsu_list[i-1], renketsu_list[i]));\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n//\\t\\t\\tvector<ll> ret(m+1,(ll)1e18);\\n\\t\\t\\tif (m>=k) {\\n\\t\\t\\t\\tchmin(ans,dp_sub1[m-1][k]);\\n\\t\\t\\t\\tchmin(ans,dp_sub2[m-1][k]);\\n\\t\\t\\t}\\n\\t\\t\\t\\n\\n\\t\\t}else{\\n\\t\\t\\tassert(false);\\n\\t\\t}\\n\\t}\\n\\n\\t/*\\n\\n\\tvector<ll> ans(1,0LL);\\n\\n\\tfor (auto a: gogo_list) {\\n\\t\\tvector<ll> nans((int)a.size()+(int)ans.size()-1,(ll)1e18);\\n\\t\\trep(i,0,(int)a.size()) {\\n\\t\\t\\trep(j,0,(int)ans.size()) {\\n\\t\\t\\t\\tchmin(nans[i+j],a[i]+ans[j]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tswap(ans,nans);\\n\\t}\\n\\t\\t*/\\n\\tif (ans<1e17){\\n\\t\\tcout<<ans<<endl;\\n\\t}else{\\n\\t\\tcout<<-1<<endl;\\n\\t}\\n}\\n\\nint main(){\\n\\tios_base::sync_with_stdio(false);\\n\\tcin.tie(NULL);\\n\\twhile(true) {\\n\\t\\tint n; cin >> n;\\n\\t\\tint k; cin >> k;\\n\\t\\tll s; cin >> s;\\n\\t\\tif (n == 0) break;\\n\\t\\tsolve(n, k, s);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 5376,\n \"score_of_the_acc\": -0.5676,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1612_10494495\",\n \"code_snippet\": \"# include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ull = unsigned long long;\\nconst double pi = acos(-1);\\ntemplate<class T>constexpr T inf() { return ::std::numeric_limits<T>::max(); }\\ntemplate<class T>constexpr T hinf() { return inf<T>() / 2; }\\ntemplate <typename T_char>T_char TL(T_char cX) { return tolower(cX); }\\ntemplate <typename T_char>T_char TU(T_char cX) { return toupper(cX); }\\ntemplate<class T> bool chmin(T& a,T b) { if(a > b){a = b; return true;} return false; }\\ntemplate<class T> bool chmax(T& a,T b) { if(a < b){a = b; return true;} return false; }\\nint popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }\\nint d_sum(ll n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }\\nint d_cnt(ll n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }\\nll gcd(ll a, ll b) { if (b == 0)return a; return gcd(b, a%b); };\\nll lcm(ll a, ll b) { ll g = gcd(a, b); return a / g*b; };\\nll MOD(ll x, ll m){return (x%m+m)%m; }\\nll FLOOR(ll x, ll m) {ll r = (x%m+m)%m; return (x-r)/m; }\\ntemplate<class T> using dijk = priority_queue<T, vector<T>, greater<T>>;\\n# define all(qpqpq) (qpqpq).begin(),(qpqpq).end()\\n# define UNIQUE(wpwpw) (wpwpw).erase(unique(all((wpwpw))),(wpwpw).end())\\n# define LOWER(epepe) transform(all((epepe)),(epepe).begin(),TL<char>)\\n# define UPPER(rprpr) transform(all((rprpr)),(rprpr).begin(),TU<char>)\\n# define rep(i,upupu) for(ll i = 0, i##_len = (upupu);(i) < (i##_len);(i)++)\\n# define reps(i,opopo) for(ll i = 1, i##_len = (opopo);(i) <= (i##_len);(i)++)\\n# define len(x) ((ll)(x).size())\\n# define bit(n) (1LL << (n))\\n# define pb push_back\\n# define eb emplace_back\\n# define exists(c, e) ((c).find(e) != (c).end())\\n\\nstruct INIT{\\n\\tINIT(){\\n\\t\\tstd::ios::sync_with_stdio(false);\\n\\t\\tstd::cin.tie(0);\\n\\t\\tcout << fixed << setprecision(20);\\n\\t}\\n}INIT;\\n\\nnamespace mmrz {\\n\\tvoid solve();\\n}\\n\\nint main(){\\n\\tmmrz::solve();\\n}\\n#define debug(...) (static_cast<void>(0))\\n\\nusing namespace mmrz;\\n#define rep2(i,a,n) for(int i=a;i<n;i++)\\nbool SOLVE(){\\n\\tll n, k, s; cin >> n >> k >> s;\\n\\tif(n==0) return true;\\n\\t\\n\\tvector<tuple<ll,ll,ll>> v(n);\\n\\trep(i,n) {\\n\\t\\tll x, y, z; cin >> x >> y >> z;\\n\\t\\tv[i] = {x, y, z};\\n\\t}\\n\\n\\t// auto calc_d = [&](ll l, ll r) -> ll {\\n\\t// \\tll ret = -1;\\n\\t// \\tif(l > r)swap(l, r);\\n\\t// \\tif(r <= l + s){\\n\\t// \\t\\treturn l+s-r;\\n\\t// \\t}\\n\\t// \\treturn ret;\\n\\t// };\\n\\n\\tvector<vector<pair<ll,ll>>> g(n);\\n\\trep(i,n) {\\n\\t\\tauto [x1, y1, z1] = v[i];\\n\\t\\tll xs = x1 + s;\\n\\t\\tll ys = y1 + s;\\n\\t\\tll zs = z1 + s;\\n\\t\\trep2(j,i+1,n) {\\n\\t\\t\\tauto [x2,y2,z2] = v[j];\\n\\t\\t\\tbool isAlreadyChecked = false;\\n\\t\\t\\trep(x_mul, 2) rep(y_mul, 2) rep(z_mul, 2) {\\n\\t\\t\\t\\tif(isAlreadyChecked) break;\\n\\t\\t\\t\\tll px = x2 + s*x_mul;\\n\\t\\t\\t\\tll py = y2 + s*y_mul;\\n\\t\\t\\t\\tll pz = z2 + s*z_mul;\\n\\t\\t\\t\\tif(x1 <= px && px <= xs && y1 <= py && py <= ys && z1 <= pz && pz <= zs) {\\n\\t\\t\\t\\t\\tisAlreadyChecked = true;\\n\\t\\t\\t\\t\\tll dx = x_mul == 0 ? xs-px: px-x1;\\n\\t\\t\\t\\t\\tll dy = y_mul == 0 ? ys-py: py-y1;\\n\\t\\t\\t\\t\\tll dz = z_mul == 0 ? zs-pz: pz-z1;\\n\\t\\t\\t\\t\\tll weight = 2ll*dx*dy + 2ll*dx*dz + 2ll*dy*dz;\\n\\t\\t\\t\\t\\tg[i].push_back({j, weight});\\n\\t\\t\\t\\t\\tg[j].push_back({i, weight});\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t// rep(j, n) {\\n\\t\\t// // for(int j = i+1;j < n;j++) {\\n\\t\\t// \\tif(i == j)continue;\\n\\t\\t// \\tauto [x2, y2, z2] = v[j];\\n\\n\\t\\t// \\tll xs = x1 + s;\\n\\t\\t// \\tll ys = y1 + s;\\n\\t\\t// \\tll zs = z1 + s;\\n\\n\\t\\t// \\t// ll dx = calc_d(x1, x2);\\n\\t\\t// \\t// ll dy = calc_d(y1, y2);\\n\\t\\t// \\t// ll dz = calc_d(z1, z2);\\n\\n\\t\\t// \\t// if(dx == -1 || dy == -1 || dz == -1)continue;\\n\\n\\t\\t// \\t// ll weight = 2ll*dx*dy + 2ll*dx*dz + 2ll*dy*dz;\\n\\n\\t\\t// \\t// g[i].push_back({j,weight});\\n\\t\\t// \\t// g[j].push_back({i,weight});\\n\\t\\t\\t\\n\\t\\t// \\tif(x1 <= x2 && x2 <= xs && y1 <= y2 && y2 <= ys && z1 <= z2 && z2 <= zs) {\\n\\n\\t\\t// \\t\\tll dx = xs - x2;\\n\\t\\t// \\t\\tll dy = ys - y2;\\n\\t\\t// \\t\\tll dz = zs - z2;\\n\\n\\t\\t// \\t\\tll weight = 2ll*dx*dy + 2ll*dx*dz + 2ll*dy*dz;\\n\\n\\t\\t// \\t\\tg[i].push_back({j,weight});\\n\\t\\t// \\t\\tg[j].push_back({i,weight});\\n\\t\\t\\t\\n\\t\\t// \\t}\\n\\t\\t// }\\n\\t}\\n\\n\\tdebug(g);\\n\\n\\tif(k == 1){\\n\\t\\tcout << 6ll*s*s << '\\\\n';\\n\\t\\treturn 0;\\n\\t}\\n\\t\\n\\tif(k == 2){\\n\\t\\tll ans = hinf<ll>();\\n\\t\\trep(i, n){\\n\\t\\t\\tfor(auto [to, e] : g[i]){\\n\\t\\t\\t\\tchmin(ans, 6ll*s*s*2 - e);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << (ans == hinf<ll>() ? -1 : ans) << '\\\\n';\\n\\t\\treturn 0;\\n\\t}\\n\\n\\tdebug(g);\\n\\tll ans = hinf<ll>();\\n\\t\\n\\trep(i, n){\\n\\t\\tfor(auto [TO, E] : g[i]){\\n\\t\\t\\tll sm = E;\\n\\t\\t\\tunordered_set<int> st;\\n\\t\\t\\tst.emplace(i);\\n\\t\\t\\tst.emplace(TO);\\n\\t\\t\\tint cur = TO, pre = i;\\n\\t\\t\\tbool flg = true;\\n\\t\\t\\tfor(int rem = k-2;rem >= 0;rem--){\\n\\t\\t\\t\\t\\n\\t\\t\\t\\tbool update = false;\\n\\t\\t\\t\\tfor(auto [to, e] : g[cur]){\\n\\t\\t\\t\\t\\tif(to == pre)continue;\\n\\t\\t\\t\\t\\tif(rem != 0 && st.contains(to))continue;\\n\\t\\t\\t\\t\\tif(rem != 0 || st.contains(to))sm += e;\\n\\t\\t\\t\\t\\tst.emplace(to);\\n\\t\\t\\t\\t\\tpre = cur;\\n\\t\\t\\t\\t\\tcur = to;\\n\\t\\t\\t\\t\\tupdate = true;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tdebug(pre, cur, sm, rem, st, update);\\n\\t\\t\\t\\tif(rem && not update){\\n\\t\\t\\t\\t\\tflg = false;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(flg){\\n\\t\\t\\t\\tchmin(ans, 6ll*s*s*k - sm);\\n\\t\\t\\t\\tdebug(st, sm);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tcout << (ans == hinf<ll>() ? -1 : ans) << '\\\\n';\\n\\treturn 0;\\n}\\n\\nvoid mmrz::solve(){\\n\\t// int t = 1;\\n\\t//cin >> t;\\n\\twhile(!SOLVE());\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3584,\n \"score_of_the_acc\": -0.1814,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1612_9412332\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\n\\nbool connect(vector<int> v1, vector<int> v2, int S){\\n if(abs(v1[0]-v2[0])<S&&abs(v1[1]-v2[1])<S&&abs(v1[2]-v2[2])<S) return true;\\n else return false;\\n}\\n\\nint add(vector<int> v1, vector<int> v2, int S){\\n vector<int> dr(3);\\n for(int i=0;i<3;i++) dr[i]=S-abs(v1[i]-v2[i]);\\n int ret=6*S*S-2*(dr[0]*dr[1]+dr[1]*dr[2]+dr[2]*dr[0]);\\n return ret;\\n}\\n\\nint epoint(int s,vector<vector<int>> &side){\\n set<int> itta;\\n queue<vector<int>> que;\\n int last=s;\\n que.push({s,-1});//{今の位置,前の位置}\\n itta.insert(s);\\n while(!que.empty()){\\n auto v=que.front();\\n que.pop();\\n int now=v[0],pre=v[1];\\n for(int next:side[now]){\\n if(next==pre) continue;\\n if(itta.count(next)){\\n last=-1;\\n break;\\n }\\n else{\\n itta.insert(next);\\n last=next;\\n que.push({next,now});\\n }\\n }\\n if(last==-1) break;\\n }\\n return last;\\n}\\n\\n\\nvoid solve(int N, int K, int S,vector<int> &ANS){\\n \\n vector<vector<int>> pos(N,vector<int>(3));\\n for(int i=0;i<N;i++){\\n for(int j=0;j<3;j++){\\n cin >> pos[i][j];\\n }\\n }\\n if(K==1){\\n ANS.push_back(6*S*S);\\n return;\\n }\\n vector<vector<int>> side(N,vector<int>(0));\\n for(int i=0;i<N;i++){\\n for(int j=i+1;j<N;j++){\\n if(connect(pos[i],pos[j],S)){\\n side[i].push_back(j);\\n side[j].push_back(i);\\n //cout << i<<\\\"と\\\"<<j<<\\\"は連結\\\"<<endl;//\\n }\\n }\\n }\\n vector<bool> used(N,false);\\n int ans=INT_MAX;\\n for(int i=0;i<N;i++){\\n if(!used[i]){\\n int start=epoint(i,side);\\n if(start==-1){\\n vector<int> con;\\n con.push_back(i);\\n used[i]=true;\\n int sec=side[i][0];\\n con.push_back(sec);\\n used[sec]=true;\\n\\n queue<int> hai;\\n hai.push(sec);\\n while(!hai.empty()){\\n int now=hai.front();\\n hai.pop();\\n for(int next:side[now]){\\n if(!used[next]){\\n used[next]=true;\\n con.push_back(next);\\n hai.push(next);\\n }\\n } \\n }\\n int sz=con.size();\\n if(sz==K){\\n int area=0;\\n for(int j=0;j<K;j++){\\n area+=add(pos[con[j]],pos[con[(j+1)%K]],S);\\n }\\n ans=min(ans,area);\\n }\\n if(sz>K){\\n int area=6*S*S;\\n for(int j=1;j<K;j++){\\n area+=add(pos[con[j-1]],pos[con[j]],S);\\n }\\n ans=min(ans,area);\\n //cout << \\\"ループの場合\\\"<<area<<endl;//\\n for(int j=1;j<sz;j++){\\n area+=add(pos[con[(K-2+j)%sz]],pos[con[(K-1+j)%sz]],S);\\n area-=add(pos[con[j-1]],pos[con[j]],S);\\n ans=min(ans,area);\\n //cout << \\\"ループの場合\\\"<<area<<endl;//\\n }\\n }\\n }\\n else{\\n queue<int> hai;\\n hai.push(start);\\n used[start]=true;\\n vector<int> con;\\n con.push_back(start);\\n while(!hai.empty()){\\n int now=hai.front();\\n hai.pop();\\n for(int next:side[now]){\\n if(!used[next]){\\n used[next]=true;\\n con.push_back(next);\\n hai.push(next);\\n }\\n } \\n }\\n int sz=con.size();\\n //for(int x:con) cout << x <<' ';//\\n //cout <<\\\"これらは連結\\\"<<endl;//\\n if(sz>=K){\\n int area=6*S*S;\\n for(int j=1;j<K;j++){\\n area+=add(pos[con[j-1]],pos[con[j]],S);\\n }\\n ans=min(ans,area);\\n //cout << \\\"鎖状の場合\\\"<<area<<endl;//\\n for(int j=K;j<sz;j++){\\n area+=add(pos[con[j-1]],pos[con[j]],S);\\n area-=add(pos[con[j-K]],pos[con[j-K+1]],S);\\n ans=min(ans,area);\\n //cout << \\\"鎖状の場合\\\"<<area<<endl;//\\n }\\n }\\n }\\n }\\n }\\n if(ans==INT_MAX) ans=-1;\\n ANS.push_back(ans);\\n\\n}\\n\\n\\n\\nint main() {\\n vector<int> ANS;\\n while(true){\\n int N,K,S;\\n cin>>N>>K>>S;\\n if(N==0) break;\\n solve(N,K,S,ANS);\\n }\\n for(int a:ANS) cout << a << endl;\\n \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3432,\n \"score_of_the_acc\": -0.141,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1612_9239661\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nbool solve() {\\n long long N, K, S;\\n std::cin >> N >> K >> S;\\n if (N == 0) return false;\\n std::array<std::vector<long long>, 3> P;\\n for (int i{} ; i < 3 ; i++) P[i] = std::vector<long long>(N);\\n for (int i{} ; i < N ; i++) {\\n for (int j{} ; j < 3 ; j++) std::cin >> P[j][i];\\n }\\n std::vector<std::vector<std::pair<int, long long>>> g(N);\\n for (int i{} ; i < N ; i++) {\\n for (int j{} ; j < N ; j++) {\\n if (i == j) continue;\\n bool ok{true};\\n long long len[3];\\n for (int k{} ; k < 3 ; k++) {\\n long long l{std::max(P[k][i], P[k][j])}, r{std::min(P[k][i], P[k][j]) + S};\\n ok &= (l < r);\\n len[k] = r - l;\\n }\\n if (!ok) continue;\\n long long cost{}; \\n for (int i{} ; i < 3 ; i++) {\\n long long area{len[i + 1 == 3 ? 0 : i + 1] * len[i]};\\n cost += 2 * area;\\n }\\n g[i].emplace_back(j, cost);\\n }\\n }\\n std::vector<bool> used(N);\\n int start{-1};\\n auto rec{[&](auto rec, int v, int cnt, long long sum) -> long long {\\n long long res{(cnt == K ? sum : -1)};\\n for (auto [x, w] : g[v]) {\\n if (!used[x] and cnt < K) {\\n used[x] = true;\\n res = std::max(res, rec(rec, x, cnt + 1, sum + w));\\n used[x] = false;\\n }\\n else if (K != 2 and cnt == K and x == start) {\\n assert(used[x]);\\n res += w;\\n }\\n }\\n return res;\\n }};\\n long long ans{-1};\\n for (int v{} ; v < N ; v++) {\\n used[v] = true;\\n start = v;\\n ans = std::max(ans, rec(rec, v, 1, 0LL)); \\n used[v] = false;\\n }\\n if (ans == -1) {\\n std::cout << ans << '\\\\n';\\n }\\n else {\\n ans = (long long)K * 6 * S * S - ans;\\n std::cout << ans << '\\\\n';\\n }\\n return true;\\n}\\n\\nint main() {\\n std::cin.tie(nullptr)->sync_with_stdio(false);\\n while (solve()) ;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3456,\n \"score_of_the_acc\": -0.1474,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1612_9122008\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define ALL(v) v.begin(),v.end()\\ntemplate<class F, class S>\\nostream& operator<<(ostream& os, const pair<F,S>& p) {\\n os << '(' << p.first << ',' << p.second << ')';\\n return os;\\n}\\ntemplate<class Iter>\\nvoid print(Iter begin, Iter end) {\\n for (auto itr = begin; itr != end; ++itr) {\\n cerr << (*itr) << ' ';\\n }\\n cerr << '\\\\n';\\n}\\n#define dbg(v) cerr << #v << \\\": \\\" << v << '\\\\n';\\nint N,K,S;\\nvector<array<int,3>> P;\\nusing Graph = vector<vector<int>>;\\nGraph G;\\nvector<vector<int>> W;\\n\\nint cycle(vector<int>& vert) {\\n if (vert.size() == K) {\\n int sum = 0;\\n for (int i : vert) {\\n for (int j : vert) {\\n sum += W[i][j];\\n }\\n }\\n assert(sum % 2 == 0);\\n return sum / 2;\\n }\\n int n = vert.size();\\n map<int, bool> used;\\n int start = vert[0];\\n vert.clear();\\n vert.push_back(start);\\n used[start] = true;\\n for (int i = 0; i < n-1; ++i) {\\n int pos = vert.back();\\n for (int to : G[pos]) {\\n if (!used[to]) {\\n vert.push_back(to);\\n used[to] = true;\\n break;\\n }\\n }\\n }\\n for (int i = 0; i < n; ++i) {\\n vert.push_back(vert[i]);\\n }\\n\\n vector<int> rui(2*n);\\n for (int i = 1; i < 2*n; ++i) {\\n rui[i] = rui[i-1] + W[vert[i]][vert[i-1]];\\n }\\n int res = 0;\\n for (int i = K-1; i < 2*n; ++i) {\\n res = max(res, rui[i] - rui[i-K+1]);\\n }\\n return res;\\n}\\n\\nint path(vector<int>& vert) {\\n int start = -1;\\n for (int v : vert) {\\n if (G[v].size() <= 1) {\\n start = v;\\n break;\\n }\\n }\\n int n = vert.size();\\n map<int, bool> used;\\n vert.clear();\\n vert.push_back(start);\\n used[start] = true;\\n for (int i = 0; i < n-1; ++i) {\\n int pos = vert.back();\\n for (int to : G[pos]) {\\n if (!used[to]) {\\n vert.push_back(to);\\n used[to] = true;\\n break;\\n }\\n }\\n }\\n\\n vector<int> rui(n);\\n for (int i = 1; i < n; ++i) {\\n rui[i] = rui[i-1] + W[vert[i]][vert[i-1]];\\n }\\n int res = 0;\\n for (int i = K-1; i < n; ++i) {\\n res = max(res, rui[i] - rui[i-K+1]);\\n }\\n return res;\\n}\\n\\nint calc(int x1, int y1, int z1, int x2, int y2, int z2)\\n{\\n if (x1 > x2) swap(x1, x2);\\n int dx = max(0, x1 + S - x2);\\n if (y1 > y2) swap(y1, y2);\\n int dy = max(0, y1 + S - y2);\\n if (z1 > z2) swap(z1, z2);\\n int dz = max(0, z1 + S - z2);\\n if (dx==0 || dy==0 || dz==0) return 0;\\n return (dx * dy + dy * dz + dz * dx) * 2;\\n}\\n\\nint solve() {\\n cin >> N >> K >> S;\\n if (N+K+S == 0) exit(0);\\n P.resize(N);\\n for (int i = 0; i < N; ++i) {\\n for (int j = 0; j < 3; ++j) {\\n cin >> P[i][j];\\n }\\n }\\n\\n G.clear();\\n G.resize(N);\\n W.clear();\\n W.resize(N, vector<int>(N,0));\\n for (int i = 0; i < N; ++i) {\\n for (int j = i+1; j < N; ++j) {\\n // calc weight of edge i-j\\n auto [x1, y1, z1] = P[i];\\n auto [x2, y2, z2] = P[j];\\n int diff = calc(x1,y1,z1, x2,y2,z2);\\n W[i][j] = W[j][i] = diff;\\n if (diff > 0) {\\n G[i].emplace_back(j);\\n G[j].emplace_back(i);\\n }\\n }\\n }\\n // for (int i = 0; i < N; ++i) {\\n // cerr << i << \\\":\\\";\\n // print(ALL(G[i]));\\n // }\\n vector<bool> used(N);\\n int ans = -1;\\n for (int i = 0; i < N; ++i) {\\n if (used[i]) continue;\\n vector<int> vert;\\n queue<int> q;\\n used[i] = true;\\n q.push(i);\\n vert.push_back(i);\\n while (q.size()) {\\n int v = q.front();\\n q.pop();\\n for (auto to : G[v]) {\\n if (!used[to]) {\\n used[to] = true;\\n q.push(to);\\n vert.push_back(to);\\n }\\n }\\n }\\n\\n bool isCycle = true;\\n for (int v : vert) {\\n if (G[v].size() != 2) {\\n isCycle = false;\\n }\\n }\\n if (vert.size() < K) {continue;}\\n\\n if (isCycle) {\\n ans = max(ans, cycle(vert));\\n } else {\\n ans = max(ans, path(vert));\\n }\\n }\\n if (ans == -1) return -1;\\n return K * S*S*6 - ans;\\n}\\n\\nint main() {\\n while (true) {\\n cout << solve() << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 7000,\n \"score_of_the_acc\": -1,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1612_8031034\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\n\\nusing namespace std;\\n\\nusing i64 = long long;\\nusing ll = long long;\\n\\nbool solve(){\\n int n, k, s;\\n cin >> n >> k >> s;\\n if (n == 0) {\\n return false;\\n }\\n vector<ll> x(n);\\n vector<ll> y(n);\\n vector<ll> z(n);\\n for (int i = 0; i < n; i++) {\\n cin >> x[i] >> y[i] >> z[i];\\n }\\n ll base = s * s * 6 * k;\\n if (k == 1) {\\n cout << base << endl;\\n return true;\\n }\\n vector<int> e1(n, -1);\\n vector<int> e2(n, -1);\\n vector<ll> s1(n, -1);\\n vector<ll> s2(n, -1);\\n for (int i = 0; i < n; i++) {\\n for (int j = 0; j < n; j++) {\\n if (i == j) {\\n continue;\\n }\\n ll ix = s + min(x[i], x[j]) - max(x[i], x[j]);\\n ll iy = s + min(y[i], y[j]) - max(y[i], y[j]);\\n ll iz = s + min(z[i], z[j]) - max(z[i], z[j]);\\n if (ix > 0 && iy > 0 && iz > 0) {\\n ll siz = (ix * iy + ix * iz + iy * iz) * 2;\\n if (e1[i] == -1) {\\n e1[i] = j;\\n s1[i] = siz;\\n } else {\\n e2[i] = j;\\n s2[i] = siz;\\n }\\n }\\n }\\n }\\n ll ans = 0;\\n bool any = false;\\n for (int i = 0; i < n; i++) {\\n if (e1[i] != -1) {\\n int p = i;\\n int c = e1[i];\\n ll su = 0;\\n ll ns = s1[i];\\n bool ok = true;\\n //cout << i << \\\"_2\\\" << endl;\\n for (int j = 1; j < k; j++) {\\n //cout << c << \\\", \\\" << p << endl;\\n if (c == -1) {\\n ok = false;\\n break;\\n }\\n su += ns;\\n if (e1[c] == p && e2[c] != -1) {\\n ns = s2[c];\\n p = c;\\n c = e2[c];\\n } else if (e2[c] == p && e1[c] != -1) {\\n ns = s1[c];\\n p = c;\\n c = e1[c];\\n } else {\\n p = c;\\n c = -1;\\n }\\n if (p == i) {\\n ok = false;\\n break;\\n }\\n }\\n if (c == i) {\\n su += ns;\\n }\\n if (ok) {\\n any = true;\\n ans = max(ans, su);\\n }\\n }\\n if (e2[i] != -1) {\\n int p = i;\\n int c = e2[i];\\n ll su = 0;\\n ll ns = s2[i];\\n bool ok = true;\\n //cout << i << \\\"_2\\\" << endl;\\n for (int j = 1; j < k; j++) {\\n //cout << c << \\\", \\\" << p << endl;\\n if (c == -1) {\\n ok = false;\\n break;\\n }\\n su += ns;\\n if (e1[c] == p && e2[c] != -1) {\\n ns = s2[c];\\n p = c;\\n c = e2[c];\\n } else if (e2[c] == p && e1[c] != -1) {\\n ns = s1[c];\\n p = c;\\n c = e1[c];\\n } else {\\n p = c;\\n c = -1;\\n }\\n if (p == i) {\\n ok = false;\\n break;\\n }\\n }\\n if (c == i) {\\n su += ns;\\n }\\n if (ok) {\\n any = true;\\n ans = max(ans, su);\\n }\\n }\\n }\\n if (any) {\\n cout << base - ans << endl;\\n } else {\\n cout << -1 << endl;\\n }\\n return true;\\n}\\n\\nint main() {\\n while(solve());\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3432,\n \"score_of_the_acc\": -0.0501,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1612_8026061\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n\\nstruct Unionfind{\\nprivate:\\n int n;\\n std::vector<int> parents;\\n\\npublic:\\n Unionfind(int n):n(n), parents(n,-1) {}\\n\\n int find(int x) {\\n if(parents[x] < 0) return x;\\n return parents[x] = find(parents[x]);\\n }\\n\\n void unite(int x,int y) {\\n x = find(x);\\n y = find(y);\\n\\n if(x == y) return;\\n if(parents[x] > parents[y]) std::swap(x, y);\\n parents[x] += parents[y];\\n parents[y] = x;\\n return;\\n } \\n\\n int size(int x) {\\n return -parents[find(x)];\\n }\\n\\n bool same(int x, int y) {\\n return find(x) == find(y);\\n }\\n\\n std::vector<int> members(int x) {\\n int root = find(x);\\n std::vector<int> member;\\n for(int i = 0;i < n; i++){\\n if(find(i) == root ){\\n member.push_back(i);\\n }\\n }\\n return member;\\n }\\n\\n int group_cnt(void) {\\n int c = 0;\\n for(int i = 0;i < n; i++){\\n if(parents[i] < 0) ++c;\\n }\\n return c;\\n }\\n};\\n\\nlong long calc(vector<vector<pair<int,long long>>>& G, Unionfind& uf, vector<bool> in_circle, int n, int k, int s){\\n long long ans = -1;\\n vector<bool> done(G.size());\\n for(int i = 0; i < G.size(); i++){\\n if(done[i]) continue;\\n auto member = uf.members(i);\\n if(member.size() < k) continue;\\n\\n\\n bool circle = false;\\n int start = i;\\n for(int j = 0; j < member.size(); j++){\\n int m = member[j];\\n done[m] = 1, circle |= in_circle[m];\\n if(G[m].size() == 1) start = m;\\n }\\n\\n // cout << circle << endl;\\n // for(int i = 0; i < member.size(); i++) cout << member[i] << \\\" \\\";\\n //cout << endl;\\n\\n vector<long long> a;\\n vector<bool> visited(member.size());\\n auto dfs = [&](auto&& self, int v, int prev = -1)->void{\\n visited[v] = true;\\n for(auto[nv, rew] : G[v]){\\n if(visited[nv]){\\n if(prev != start && nv == start) a.push_back(rew);\\n continue;\\n }\\n a.push_back(rew);\\n self(self, nv, v);\\n }\\n };\\n dfs(dfs, start);\\n\\n //for(int i = 0; i < a.size(); i++){\\n // cout << a[i] << \\\" \\\";\\n //}\\n //cout << endl;\\n\\n if(member.size() == k){\\n ans = max(ans, accumulate(a.begin(), a.end(), 0ll));\\n }\\n else{\\n if(circle){\\n vector<long long> sum(3*a.size() + 1);\\n for(int i = 0; i < sum.size() - 1; i++){\\n sum[i + 1] = sum[i] + a[i % a.size()];\\n }\\n for(int i = k - 1; i <= a.size() + k; i++){\\n ans = max(ans, sum[i] - sum[i - (k - 1)]);\\n }\\n }\\n else{\\n vector<long long> sum(a.size() + 1);\\n for(int i = 0; i < a.size(); i++){\\n sum[i + 1] = sum[i] + a[i % a.size()];\\n }\\n for(int i = k - 1; i < sum.size(); i++){\\n ans = max(ans, sum[i] - sum[i - (k - 1)]);\\n }\\n }\\n }\\n }\\n return ans;\\n} \\n\\n\\nvoid solve(int n, int k, long long s){\\n vector<int> x(n), y(n), z(n);\\n Unionfind uf(n);\\n vector<bool> in_circle(n);\\n vector<vector<pair<int, long long>>> G(n);\\n for(int i = 0; i < n; i++) cin >> x[i] >> y[i] >> z[i];\\n auto process = [&](int i, int j)->void{\\n long long area = 0;\\n for(int mask = 0; mask < 1<<3; mask++){\\n vector<int> co(3);\\n co[0] = x[i], co[1] = y[i], co[2] = z[i];\\n for(int p = 0; p < 3; p++){\\n if(mask >> p & 1) co[p] += s;\\n }\\n if(x[j] <= co[0] && co[0] <= x[j] + s && y[j] <= co[1] && co[1] <= y[j] + s && z[j] <= co[2] && co[2] <= z[j] + s){\\n long long tate = ((mask >> 0 & 1) ? co[0] - x[j] : x[j] + s - co[0]);\\n long long yoko = ((mask >> 1 & 1) ? co[1] - y[j] : y[j] + s - co[1]);\\n long long takasa = ((mask >> 2 & 1) ? co[2] - z[j] : z[j] + s - co[2]);\\n area = 2 * (tate * yoko + tate * takasa + yoko * takasa);\\n } \\n }\\n if(area != 0){\\n G[i].push_back({j, area}), G[j].push_back({i, area});\\n if(uf.same(i, j)) in_circle[i] = in_circle[j] = 1;\\n uf.unite(i, j);\\n }\\n };\\n for(int i = 0; i < n; i++) for(int j = 0; j < i; j++) process(i, j);\\n //for(int i = 0; i < n; i++){\\n // for(auto[j, cost]:G[i]) cout << i << \\\" \\\" << j << \\\" \\\" << cost << endl;\\n //}\\n long long tmp = calc(G, uf, in_circle, n, k, s);\\n if(tmp == -1) cout << tmp << endl;\\n else cout << 6*s*s*k - tmp << endl;\\n}\\n\\nint main() {\\n while(1){\\n int n, k, s; cin >> n >> k >> s;\\n if(n == 0 && k == 0 && s == 0) break;\\n solve(n, k, s);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3544,\n \"score_of_the_acc\": -0.7162,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1612_7720545\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\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 ull = unsigned long long;\\n\\ntemplate<typename T> bool chmin(T &a, const T &b){\\n if (a <= b) return false;\\n a = b;\\n return true;\\n}\\ntemplate<typename T> bool chmax(T &a, const T &b){\\n if (a >= b) return false;\\n a = b;\\n return true;\\n}\\n\\nint main() {\\n const int INF = std::numeric_limits<int>::max();\\n int n,k,s;\\n while(std::cin >> n >> k >> s, n != 0) {\\n using P = std::array<int, 3>;\\n std::vector<P> ps(n);\\n for(auto &p: ps) {\\n rep(i,0,3) {\\n std::cin >> p[i];\\n }\\n }\\n auto is_connect = [&](P a, P b) -> bool {\\n rep(bit,0,1<<3) {\\n bool is_ok = true;\\n rep(i,0,3) {\\n int ret = a[i];\\n if((bit >> i) & 1) {\\n ret += s;\\n }\\n is_ok &= b[i] <= ret && ret <= b[i] + s;\\n }\\n if(is_ok) return true;\\n }\\n return false;\\n };\\n auto f = [&](P a, P b) -> int {\\n P diff;\\n rep(i,0,3) diff[i] = s - std::abs(a[i] - b[i]);\\n int ret = 0;\\n rep(i,0,3) ret += 2 * diff[i] * diff[(i + 1) % 3];\\n return ret;\\n };\\n if(k == 1) {\\n std::cout << 6 * s * s << '\\\\n';\\n continue;\\n }\\n if(k == 2) {\\n int ans = INF;\\n rep(i,0,n) {\\n rep(j,i+1,n) {\\n if(is_connect(ps[i], ps[j])) chmin(ans, 6*s*s*2 - f(ps[i], ps[j]));\\n }\\n }\\n if(ans == INF) ans = -1;\\n std::cout << ans << '\\\\n';\\n continue;\\n }\\n\\n std::vector g(n, std::vector<int>());\\n rep(i,0,n) rep(j,i+1,n) {\\n if(is_connect(ps[i], ps[j])) {\\n g[i].emplace_back(j);\\n g[j].emplace_back(i);\\n }\\n }\\n std::vector<std::vector<int>> groups;\\n {\\n std::vector<int> deg1;\\n std::vector<int> seen(n, -1);\\n std::vector<int> group;\\n auto dfs = [&](auto &&self, int v) -> void {\\n seen[v] = 1;\\n group.emplace_back(v);\\n for(auto nv: g[v]) if(seen[nv] < 0) {\\n self(self, nv);\\n }\\n };\\n rep(i,0,n) if(g[i].size() == 1 && seen[i] < 0) {\\n dfs(dfs, i);\\n groups.emplace_back(group);\\n group.clear();\\n }\\n rep(i,0,n) if(seen[i] < 0) {\\n dfs(dfs, i);\\n groups.emplace_back(group);\\n group.clear();\\n }\\n }\\n int ans = INF;\\n for(auto group: groups) {\\n int sz = group.size();\\n if(sz < k) continue;\\n std::vector<int> diffs;\\n rep(i,0,sz-1) {\\n int idx = group[i];\\n int jdx = group[i+1];\\n diffs.emplace_back(f(ps[idx], ps[jdx]));\\n }\\n bool is_loop = is_connect(ps[group[0]], ps[group.back()]);\\n int w = k-1;\\n if(is_loop) {\\n diffs.emplace_back(f(ps[group[0]], ps[group.back()]));\\n if(sz == k) w = k;\\n }\\n sz = diffs.size();\\n int ret = 0;\\n rep(i,0,w) {\\n ret += diffs[i];\\n }\\n chmin(ans, 6 * s * s * k - ret);\\n rep(i,0,sz) {\\n if(!is_loop && i + w >= sz) break;\\n ret -= diffs[i];\\n ret += diffs[(i + w) % sz];\\n chmin(ans, 6 * s * s * k - ret);\\n }\\n }\\n if(ans == INF) ans = -1;\\n std::cout << ans << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3572,\n \"score_of_the_acc\": -0.1782,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1612_7720139\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nbool is_connect(int i, int j, int s, vector<int>&x, vector<int>&y, vector<int>&z){\\n\\tint px,py,pz,qx,qy,qz;\\n\\tfor (int k=0; k<8; k++){\\n\\t\\tif (k&1){\\n\\t\\t\\tpx=i;\\n\\t\\t\\tqx=j;\\n\\t\\t}else{\\n\\t\\t\\tpx=j;\\n\\t\\t\\tqx=i;\\n\\t\\t}\\n\\t\\tif (k&2){\\n\\t\\t\\tpy=i;\\n\\t\\t\\tqy=j;\\n\\t\\t}else{\\n\\t\\t\\tpy=j;\\n\\t\\t\\tqy=i;\\n\\t\\t}\\n\\t\\tif (k&4){\\n\\t\\t\\tpz=i;\\n\\t\\t\\tqz=j;\\n\\t\\t}else{\\n\\t\\t\\tpz=j;\\n\\t\\t\\tqz=i;\\n\\t\\t}\\n\\t\\tif (!(x[px] <= x[qx] && x[qx] <= x[px]+s)) continue;\\n\\t\\tif (!(y[py] <= y[qy] && y[qy] <= y[py]+s)) continue;\\n\\t\\tif (!(z[pz] <= z[qz] && z[qz] <= z[pz]+s)) continue;\\n\\t\\treturn true;\\n\\t}\\n\\treturn false;\\n}\\n\\nint kasane(int i, int j, int s, vector<int>&x, vector<int>&y, vector<int>&z){\\n\\tint px,py,pz;\\n\\tif (x[i] <= x[j]){\\n\\t\\tpx = x[i]+s-x[j];\\n\\t}else{\\n\\t\\tpx = x[j]+s-x[i];\\n\\t}\\n\\tif (y[i] <= y[j]){\\n\\t\\tpy = y[i]+s-y[j];\\n\\t}else{\\n\\t\\tpy = y[j]+s-y[i];\\n\\t}\\n\\tif (z[i] <= z[j]){\\n\\t\\tpz = z[i]+s-z[j];\\n\\t}else{\\n\\t\\tpz = z[j]+s-z[i];\\n\\t}\\n\\treturn 2*(px*py+py*pz+pz*px);\\n}\\n\\nvoid solve(int n, int k, int s){\\n\\tvector<int> x(n), y(n), z(n);\\n\\tfor (int i=0; i<n; i++){\\n\\t\\tcin >> x[i] >> y[i] >> z[i];\\n\\t}\\n\\n\\tvector<vector<int>> ikeru(n, vector<int>(0));\\n\\tvector<int> deg(n);\\n\\tfor (int i=0; i<n; i++){\\n\\t\\tfor (int j=i+1; j<n; j++){\\n\\t\\t\\tif (is_connect(i, j, s, x, y, z)){\\n\\t\\t\\t\\tikeru[i].push_back(j);\\n\\t\\t\\t\\tikeru[j].push_back(i);\\n\\t\\t\\t\\tdeg[i] += 1;\\n\\t\\t\\t\\tdeg[j] += 1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t\\n\\tvector<int> deg1(0);\\n\\tvector<bool> tansaku(n);\\n\\tfor (int i=0; i<n; i++){\\n\\t\\tif (deg[i] <= 1) deg1.push_back(i);\\n\\t}\\n\\tvector<vector<int>> groups(0,vector<int>(0));\\n\\tint cnt = 0;\\n\\tvector<bool> isen(0);\\n\\tfor (int st: deg1){\\n\\t\\tvector<int> mada = {st};\\n\\t\\ttansaku[st] = true;\\n\\t\\tgroups.push_back(vector<int>(0));\\n\\t\\tgroups[cnt].push_back(st);\\n\\t\\tisen.push_back(false);\\n\\t\\twhile(!mada.empty()){\\n\\t\\t\\tint i = mada.back(); mada.pop_back();\\n\\t\\t\\tfor (int j: ikeru[i]){\\n\\t\\t\\t\\tif(!tansaku[j]){\\n\\t\\t\\t\\t\\ttansaku[j] = true;\\n\\t\\t\\t\\t\\tgroups[cnt].push_back(j);\\n\\t\\t\\t\\t\\tmada.push_back(j);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcnt += 1;\\n\\t}\\n\\tfor (int st=0; st<n; st++){\\n\\t\\tif (tansaku[st]) continue;\\n\\t\\tvector<int> mada = {st};\\n\\t\\tgroups.push_back(vector<int>(0));\\n\\t\\tisen.push_back(true);\\n\\t\\twhile(!mada.empty()){\\n\\t\\t\\tint i = mada.back(); mada.pop_back();\\n\\t\\t\\tif(tansaku[i]) continue;\\n\\t\\t\\tgroups[cnt].push_back(i);\\n\\t\\t\\ttansaku[i] = true;\\n\\t\\t\\tfor (int j: ikeru[i]){\\n\\t\\t\\t\\tif(!tansaku[j]){\\n\\t\\t\\t\\t\\tmada.push_back(j);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcnt += 1;\\n\\t}\\n\\n\\tint ans = 1e9;\\n\\tfor (int xx=0; xx<cnt; xx++){\\n\\t\\tint m = groups[xx].size();\\n\\t\\tif (m < k) continue;\\t\\n\\t\\tint w = k-1;\\n\\t\\tif (isen[xx]){\\n\\t\\t\\tif (m==k) w=k;\\n\\t\\t\\tvector<int> dif(2*m);\\n\\t\\t\\tfor (int i=0; i<2*m; i++){\\n\\t\\t\\t\\tdif[i] = kasane(groups[xx][i%m], groups[xx][(i+1)%m], s, x, y, z);\\n\\t\\t\\t}\\n\\t\\t\\tvector<int> rui(2*m+1);\\n\\t\\t\\tfor (int i=0; i<2*m; i++){\\n\\t\\t\\t\\trui[i+1] = rui[i] + dif[i];\\n\\t\\t\\t}\\n\\t\\t\\tfor (int i=0; i<=2*m-w; i++){\\n\\t\\t\\t\\tans = min(ans, 6*s*s*k - (rui[i+w] - rui[i]));\\n\\t\\t\\t}\\n\\t\\t}else{\\n\\t\\t\\tvector<int> dif(m-1);\\n\\t\\t\\tfor (int i=0; i<m-1; i++){\\n\\t\\t\\t\\tdif[i] = kasane(groups[xx][i%m], groups[xx][(i+1)%m], s, x, y, z);\\n\\t\\t\\t}\\n\\t\\t\\tvector<int> rui(m);\\n\\t\\t\\tfor (int i=0; i<m-1; i++){\\n\\t\\t\\t\\trui[i+1] = rui[i] + dif[i];\\n\\t\\t\\t}\\n\\t\\t\\tfor (int i=0; i<m-w; i++){\\n\\t\\t\\t\\tans = min(ans, 6*s*s*k - (rui[i+w] - rui[i]));\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\tif (ans == 1e9) ans = -1;\\n\\tcout << ans << \\\"\\\\n\\\";\\n}\\n\\nint main(){\\n\\twhile(true){\\n\\t\\tint n,k,s; cin >> n >> k >> s;\\n\\t\\tif (n == 0) break;\\n\\t\\tsolve(n,k,s);\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3572,\n \"score_of_the_acc\": -0.0873,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1612_7720114\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i,x,n) for(int i = (int)x; i < (int)n; i++)\\n#define rrep(i,x,n) for(int i = int(n) - 1; i >= x; i--)\\n#define all(a) a.begin(), a.end()\\n\\nusing ll = long long;\\nusing ull = unsigned long long;\\n\\ntemplate<class T>\\nbool chmin(T &a, T b) {\\n if(a <= b) return false;\\n a = b;\\n return true;\\n}\\n\\ntemplate<class T>\\nbool chmax(T &a, T b) {\\n if(a >= b) return false;\\n a = b;\\n return true;\\n}\\n\\nint main() {\\n using pv = array<ll,3>;\\n auto cnct = [](pv a, pv b, ll w){\\n rep(s,0,8){\\n pv c = {0,0,0};\\n rep(i,0,3) c[i] = b[i] + (s >> i & 1) * w;\\n bool ok = true;\\n rep(i,0,3){\\n if (c[i] < a[i] || a[i]+w < c[i]) ok = false;\\n }\\n if (ok) return true;\\n }\\n return false;\\n };\\n auto cov = [&](pv a, pv b, ll w){\\n pv c = {0,0,0};\\n rep(i,0,3) c[i] = w - abs(a[i]-b[i]);\\n ll res = 0;\\n rep(i,0,3){\\n res += 2 * c[i] * c[(i+1)%3];\\n }\\n return res;\\n };\\n while (true){\\n int n, k; cin >> n >> k;\\n ll s; cin >> s;\\n if (n == 0) break;\\n vector<pv> a(n);\\n rep(i,0,n){\\n ll x, y, z; cin >> x >> y >> z;\\n a[i] = {x,y,z};\\n }\\n if (k == 1){\\n cout << 6*s*s << endl;\\n continue;\\n }\\n if (k == 2){\\n set<pv> st;\\n bool ok = false;\\n rep(i,0,n){\\n if (st.find(a[i]) == st.end()){\\n st.insert(a[i]);\\n }\\n else {\\n ok = true; \\n }\\n }\\n if (ok){\\n cout << 6*s*s << endl;\\n continue;\\n }\\n }\\n vector<vector<int>> es(n);\\n vector<int> deg(n,0);\\n rep(i,0,n) rep(j,0,n){\\n if (i == j) continue;\\n if (cnct(a[i],a[j],s)) es[i].emplace_back(j), deg[i]++;\\n }\\n vector<int> vis(n,0);\\n const ll inf = 1'000'000'000'000'000'000;\\n ll ans = inf;\\n rep(i,0,n){\\n if (vis[i] == 1) continue;\\n vector<int> ids;\\n ids.emplace_back(i);\\n vis[i] = 1;\\n queue<int> que;\\n que.push(i);\\n while (!que.empty()){\\n int p = que.front(); que.pop(); //cout << p << endl;\\n for (int q : es[p]){\\n if (vis[q] == 1) continue;\\n vis[q] = 1;\\n ids.emplace_back(q);\\n que.push(q);\\n }\\n }\\n int nsiz = ids.size(); //cout << nsiz << endl; cout << endl;\\n if (nsiz < k) continue;\\n bool ng = true;\\n int id = ids[0];\\n for (int j : ids){\\n if (deg[j] == 1) id = j, ng = false;\\n }\\n for (int j : ids) vis[j] = 0;\\n ids.clear();\\n ids.emplace_back(id);\\n vis[id] = 1;\\n que.push(id);\\n while (!que.empty()){\\n int p = que.front(); que.pop();\\n for (int q : es[p]){\\n if (vis[q] == 1) continue;\\n vis[q] = 1;\\n ids.emplace_back(q);\\n que.push(q);\\n break;\\n }\\n }\\n int siz = ids.size(); //cout << nsiz << endl;\\n if (siz < k) continue;\\n int cs = k-1;\\n if (ng){\\n if (siz == k){\\n ll cur = 6*s*s*k;\\n rep(j,0,siz) cur -= cov(a[ids[j]],a[ids[(j+1)%siz]],s);\\n if (k == 2) cur += cov(a[ids[0]],a[ids[1]],s);\\n chmin(ans,cur);\\n continue;\\n }\\n rep(j,0,siz){\\n ids.emplace_back(ids[j]);\\n }\\n }\\n siz = ids.size();\\n vector<ll> cum(siz, 0);\\n rep(j,0,siz-1) {\\n cum[j+1] = cum[j] + cov(a[ids[j]],a[ids[j+1]],s);\\n }\\n rep(j,0,siz) {\\n if(j + cs >= siz) break;\\n chmin(ans, 6*s*s*k - (cum[j+cs] - cum[j]));\\n }\\n }\\n if (ans == inf) ans = -1;\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3432,\n \"score_of_the_acc\": -0.5046,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1612_7719767\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\n#define rep(i,x,n) for(int i = (int)x; i < (int)n; i++)\\n#define rrep(i,x,n) for(int i = int(n) - 1; i >= x; i--)\\n#define all(a) a.begin(), a.end()\\n\\nusing ll = long long;\\nusing ull = unsigned long long;\\n\\ntemplate<class T>\\nbool chmin(T &a, T b) {\\n if(a <= b) return false;\\n a = b;\\n return true;\\n}\\n\\ntemplate<class T>\\nbool chmax(T &a, T b) {\\n if(a >= b) return false;\\n a = b;\\n return true;\\n}\\n\\nconst ll inf = ll(1) << ll(60);\\n\\nint main() {\\n ll n,k,s;\\n using P = std::vector<ll>;\\n while(std::cin >> n >> k >> s, !(n == 0)) {\\n auto is_connect = [&](P a, P b){\\n ll w = s;\\n rep(ss,0,8){\\n P c = {0,0,0};\\n rep(i,0,3) c[i] = b[i] + (ss >> i & 1) * w;\\n bool ok = true;\\n rep(i,0,3){\\n if (c[i] < a[i] || a[i]+w < c[i]) ok = false;\\n }\\n if (ok) return true;\\n }\\n return false;\\n };\\n auto cover_sum = [&](P a, P b) -> ll {\\n std::vector<ll> diff(3);\\n rep(i,0,3) {\\n ll x1 = a[i];\\n ll x2 = b[i];\\n if(x1 > x2) std::swap(x1, x2);\\n diff[i] = x1 + s - x2;\\n }\\n ll sum = 0;\\n rep(i,0,3) sum += 2 * diff[i] * diff[(i + 1) % 3];\\n return sum;\\n };\\n std::vector<P> ps(n, P(3));\\n for(auto &p: ps) {\\n rep(i,0,3) std::cin >> p[i];\\n }\\n if(k == 1) {\\n std::cout << 6 * s * s << '\\\\n';\\n continue;\\n }\\n if (k == 2){\\n set<P> st;\\n bool ok = false;\\n rep(i,0,n){\\n if (st.find(ps[i]) == st.end()){\\n st.insert(ps[i]);\\n }\\n else {\\n ok = true; \\n }\\n }\\n if (ok){\\n cout << 6*s*s << endl;\\n continue;\\n }\\n ll ans = inf;\\n rep(i,0,n) {\\n rep(j,i+1,n) {\\n if(is_connect(ps[i], ps[j])) {\\n chmin(ans, 6*s*s*2 - cover_sum(ps[i], ps[j]));\\n }\\n }\\n }\\n if(ans == inf) ans = -1;\\n std::cout << ans << '\\\\n';\\n continue;\\n }\\n std::vector g(n, std::vector<int>());\\n rep(i,0,n) {\\n rep(j,i+1,n) {\\n if(is_connect(ps[i], ps[j])) {\\n g[i].emplace_back(j);\\n g[j].emplace_back(i);\\n }\\n }\\n }\\n std::vector<std::vector<int>> groups;\\n {\\n std::vector<int> deg1;\\n rep(i,0,n) if(g[i].size() == 1) deg1.emplace_back(i);\\n std::vector<int> group, seen(n, -1);\\n auto dfs = [&](auto &&self, int idx) -> void {\\n for(auto v: g[idx]) {\\n if(seen[v] < 0) {\\n seen[v] = 1;\\n group.emplace_back(v);\\n self(self, v);\\n }\\n }\\n };\\n for(auto i: deg1) {\\n if(seen[i] > 0) continue;\\n group.clear();\\n group.emplace_back(i);\\n seen[i] = 1;\\n dfs(dfs, i);\\n groups.emplace_back(group);\\n }\\n rep(i,0,n) {\\n if(seen[i] > 0) continue;\\n group.clear();\\n seen[i] = 1;\\n group.emplace_back(i);\\n dfs(dfs, i);\\n groups.emplace_back(group);\\n }\\n }\\n ll ans = inf;\\n for(auto group: groups) {\\n int sz = group.size();\\n if(sz < k) continue;\\n std::vector<ll> diffs;\\n rep(i,0,sz-1) {\\n int idx = group[i];\\n int jdx = group[i+1];\\n diffs.emplace_back(cover_sum(ps[idx], ps[jdx]));\\n }\\n int w = k-1;\\n {\\n int idx = group[0];\\n int jdx = group.back();\\n if(is_connect(ps[idx], ps[jdx])) {\\n if(group.size() == k) w = k;\\n int c = diffs.size();\\n diffs.emplace_back(cover_sum(ps[idx], ps[jdx]));\\n rep(i,0,c) diffs.emplace_back(diffs[i]);\\n }\\n }\\n sz = diffs.size();\\n std::vector<ll> cum(sz+1, 0);\\n rep(i,0,sz) {\\n cum[i+1] = cum[i] + diffs[i];\\n }\\n rep(i,0,sz) {\\n if(i + w > sz) break;\\n chmin(ans, 6 * s * s * k - (cum[i+w] - cum[i]));\\n }\\n }\\n if (ans == inf) ans = -1;\\n std::cout << ans << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 3536,\n \"score_of_the_acc\": -0.9868,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1612_6775373\",\n \"code_snippet\": \"#include <algorithm>\\n#include <bitset>\\n#include <cassert>\\n#include <chrono>\\n#include <climits>\\n#include <cmath>\\n#include <cstddef>\\n#include <cstdint>\\n#include <cstdlib>\\n#include <cstring>\\n#include <functional>\\n#include <iomanip>\\n#include <iostream>\\n#include <limits>\\n#include <map>\\n#include <memory>\\n#include <numeric>\\n#include <optional>\\n#include <queue>\\n#include <random>\\n#include <set>\\n#include <stack>\\n#include <string>\\n#include <tuple>\\n#include <type_traits>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <utility>\\n#include <vector>\\n\\n/* macro */\\n\\n#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)\\n#define rrep(i, a, n) for (int i = ((int)(n - 1)); i >= (int)(a); i--)\\n#define Rep(i, a, n) for (i64 i = (i64)(a); i < (i64)(n); i++)\\n#define RRep(i, a, n) for (i64 i = ((i64)(n - i64(1))); i >= (i64)(a); i--)\\n#define all(v) (v).begin(), (v).end()\\n#define rall(v) (v).rbegin(), (v).rend()\\n#define Bit(n) (1LL << (n))\\n\\n/* macro end */\\n\\n/* template */\\n\\nnamespace ebi {\\n\\n#ifdef LOCAL\\n#define debug(...) \\\\\\n std::cerr << \\\"LINE: \\\" << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"]:\\\", \\\\\\n debug_out(__VA_ARGS__)\\n#else\\n#define debug(...)\\n#endif\\n\\nvoid debug_out() { std::cerr << std::endl; }\\n\\ntemplate <typename Head, typename... Tail>\\nvoid debug_out(Head h, Tail... t) {\\n std::cerr << \\\" \\\" << h;\\n if (sizeof...(t) > 0) std::cout << \\\" :\\\";\\n debug_out(t...);\\n}\\n\\ntemplate <typename T1, typename T2>\\nstd::ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &pa) {\\n return os << pa.first << \\\" \\\" << pa.second;\\n}\\n\\ntemplate <typename T1, typename T2>\\nstd::istream &operator>>(std::istream &os, std::pair<T1, T2> &pa) {\\n return os >> pa.first >> pa.second;\\n}\\n\\ntemplate <typename T>\\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &vec) {\\n for (std::size_t i = 0; i < vec.size(); i++)\\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\" \\\");\\n return os;\\n}\\n\\ntemplate <typename T>\\nstd::istream &operator>>(std::istream &os, std::vector<T> &vec) {\\n for (T &e : vec) std::cin >> e;\\n return os;\\n}\\n\\ntemplate <typename T>\\nstd::ostream &operator<<(std::ostream &os, const std::optional<T> &opt) {\\n if (opt) {\\n os << opt.value();\\n } else {\\n os << \\\"invalid value\\\";\\n }\\n return os;\\n}\\n\\nusing std::size_t;\\nusing i32 = std::int32_t;\\nusing u32 = std::uint32_t;\\nusing i64 = std::int64_t;\\nusing u64 = std::uint64_t;\\n\\ntemplate <class T, T init>\\nauto make_vector(int n) {\\n return std::vector<T>(n, init);\\n}\\n\\ntemplate <class T, T init, typename Head, typename... Tail>\\nauto make_vector(Head n, Tail... ts) {\\n return std::vector(n, make_vector<T, init>(ts...));\\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\\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>\\nT pow(T x, i64 n) {\\n T res = 1;\\n while (n > 0) {\\n if (n & 1) res = res * x;\\n x = x * x;\\n n >>= 1;\\n }\\n return res;\\n}\\n\\ntemplate <class T>\\nT mod_pow(T x, i64 n, i64 mod) {\\n T res = 1;\\n while (n > 0) {\\n if (n & 1) res = (res * x) % mod;\\n x = (x * x) % mod;\\n n >>= 1;\\n }\\n return res;\\n}\\n\\ntemplate <class T>\\nT scan() {\\n T val;\\n std::cin >> val;\\n return val;\\n}\\n\\ntemplate <class T>\\nstruct Edge {\\n int to;\\n T cost;\\n Edge(int _to, T _cost = 1) : to(_to), cost(_cost) {}\\n};\\n\\ntemplate <class T>\\nstruct Graph : std::vector<std::vector<Edge<T>>> {\\n using std::vector<std::vector<Edge<T>>>::vector;\\n void add_edge(int u, int v, T w, bool directed = false) {\\n (*this)[u].emplace_back(v, w);\\n if (directed) return;\\n (*this)[v].emplace_back(u, w);\\n }\\n};\\n\\nstruct graph : std::vector<std::vector<int>> {\\n using std::vector<std::vector<int>>::vector;\\n void add_edge(int u, int v, bool directed = false) {\\n (*this)[u].emplace_back(v);\\n if (directed) return;\\n (*this)[v].emplace_back(u);\\n }\\n};\\n\\nconstexpr i64 LNF = std::numeric_limits<i64>::max() / 4;\\n\\nconstexpr int INF = std::numeric_limits<int>::max() / 2;\\n\\nconst std::vector<int> dy = {1, 0, -1, 0, 1, 1, -1, -1};\\nconst std::vector<int> dx = {0, 1, 0, -1, 1, -1, 1, -1};\\n\\n} // namespace ebi\\n\\nnamespace ebi {\\n\\nvoid main_() {\\n int n, k, s;\\n while (std::cin >> n >> k >> s, !(n == 0 && k == 0 && s == 0)) {\\n std::vector<std::tuple<i64, i64, i64>> ps(n);\\n for (auto &[x, y, z] : ps) {\\n std::cin >> x >> y >> z;\\n }\\n if(k == 1) {\\n std::cout << i64(s) * i64(s) * 6 << '\\\\n';\\n continue;\\n }\\n Graph<i64> g(n);\\n auto f = [&](int i, int j) -> std::vector<std::tuple<i64, i64, i64>> {\\n std::vector<std::tuple<i64, i64, i64>> ret;\\n auto [x, y, z] = ps[i];\\n auto [nx, ny, nz] = ps[j];\\n rep(a, 0, 2) {\\n rep(b, 0, 2) {\\n rep(c, 0, 2) {\\n int px = nx + s * a;\\n int py = ny + s * b;\\n int pz = nz + s * c;\\n if (x <= px && px <= x + s && y <= py && py <= y + s &&\\n z <= pz && pz <= z + s) {\\n ret.emplace_back(px, py, pz);\\n }\\n }\\n }\\n }\\n return ret;\\n };\\n rep(i, 0, n) {\\n for (int j = i + 1; j < n; j++) {\\n auto ret = f(i, j);\\n if (ret.size() == 0) continue;\\n auto rhs = f(j, i);\\n assert(rhs.size() == ret.size());\\n ret.insert(ret.end(), all(rhs));\\n\\n i64 res = 0;\\n\\n\\n if (ret.size() == 2) {\\n auto [x, y, z] = ret[0];\\n auto [nx, ny, nz] = ret[1];\\n res = 2 * (std::abs(nx - x) * std::abs(ny - y) +\\n std::abs(ny - y) * std::abs(nz - z) +\\n std::abs(nz - z) * std::abs(nx - x));\\n } else if (ret.size() == 4 || ret.size() == 8) {\\n auto [x, y, z] = ret[0];\\n int idx = ret.size() / 2;\\n while (idx < (int)ret.size()) {\\n auto [nx, ny, nz] = ret[idx];\\n if (x == nx || y == ny || z == nz) {\\n idx++;\\n }\\n else {\\n break;\\n }\\n }\\n auto [nx, ny, nz] = ret[idx];\\n res = 2 * (std::abs(nx - x) * std::abs(ny - y) +\\n std::abs(ny - y) * std::abs(nz - z) +\\n std::abs(nz - z) * std::abs(nx - x));\\n } else {\\n assert(0);\\n }\\n g.add_edge(i, j, res);\\n }\\n }\\n std::vector<int> seen(n, -1);\\n i64 ans = -1;\\n std::vector<i64> a;\\n int root = -1;\\n auto dfs = [&](auto &&self, int v, int par = -1) -> void {\\n seen[v] = 1;\\n for (auto [nv, cost] : g[v]) {\\n if (nv == par) continue;\\n if(nv == root) {\\n a.emplace_back(cost);\\n continue;\\n }\\n if (seen[nv] < 0) {\\n a.emplace_back(cost);\\n self(self, nv, v);\\n }\\n }\\n return;\\n };\\n rep(i, 0, n) {\\n if (g[i].size() == 1 && seen[i] < 0) {\\n a.clear();\\n dfs(dfs, i);\\n if ((int)a.size() < k - 1) continue;\\n i64 sum = 0;\\n rep(j,0,k-1) {\\n sum += a[j];\\n }\\n chmax(ans, sum);\\n int l = 0, r = k-1;\\n while(r < (int)a.size()) {\\n sum -= a[l++];\\n sum += a[r++];\\n chmax(ans, sum);\\n }\\n }\\n }\\n rep(i,0,n) {\\n if(seen[i] < 0) {\\n a.clear();\\n root = i;\\n dfs(dfs, i);\\n if((int)a.size() < k-1) continue;\\n if((int)a.size() == k) {\\n chmax(ans, std::accumulate(all(a), i64(0)));\\n continue;\\n }\\n {\\n auto b = a;\\n a.insert(a.end(), all(b));\\n }\\n i64 sum = 0;\\n rep(j,0,k-1) {\\n sum += a[j];\\n }\\n int l = 0, r = k-1;\\n while(r < (int)a.size()) {\\n sum -= a[l++];\\n sum += a[r++];\\n chmax(ans, sum);\\n }\\n }\\n }\\n if(ans > 0) {\\n ans = i64(s) * i64(s) * 6 * k - ans;\\n }\\n std::cout << ans << '\\\\n';\\n }\\n}\\n\\n} // namespace ebi\\n\\nint main() {\\n std::cout << std::fixed << std::setprecision(15);\\n std::cin.tie(nullptr);\\n std::ios::sync_with_stdio(false);\\n int t = 1;\\n // std::cin >> t;\\n while (t--) {\\n ebi::main_();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3480,\n \"score_of_the_acc\": -0.0628,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1612_6717176\",\n \"code_snippet\": \"using namespace std;\\n#include <bits/stdc++.h>\\n\\n#define ll long long\\n#define ul unsigned long\\n#define dd long double\\n#define MAX 9223372036854775807\\n#define REP(i,st,N) for(ll i=st; i<N; i++)\\n\\nll sp;\\n\\nll solve(vector<ll>& sq1, vector<ll>& sq2, ll s) {\\n\\tvector<ll> e(3);\\n\\tREP(i, 0, 3) {\\n\\t\\tll mi = min(sq1[i], sq2[i]);\\n\\t\\tll ma = max(sq1[i], sq2[i]);\\n\\t\\te[i] = max(mi + s - ma, 0LL);\\n\\t\\tif (e[i] == 0) return 0;\\n\\t}\\n\\tll sum = 0;\\n\\tREP(i, 0, 3) sum += 2 * e[i] * e[(i + 1) % 3];\\n\\treturn sum;\\n}\\n\\nll dfs(vector<vector<pair<ll, ll>>>& g, ll st, ll pre, ll k, ll initK, vector<bool>& done) {\\n\\tll ans = -1;\\n\\tif (k == 0) {\\n\\t\\tfor (pair<ll, ll> p : g[st]) if (p.first == sp && initK != 2) return p.second;\\n\\t\\treturn 0;\\n\\t}\\n\\n\\tfor (pair<ll, ll> p : g[st]) if (p.first != pre && !done[p.first]) {\\n\\t\\tdone[p.first] = true;\\n\\t\\tll t = dfs(g, p.first, st, k - 1, initK, done);\\n\\t\\tif (t >= 0) t += p.second;\\n\\t\\tans = max(ans, t);\\n\\t\\tdone[p.first] = false;\\n\\t}\\n\\treturn ans;\\n}\\n\\nint main() {\\n\\twhile (1) {\\n\\t\\tll n, k, s; cin >> n >> k >> s;\\n\\t\\tif (!(n || k || s)) break;\\n\\t\\tvector<vector<ll>> sq;\\n\\t\\tll ma = 6 * s * s * k;\\n\\t\\tREP(i, 0, n) {\\n\\t\\t\\tvector<ll> c(3);\\n\\t\\t\\tcin >> c[0] >> c[1] >> c[2];\\n\\t\\t\\tsq.push_back(c);\\n\\t\\t}\\n\\t\\tif (n == 1 || k == 1) {\\n\\t\\t\\tcout << ma << endl;\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tvector<vector<pair<ll, ll>>> g(n);\\n\\t\\tREP(i, 0, n) REP(j, i + 1, n) {\\n\\t\\t\\tll x = solve(sq[i], sq[j], s);\\n\\t\\t\\tif (x > 0) {\\n\\t\\t\\t\\tg[i].push_back({ j,x });\\n\\t\\t\\t\\tg[j].push_back({ i,x });\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tll x = 0;\\n\\t\\tvector<bool> done(n, false);\\n\\t\\tREP(i, 0, n) {\\n\\t\\t\\tsp = i;\\n\\t\\t\\tx = max(x, dfs(g, i, -1, k - 1,k, done));\\n\\t\\t}\\n\\t\\tif (x <= 0) cout << -1 << endl;\\n\\t\\telse cout << ma - x << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3456,\n \"score_of_the_acc\": -0.0564,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1612_6637783\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing ld = long double;\\nusing vl = vector<ll>;\\ntemplate<class T> using vc = vector<T>;\\ntemplate<class T> using vvc = vector<vector<T>>;\\n\\n#define eb emplace_back\\n#define all(x) (x).begin(), (x).end()\\n#define rep(i, n) for (ll i = 0; i < (n); i++)\\n#define repr(i, n) for (ll i = (n)-1; i >= 0; i--)\\n#define repe(i, l, r) for (ll i = (l); i < (r); i++)\\n#define reper(i, l, r) for (ll i = (r)-1; i >= (l); i--)\\n#define repa(i,n) for (auto& i: n)\\n\\ntemplate<class T1, class T2> inline bool chmax(T1 &a, const T2 &b) {if (a<b) { a=b; return 1;} return 0;}\\ntemplate<class T1, class T2> inline bool chmin(T1 &a, const T2 &b) {if (b<a) { a=b; return 1;} return 0;}\\n\\nstruct init{init(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);cerr<<fixed<<setprecision(15);}}init_;\\n\\ntemplate <typename T, typename U> ostream& operator<<(ostream&out,const pair<T, U>&a){return out<<a.first<<' '<<a.second;}\\ntemplate <typename T> ostream& operator<<(ostream&out, const vector<T>&a){for(auto it=a.begin();it!= a.end();){out<<*it;if(++it!=a.end())out<<' ';}return out;}\\ntemplate <typename T, size_t N> ostream& operator<<(ostream&out, const array<T, N>&a){for(auto it=a.begin();it!= a.end();){out<<*it;if(++it!=a.end())out<<' ';}return out;}\\ntemplate <typename T> ostream& operator<<(ostream&out, const set<T>&a){for(auto it=a.begin();it!=a.end();){out<<*it;if(++it!=a.end())out<<' ';}return out;}\\ntemplate <typename T, typename U> ostream& operator<<(ostream&out, const map<T, U>&a){for(auto it=a.begin();it!=a.end();){out<<*it;if(++it!=a.end())out<<'\\\\n';}return out;}\\n\\n#ifdef DEBUG\\ntemplate <class T, class N> void verr(const vector<T>& a, const N& n) { rep(i, n) cerr << a[i] << \\\" \\\"; cerr << endl; }\\ntemplate <class T, class N, size_t AN> void verr(const array<T, AN>& a, const N& n) { rep(i, n) cerr << a[i] << \\\" \\\"; cerr << endl; }\\nll dbgt = 1; void err() { cerr << \\\"passed \\\" << dbgt++ << endl; }\\ntemplate<class H, class... T> void err(H&& h,T&&... t){ cerr<< h << (sizeof...(t)?\\\" \\\":\\\"\\\\n\\\") << flush; if(sizeof...(t)>0) err(forward<T>(t)...); }\\n#else\\nvoid err(){}\\ntemplate <class H, class... T>\\nvoid err(H &&h, T &&...t) {}\\ntemplate <class H, class... T>\\nvoid verr(H &&h, T &&...t) {}\\n#endif\\n\\nconst ll INF = 4e18;\\nconst ld EPS = 1e-11;\\nconst ld PI = acos(-1.0L);\\n// const ll MOD = 1e9 + 7;\\nconst ll MOD = 998244353;\\n//--------------------------------------------------------------------------------//\\nstruct point {\\n int x, y, z;\\n point(){}\\n point(int x, int y, int z): x(x), y(y), z(z){}\\n};\\n\\nstruct UnionFind {\\nprivate:\\n vector<int> par;\\n vector<int> count;\\n vector<int> rank;\\npublic:\\n UnionFind(int N) {\\n count.assign(N, 1);\\n rank.assign(N, 0);\\n par.assign(N, 0);\\n rep(i, N) par[i] = i;\\n }\\n\\n int root(int x) {\\n if (par[x] == x)\\n return x;\\n else {\\n par[x] = root(par[x]);\\n return par[x];\\n }\\n }\\n\\n void unite(int x, int y) {\\n x = root(x), y = root(y);\\n if (x == y) return;\\n if (rank[x] < rank[y])\\n swap(x, y);\\n else if (rank[x] == rank[y])\\n rank[y]++;\\n par[y] = x;\\n count[x] += count[y];\\n return;\\n }\\n\\n int size(int x) {\\n return count[root(x)];\\n }\\n\\n bool issame(int x, int y) {\\n return root(x) == root(y);\\n }\\n};\\nusing UF = struct UnionFind;\\n\\n\\nvoid solve(int N, int K, int S){\\n // err(N, K, S);\\n vc<point> ps(N);\\n rep(i, N) cin >> ps[i].x >> ps[i].y >> ps[i].z;\\n if(K == 1) {\\n cout << 6 * S * S << endl;\\n return;\\n }\\n\\n auto dup = [&](point p1, point p2) -> int {\\n ll s = 1, ssum = 0;\\n if (p1.x >= p2.x + S or p2.x >= p1.x + S) return 0;\\n int dx = min(p1.x + S - p2.x, p2.x + S - p1.x);\\n if(p1.y >= p2.y + S or p2.y >= p1.y + S) return 0;\\n int dy = min(p1.y + S - p2.y, p2.y + S - p1.y);\\n if (p1.z >= p2.z + S or p2.z >= p1.z + S) return 0;\\n int dz = min(p1.z + S - p2.z, p2.z + S - p1.z);\\n ssum = 2 * (dx * dy + dy * dz + dz * dx);\\n return ssum;\\n };\\n\\n UF ufall(N);\\n vvc<pair<int, int>> G(N);\\n rep(i, N) repe(j, i + 1, N) {\\n auto s = dup(ps[i], ps[j]);\\n if(s > 0) {\\n G[i].eb(j, s);\\n G[j].eb(i, s);\\n ufall.unite(i, j);\\n }\\n }\\n\\n ll ans = INF;\\n rep(rt, N) {\\n if (ufall.size(rt) < K) continue;\\n\\n bool iscycle = true;\\n int v1;\\n rep(i, N) {\\n if (!ufall.issame(i, rt)) continue;\\n if (G[i].size() < 2) {\\n iscycle = false;\\n v1 = i;\\n }\\n }\\n\\n if (iscycle) {\\n vl es;\\n int cur = rt, par = G[cur][0].first;\\n int ncur, npar;\\n do {\\n for(auto[to, ts]: G[cur]) {\\n if (to == par) continue;\\n es.eb(ts);\\n tie(ncur, npar) = {to, cur};\\n }\\n // err(\\\"cp\\\", cur, par);\\n tie(cur, par) = {ncur, npar};\\n } while (cur != rt);\\n int en = es.size();\\n if(ufall.size(rt) == K) {\\n chmin(ans, K * 6 * S * S - accumulate(all(es), 0ll));\\n // err(\\\"pass\\\", K * 6 * S * S - accumulate(all(es), 0ll), en);\\n continue;\\n }\\n vl acc(en * 2 + 1);\\n rep(i, 2 * en) acc[i + 1] = acc[i] + es[i % en];\\n repe(i, K - 1, en * 2) chmin(ans, K * 6 * S * S - (acc[i] - acc[i - K + 1]));\\n } else {\\n vl es;\\n int cur = v1, par = -1;\\n int ncur, npar;\\n while (true) {\\n bool update = false;\\n for(auto[to, ts]: G[cur]) {\\n if (to == par) continue;\\n es.eb(ts);\\n update = true;\\n tie(ncur, npar) = {to, cur};\\n }\\n if (!update) break;\\n tie(cur, par) = {ncur, npar};\\n }\\n int en = es.size();\\n vl acc(en + 1);\\n rep(i, en) acc[i + 1] = acc[i] + es[i];\\n repe(i, K - 1, en + 1) chmin(ans, K * 6 * S * S - (acc[i] - acc[i - K + 1]));\\n }\\n }\\n cout << (ans == INF ? -1 : ans) << endl;\\n}\\n\\nint main() {\\n int counter = 0;\\n while (true) {\\n int N, K, S;\\n cin >> N >> K >> S;\\n counter++;\\n if (N == 0) break;\\n solve(N, K, S);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3440,\n \"score_of_the_acc\": -0.0522,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1612_6026797\",\n \"code_snippet\": \"//Let's join Kaede Takagaki Fan Club !!\\n#pragma GCC optimize(\\\"Ofast\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#include <cstdio>\\n#include <cstring>\\n#include <cstdlib>\\n#include <cmath>\\n#include <ctime>\\n#include <cassert>\\n#include <string>\\n#include <algorithm>\\n#include <vector>\\n#include <queue>\\n#include <stack>\\n#include <functional>\\n#include <iostream>\\n#include <map>\\n#include <set>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <cassert>\\n#include <iomanip>\\n#include <chrono>\\n#include <random>\\n#include <bitset>\\n#include <complex>\\n#include <ext/pb_ds/assoc_container.hpp>\\n#include <ext/pb_ds/tree_policy.hpp>\\nusing namespace std;\\n#define int long long\\n//#define L __int128\\ntypedef long long ll;\\ntypedef pair<int,int> P;\\ntypedef pair<int,P> P1;\\ntypedef pair<P,P> P2;\\n#define pu push\\n#define pb push_back\\n#define eb emplace_back\\n#define mp make_pair\\n#define eps 1e-7\\n#define INF 1000000000\\n#define a first\\n#define b second\\n#define fi first\\n#define sc second\\n#define rng(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\\n#define rep(i,x) for(int i=0;i<x;i++)\\n#define repn(i,x) for(int i=1;i<=x;i++)\\n#define SORT(x) sort(x.begin(),x.end())\\n#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())\\n#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())\\n#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())\\n#define all(x) x.begin(),x.end()\\n#define si(x) int(x.size())\\n \\n#ifdef LOCAL\\n#define dmp(x) cerr<<__LINE__<<\\\" \\\"<<#x<<\\\" \\\"<<x<<endl\\n#else\\n#define dmp(x) void(0)\\n#endif\\n \\ntemplate<class t,class u> bool chmax(t&a,u b){if(a<b){a=b;return true;}else return false;}\\ntemplate<class t,class u> bool chmin(t&a,u b){if(b<a){a=b;return true;}else return false;}\\n \\ntemplate<class t> using vc=vector<t>;\\n \\ntemplate<class t,class u>\\nostream& operator<<(ostream& os,const pair<t,u>& p){\\n\\treturn os<<\\\"{\\\"<<p.fi<<\\\",\\\"<<p.sc<<\\\"}\\\";\\n}\\n \\ntemplate<class t> ostream& operator<<(ostream& os,const vc<t>& v){\\n\\tos<<\\\"{\\\";\\n\\tfor(auto e:v)os<<e<<\\\",\\\";\\n\\treturn os<<\\\"}\\\";\\n}\\n \\n\\ntemplate<class T>\\nvoid o(const T &a,bool space=false){\\n\\tcout << a << (space?' ':'\\\\n');\\n}\\n//ios::sync_with_stdio(false);\\n//const ll mod = 998244353;\\nconst ll mod = 1000000007;\\nmt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());\\ntemplate<class T>\\nvoid add(T&a,T b){\\n\\ta+=b;\\n\\tif(a >= mod) a-=mod;\\n}\\nll modpow(ll x,ll n){\\n\\tll res=1;\\n\\twhile(n>0){\\n\\t\\tif(n&1) res=res*x%mod;\\n\\t\\tx=x*x%mod;\\n\\t\\tn>>=1;\\n\\t}\\n\\treturn res;\\n}\\n#define _sz 1\\nll F[_sz],R[_sz];\\nvoid make(){\\n\\tF[0] = 1;\\n\\tfor(int i=1;i<_sz;i++) F[i] = F[i-1]*i%mod;\\n\\tR[_sz-1] = modpow(F[_sz-1], mod-2);\\n\\tfor(int i=_sz-2;i>=0;i--) R[i] = R[i+1] * (i+1) % mod;\\n}\\nll C(int a,int b){\\n\\tif(b < 0 || a < b) return 0;\\n\\treturn F[a]*R[b]%mod*R[a-b]%mod;\\n}\\n//複数テストケースなので積み上げる変数はローカルに！\\n//置けないなら必ず初期化！\\nint n, k, s, x[2005], y[2005], z[2005];\\nvoid solve(){\\n\\t//最初の入力は済んでいる\\n\\trep(i, n) cin >> x[i] >> y[i] >> z[i];\\n\\tauto area = [&](P p, P q){\\n\\t\\tint x = min(p.a + s, q.a + s) - max(p.a, q.a);\\n\\t\\tint y = min(p.b + s, q.b + s) - max(p.b, q.b);\\n\\t\\tchmax(x, 0LL);\\n\\t\\tchmax(y, 0LL);\\n\\t\\treturn x*y;\\n\\t};\\n\\tvc<vc<P>>edge(n);\\n\\trep(i, n){\\n\\t\\trep(j, i){\\n\\t\\t\\tint f = area(mp(x[j], y[j]), mp(x[i], y[i]));\\n\\t\\t\\tint g = area(mp(x[j], z[j]), mp(x[i], z[i]));\\n\\t\\t\\tint h = area(mp(z[j], y[j]), mp(z[i], y[i]));\\n\\t\\t\\tif(!f or !g or !h) continue;\\n\\t\\t\\t\\n\\t\\t\\tedge[i].eb(j, f + g + h);\\n\\t\\t\\tedge[j].eb(i, f + g + h);\\n\\t\\t}\\n\\t}\\n\\tint ans = -1e18;\\n\\trep(i, n){\\n\\t\\tif(k == 1){\\n\\t\\t\\tchmax(ans, 0LL);\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tfor(auto a:edge[i]){\\n\\t\\t\\tvc<int>vis(n, 0);\\n\\t\\t\\tvis[i] = 1;\\n\\t\\t\\t\\n\\t\\t\\tint cur = a.a;\\n\\t\\t\\tint tmp = a.b;\\n\\t\\t\\tint zan = k-1;\\n\\t\\t\\twhile(1){\\n\\t\\t\\t\\tif(vis[cur]) break;\\n\\t\\t\\t\\tvis[cur] = 1;\\n\\t\\t\\t\\tzan --;\\n\\t\\t\\t\\tif(zan == 0) {\\n\\t\\t\\t\\t\\tif(k > 2){\\n\\t\\t\\t\\t\\t\\tfor(auto a:edge[cur]){\\n\\t\\t\\t\\t\\t\\t\\tif(a.a == i){\\n\\t\\t\\t\\t\\t\\t\\t\\ttmp += a.b;\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tfor(auto a:edge[cur]){\\n\\t\\t\\t\\t\\tif(!vis[a.a]) {\\n\\t\\t\\t\\t\\t\\tcur = a.a;\\n\\t\\t\\t\\t\\t\\ttmp += a.b;\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif(!zan) chmax(ans, tmp);\\n\\t\\t}\\n\\t}\\n\\tif(ans < 0) o(-1);\\n\\telse o(2LL * (3LL*s*s*k - ans));\\n}\\nsigned main(){\\n\\t//cin.tie(0);\\n\\tios::sync_with_stdio(0);\\n\\tcout<<fixed<<setprecision(20);\\n\\twhile(true){\\n\\t\\tcin>>n>>k>>s;\\n\\t\\t//終了条件\\n\\t\\tif(!n) return 0;\\n\\t\\tsolve();\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3244,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1612_6022554\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <map>\\n#include <set>\\n#include <queue>\\n#include <bitset>\\n#include <climits>\\n#include <string>\\n#include <cmath>\\n#include <bitset>\\n#include <complex>\\n#include <functional>\\n#include <ctime>\\n#include <cassert>\\n#include <fstream>\\n#include <stack>\\n#include <random>\\n#include <iomanip>\\n#include <time.h>\\n#include <list>\\n#include <unordered_map>\\n\\n#include <algorithm>\\n#include <array>\\n\\nusing namespace std;\\ntypedef long long ll;\\ntypedef long double dd;\\ntypedef vector<ll> vl;\\ntypedef vector<dd> vd;\\ntypedef vector<vector<ll>> vvl;\\ntypedef vector<vector<dd>> vvd;\\n//#define i_7 (ll)(1E9+7)\\n#define i_7 998244353\\n#define i_5 i_7-2\\nll mod(ll a){\\n ll c=a%i_7;\\n if(c>=0)return c;\\n return c+i_7;\\n}\\ntypedef pair<ll,ll> l_l;\\ntypedef pair<dd,dd> d_d;\\nll inf=(ll)1E18;\\n#define rep(i,l,r) for(ll i=l;i<=r;i++)\\n#define pb push_back\\nll max(ll a,ll b){if(a<b)return b;else return a;}\\nll min(ll a,ll b){if(a>b)return b;else return a;}\\ndd EPS=1E-6;\\ndd PI=acos(-1);\\n#define endl \\\"\\\\n\\\"\\n#define fastio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);\\n\\n\\n\\nstruct Edge{\\n ll to,cost;\\n Edge(ll to, ll cost){\\n this->to = to;\\n this->cost = cost;\\n }\\n};\\n\\nll hoge;\\n\\nvoid dfs(ll idx, vector<bool> &seen, const vector<vector<Edge>> &v, vector<ll> &tmp){\\n seen[idx] = true;\\n hoge=idx;\\n for(Edge e : v[idx]){\\n if(seen[e.to])continue;\\n tmp.pb(e.cost);\\n dfs(e.to, seen, v, tmp);\\n }\\n}\\n\\n\\nsigned main(){fastio\\n while(true){\\n ll n,K,s;cin>>n>>K>>s;\\n if(n==0)break;\\n vvl x(n);\\n rep(i,0,n-1){\\n x[i].resize(3);\\n cin>>x[i][0]>>x[i][1]>>x[i][2];\\n }\\n vector<vector<Edge>> v(n);\\n rep(i,0,n-1){\\n rep(j,0,n-1){\\n if(i>=j)continue;\\n bool ok = true;\\n vl u;\\n rep(k,0,2){\\n if(x[j][k]<=x[i][k] && x[i][k]<=x[j][k]+s){\\n u.pb(x[j][k]+s-x[i][k]);\\n }else if(x[i][k]<=x[j][k] && x[j][k]<=x[i][k]+s){\\n u.pb(x[i][k]+s-x[j][k]);\\n }else{\\n ok = false;\\n }\\n }\\n if(ok){\\n ll pro=0;\\n rep(k,0,2){\\n rep(l,0,2){\\n if(k<l){\\n pro += 2*u[k]*u[l];\\n }\\n }\\n }\\n ll cost = pro;\\n v[i].pb(Edge(j,cost));\\n v[j].pb(Edge(i,cost));\\n }\\n }\\n }\\n vector<bool> seen(n, false);\\n ll ans=inf;\\n rep(i,0,n-1){\\n if(seen[i])continue;\\n if(v[i].size() == 0){\\n if(K==1){\\n ans = min(ans, 6*s*s);\\n }\\n continue;\\n }\\n vector<ll> tm;\\n bool loop = false;\\n if(v[i].size() == 1){\\n dfs(i, seen, v, tm);\\n }else{\\n seen[i] = true;\\n vector<ll> tmp;\\n tmp.pb(v[i][0].cost);\\n dfs(v[i][0].to, seen, v, tmp);\\n if(hoge == v[i][1].to)loop = true;\\n vector<ll> tmp2;\\n tmp2.pb(v[i][1].cost);\\n if(!seen[v[i][1].to]){\\n dfs(v[i][1].to, seen, v, tmp2);\\n }\\n reverse(tmp2.begin(), tmp2.end());\\n for(ll co : tmp2){\\n tm.pb(co);\\n }\\n for(ll co : tmp){\\n tm.pb(co);\\n }\\n }\\n ll num;\\n if(loop){\\n num = tm.size();\\n }else{\\n num = tm.size() + 1;\\n }\\n if(num < K){\\n continue;\\n }\\n ll m = tm.size();\\n vl sum(m+1,0);\\n rep(i,1,m){\\n sum[i] = sum[i-1] + tm[i-1];\\n }\\n ll maxi = 0;\\n if(loop){\\n if(K==num){\\n maxi = sum[m];\\n }else{\\n rep(j,K-1,m+(K-1)-1){\\n if(j<=m){\\n maxi = max(maxi, sum[j]-sum[j-(K-1)]);\\n }else{\\n maxi = max(maxi, sum[m]-sum[j-(K-1)]+sum[j-m]);\\n }\\n }\\n }\\n }else{\\n rep(j,K-1,m){\\n maxi = max(maxi, sum[j]-sum[j-(K-1)]);\\n }\\n }\\n ans = min(ans, 6*s*s*K - maxi);\\n }\\n if(ans == inf){\\n cout<<-1<<endl;\\n }else{\\n cout<<ans<<endl;\\n }\\n }\\n \\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3508,\n \"score_of_the_acc\": -0.0703,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1612_6015570\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing ll = long long;\\n#define var auto\\nconst char newl = '\\\\n';\\n\\nusing namespace std;\\n\\ntemplate<typename T1, typename T2> inline void chmin(T1& a, T2 b) { if (a > b) a = b; }\\ntemplate<typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }\\n\\nconst ll inf = INT32_MAX;\\n\\nstruct Box;\\nbool ow(Box a, Box b);\\n\\nll w;\\n\\nstruct Box {\\n ll x, y, z;\\n ll s() {\\n return w * w * 6;\\n }\\n ll eats(Box& a) {\\n if (not ow(*this, a)) return 0;\\n var dx = w - abs(x - a.x);\\n var dy = w - abs(y - a.y);\\n var dz = w - abs(z - a.z);\\n assert(dx <= w && dy <= w && dz <= w);\\n ll res = 0;\\n return (dx * dy + dy * dz + dz * dx) * 2;\\n }\\n};\\n\\nbool ow(Box a, Box b) {\\n ll maxdist = 0;\\n chmax(maxdist, abs(a.x - b.x));\\n chmax(maxdist, abs(a.y - b.y));\\n chmax(maxdist, abs(a.z - b.z));\\n assert(maxdist != w);\\n return maxdist < w;\\n}\\n\\nstruct Boxes {\\n ll s = 0;\\n deque<Box> q;\\n Box prev2;\\n Box prev1;\\n\\n void check() {\\n ll res = 0;\\n for (int i = 0; i < q.size(); i++) {\\n res += q[i].s();\\n if (i == 0) continue;\\n res -= q[i].eats(q[i - 1]);\\n }\\n if (res != s) {\\n cout << \\\"\\\";\\n }\\n assert(res == s);\\n }\\n\\n void push(Box cur) {\\n check();\\n if (q.size() != 0) {\\n s -= cur.eats(q.back());\\n }\\n s += cur.s();\\n q.emplace_back(cur);\\n }\\n void pop() {\\n check();\\n assert(!q.empty());\\n var popped = q.front(); q.pop_front();\\n s -= popped.s();\\n if (q.size() == 0) return;\\n s += popped.eats(q.front());\\n }\\n};\\n\\nstruct UnionFind {\\n int num;\\n vector<int> rs, ps;\\n UnionFind(int n) :num(n), rs(n, 1), ps(n, 0) {\\n iota(ps.begin(), ps.end(), 0);\\n }\\n int find(int x) {\\n return (x == ps[x] ? x : ps[x] = find(ps[x]));\\n }\\n bool same(int x, int y) {\\n return find(x) == find(y);\\n }\\n void unite(int x, int y) {\\n x = find(x); y = find(y);\\n if (x == y) return;\\n if (rs[x] < rs[y]) swap(x, y);\\n rs[x] += rs[y];\\n ps[y] = x;\\n num--;\\n }\\n int size(int x) {\\n return rs[find(x)];\\n }\\n int count() const {\\n return num;\\n }\\n};\\n\\nbool solve() {\\n int n, k;\\n cin >> n >> k >> w;\\n if (n == 0) return false;\\n vector<Box> v(n);\\n for (var&& item : v) cin >> item.x >> item.y >> item.z;\\n\\n vector<vector<int>> graph(n);\\n UnionFind uf(n);\\n for (int i = 0; i < n; i++) {\\n for (int j = i + 1; j < n; j++) {\\n if (ow(v[i], v[j])) {\\n uf.unite(i, j);\\n graph[i].emplace_back(j);\\n graph[j].emplace_back(i);\\n }\\n }\\n }\\n\\n\\n const ll inf = LLONG_MAX;\\n ll res = inf;\\n\\n for (int id = 0; id < n; id++) {\\n bool has_point = false;\\n int first = -1;\\n for (int i = 0; i < n; i++) {\\n if (uf.find(i) != id) continue;\\n if (graph[i].size() == 1) {\\n if (not has_point) {\\n first = i;\\n }\\n has_point = true;\\n continue;\\n }\\n if (not has_point) {\\n first = i;\\n }\\n }\\n\\n if (first == -1) continue;\\n if (uf.size(first) < k) continue;\\n\\n int last = -1;\\n int cur = first;\\n Boxes b; b.push(v[cur]);\\n\\n while (b.q.size() < k) {\\n for (var&& adj : graph[cur]) {\\n if (adj == last) continue;\\n b.push(v[adj]);\\n last = cur;\\n cur = adj;\\n break;\\n }\\n }\\n\\n assert(b.q.size() == k);\\n\\n if (k != 1 && uf.size(first) == k && not has_point) {\\n b.s -= b.q.front().eats(b.q.back());\\n chmin(res, b.s);\\n continue;\\n }\\n\\n ll curres = b.s;\\n\\n int cnt = has_point ? (uf.size(first) - k) : (uf.size(first) - 1);\\n for (int _ = 0; _ < cnt; _++) {\\n b.pop();\\n for (var&& adj : graph[cur]) {\\n if (adj == last) continue;\\n b.push(v[adj]);\\n last = cur;\\n cur = adj;\\n break;\\n }\\n assert(b.q.size() == k);\\n chmin(curres, b.s);\\n }\\n\\n chmin(res, curres);\\n }\\n if (res == inf) res = -1;\\n cout << res << endl;\\n return true;\\n}\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n while (solve());\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3432,\n \"score_of_the_acc\": -0.0501,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1612_6011336\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n//#include <atcoder/all>\\n//using namespace atcoder;\\n#pragma GCC target (\\\"avx2\\\")\\n#pragma GCC optimization (\\\"O3\\\")\\n#pragma GCC optimization (\\\"unroll-loops\\\")\\nusing namespace std;\\n \\ntypedef vector<int> VI;\\ntypedef vector<VI> VVI;\\ntypedef vector<string> VS;\\ntypedef pair<int, int> PII;\\ntypedef pair<int, int> pii;\\ntypedef pair<long long, long long> PLL;\\ntypedef pair<int, PII> TIII;\\n \\ntypedef long long ll;\\ntypedef long double ld;\\ntypedef unsigned long long ull;\\n \\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 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 \\n#define MOD 1000000007\\n \\ntemplate<class T1, class T2> inline bool chmax(T1 &a, T2 b) {if (a < b) {a = b; return true;} return false;}\\ntemplate<class T1, class T2> inline bool chmin(T1 &a, T2 b) {if (a > b) {a = b; return true;} return false;}\\nconst double EPS = 1e-8, PI = acos(-1);\\nconst double pi = 3.141592653589793238462643383279;\\n//ここから編集 \\ntypedef string::const_iterator State;\\nll GCD(ll a, ll b){\\n return (b==0)?a:GCD(b, a%b);\\n}\\nll LCM(ll a, ll b){\\n return a/GCD(a, b) * b;\\n}\\ntemplate< int mod >\\nstruct ModInt {\\n int x;\\n \\n ModInt() : x(0) {}\\n \\n ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}\\n \\n ModInt &operator+=(const ModInt &p) {\\n if((x += p.x) >= mod) x -= mod;\\n return *this;\\n }\\n \\n ModInt &operator-=(const ModInt &p) {\\n if((x += mod - p.x) >= mod) x -= mod;\\n return *this;\\n }\\n \\n ModInt &operator*=(const ModInt &p) {\\n x = (int) (1LL * x * p.x % mod);\\n return *this;\\n }\\n \\n ModInt &operator/=(const ModInt &p) {\\n *this *= p.inverse();\\n return *this;\\n }\\n \\n ModInt operator-() const { return ModInt(-x); }\\n \\n ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }\\n \\n ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }\\n \\n ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }\\n \\n ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }\\n \\n bool operator==(const ModInt &p) const { return x == p.x; }\\n \\n bool operator!=(const ModInt &p) const { return x != p.x; }\\n \\n ModInt inverse() const {\\n int a = x, b = mod, u = 1, v = 0, t;\\n while(b > 0) {\\n t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return ModInt(u);\\n }\\n \\n ModInt pow(int64_t n) const {\\n ModInt ret(1), mul(x);\\n while(n > 0) {\\n if(n & 1) ret *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return ret;\\n }\\n \\n friend ostream &operator<<(ostream &os, const ModInt &p) {\\n return os << p.x;\\n }\\n \\n friend istream &operator>>(istream &is, ModInt &a) {\\n int64_t t;\\n is >> t;\\n a = ModInt< mod >(t);\\n return (is);\\n }\\n \\n static int get_mod() { return mod; }\\n};\\n \\nusing modint = ModInt< 998244353 >;\\ntemplate< typename T >\\nstruct Combination {\\n vector< T > _fact, _rfact, _inv;\\n \\n Combination(int sz) : _fact(sz + 1), _rfact(sz + 1), _inv(sz + 1) {\\n _fact[0] = _rfact[sz] = _inv[0] = 1;\\n for(int i = 1; i <= sz; i++) _fact[i] = _fact[i - 1] * i;\\n _rfact[sz] /= _fact[sz];\\n for(int i = sz - 1; i >= 0; i--) _rfact[i] = _rfact[i + 1] * (i + 1);\\n for(int i = 1; i <= sz; i++) _inv[i] = _rfact[i] * _fact[i - 1];\\n }\\n \\n inline T fact(int k) const { return _fact[k]; }\\n \\n inline T rfact(int k) const { return _rfact[k]; }\\n \\n inline T inv(int k) const { return _inv[k]; }\\n \\n T P(int n, int r) const {\\n if(r < 0 || n < r) return 0;\\n return fact(n) * rfact(n - r);\\n }\\n \\n T C(int p, int q) const {\\n if(q < 0 || p < q) return 0;\\n return fact(p) * rfact(q) * rfact(p - q);\\n }\\n \\n T H(int n, int r) const {\\n if(n < 0 || r < 0) return (0);\\n return r == 0 ? 1 : C(n + r - 1, r);\\n }\\n};\\n \\nll modpow(ll x, ll n, ll mod) {\\n ll res = 1;\\n x %= mod;\\n if(x == 0) return 0;\\n while(n) {\\n if(n&1) res = (res * x) % mod;\\n x = (x * x) % mod;\\n n >>= 1;\\n }\\n return res;\\n} \\ninline long long mod(long long a, long long m) {\\n return (a % m + m) % m;\\n}\\ntemplate<typename T> \\nstruct BIT{\\n int N;\\n std::vector<T> node;\\n BIT(){}\\n BIT(int n){\\n N = n;\\n node.resize(N+10);\\n }\\n void build(int n) {\\n N = n;\\n node.resize(N+10);\\n }\\n /* a: 1-indexed */\\n void add(int a, T x){\\n for(int i=a; i<(int)node.size(); i += i & -i) node[i] += x;\\n }\\n\\n /* [1, a] */\\n T sum(int a){\\n T res = 0;\\n for(int x=a; x>0; x -= x & -x) res += node[x];\\n return res;\\n }\\n\\n /* [l, r] */\\n T rangesum(int l, int r){\\n return sum(r) - sum(l-1);\\n }\\n\\n /* \\n a1+a2+...+aw >= valとなるような最小のwを返す\\n @verify https://codeforces.com/contest/992/problem/E\\n */\\n int lower_bound(T val) {\\n if(val < 0) return 0;\\n\\n int res = 0;\\n int n = 1; \\n while (n < N) n *= 2;\\n\\n T tv=0;\\n for (int k = n; k > 0; k /= 2) {\\n if(res + k < N && node[res + k] < val){\\n val -= node[res+k];\\n res += k;\\n }\\n }\\n return res+1; \\n }\\n};\\nstruct UnionFind{\\n std::vector<int> par;\\n std::vector<int> siz;\\n\\n UnionFind(int sz_): par(sz_), siz(sz_) {\\n for(int i=0; i<sz_; ++i) par[i] = i, siz[i] = 1;\\n }\\n\\n void init(int sz_){\\n par.resize(sz_);\\n siz.resize(sz_);\\n for(int i=0; i<sz_; ++i) par[i] = i, siz[i] = 1;\\n }\\n\\n int root(int x){\\n if(x == par[x]) return x;\\n return par[x] = root(par[x]);\\n }\\n\\n bool merge(int x, int y){\\n x = root(x), y = root(y);\\n if(x == y) return false;\\n if(siz[x] < siz[y]) std::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};\\nstruct RollingHash{\\n\\n using ull = unsigned long long;\\n const ull mod = (1ULL << 61) - 1;\\n const ull MASK30 = (1ULL << 30) - 1;\\n const ull MASK31 = (1ULL << 31) - 1;\\n\\n const ull MASK61 = mod;\\n\\n ull base;\\n int n;\\n vector<ull> hash, pow;\\n\\n RollingHash(const string &s)\\n {\\n random_device rnd;\\n mt19937_64 mt(rnd());\\n base = 1001;\\n \\n n = (int)s.size();\\n hash.assign(n+1, 0);\\n pow.assign(n+1, 1);\\n \\n for(int i=0; i<n; i++){\\n hash[i+1] = calc_mod(mul(hash[i], base) + s[i]);\\n pow[i+1] = calc_mod(mul(pow[i], base));\\n }\\n }\\n\\n ull calc_mod(ull x){\\n ull xu = x >> 61;\\n ull xd = x & MASK61;\\n ull res = xu + xd;\\n if(res >= mod) res -= mod;\\n return res;\\n }\\n\\n ull mul(ull a, ull b){\\n ull au = a >> 31;\\n ull ad = a & MASK31;\\n ull bu = b >> 31;\\n ull bd = b & MASK31;\\n ull mid = ad * bu + au * bd;\\n ull midu = mid >> 30;\\n ull midd = mid & MASK30;\\n return calc_mod(au * bu * 2 + midu + (midd << 31) + ad * bd);\\n }\\n\\n //[l,r)のハッシュ値\\n inline ull get(int l, int r){\\n ull res = calc_mod(hash[r] + mod*3-mul(hash[l], pow[r-l]));\\n return res;\\n }\\n //string tのハッシュ値\\n inline ull get(string t){\\n ull res = 0;\\n for(int i=0; i<t.size(); i++){\\n res = calc_mod(mul(res, base)+t[i]);\\n }\\n return res;\\n }\\n //string s中のtの数をカウント\\n inline int count(string t) {\\n if(t.size() > n) return 0;\\n auto hs = get(t);\\n int res = 0;\\n for(int i=0; i<n-t.size()+1; i++){\\n if(get(i, i+t.size()) == hs) res++; \\n }\\n return res;\\n }\\n\\n /* \\n concat \\n @verify https://codeforces.com/problemset/problem/514/C\\n */\\n inline ull concat(ull h1, ull h2, int h2len){\\n return calc_mod(h2 + mul(h1, pow[h2len]));\\n }\\n\\n // LCPを求める S[a:] T[b:]\\n inline int LCP(int a, int b){\\n int len = min((int)hash.size()-a, (int)hash.size()-b);\\n \\n int lb = -1, ub = len;\\n while(ub-lb>1){\\n int mid = (lb+ub)/2;\\n\\n if(get(a, a+mid) == get(b, b+mid)) lb = mid;\\n else ub = mid;\\n }\\n return lb;\\n }\\n};\\nint h;\\nll ans = (1LL<<60);\\nll x[2010], y[2010], z[2010];\\nint n, k, s;\\nset<int> st;\\nvoid dfs(int v, int p, int nokori, vector<vector<pair<ll,ll>>> &g, ll sum) {\\n ll t = sum;\\n for(auto[u, cost]: g[v]) {\\n if(u != p && st.find(u) != st.end()) t -= cost;\\n }\\n\\n if(nokori == 0) {\\n ans = min(ans, t);\\n return ;\\n }\\n \\n for(auto[u, cost]: g[v]) {\\n if(p == u) continue;\\n if(st.find(u) != st.end()) continue;\\n st.insert(u);\\n dfs(u, v, nokori-1, g, t + 6 * s * s - cost);\\n st.erase(u);\\n }\\n\\n}\\nint main() { \\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(12);\\n\\n while(cin >> n >> k >> s) {\\n if(n == 0 && k == 0 && s == 0) break;\\n REP(i,n) cin >> x[i] >> y[i] >> z[i];\\n vector<vector<pair<ll,ll>>> g(n);\\n st.clear();\\n ans = (1LL<<60);\\n for(int i=0; i<n; i++) {\\n for(int j=i+1; j<n; j++) {\\n\\n int ax = x[i], bx = x[i] + s, cx = x[j], dx = x[j] + s;\\n if(bx < cx) continue;\\n if(dx < ax) continue;\\n int ay = y[i], by = y[i] + s, cy = y[j], dy = y[j] + s;\\n if(by < cy) continue;\\n if(dy < ay) continue;\\n int az = z[i], bz = z[i] + s, cz = z[j], dz = z[j] + s;\\n if(bz < cz) continue;\\n if(dz < az) continue;\\n\\n \\n vector<ll> a;\\n if(ax <= cx && cx <= bx) a.push_back(bx-cx);\\n else a.push_back(dx-ax);\\n if(ay <= cy && cy <= by) a.push_back(by-cy);\\n else a.push_back(dy-ay);\\n if(az <= cz && cz <= bz) a.push_back(bz-cz);\\n else a.push_back(dz-az);\\n ll t = 2*a[0]*a[1]+2*a[0]*a[2]+2*a[1]*a[2];\\n g[i].push_back({j,t});\\n g[j].push_back({i,t});\\n }\\n }\\n for(int i=0; i<n; i++) {\\n st.insert(i);\\n dfs(i, -1, k-1, g, 6 * s * s);\\n st.erase(i);\\n }\\n if(ans == (1LL<<60)) ans = -1;\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3480,\n \"score_of_the_acc\": -0.6083,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1612_5990703\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define rep(i,n) for(int i = 0; i < (n); i++)\\nusing namespace std;\\ntypedef long long ll;\\n\\nint main(){\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n \\n while(true) {\\n int n,k,s; cin >> n >> k >> s; if(n == 0) break;\\n vector<vector<pair<int,int>>> G(n);\\n vector<int> x(n), y(n), z(n);\\n rep(i,n) cin >> x[i] >> y[i] >> z[i];\\n\\n if(k == 1) { cout << 6 * s * s << endl; continue; }\\n\\n auto calc = [&](int i, int j) {\\n int dx = s - abs(x[i] - x[j]);\\n int dy = s - abs(y[i] - y[j]);\\n int dz = s - abs(z[i] - z[j]);\\n if(dx <= 0 || dy <= 0 || dz <= 0) return 0;\\n return 2 * (dx * dy + dy * dz + dz * dx);\\n };\\n\\n rep(i,n)rep(j,n)if(i < j) {\\n int cost = calc(i, j);\\n if(cost != 0) {\\n G[i].push_back({j, cost});\\n G[j].push_back({i, cost});\\n }\\n }\\n\\n int ans = 0;\\n rep(S,n) {\\n for(auto to : G[S]) {\\n int T = to.first;\\n vector<int> can;\\n vector<bool> used(n, false);\\n can.push_back(T); used[T] = true;\\n can.push_back(S); used[S] = true;\\n\\n bool f = (k == 2);\\n rep(_,k-2) {\\n f = false;\\n for(auto nt : G[T]) {\\n if(!used[nt.first]) {\\n f = true;\\n used[nt.first] = true;\\n T = nt.first;\\n can.push_back(T);\\n break;\\n }\\n }\\n }\\n\\n if(!f) continue;\\n int sum = 0;\\n for(int i : can) for(int j : can) \\n if(i < j) sum += calc(i, j);\\n ans = max(ans, sum);\\n }\\n }\\n \\n cout << (ans == 0 ? -1 : 6 * s * s * k - ans) << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 3520,\n \"score_of_the_acc\": -1.0735,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1612_5943625\",\n \"code_snippet\": \"//#include<atcoder/all>\\n\\n#ifndef ATCODER_MODINT_HPP\\n#define ATCODER_MODINT_HPP 1\\n\\n//#include <atcoder/internal_math>\\n#ifndef ATCODER_INTERNAL_MATH_HPP\\n#define ATCODER_INTERNAL_MATH_HPP 1\\n\\n#include <utility>\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\n// @param m `1 <= m`\\n// @return x mod m\\nconstexpr long long safe_mod(long long x, long long m) {\\n x %= m;\\n if (x < 0) x += m;\\n return x;\\n}\\n\\n// Fast moduler by barrett reduction\\n// Reference: https://en.wikipedia.org/wiki/Barrett_reduction\\n// NOTE: reconsider after Ice Lake\\nstruct barrett {\\n unsigned int _m;\\n unsigned long long im;\\n\\n // @param m `1 <= m`\\n barrett(unsigned int m) : _m(m), im((unsigned long long)(-1) / m + 1) {}\\n\\n // @return m\\n unsigned int umod() const { return _m; }\\n\\n // @param a `0 <= a < m`\\n // @param b `0 <= b < m`\\n // @return `a * b % m`\\n unsigned int mul(unsigned int a, unsigned int b) const {\\n // [1] m = 1\\n // a = b = im = 0, so okay\\n\\n // [2] m >= 2\\n // im = ceil(2^64 / m)\\n // -> im * m = 2^64 + r (0 <= r < m)\\n // let z = a*b = c*m + d (0 <= c, d < m)\\n // a*b * im = (c*m + d) * im = c*(im*m) + d*im = c*2^64 + c*r + d*im\\n // c*r + d*im < m * m + m * im < m * m + 2^64 + m <= 2^64 + m * (m + 1) < 2^64 * 2\\n // ((ab * im) >> 64) == c or c + 1\\n unsigned long long z = a;\\n z *= b;\\n#ifdef _MSC_VER\\n unsigned long long x;\\n _umul128(z, im, &x);\\n#else\\n unsigned long long x =\\n (unsigned long long)(((unsigned __int128)(z)*im) >> 64);\\n#endif\\n unsigned int v = (unsigned int)(z - x * _m);\\n if (_m <= v) v += _m;\\n return v;\\n }\\n};\\n\\n// @param n `0 <= n`\\n// @param m `1 <= m`\\n// @return `(x ** n) % m`\\nconstexpr long long pow_mod_constexpr(long long x, long long n, int m) {\\n if (m == 1) return 0;\\n unsigned int _m = (unsigned int)(m);\\n unsigned long long r = 1;\\n unsigned long long y = safe_mod(x, m);\\n while (n) {\\n if (n & 1) r = (r * y) % _m;\\n y = (y * y) % _m;\\n n >>= 1;\\n }\\n return r;\\n}\\n\\n// Reference:\\n// M. Forisek and J. Jancina,\\n// Fast Primality Testing for Integers That Fit into a Machine Word\\n// @param n `0 <= n`\\nconstexpr bool is_prime_constexpr(int n) {\\n if (n <= 1) return false;\\n if (n == 2 || n == 7 || n == 61) return true;\\n if (n % 2 == 0) return false;\\n long long d = n - 1;\\n while (d % 2 == 0) d /= 2;\\n for (long long a : {2, 7, 61}) {\\n long long t = d;\\n long long y = pow_mod_constexpr(a, t, n);\\n while (t != n - 1 && y != 1 && y != n - 1) {\\n y = y * y % n;\\n t <<= 1;\\n }\\n if (y != n - 1 && t % 2 == 0) {\\n return false;\\n }\\n }\\n return true;\\n}\\ntemplate <int n> constexpr bool is_prime = is_prime_constexpr(n);\\n\\n// @param b `1 <= b`\\n// @return pair(g, x) s.t. g = gcd(a, b), xa = g (mod b), 0 <= x < b/g\\nconstexpr std::pair<long long, long long> inv_gcd(long long a, long long b) {\\n a = safe_mod(a, b);\\n if (a == 0) return {b, 0};\\n\\n // Contracts:\\n // [1] s - m0 * a = 0 (mod b)\\n // [2] t - m1 * a = 0 (mod b)\\n // [3] s * |m1| + t * |m0| <= b\\n long long s = b, t = a;\\n long long m0 = 0, m1 = 1;\\n\\n while (t) {\\n long long u = s / t;\\n s -= t * u;\\n m0 -= m1 * u; // |m1 * u| <= |m1| * s <= b\\n\\n // [3]:\\n // (s - t * u) * |m1| + t * |m0 - m1 * u|\\n // <= s * |m1| - t * u * |m1| + t * (|m0| + |m1| * u)\\n // = s * |m1| + t * |m0| <= b\\n\\n auto tmp = s;\\n s = t;\\n t = tmp;\\n tmp = m0;\\n m0 = m1;\\n m1 = tmp;\\n }\\n // by [3]: |m0| <= b/g\\n // by g != b: |m0| < b/g\\n if (m0 < 0) m0 += b / s;\\n return {s, m0};\\n}\\n\\n// Compile time primitive root\\n// @param m must be prime\\n// @return primitive root (and minimum in now)\\nconstexpr int primitive_root_constexpr(int m) {\\n if (m == 2) return 1;\\n if (m == 167772161) return 3;\\n if (m == 469762049) return 3;\\n if (m == 754974721) return 11;\\n if (m == 998244353) return 3;\\n int divs[20] = {};\\n divs[0] = 2;\\n int cnt = 1;\\n int x = (m - 1) / 2;\\n while (x % 2 == 0) x /= 2;\\n for (int i = 3; (long long)(i)*i <= x; i += 2) {\\n if (x % i == 0) {\\n divs[cnt++] = i;\\n while (x % i == 0) {\\n x /= i;\\n }\\n }\\n }\\n if (x > 1) {\\n divs[cnt++] = x;\\n }\\n for (int g = 2;; g++) {\\n bool ok = true;\\n for (int i = 0; i < cnt; i++) {\\n if (pow_mod_constexpr(g, (m - 1) / divs[i], m) == 1) {\\n ok = false;\\n break;\\n }\\n }\\n if (ok) return g;\\n }\\n}\\ntemplate <int m> constexpr int primitive_root = primitive_root_constexpr(m);\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n#endif // ATCODER_INTERNAL_MATH_HPP\\n\\n//#include <atcoder/internal_type_traits>\\n#ifndef ATCODER_INTERNAL_TYPE_TRAITS_HPP\\n#define ATCODER_INTERNAL_TYPE_TRAITS_HPP 1\\n\\n#include <cassert>\\n#include <numeric>\\n#include <type_traits>\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\n#ifndef _MSC_VER\\ntemplate <class T>\\nusing is_signed_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value ||\\n std::is_same<T, __int128>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __uint128_t>::value ||\\n std::is_same<T, unsigned __int128>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing make_unsigned_int128 =\\n typename std::conditional<std::is_same<T, __int128_t>::value,\\n __uint128_t,\\n unsigned __int128>;\\n\\ntemplate <class T>\\nusing is_integral = typename std::conditional<std::is_integral<T>::value ||\\n is_signed_int128<T>::value ||\\n is_unsigned_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_signed_int = typename std::conditional<(is_integral<T>::value &&\\n std::is_signed<T>::value) ||\\n is_signed_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int =\\n typename std::conditional<(is_integral<T>::value &&\\n std::is_unsigned<T>::value) ||\\n is_unsigned_int128<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing to_unsigned = typename std::conditional<\\n is_signed_int128<T>::value,\\n make_unsigned_int128<T>,\\n typename std::conditional<std::is_signed<T>::value,\\n std::make_unsigned<T>,\\n std::common_type<T>>::type>::type;\\n\\n#else\\n\\ntemplate <class T> using is_integral = typename std::is_integral<T>;\\n\\ntemplate <class T>\\nusing is_signed_int =\\n typename std::conditional<is_integral<T>::value && std::is_signed<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing is_unsigned_int =\\n typename std::conditional<is_integral<T>::value &&\\n std::is_unsigned<T>::value,\\n std::true_type,\\n std::false_type>::type;\\n\\ntemplate <class T>\\nusing to_unsigned = typename std::conditional<is_signed_int<T>::value,\\n std::make_unsigned<T>,\\n std::common_type<T>>::type;\\n\\n#endif\\n\\ntemplate <class T>\\nusing is_signed_int_t = std::enable_if_t<is_signed_int<T>::value>;\\n\\ntemplate <class T>\\nusing is_unsigned_int_t = std::enable_if_t<is_unsigned_int<T>::value>;\\n\\ntemplate <class T> using to_unsigned_t = typename to_unsigned<T>::type;\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n#endif // ATCODER_INTERNAL_TYPE_TRAITS_HPP\\n\\n#include <cassert>\\n#include <numeric>\\n#include <type_traits>\\n\\n#ifdef _MSC_VER\\n#include <intrin.h>\\n#endif\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\nstruct modint_base {};\\nstruct static_modint_base : modint_base {};\\n\\ntemplate <class T> using is_modint = std::is_base_of<modint_base, T>;\\ntemplate <class T> using is_modint_t = std::enable_if_t<is_modint<T>::value>;\\n\\n} // namespace internal\\n\\ntemplate <int m, std::enable_if_t<(1 <= m)>* = nullptr>\\nstruct static_modint : internal::static_modint_base {\\n using mint = static_modint;\\n\\n public:\\n static constexpr int mod() { return m; }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n\\n static_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T>* = nullptr>\\n static_modint(T v) {\\n long long x = (long long)(v % (long long)(umod()));\\n if (x < 0) x += umod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\\n static_modint(T v) {\\n _v = (unsigned int)(v % umod());\\n }\\n static_modint(bool v) { _v = ((unsigned int)(v) % umod()); }\\n\\n unsigned int val() const { return _v; }\\n\\n mint& operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n mint& operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n\\n mint& operator+=(const mint& rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator-=(const mint& rhs) {\\n _v -= rhs._v;\\n if (_v >= umod()) _v += umod();\\n return *this;\\n }\\n mint& operator*=(const mint& rhs) {\\n unsigned long long z = _v;\\n z *= rhs._v;\\n _v = (unsigned int)(z % umod());\\n return *this;\\n }\\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\\n\\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n\\n mint pow(long long n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n if (prime) {\\n assert(_v);\\n return pow(umod() - 2);\\n } else {\\n auto eg = internal::inv_gcd(_v, m);\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n }\\n\\n friend mint operator+(const mint& lhs, const mint& rhs) {\\n return mint(lhs) += rhs;\\n }\\n friend mint operator-(const mint& lhs, const mint& rhs) {\\n return mint(lhs) -= rhs;\\n }\\n friend mint operator*(const mint& lhs, const mint& rhs) {\\n return mint(lhs) *= rhs;\\n }\\n friend mint operator/(const mint& lhs, const mint& rhs) {\\n return mint(lhs) /= rhs;\\n }\\n friend bool operator==(const mint& lhs, const mint& rhs) {\\n return lhs._v == rhs._v;\\n }\\n friend bool operator!=(const mint& lhs, const mint& rhs) {\\n return lhs._v != rhs._v;\\n }\\n\\n private:\\n unsigned int _v;\\n static constexpr unsigned int umod() { return m; }\\n static constexpr bool prime = internal::is_prime<m>;\\n};\\n\\ntemplate <int id> struct dynamic_modint : internal::modint_base {\\n using mint = dynamic_modint;\\n\\n public:\\n static int mod() { return (int)(bt.umod()); }\\n static void set_mod(int m) {\\n assert(1 <= m);\\n bt = internal::barrett(m);\\n }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n\\n dynamic_modint() : _v(0) {}\\n template <class T, internal::is_signed_int_t<T>* = nullptr>\\n dynamic_modint(T v) {\\n long long x = (long long)(v % (long long)(mod()));\\n if (x < 0) x += mod();\\n _v = (unsigned int)(x);\\n }\\n template <class T, internal::is_unsigned_int_t<T>* = nullptr>\\n dynamic_modint(T v) {\\n _v = (unsigned int)(v % mod());\\n }\\n dynamic_modint(bool v) { _v = ((unsigned int)(v) % mod()); }\\n\\n unsigned int val() const { return _v; }\\n\\n mint& operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n mint& operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n\\n mint& operator+=(const mint& rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator-=(const mint& rhs) {\\n _v += mod() - rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n mint& operator*=(const mint& rhs) {\\n _v = bt.mul(_v, rhs._v);\\n return *this;\\n }\\n mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\\n\\n mint operator+() const { return *this; }\\n mint operator-() const { return mint() - *this; }\\n\\n mint pow(long long n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n mint inv() const {\\n auto eg = internal::inv_gcd(_v, mod());\\n assert(eg.first == 1);\\n return eg.second;\\n }\\n\\n friend mint operator+(const mint& lhs, const mint& rhs) {\\n return mint(lhs) += rhs;\\n }\\n friend mint operator-(const mint& lhs, const mint& rhs) {\\n return mint(lhs) -= rhs;\\n }\\n friend mint operator*(const mint& lhs, const mint& rhs) {\\n return mint(lhs) *= rhs;\\n }\\n friend mint operator/(const mint& lhs, const mint& rhs) {\\n return mint(lhs) /= rhs;\\n }\\n friend bool operator==(const mint& lhs, const mint& rhs) {\\n return lhs._v == rhs._v;\\n }\\n friend bool operator!=(const mint& lhs, const mint& rhs) {\\n return lhs._v != rhs._v;\\n }\\n\\n private:\\n unsigned int _v;\\n static internal::barrett bt;\\n static unsigned int umod() { return bt.umod(); }\\n};\\ntemplate <int id> internal::barrett dynamic_modint<id>::bt = 998244353;\\n\\nusing modint998244353 = static_modint<998244353>;\\nusing modint1000000007 = static_modint<1000000007>;\\nusing modint = dynamic_modint<-1>;\\n\\nnamespace internal {\\n\\ntemplate <class T>\\nusing is_static_modint = std::is_base_of<internal::static_modint_base, T>;\\n\\ntemplate <class T>\\nusing is_static_modint_t = std::enable_if_t<is_static_modint<T>::value>;\\n\\ntemplate <class> struct is_dynamic_modint : public std::false_type {};\\ntemplate <int id>\\nstruct is_dynamic_modint<dynamic_modint<id>> : public std::true_type {};\\n\\ntemplate <class T>\\nusing is_dynamic_modint_t = std::enable_if_t<is_dynamic_modint<T>::value>;\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n#endif // ATCODER_MODINT_HPP\\n\\n\\n////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////\\n\\n#ifndef ATCODER_DSU_HPP\\n#define ATCODER_DSU_HPP 1\\n\\n#include <algorithm>\\n#include <cassert>\\n#include <vector>\\n\\nnamespace atcoder {\\n\\n// Implement (union by size) + (path compression)\\n// Reference:\\n// Zvi Galil and Giuseppe F. Italiano,\\n// Data structures and algorithms for disjoint set union problems\\nstruct dsu {\\n public:\\n dsu() : _n(0) {}\\n dsu(int n) : _n(n), parent_or_size(n, -1) {}\\n\\n int merge(int a, int b) {\\n assert(0 <= a && a < _n);\\n assert(0 <= b && b < _n);\\n int x = leader(a), y = leader(b);\\n if (x == y) return x;\\n if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);\\n parent_or_size[x] += parent_or_size[y];\\n parent_or_size[y] = x;\\n return x;\\n }\\n\\n bool same(int a, int b) {\\n assert(0 <= a && a < _n);\\n assert(0 <= b && b < _n);\\n return leader(a) == leader(b);\\n }\\n\\n int leader(int a) {\\n assert(0 <= a && a < _n);\\n if (parent_or_size[a] < 0) return a;\\n return parent_or_size[a] = leader(parent_or_size[a]);\\n }\\n\\n int size(int a) {\\n assert(0 <= a && a < _n);\\n return -parent_or_size[leader(a)];\\n }\\n\\n std::vector<std::vector<int>> groups() {\\n std::vector<int> leader_buf(_n), group_size(_n);\\n for (int i = 0; i < _n; i++) {\\n leader_buf[i] = leader(i);\\n group_size[leader_buf[i]]++;\\n }\\n std::vector<std::vector<int>> result(_n);\\n for (int i = 0; i < _n; i++) {\\n result[i].reserve(group_size[i]);\\n }\\n for (int i = 0; i < _n; i++) {\\n result[leader_buf[i]].push_back(i);\\n }\\n result.erase(\\n std::remove_if(result.begin(), result.end(),\\n [&](const std::vector<int>& v) { return v.empty(); }),\\n result.end());\\n return result;\\n }\\n\\n private:\\n int _n;\\n // root node: -1 * component size\\n // otherwise: parent\\n std::vector<int> parent_or_size;\\n};\\n\\n} // namespace atcoder\\n\\n#endif // ATCODER_DSU_HPP\\n\\n\\n\\n\\n\\n\\n\\n\\n\\nusing namespace atcoder;\\n\\n#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\n//typedef int ll;\\n\\nvoid mod_print(ll k){\\n // const ll i_7=998244353;\\n const ll i_7 =(ll)(1E9+7);\\n auto mod=[&](ll a){\\n ll c=a%i_7;\\n if(c>=0)return c;\\n return c+i_7;\\n };\\n ll P=50000;\\n for(ll y=1;y<=P;y++){\\n ll x=mod(y*k);\\n if(abs(x)<=P||x+P>=i_7){\\n if(x+P>=i_7){\\n x-=i_7;\\n }\\n cerr<<x<<\\\"/\\\"<<y<<\\\" \\\";\\n //cerr<<setprecision(5)<<(dd)x/(dd)y<<\\\" \\\";\\n return;\\n }\\n }\\n cerr<<\\\"nun\\\"<<endl;\\n}\\n/*\\n#include <boost/multiprecision/cpp_int.hpp>\\n#include <boost/multiprecision/cpp_dec_float.hpp>\\nnamespace multi = boost::multiprecision;\\ntypedef multi::cpp_int LL;\\ntypedef multi::number<multi::cpp_dec_float<1024>> DD;// 仮数部が1024ビットの浮動小数点数型(TLEしたら小さくする)\\n//*/\\ntypedef long double dd;\\ntypedef pair<ll,ll> l_l;\\ntypedef pair<dd,dd> d_d;\\nll inf=(ll)1E18;\\n#define rep(i,l,r) for(ll i=l;i<=r;i++)\\n#define rrep(i,r,l) for(ll i=r;i>=l;i--)\\n#define pb push_back\\nll max(ll a,ll b){if(a<b)return b;else return a;}\\nll min(ll a,ll b){if(a>b)return b;else return a;}\\ndd EPS=1E-12;\\n#define fi first\\n#define se second\\n\\n#define SORT(v) sort(v.begin(),v.end())\\n#define ERASE(v) sort(v.begin(),v.end()); v.erase(unique(v.begin(),v.end()),v.end())\\n#define POSL(v,x) (lower_bound(v.begin(),v.end(),x)-v.begin())\\n#define POSU(v,x) (upper_bound(v.begin(),v.end(),x)-v.begin())\\ntemplate<class T,class S>\\ninline bool chmax(T &a, S b) {\\n if(a < b) {\\n a = (T)b;\\n return true;\\n }\\n return false;\\n}\\ntemplate<class T,class S>\\ninline bool chmin(T &a, S b) {\\n if(a > b) {\\n a = (T)b;\\n return true;\\n }\\n return false;\\n}\\n#define all(c) c.begin(),c.end()\\n\\n//using mint = modint998244353;\\nusing mint = modint1000000007;\\n//using mint=modint;\\n//using mint=static_modint<100>;\\n//using mint=dd;\\n//using mint=ll;\\n\\ntypedef vector<ll> vl;\\ntypedef vector<vl> vvl;\\ntypedef vector<vvl>vvvl;\\ntypedef vector<mint>vi;\\ntypedef vector<vi>vvi;\\ntypedef vector<vvi>vvvi;\\ntypedef vector<vvvi>vvvvi;\\ntypedef vector<l_l>vl_l;\\ntypedef vector<vl_l>vvl_l;\\ntypedef vector<string>vs;\\ntypedef vector<vs>vvs;\\ntypedef vector<dd> vd;\\ntypedef vector<vd> vvd;\\ntypedef vector<vvd> vvvd;\\ntypedef vector<d_d>vd_d;\\ndd PI=acos((dd)-1);\\n\\n#define fastio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); cout<<setprecision(20);\\ntemplate <class T> using pq = priority_queue<T>;\\ntemplate <class T> using pqg = priority_queue<T, vector<T>, greater<T>>;\\n\\n// g++ -std=gnu++17 -Wall -Wextra -O2 -DONLINE_JUDGE main.cpp && ./a.out\\n#define endl \\\"\\\\n\\\" //インタラクティブで消す！！！！！！！！！！！！！！！！！！！！！\\n#define popcount __builtin_popcountll\\n#define SHUFFLE(v) shuffle(all(v),default_random_engine(chrono::system_clock::now().time_since_epoch().count()))\\n//////////////////////////////////////////////////////////////////////////////\\ntemplate<class S>\\nvoid DEBUG_PRINT(S x){\\n cerr<<x<<endl;\\n}\\ntemplate<class S,class T>\\nvoid DEBUG_PRINT(pair<S,T>x){\\n cerr<<\\\"(\\\"<<x.fi<<\\\",\\\"<<x.se<<\\\")\\\"<<endl;\\n}\\ntemplate<class S>\\nvoid DEBUG_PRINT(vector<S> x){\\n for(auto y:x)cerr<<setw(2)<<y<<\\\" \\\";\\n cerr<<endl;\\n}\\ntemplate<class S,class T>\\nvoid DEBUG_PRINT(vector<pair<S,T>>x){\\n for(auto y:x)cerr<<\\\"(\\\"<<y.fi<<\\\",\\\"<<y.se<<\\\") \\\";\\n cerr<<endl;\\n}\\ntemplate<class S>\\nvoid DEBUG_PRINT(vector<vector<S>> x){\\n cerr<<endl;\\n for(auto y:x){\\n for(auto z:y){\\n cerr<<setw(2)<<z<<\\\" \\\";\\n }cerr<<endl;\\n }cerr<<endl;\\n}\\n\\n#define TO_STRING_FOR_DEBUG(VariableName) # VariableName\\n#ifdef LOCAL\\n#define DEB(V) cerr<< TO_STRING_FOR_DEBUG(V) << \\\": \\\"; DEBUG_PRINT(V);\\n#else\\n#define DEB(V) void(0)\\n#endif\\n/////////////////////////////////////////////////////////////////////////////////////////\\n\\nvoid solve(){\\n ll n,k,s;cin>>n>>k>>s;\\n if(n==0)exit(0);\\n vvl a(n,vl(3));\\n rep(i,0,n-1)rep(j,0,2)cin>>a[i][j];\\n \\n if(k==1){\\n cout<<6*s*s<<endl;return ;\\n }\\n \\n vvl_l v(n);\\n rep(i,0,n-1){\\n rep(j,i+1,n-1){\\n auto calc=[](vl a,vl b,ll s){\\n vl v;\\n rep(i,0,2){\\n ll dis=abs(a[i]-b[i]);\\n if(dis>=s){\\n return 0ll;\\n }else{\\n v.pb(s-dis);\\n }\\n }\\n ll ans=0;\\n rep(i,0,2){\\n rep(j,i+1,2){\\n ans += v[i]*v[j];\\n }\\n }\\n return ans*2;\\n };\\n ll E=calc(a[i],a[j],s);\\n if(E==0)continue;\\n v[i].pb({j,E});\\n v[j].pb({i,E});\\n }\\n }\\n rep(i,0,n-1){\\n cerr<<i<<\\\":\\\";\\n DEB(v[i]);\\n }\\n dsu d(n);\\n rep(i,0,n-1){\\n for(auto x:v[i]){\\n d.merge(i,x.fi);\\n }\\n }\\n map<l_l,ll>mp;\\n rep(i,0,n-1){\\n for(auto x:v[i]){\\n mp[{i,x.fi}] = x.se;\\n }\\n }\\n auto G=d.groups();\\n vl used(n);\\n ll MAX =0;\\n for(auto g:G){\\n ll sz=g.size();\\n ll edge_cnt=0;\\n for(auto x:g){\\n for(auto y:v[x]){\\n if(x>y.fi)continue;\\n edge_cnt ++;\\n }\\n }\\n assert(edge_cnt == sz || edge_cnt == sz-1);\\n \\n if(sz<k)continue;\\n \\n ll pos=g[0];\\n if(edge_cnt == sz-1){\\n for(auto x:g){\\n if((int)v[x].size()==1){\\n pos=x;\\n break;\\n }\\n }\\n assert((int)v[pos].size()==1);\\n }\\n \\n vl vec={pos};\\n used[pos]=true;\\n while(1){\\n bool bre=true;\\n for(auto x:v[pos]){\\n if(used[x.fi])continue;\\n used[x.fi]=true;\\n pos=x.fi;\\n vec.pb(x.fi);\\n bre=false;\\n break;\\n }\\n if(bre)break;\\n }\\n assert((int)vec.size() == sz);\\n \\n auto callast=[&](vl v){\\n rep(i,0,(int)v.size()-1){\\n ll sum=0;\\n rep(j,i,i+k-2){//k-1個\\n if(j>=(int)v.size()){\\n return;\\n }\\n sum += v[j];\\n }\\n chmax(MAX,sum);\\n }\\n };\\n if(edge_cnt == sz-1){\\n vl v;\\n rep(i,0,sz-2){\\n v.pb(mp[{vec[i],vec[i+1]}]);\\n }\\n callast(v);\\n }else{\\n if(sz==k){\\n ll sum=0;\\n rep(i,0,sz-1){//k個\\n sum += mp[{vec[i%sz],vec[(i+1)%sz]}];\\n }\\n chmax(MAX,sum);\\n }else{\\n vl v;\\n rep(i,0,2*sz){\\n v.pb(mp[{vec[i%sz],vec[(i+1)%sz]}]);\\n }\\n callast(v);\\n }\\n }\\n }\\n if(MAX==0){\\n cout<<-1<<endl;\\n }else{\\n cout<<k*6*s*s - MAX<<endl;\\n }\\n}\\n\\nsigned main(){fastio\\n \\n while(1){\\n solve();\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3564,\n \"score_of_the_acc\": -0.0852,\n \"final_rank\": 8\n }\n]","isConversational":false}}},{"rowIdx":985,"cells":{"group_id":{"kind":"string","value":"aoj_1611_cpp"},"problem_description":{"kind":"string","value":"Daruma Otoshi\nYou are playing a variant of a game called \"Daruma Otoshi (Dharma Block Striking)\".\nAt the start of a game, several wooden blocks of the same size but with varying weights\nare stacked on top of each other, forming a tower.\nAnother block symbolizing Dharma is placed atop.\nYou have a wooden hammer with its head thicker than the height of a block,\nbut not twice that.\nYou can choose any two adjacent blocks, except Dharma on the top,\ndiffering at most 1 in their weight,\nand push both of them out of the stack with a single blow of your hammer.\nThe blocks above the removed ones then fall straight down,\nwithout collapsing the tower.\n\nYou cannot hit a block pair with weight difference of 2 or more,\nfor that makes too hard to push out blocks while keeping the balance of the tower.\nThere is no chance in hitting three blocks out at a time,\nfor that would require superhuman accuracy.\nThe goal of the game is to remove as many blocks as you can.\nYour task is to decide the number of blocks that can be removed\nby repeating the blows in an optimal order.\nFigure D1. Striking out two blocks at a time\nIn the above figure, with a stack of four blocks weighing 1, 2, 3, and\n1, in this order from the bottom, you can hit middle\ntwo blocks, weighing 2 and 3, out from the stack. The blocks above will\nthen fall down, and two blocks weighing 1 and the Dharma block will remain.\nYou can then push out the remaining pair of weight-1 blocks after that.\nInput\nThe input consists of multiple datasets.\nThe number of datasets is at most 50.\nEach dataset is in the following format.\nn\nw\n1\nw\n2\n…\nw\nn\nn\nis the number of blocks, except Dharma on the top.\nn\nis a positive integer not exceeding 300.\nw\ni\ngives the weight of the\ni\n-th block counted from the bottom.\nw\ni\nis an integer between 1 and 1000, inclusive.\nThe end of the input is indicated by a line containing a zero.\nOutput\nFor each dataset, output in a line the maximum number of blocks you can remove.\nSample Input\n4\n1 2 3 4\n4\n1 2 3 1\n5\n5 1 2 3 6\n14\n8 7 1 4 3 5 4 1 6 8 10 4 6 5\n5\n1 3 5 1 3\n0\nOutput for the Sample Input\n4\n4\n2\n12\n0"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1611_11035458","code_snippet":"#include <iostream>\n#include <vector>\n\nusing namespace std;\n\n\nint main(){\n\n while(1){\n int n;\n cin >> n;\n if (n == 0) break;\n vector<int> w(n);\n for (int i=0; i<n; i++) cin >> w[i];\n\n vector<vector<int>> dp(n+1, vector<int>(n+1, 0));\n for(int width=2; width<=n; width++){\n for (int l=0; l+width<=n; l++){\n int r = l + width;\n // if (r >= n) continue;\n // dp[l+1][r-1] == r - l - 2 : 間の全てのブロックを落とせる。\n // cout << \"r=\" << r << \", l=\" << l << endl;\n if (dp[l+1][r-1] == r - l - 2 && abs(w[r-1]-w[l]) <= 1){\n dp[l][r] = width;\n // cout << \"all\" << endl;\n }\n else{\n for (int mid=l; mid<=r; mid++){\n // cout << \"mid=\" << mid << \", dp[l][mid]=\" << dp[l][mid] << \", dp[mid][r]=\" << dp[mid][r] << endl;\n dp[l][r] = max(dp[l][r], dp[l][mid] + dp[mid][r]);\n }\n }\n // cout << \"dp[\" << l << \"][\" << r << \"] = \" << dp[l][r] << endl;\n }\n }\n cout << dp[0][n] << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":120,"memory_kb":3768,"score_of_the_acc":-0.449,"final_rank":4},{"submission_id":"aoj_1611_11035150","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\n#define rep(a,b,c) for(int a=b;a<c;a++)\n#define rep1(a,b,c) for(int a=b;a>=c;a--)\n#define vc vector\n#define pbk push_back\n#define ebk emplace_back\n#define fst first\n#define snd second\n#define sz(a) (int)a.size()\n#define out(a,b,c,d,e) cout << a << \" \" << b << \" \" << c << \" \" << d << \" \" << e << endl\nusing pii=pair<int,int>;\n\nvoid chmax(int &a,int b){a=max(a,b);return;}\nvoid chmin(int &a,int b){a=min(a,b);return;}\n\nsigned main() {\n\tint n;\n\tvc<int> ans;\n\twhile(true){\n\t\tcin >> n;\n\t\tif(n==0) break;\n\t\tvc<int> a(n);\n\t\trep(i,0,n) cin >> a[i];\n\n\n\t\tvc dp(n+1,vc<int>(n+2,-1));\n\n\n\t\tauto dfs=[&](auto dfs,int s,int t)->int{\n\t\t\tif(dp[s][t]!=-1) return dp[s][t];\n\t\t\tif(t-s<=1) return 0;\n\t\t\tif(t-s==2){\n\t\t\t\tif(abs(a[s]-a[s+1])<=1) return dp[s][t]=2;\n\t\t\t\telse return dp[s][t]=0;\n\t\t\t}\n\t\t\tint tmp=0;\n\t\t\tif(abs(a[s]-a[t-1])<=1 && dfs(dfs,s+1,t-1)==t-s-2){\n\t\t\t\tchmax(tmp,t-s);\n\t\t\t}\n\t\t\trep(i,s+1,t){\n\t\t\t\tint r=dfs(dfs,s,i)+dfs(dfs,i,t);\n\t\t\t\tchmax(tmp,r);\n\t\t\t}\n\t\t\treturn dp[s][t]=tmp;\n\t\t};\n\n\t\tcout << (dfs(dfs,0,n)) << endl;\n\n\t}\n\t//for(int x:ans) cout << x << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":840,"memory_kb":3968,"score_of_the_acc":-1.454,"final_rank":18},{"submission_id":"aoj_1611_11035144","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\n#define rep(a,b,c) for(int a=b;a<c;a++)\n#define rep1(a,b,c) for(int a=b;a>=c;a--)\n#define vc vector\n#define pbk push_back\n#define ebk emplace_back\n#define fst first\n#define snd second\n#define sz(a) (int)a.size()\n#define out(a,b,c,d,e) cout << a << \" \" << b << \" \" << c << \" \" << d << \" \" << e << endl\nusing pii=pair<int,int>;\n\nvoid chmax(int &a,int b){a=max(a,b);return;}\nvoid chmin(int &a,int b){a=min(a,b);return;}\n\nsigned main() {\n\tint n;\n\tvc<int> ans;\n\twhile(true){\n\t\tcin >> n;\n\t\tif(n==0) break;\n\t\tvc<int> a(n);\n\t\trep(i,0,n) cin >> a[i];\n\n\n\t\tvc dp(n+1,vc<int>(n+2,-1));\n\n\n\t\tauto dfs=[&](auto dfs,int s,int t)->int{\n\t\t\tif(dp[s][t]!=-1) return dp[s][t];\n\t\t\tif(t-s<=1) return 0;\n\t\t\tif(t-s==2){\n\t\t\t\tif(abs(a[s]-a[s+1])<=1) return 2;\n\t\t\t\telse return 0;\n\t\t\t}\n\t\t\tint tmp=0;\n\t\t\tif(abs(a[s]-a[t-1])<=1 && dfs(dfs,s+1,t-1)==t-s-2){\n\t\t\t\tchmax(tmp,t-s);\n\t\t\t}\n\t\t\trep(i,s+1,t){\n\t\t\t\tint r=dfs(dfs,s,i)+dfs(dfs,i,t);\n\t\t\t\tchmax(tmp,r);\n\t\t\t}\n\t\t\tdp[s][t]=tmp;\n\t\t\treturn tmp;\n\t\t};\n\n\tcout << (dfs(dfs,0,n)) << endl;\n\n\t}\n\t//for(int x:ans) cout << x << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":870,"memory_kb":3968,"score_of_the_acc":-1.4843,"final_rank":20},{"submission_id":"aoj_1611_11035119","code_snippet":"#include <bits/stdc++.h>\n#define ALL(obj) begin(obj), end(obj)\nusing namespace std;\n\ntemplate <class T>\nbool chmax(T &a, const T &b) {\n if (a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\n\nint N;\nvector<int> w;\nvector<vector<int>> dp;\n\nint rec(int l = 0, int r = N) { // メモ化再帰\n if ((r - l) <= 1) return 0;\n if ((r - l) == 2) {\n if (abs(w[l] - w[l + 1]) <= 1) { // 隣り合う2つの差が1以下\n return 2;\n } else {\n return 0;\n }\n }\n\n int &ret = dp[l][r]; // 更新の対象についての参照を宣言\n if (ret != -1) return ret; // 既に計算済みならその値を使う\n\n // 1. 全部取り除けるとき\n if (abs(w[l] - w[r-1]) <= 1 && rec(l + 1, r - 1) == r - l - 2) chmax(ret, r - l);\n // 2. そうでない時\n for (int i = l + 1; i <= r - 1; i++) {\n chmax(ret, rec(l, i) + rec(i, r));\n }\n\n return ret;\n}\n\nint main() {\n vector<int> ans;\n while (true) {\n cin >> N;\n if (N == 0) break;\n w.resize(N);\n for (int i = 0; i < N; i++) {\n cin >> w.at(i);\n }\n\n dp.assign(N + 2, vector<int>(N + 2, -1)); // 初期化\n\n ans.push_back(rec());\n }\n\n for (auto i : ans) {\n cout << i << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":700,"memory_kb":3816,"score_of_the_acc":-1.1015,"final_rank":14},{"submission_id":"aoj_1611_10937835","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing pii = pair < int, int > ;\nusing pll = pair < ll, ll > ;\n#define all(x) x.begin(), x.end()\nconst double pi = 3.141592653589793238;\nconst string ABC = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst string abc = \"abcdefghijklmnopqrstuvwxyz\";\n//n以下の約数列挙。O(√n)\nvector<ll> enumdiv(ll n){\n vector<ll> res;\n for(ll i = 1; i*i <= n; i++){\n if(n%i==0){\n res.push_back(i);\n if(i*i!=n) res.push_back(n/i); \n }\n }\n sort(all(res));\n return res;\n}\n//nを素因数分解する。{素数、指数}\nvector<pair<ll,ll>> prime_factorize(ll n){\n vector<pair<ll,ll>> res;\n for(ll a = 2; a*a<=n; a++){\n if(n%a==0){\n ll ex = 0;//指数部分\n while(n%a==0){\n n/=a;\n ex++;\n }\n res.push_back({a,ex});\n }\n }\n if(n!=1) res.push_back({n,1});\n return res;\n}\nstruct UnionFind{\n vector<int> par;//各要素の親 root=-1\n UnionFind(int sz){\n par.assign(sz,-1);\n }\n bool unite(int x,int y){\n x = find(x);\n y = find(y);\n if(x==y) return false;\n if(par[x]>par[y]) swap(x,y);\n par[x] += par[y];\n par[y] = x;\n return true;\n }\n int find(int k){//kが属する根ノードを返す\n if(par[k]<0) return k;\n return par[k] = find(par[k]);\n }\n int size(int k){//kが属する木のサイズ\n return -par[find(k)];\n }\n vector<vector<int>> groups(){//全ての要素を連結成分ごとにグループ分けして返す。\n vector<vector<int>> result;\n map<int,vector<int>> mp;\n for(int i = 0; i < (int)par.size(); i++){\n mp[find(i)].push_back(i);\n }\n for(auto [key,val] : mp){\n result.push_back(val);\n }\n return result;\n }\n};\n// a^n mod を計算する\nlong long modpow(long long a, long long n, long long mod) {\n\tlong long res = 1;\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;\n}\nint main() {\n int n;\n while(cin >> n){\n if(n==0) break;\n vector<int> w(n);\n for(int i = 0; i < n; i++){\n cin >> w[i];\n }\n vector<vector<int>> dp(n+1,vector<int>(n+1,-1));\n auto rec = [&](auto self,int l,int r) -> int{\n if(r-l<=1) return 0;\n if(r-l==2){\n if(abs(w[l+1]-w[l])<=1){\n return 2;\n }else return 0;\n }\n if(dp[l][r]!=-1) return dp[l][r];\n if(abs(w[l]-w[r-1])<=1&&self(self,l+1,r-1)==r-l-2){//全部取り除ける時\n dp[l][r] = max(dp[l][r],r-l);\n }\n for(int i = l+1; i <= r-1; i++){\n dp[l][r] = max(dp[l][r],self(self,l,i)+self(self,i,r));\n }\n return dp[l][r];\n };\n cout << rec(rec,0,n) << endl;\n }\n}","accuracy":1,"time_ms":1100,"memory_kb":3748,"score_of_the_acc":-1.4111,"final_rank":17},{"submission_id":"aoj_1611_10891129","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#if __has_include(<atcoder/all>)\n#include <atcoder/math>\nusing namespace atcoder;\n#endif\n\nusing ll = long long;\nusing ld = long double;\nusing vi = vector<int>;\nusing vvi = vector<vector<int>>;\nusing vvvi = vector<vector<vector<int>>>;\nusing vll = vector<ll>;\nusing vvll = vector<vector<ll>>;\nusing vvvll = vector<vector<vector<ll>>>;\nusing vd = vector<double>;\nusing vvd = vector<vector<double>>;\nusing vstr = vector<string>;\nusing vchar = vector<char>;\nusing vvchar = vector<vector<char>>;\nusing vb = vector<bool>;\nusing vvb = vector<vector<bool>>;\nusing pii = pair<int,int>;\nusing pll = pair<long long, long long>;\nusing Graph = vector<vector<int>>;\nconst int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};\nconst int dy[8] = {0, 1, 0, -1, 1, -1, 1, -1};\n\n#define rep(i, a, b) for(int i = (int)a; i < (int)b; i++)\n#define REP(i, a, b) for (int i = (int)a; i <= (int)b; i++)\n#define all(v) v.begin(), v.end()\n#define rall(v) v.rbegin(), v.rend()\n#define YESNO(flag) cout << (flag ? \"Yes\" : \"No\") << \"\\n\"\n#define spa \" \"\n\nconst int inf = 1070000000;\nconst long long INF = 4500000000000000000;\nconst long long MOD = 998244353;\n//const long long MOD = 1000000007;\nconst double pi = 3.141592653589793238;\nconst double eps = (1e-10);\nconst string ABC = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst string abc = \"abcdefghijklmnopqrstuvwxyz\";\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\n//xのn乗\nll llpow(ll x, ll n) {\n ll ans = 1;\n while(n > 0) {\n if(n & 1) ans *= x;\n x *= x;\n n >>= 1; \n }\n return ans;\n}\nll modpow(ll x, ll n, ll mod) {\n ll ans = 1;\n while(n > 0) {\n if(n & 1) ans = ans * x % mod;\n x = x * x % mod;\n n >>= 1;\n }\n return ans;\n}\n//mod pでのaの逆元\nll inverse(ll a, ll p) {\n return modpow(a, p-2, p);\n}\n//nの階乗\nll fact(ll n) {\n if(n == 0) return 1;\n else return n * fact(n-1);\n}\nll modfact(ll n, ll mod) {\n if(n == 0) return 1;\n else return (n * modfact(n-1, mod)) % mod;\n}\n//nCr=n!/r!(n-r)! mod p\nll comb(ll n, ll r, ll mod) {\n ll a = modfact(n, mod), b = modfact(r, mod), c = modfact(n-r, mod);\n b = inverse(b, mod); c = inverse(c, mod);\n return (((a*b)%mod)*c)%mod;\n}\n\n//1+2+...+n = n(n+1)/2\nll triangle(ll n) {\n ll x = n*(n+1);\n return x/2;\n}\n//素数判定\nbool is_prime(long long x) {\n if(x == 1) return false;\n \n for(long long i = 2; i*i <= x; i++) {\n if(x % i == 0) return false;\n }\n return true;\n}\n\n//座標圧縮\nvector<int> compress(vector<int> A) {\n vector<int> B = A;\n\n sort(B.begin(), B.end());\n B.erase(unique(B.begin(), B.end()), B.end());\n\n vector<int> res(A.size());\n for(int i = 0; i < (int)A.size(); i++) {\n res[i] = lower_bound(B.begin(), B.end(), A[i]) - B.begin();\n }\n return res;\n}\n\n//正方形グリッドの右回転\nvoid rotate_right(vector<vector<char>> &S) {\n int N = S.size();\n auto T = S;\n rep(i,0,N) rep(j,0,N) {\n T[i][j] = S[N-1-j][i];\n }\n S = T;\n}\n//左回転\nvoid rotate_left(vector<vector<char>> &S) {\n int N = S.size();\n auto T = S;\n rep(i,0,N) rep(j,0,N) {\n T[i][j] = S[j][N-1-i];\n }\n S = T;\n}\n\n//2点(a,b)と(x,y)の距離\ndouble dist2(ll a, ll b, ll x, ll y) {\n return sqrt((a-x)*(a-x) + (b-y)*(b-y));\n}\nint man(int a, int b, int x, int y) {\n return abs(a-x) + abs(b-y);\n}\n\n//桁数\nint digit(ll N) {\n if(N <= 9) return 1;\n\n return 1 + digit(N / 10);\n}\n//A進数文字列NをB進数に変換. A,Bは10以下\nstring base_change(string N, ll A, ll B) {\n ll X = stoll(N), Y = 0;\n\n ll i = 1;\n while(X != 0) {\n Y += (X % 10) * i;\n i *= A;\n X /= 10;\n }\n\n X = Y, Y = 0;\n i = 1;\n while(X != 0) {\n Y += (X % B) * i;\n i *= 10;\n X /= B;\n }\n\n return to_string(Y);\n}\n//回文判定\nbool palin(string S) {\n rep(i,0,S.size()) {\n if(S[i] != S[S.size()-1-i]) return false;\n }\n return true;\n}\n\n//hh:mm:ss to second\nint convert_to_time(string S) {\n ll h = 10*(S[0]-'0') + (S[1]-'0');\n ll m = 10*(S[3]-'0') + (S[4]-'0');\n ll s = 10*(S[6]-'0') + (S[7]-'0');\n \n return h*3600+m*60+s;\n}\n\n//DFS\nvoid dfs(const Graph &G, int v, vector<bool> &seen) { \n seen[v] = true;\n \n for (auto next_v : G[v]) { \n if (!seen[next_v]) {\n dfs(G, next_v, seen);\n }\n }\n}\nvoid griddfs(const vector<vector<char>> &G, int x, int y, vector<vector<bool>> &seen) {\n int H = G.size(), W = G[0].size();\n seen[x][y] = true;\n \n for (int i = 0; i < 8; i++) { \n int nx = x + dx[i], ny = y + dy[i];\n if(nx < 0 or nx >= H or ny < 0 or ny >= W) continue;\n if (!seen[nx][ny] and G[nx][ny] != '#') griddfs(G, nx, ny, seen);\n }\n}\n//BFS\nvoid bfs(const Graph &G, int v, vector<int> &dist) {\n rep(i,0,dist.size()) dist[i] = inf;\n dist[v] = 0;\n queue<int> q;\n q.push(v);\n while(!q.empty()) {\n int u = q.front();\n q.pop();\n for(auto next_u : G[u]) {\n if(dist[next_u] == inf) {\n dist[next_u] = dist[u] + 1;\n q.push(next_u);\n }\n }\n }\n}\nvoid gridbfs(const vector<vector<char>> &G, int x, int y, vector<vector<int>> &dist) {\n int H = G.size(), W = G[0].size();\n rep(i,0,H) rep(j,0,W) dist[i][j] = inf;\n dist[x][y] = 0;\n queue<pair<int, int>> q;\n q.push(make_pair(x, y));\n while(!q.empty()) {\n int x = q.front().first, y = q.front().second;\n q.pop();\n for(int i = 0; i < 4; i++) {\n int nx = x + dx[i], ny = y + dy[i];\n if(nx < 0 or nx >= H or ny < 0 or ny >= W) continue;\n if(dist[nx][ny] == inf and G[nx][ny] != '#') {\n dist[nx][ny] = dist[x][y] + 1;\n q.push(make_pair(nx, ny));\n }\n }\n }\n}\n//ワーシャル・フロイド\nvector<vector<ll>> floyd(vector<vector<ll>> G) {\n int N = G.size();\n auto dp = G;\n for (int k = 0; k < N; k++){\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if(dp[i][j] > dp[i][k] + dp[k][j] and dp[i][k] != INF and dp[k][j] != INF) {\n dp[i][j] = dp[i][k] + dp[k][j];\n }\n }\n }\n }\n return dp;\n}\n\n//Union-Find\nstruct UnionFind {\n vector<int> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2\n \n UnionFind(int N) : par(N) { //最初は全てが根であるとして初期化\n for(int i = 0; i < N; i++) par[i] = i;\n }\n \n int root(int x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}\n if (par[x] == x) return x;\n return par[x] = root(par[x]);\n }\n \n void unite(int x, int y) { // xとyの木を併合\n int rx = root(x); //xの根をrx\n int ry = root(y); //yの根をry\n if (rx == ry) return; //xとyの根が同じ(=同じ木にある)時はそのまま\n par[rx] = ry; //xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける\n }\n \n bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す\n int rx = root(x);\n int ry = root(y);\n return rx == ry;\n }\n};\n\nvoid solve() {\n}\n\nint main() {\n while(1) {\n int N; cin >> N;\n if(N == 0) break;\n vi A(N); rep(i,0,N) cin >> A[i];\n vvi dp(N+1, vi(N+1, 0));\n REP(k,2,N) {\n REP(l,0,N-k) {\n int r = l+k;\n rep(i,l+1,r) chmax(dp[l][r], dp[l][i]+dp[i][r]);\n if(abs(A[l]-A[r-1]) <= 1 and dp[l+1][r-1] == r-l-2) dp[l][r] = r-l;\n }\n }\n cout << dp[0][N] << \"\\n\";\n }\n\n return 0;\n}","accuracy":1,"time_ms":170,"memory_kb":3768,"score_of_the_acc":-0.4995,"final_rank":7},{"submission_id":"aoj_1611_10875922","code_snippet":"// #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\n#include<bits/stdc++.h>\nusing namespace std;\n\n#include<complex>\n//#include <ext/pb_ds/tree_policy.hpp>\n//#include <ext/pb_ds/assoc_container.hpp>\n\n#define x() real()\n#define y() imag()\n#define endl '\\n'\n#define ll long long\ntypedef long double T;\ntypedef complex<T> point;\n#define pii pair<int,int>\n#define all(x) x.begin(),x.end()\n#define fastIO cin.tie(0)->sync_with_stdio(0);\n\n//using namespace __gnu_pbds;\n//template <typename T> using o_set = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;\n\n//If you can't solve a problem then there's an easier\n//sub-problem that you can not solve.Find it!!\n\nconst int N = 310;\nint a[N] , can[N][N] , dp[N][N];\n\nint main()\n{\n fastIO;\n\n //int t = 1; cin >> t;\n\n while (1)\n {\n int n; cin >> n;\n if (n == 0) break;\n\n memset(can , 0 , sizeof can);\n memset(dp , 0 , sizeof dp);\n\n for (int i = 1 ; i <= n ; i++) cin >> a[i];\n\n for (int len = 2 ; len <= n ; len += 2)\n {\n for (int i = 1 ; i + len - 1 <= n ; i++)\n {\n int lim = i + len - 1;\n\n for (int j = i + 1 ; j <= lim ; j++)\n {\n if (abs(a[i] - a[j]) > 1) continue;\n\n bool left = (j == i + 1) || can[i + 1][j - 1];\n bool right = (j + 1 > lim) || can[j + 1][lim];\n\n if (left && right)\n can[i][lim] |= 1;\n }\n }\n }\n\n int ans = 0;\n\n for (int len = 2 ; len <= n ; len++)\n {\n for (int i = 1 ; i + len - 1 <= n ; i++)\n {\n int j = i + len - 1;\n\n if (can[i][j])\n {\n dp[i][j] = j - i + 1;\n ans = max(ans , dp[i][j]);\n continue;\n }\n\n for (int k = i ; k < j ; k++)\n dp[i][j] = max(dp[i][j] , dp[i][k] + dp[k + 1][j]);\n\n ans = max(ans , dp[i][j]);\n }\n }\n\n cout << ans << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":220,"memory_kb":4120,"score_of_the_acc":-1.0389,"final_rank":13},{"submission_id":"aoj_1611_10875921","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n while (true) {\n int n;\n if (!(cin >> n)) break;\n if (n == 0) break;\n\n vector<int> w(n);\n for (int i = 0; i < n; i++) cin >> w[i];\n\n vector<vector<bool>> can(n, vector<bool>(n, false));\n vector<vector<int>> dp(n, vector<int>(n, 0));\n\n for (int len = 2; len <= n; len++) {\n for (int l = 0; l + len - 1 < n; l++) {\n int r = l + len - 1;\n\n if (len % 2 == 0) {\n for (int m = l + 1; m <= r; m++) {\n if (abs(w[l] - w[m]) <= 1) {\n bool left_ok = (m == l + 1) || can[l + 1][m - 1];\n bool right_ok = (m == r) || can[m + 1][r];\n if (left_ok && right_ok) {\n can[l][r] = true;\n break;\n }\n }\n }\n }\n\n int best = can[l][r] ? len : 0;\n for (int k = l; k < r; k++) {\n best = max(best, dp[l][k] + dp[k + 1][r]);\n }\n dp[l][r] = best;\n }\n }\n\n cout << dp[0][n - 1] << \"\\n\";\n }\n\n return 0;\n}","accuracy":1,"time_ms":190,"memory_kb":3532,"score_of_the_acc":-0.1919,"final_rank":3},{"submission_id":"aoj_1611_10869963","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int n;\n while(cin >> n){\n if(n==0){\n return 0;\n }\n\n vector<int> w(n);\n for(int i=0; i<n; i++){\n cin >> w[i];\n }\n\n vector<vector<int>> dp(n, vector<int>(n,0));\n for(int leng=2; leng<=n; leng++){\n for(int i=0; i<n-leng+1; i++){\n int j=i+leng-1;\n \n if(dp[i+1][j-1]==j-i-1 && abs(w[i]-w[j])<=1){\n dp[i][j]=j-i+1;\n continue;\n }\n \n for(int k=i; k<j; k++){\n dp[i][j]=max(dp[i][j],dp[i][k]+dp[k+1][j]);\n }\n }\n }\n\n cout << dp[0][n-1] << '\\n';\n\n }\n}","accuracy":1,"time_ms":110,"memory_kb":3792,"score_of_the_acc":-0.4722,"final_rank":5},{"submission_id":"aoj_1611_10866801","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main() {\n vector<int> res_list;\n while (true) {\n int n; cin >> n;\n if (n == 0) break;\n vector<int> W(n);\n for (int i = 0; i < n; ++i) cin >> W[i];\n\n vector<vector<int>> dp(n, vector<int>(n,INT_MAX));\n for (int i = 0; i < n; ++i) dp[i][i] = 1;\n for (int l = 2; l <= n; ++l) {\n for (int i = 0; i < n - l + 1; ++i) {\n int j = i + l - 1;\n if (l == 2) {\n if (abs(W[i] - W[j]) <= 1) dp[i][j] = 0;\n else dp[i][j] = 2;\n continue;\n }\n if (abs(W[i] - W[j]) <= 1 && dp[i + 1][j - 1] == 0) {\n dp[i][j] = 0;\n continue;\n }\n for (int k = i; k < j; ++k) {\n dp[i][j] = min(dp[i][j], dp[i][k] + dp[k + 1][j]);\n } \n }\n }\n\n res_list.push_back(n - dp[0][n-1]);\n }\n for (int res: res_list) cout << res << endl;\n return 0;\n}","accuracy":1,"time_ms":130,"memory_kb":3468,"score_of_the_acc":-0.0424,"final_rank":2},{"submission_id":"aoj_1611_10864647","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll=long long;\nusing pii=pair<int,int>;\n#define rep(a,b,c) for(int a=b;a<c;a++)\n#define rep1(a,b,c) for(int a=b;a>=c;a--)\n#define vc vector\n#define pbk push_back\n#define ebk emplace_back\n#define fst first\n#define snd second\n#define sz(a) (int)a.size()\n#define out(a,b,c,d,e) cout << a << \" \" << b << \" \" << c << \" \" << d << \" \" << e << endl\n\nvoid chmax(int &a,int b){a=max(a,b);return;}\n\nsigned main() {\n\tint n;\n\twhile(true){\n\t\tcin >> n;\n\t\tif(n==0) return 0;\n\t\tvc<int> w(n);\n\t\trep(i,0,n) cin >> w[i];\n\n\t\tvc dp(n,vc<int>(n+1,-1));\n\n\t\tauto dfs=[&](auto dfs,int s,int t)->int{\n\t\t\tif(dp[s][t]!=-1) return dp[s][t];\n\t\t\tif(t-s==1) return dp[s][t]=0;\n\t\t\tif(t-s==2){\n\t\t\t\tif(abs(w[s]-w[t-1])<=1) return dp[s][t]=2;\n\t\t\t\telse return dp[s][t]=0;\n\t\t\t}\n\t\t\tint tmp=0;\n\t\t\tif(abs(w[s]-w[t-1])<=1 && dfs(dfs,s+1,t-1)==t-s-2){\n\t\t\t\treturn dp[s][t]=t-s;\n\t\t\t}\n\t\t\trep(i,s+1,t){\n\t\t\t\tchmax(tmp,dfs(dfs,s,i)+dfs(dfs,i,t));\n\t\t\t}\n\t\t\treturn dp[s][t]=tmp;\n\t\t};\n\n\t\tint ans=dfs(dfs,0,n);\n\t\tcout << ans << endl;\n\n\t}\n\n\n}","accuracy":1,"time_ms":790,"memory_kb":3840,"score_of_the_acc":-1.2258,"final_rank":16},{"submission_id":"aoj_1611_10856891","code_snippet":"#include<bits/stdc++.h>\n#define FOR(i,s,t) for(int i = s; i<t ; i++)\n#define SZ(x) (int)x.size()\n#define ALL(x) x.begin(), x.end()\n\nusing namespace std;\n\nusing VI = vector<int>;\nusing LL = long long;\nusing VL = vector<LL>;\nusing VVI = vector<VI>;\n\n\nint main() {\n\tint N;\n\twhile (cin >> N, N) {\n\t\tVI a(N);\n\t\tFOR(i, 0, N) {\n\t\t\tscanf(\"%d\", &a[i]);\n\t\t}\n\t\tVVI checkdp(N + 1, VI(N + 1, 0));\n\t\tVVI dp(N + 1, VI(N + 1, 0));\n\t\tint ans = 0;\n\n\t\tFOR(alen, 2, N + 1) {\n\t\t\tFOR(i, 0, N) {\n\t\t\t\tint j = alen + i - 1;\n\t\t\t\tif (j >= N) continue;\n\t\t\t\tif (dp[i + 1][j - 1] == alen - 2 && abs(a[i] - a[j]) <= 1) dp[i][j] = alen;\n\t\t\t\tFOR(k, i, j) {\n\t\t\t\t\tdp[i][j] = max(dp[i][j], dp[i][k] + dp[k + 1][j]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout << dp[0][N - 1] << endl;\n\t\t//\n\n\n\n\t\t//FOR(i, 0, N - 1) {\n\t\t//\tif (abs(a[i] - a[i + 1]) <= 1) {\n\t\t//\t\tcheckdp[i][i + 1] = 1;\n\t\t//\t\tdp[i][i + 1] = 2;\n\t\t//\t\tans = 2;\n\t\t//\t}\n\t\t//}\n\n\t\t//for (int alen = 4; alen <= N; alen += 2) {// 長さalenを合成\n\t\t//\tfor (int s = 0; s < N; s++) {\n\t\t//\t\tfor (int spl = s + 1; spl <= N; spl++) {\n\t\t//\t\t\tint end = alen + s - 1;\n\t\t//\t\t\t// checkdp[s][spl], checkdp[spl + 1][end] merge;\n\t\t//\t\t\t// あとで境界処理をすること\n\t\t//\t\t\tif (s < end &&spl < end&& end < N) {// cond\n\t\t//\t\t\t\tif (checkdp[s][spl] && checkdp[spl + 1][end]) {\n\t\t//\t\t\t\t\tcheckdp[s][end] = 1;\n\t\t//\t\t\t\t\tdp[s][end] = alen;\n\t\t//\t\t\t\t\tans = max(ans, alen);\n\t\t//\t\t\t\t}\n\t\t//\t\t\t\tif (abs(a[s] - a[end]) <= 1 && checkdp[s + 1][spl] && checkdp[spl + 1][end - 1]) {\n\t\t//\t\t\t\t\tcheckdp[s][end] = 1;\n\t\t//\t\t\t\t\tdp[s][end] = alen;\n\t\t//\t\t\t\t\tans = max(ans, alen);\n\t\t//\t\t\t\t}\n\n\t\t//\t\t\t\tif (abs(a[s] - a[end]) <= 1 && checkdp[s + 1][end - 1]) {\n\n\t\t//\t\t\t\t\tcheckdp[s][end] = 1;\n\t\t//\t\t\t\t\tdp[s][end] = alen;\n\t\t//\t\t\t\t\tans = max(ans, alen);\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//}\n\t\t////cout << \"PREANS\" << ans << endl;\n\t\t////int ss, tt;\n\t\t////while (cin >> ss >> tt) {\n\t\t////\tcout << \"(s:\" << ss << \",t\" << tt << \"):\" << checkdp[ss][tt] << endl;\n\t\t////}\n\t\t//// くくりはmergeできたので、O XM O みたいなのを合成する\n\n\t\t//// max / + \n\n\t\t//for (int alen = 4; alen <= N; alen++) {// 長さalenを合成\n\t\t//\tfor (int s = 0; s < N; s++) {\n\t\t//\t\tfor (int spl = s + 1; spl <= N; spl++) {\n\t\t//\t\t\tint end = alen + s - 1;\n\t\t//\t\t\t// checkdp[s][spl], checkdp[spl + 1][end] merge;\n\t\t//\t\t\t// あとで境界処理をすること\n\t\t//\t\t\tif (s < end &&spl < end&& end < N) {// cond\n\n\n\t\t//\t\t\t\tdp[s][end] = max({ dp[s][end],dp[s][spl] + dp[spl + 1][end] });\n\t\t//\t\t\t\tans = max(ans, dp[s][end]);\n\t\t//\t\t\t\t/*if (checkdp[s][spl] && checkdp[spl + 1][end]) {\n\t\t//\t\t\t\t\tcheckdp[s][end] = 1;\n\t\t//\t\t\t\t\tdp[s][end] = alen;\n\t\t//\t\t\t\t\tans = max(ans, alen);\n\t\t//\t\t\t\t}\n\t\t//\t\t\t\tif (abs(a[s] - a[end]) <= 1 && checkdp[s + 1][spl] && checkdp[spl + 1][end - 1]) {\n\t\t//\t\t\t\t\tcheckdp[s][end] = 1;\n\t\t//\t\t\t\t\tdp[s][end] = alen;\n\t\t//\t\t\t\t\tans = max(ans, alen);\n\t\t//\t\t\t\t}\n\n\t\t//\t\t\t\tif (abs(a[s] - a[end]) <= 1 && checkdp[s + 1][end - 1]) {\n\n\t\t//\t\t\t\t\tcheckdp[s][end] = 1;\n\t\t//\t\t\t\t\tdp[s][end] = alen;\n\t\t//\t\t\t\t\tans = max(ans, alen);\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//}\n\n\t\t//cout << ans << endl;\n\n\t}\n\n\n\n\treturn 0;\n}","accuracy":1,"time_ms":120,"memory_kb":4172,"score_of_the_acc":-1.0101,"final_rank":12},{"submission_id":"aoj_1611_10854239","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint main() {\n vector<int> res_list;\n while (true) {\n int n; cin >> n;\n if (n == 0) break;\n vector<int> W(n);\n for (int i = 0; i < n; ++i) cin >> W[i];\n\n vector<vector<int>> dp(n, vector<int>(n, 0));\n for (int l = 2; l <= n; ++l) {\n for (int i = 0; i < n - l + 1; ++i) {\n int j = i + l - 1;\n if (abs(W[i] - W[j]) < 2 && dp[i + 1][j - 1] == l - 2) dp[i][j] = l; \n for (int k = i; k < j; ++k) {\n dp[i][j] = max(dp[i][j], dp[i][k] + dp[k+1][j]);\n }\n }\n }\n\n res_list.push_back(dp[0][n-1]);\n }\n\n for (int res: res_list) cout << res << endl;\n return 0;\n}","accuracy":1,"time_ms":130,"memory_kb":3452,"score_of_the_acc":-0.0202,"final_rank":1},{"submission_id":"aoj_1611_10853208","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define FOR(i,a,b) for(int (i)=(a);(i)<(b);(i)++)\n#define REP(i,n) FOR(i,0,(n))\n\ntypedef long long ll;\n\nconst int M=10000000;\nint dp[400][400];\n\nvector<int>wass;\nbool ok(int a, int b){\n return abs(wass[a]-wass[b])<=1;\n}\nint solve(int l,int r){\n if(dp[l][r]!=-1)return dp[l][r];\n if(l==r)return dp[l][r]=0;\n else if(l==r+1)return dp[l][r]=0;\n else{\n int ans=0;\n for(int p=l+1;p<r;++p){\n ans=max(ans,solve(l,p)+solve(p,r));\n }\n if(ok(l,r-1)){\n if(solve(l+1,r-1)==r-l-2){\n ans=r-l;\n }\n }\n return dp[l][r]=ans;\n }\n}\nint main()\n{\n while(true){\n for(int i=0;i<400;++i){\n for(int j=0;j<400;++j){\n dp[i][j]=-1;\n }\n }\n int N;cin>>N;\n if(!N)break;\n wass.assign(N,0);\n\n for(int i=0;i<N;++i){\n cin>>wass[i];\n }\n int ans=solve(0,N);\n cout<<ans<<endl;\n }\n \n}","accuracy":1,"time_ms":800,"memory_kb":4000,"score_of_the_acc":-1.4581,"final_rank":19},{"submission_id":"aoj_1611_10829050","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint dp[309][309];\n\nint main() {\n while(true){\n int N;\n cin >> N;\n if(N == 0){\n return 0;\n }\n vector<int> weight(N);\n for(int i = 0; i < N; i++){\n cin >> weight[i];\n }\n for(int i = 0; i < N+2; i++){\n for(int j = 0; j < N+2; j++){\n dp[i][j] = 0;\n }\n }\n for(int i = 0; i < N; i++){\n dp[i][i+1] = 0;\n }\n\n for(int W = 2; W <= N; W++){\n for(int L = 0; L + W <= N; L++){\n int R = L + W;\n\n if(dp[L+1][R-1] == W-2 && abs(weight[L] - weight[R-1]) <= 1){\n dp[L][R] = W;\n }\n\n for(int i = L; i <= R; i++){\n dp[L][R] = max(dp[L][R], dp[L][i] + dp[i][R]);\n }\n }\n }\n cout << dp[0][N] << endl;\n }\n}","accuracy":1,"time_ms":110,"memory_kb":3808,"score_of_the_acc":-0.4944,"final_rank":6},{"submission_id":"aoj_1611_10781360","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\nusing Graph = vector<vector<int>>;\nconst int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};\nconst int dy[8] = {0, 1, 0, -1, 1, -1, 1, -1};\n\n#define rep(i, a, b) for(int i = a; i < b; i++)\n#define all(v) v.begin(), v.end()\n#define YESNO(flag) cout << (flag ? \"Yes\" : \"No\") << \"\\n\"\n#define inf 1070000000\n#define INF 4500000000000000000\n#define MOD 998244353\n//#define MOD 1000000007\n#define pi 3.14159265358979\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\n//xのn乗\nll llpow(ll x, ll n) {\n ll ans = 1;\n while(n > 0) {\n if(n & 1) ans *= x;\n x *= x;\n n >>= 1; \n }\n return ans;\n}\nll modpow(ll x, ll n, ll mod) {\n ll ans = 1;\n while(n > 0) {\n if(n & 1) ans = ans * x % mod;\n x = x * x % mod;\n n >>= 1;\n }\n return ans;\n}\n//nの階乗\nll fact(ll n) {\n if(n == 0) return 1;\n else return n * fact(n-1);\n}\n//素数判定\nbool is_prime(long long x) {\n if(x == 1) return false;\n \n for(long long i = 2; i*i <= x; i++) {\n if(x % i == 0) return false;\n }\n return true;\n}\n\n//座標圧縮\nvector<int> compress(vector<int> A) {\n vector<int> B = A;\n\n sort(B.begin(), B.end());\n B.erase(unique(B.begin(), B.end()), B.end());\n\n vector<int> res(A.size());\n for(int i = 0; i < (int)A.size(); i++) {\n res[i] = lower_bound(B.begin(), B.end(), A[i]) - B.begin();\n }\n return res;\n}\n\n//正方形グリッドの右回転\nvoid rotate_right(vector<vector<char>> &S) {\n int N = S.size();\n auto T = S;\n rep(i,0,N) rep(j,0,N) {\n T[i][j] = S[N-1-j][i];\n }\n S = T;\n}\n//左回転\nvoid rotate_left(vector<vector<char>> &S) {\n int N = S.size();\n auto T = S;\n rep(i,0,N) rep(j,0,N) {\n T[i][j] = S[j][N-1-i];\n }\n S = T;\n}\n\n//2点(a,b)と(x,y)の距離\ndouble dist(ll a, ll b, ll x, ll y) {\n return sqrt((a-x)*(a-x) + (b-y)*(b-y));\n}\nint man(int a, int b, int x, int y) {\n return abs(a-x) + abs(b-y);\n}\n\n//桁数\nint digit(ll N) {\n if(N <= 9) return 1;\n\n return 1 + digit(N / 10);\n}\n//A進数文字列NをB進数に変換. A,Bは10以下\nstring base_change(string N, ll A, ll B) {\n ll X = stoll(N), Y = 0;\n\n ll i = 1;\n while(X != 0) {\n Y += (X % 10) * i;\n i *= A;\n X /= 10;\n }\n\n X = Y, Y = 0;\n i = 1;\n while(X != 0) {\n Y += (X % B) * i;\n i *= 10;\n X /= B;\n }\n\n return to_string(Y);\n}\n//回文判定\nbool palin(string S) {\n rep(i,0,S.size()) {\n if(S[i] != S[S.size()-1-i]) return false;\n }\n return true;\n}\n\n\n//DFS\nvoid dfs(const Graph &G, int v, vector<bool> &seen) { \n seen[v] = true;\n \n for (auto next_v : G[v]) { \n if (!seen[next_v]) {\n dfs(G, next_v, seen);\n }\n }\n}\nvoid griddfs(const vector<vector<char>> &G, int x, int y, vector<vector<bool>> &seen) {\n int H = G.size(), W = G[0].size();\n seen[x][y] = true;\n \n for (int i = 0; i < 8; i++) { \n int nx = x + dx[i], ny = y + dy[i];\n if(nx < 0 or nx >= H or ny < 0 or ny >= W) continue;\n if (!seen[nx][ny] and G[nx][ny] != '#') griddfs(G, nx, ny, seen);\n }\n}\n//BFS\nvoid bfs(const Graph &G, int v, vector<int> &dist) {\n rep(i,0,dist.size()) dist[i] = inf;\n dist[v] = 0;\n queue<int> q;\n q.push(v);\n while(!q.empty()) {\n int u = q.front();\n q.pop();\n for(auto next_u : G[u]) {\n if(dist[next_u] == inf) {\n dist[next_u] = dist[u] + 1;\n q.push(next_u);\n }\n }\n }\n}\nvoid gridbfs(const vector<vector<char>> &G, int x, int y, vector<vector<int>> &dist) {\n int H = G.size(), W = G[0].size();\n rep(i,0,H) rep(j,0,W) dist[i][j] = inf;\n dist[x][y] = 0;\n queue<pair<int, int>> q;\n q.push(make_pair(x, y));\n while(!q.empty()) {\n int x = q.front().first, y = q.front().second;\n q.pop();\n for(int i = 0; i < 4; i++) {\n int nx = x + dx[i], ny = y + dy[i];\n if(nx < 0 or nx >= H or ny < 0 or ny >= W) continue;\n if(dist[nx][ny] == inf and G[nx][ny] != '#') {\n dist[nx][ny] = dist[x][y] + 1;\n q.push(make_pair(nx, ny));\n }\n }\n }\n}\n//ワーシャル・フロイド\nvoid floyd(vector<vector<ll>> &G) {\n int N = G.size();\n for (int k = 0; k < N; k++){\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < N; j++) {\n if(G[i][j] > G[i][k] + G[k][j]) {\n G[i][j] = G[i][k] + G[k][j];\n }\n }\n }\n }\n}\n\nvoid solve() {\n}\n\nint main() {\n while(1) {\n int N; cin >> N;\n if(N == 0) break;\n vector<int> A(N); rep(i,0,N) cin >> A[i];\n vector<vector<int>> dp(N+1, vector<int>(N+1, 0));\n\n rep(i,0,N) dp[i][i+1] = 0;\n rep(W, 2, N+1) {\n rep(l,0,N) {\n int r = l + W;\n if(r > N) continue;\n\n if(abs(A[l] - A[r-1]) <= 1 and dp[l+1][r-1] == r-l-2) dp[l][r] = r-l;\n\n rep(mid,l+1,r) {\n chmax(dp[l][r], dp[l][mid] + dp[mid][r]);\n }\n }\n }\n\n cout << dp[0][N] << \"\\n\";\n }\n \n return 0;\n}","accuracy":1,"time_ms":180,"memory_kb":3872,"score_of_the_acc":-0.654,"final_rank":10},{"submission_id":"aoj_1611_10769044","code_snippet":"#include <iostream>\n#include <vector>\n#include <string>\n#include <algorithm>\n#include <cmath>\n#include <numeric>\n#include <iomanip>\n#include <map>\n#include <queue>\n#include <set>\n#include <bitset>\n#include <stack>\n#include <list>\n#include <unordered_set>\n#include <unordered_map>\n#define rep(i, a, b) for (int i = a; i < b; ++i)\nusing namespace std;\n\nconst int MOD = 998244353;\nconst int mod = 1000000007;\n\nconst long long INF = 1LL << 60;\nconstexpr double pi = 3.141592653589793238462643383279502884L;\n\nstruct Edge {\n int to;\n long long w;\n Edge(int to, long long w) : to(to), w(w) {}\n};\n\nusing Graph = vector<vector<Edge>>;\nusing P = pair<int, int>;\nusing Pll = pair<long long, int>;\nusing ll = long long;\n\ntemplate<class T> bool chmin(T& a, T b) { if (a > b) { a = b; return true; } else return false; }\ntemplate<class T> bool chmax(T& a, T b) { if (a < b) { a = b; return true; } else return false; }\n\nvector<vector<int>> dp;\n\nint rec(int l, int r, const vector<int> &w) {\n // 計算済みの時はその値を返す\n if (dp[l][r] != -1) return dp[l][r];\n\n // 一個のみの時は取り除けないので取り除かない，つまり0を返す\n if (abs(l - r) <= 1) return 0;\n\n int res = 0;\n // 区間[l, r)を計算する\n // パターン1: [l, r)までの区間が全部取り除けるとき\n // その中身がすべて1以下で構成されているとき取り除けることになる\n if (abs(w[l] - w[r-1]) <= 1 && rec(l+1, r-1, w) == r - l - 2) {\n // [l, r)を取り除く\n res = r - l;\n }\n\n // パターン2: 全部取り除かず，区間内でぼちぼち取り除く\n for (int i = l+1; i <= r-1; ++i) {\n // 左側部分での最適な取り除き方をしたときの取り除き個数\n // と右側部分での最適な取り除き方をしたときの取り除き個数\n // を合わせれば今回の[l, r)の最適な取り出し方が得られる\n res = max(res, rec(l, i, w) + rec(i, r, w));\n }\n\n // メモ化再帰\n return dp[l][r] = res;\n}\n\nint main() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n\n while (true) {\n int n; cin >> n;\n if (n == 0) break;\n\n vector<int> w(n);\n for (int i = 0; i < n; ++i) {\n cin >> w[i];\n }\n\n dp.assign(n+1, vector<int>(n+1, -1));\n cout << rec(0, n, w) << endl;\n }\n}","accuracy":1,"time_ms":700,"memory_kb":3840,"score_of_the_acc":-1.1348,"final_rank":15},{"submission_id":"aoj_1611_10750034","code_snippet":"#include <iostream>\n#include <vector>\n#include <iomanip>\n#include <algorithm>\n#include <tuple>\n#include <set>\n#include <map>\n#include <bitset>\n#include <cmath>\n#include <deque>\n#include <queue>\n#include <stack>\n#include <cassert>\n#include <unordered_set>\n#include <unordered_map>\n#include <cmath>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\n#define all(v) v.begin(), v.end()\n\nll llpow(ll a, ll t)\n{\n ll res = 1;\n rep(i, t) res *= a;\n return res;\n}\n\nll inf = std::numeric_limits<ll>::max();\n\nint main()\n{\n vector<ll> ans;\n while (true)\n {\n ll n;\n cin >> n;\n if (!n)\n {\n break;\n }\n vector<ll> vec(n);\n rep(i, n)\n {\n cin >> vec[i];\n }\n // lrで取り除ける最大\n vector<vector<ll>> dp(n, vector<ll>(n, 0));\n rep(i, n) // diff\n {\n rep(j, n) // left\n {\n if (!i)\n {\n continue;\n }\n if (i + j > n - 1)\n {\n continue;\n }\n if (i == 1)\n {\n if (abs(vec[j] - vec[j + i]) <= 1)\n {\n dp[j][j + i] = 2;\n }\n continue;\n }\n if (dp[j + 1][j + i - 1] == i - 1 && abs(vec[j] - vec[j + i]) <= 1)\n {\n dp[j][j + i] = i + 1;\n continue;\n }\n rep(k, i)\n {\n dp[j][j + i] = max(dp[j][j + i], dp[j][j + k] + dp[j + k + 1][j + i]);\n }\n }\n }\n // cout << dp[0][3] << endl;\n ans.push_back(dp[0][n - 1]);\n }\n for (auto num : ans)\n {\n cout << num << endl;\n }\n}","accuracy":1,"time_ms":150,"memory_kb":3896,"score_of_the_acc":-0.6571,"final_rank":11},{"submission_id":"aoj_1611_10743637","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing P = pair<int, int>;\n#define chmin(x, y) x = min(x, y)\n#define chmax(x, y) x = max(x, y)\n\nint inf = 10010010;\n\nint main()\n{\n while (true)\n {\n int n;\n cin >> n;\n if (n == 0)\n break;\n vector<int> w;\n for (int i = 0; i < n; ++i)\n {\n int a;\n cin >> a;\n w.push_back(a);\n }\n vector<vector<int>> dp(n + 5, vector<int>(n + 5, 0));\n for (int i = 0; i < n - 1; ++i)\n {\n if (abs(w[i] - w[i + 1]) <= 1)\n {\n dp[i][i + 1] = 2;\n }\n }\n for (int i = 0; i < n; ++i)\n {\n for (int j = 0; j < n; ++j)\n {\n int start = j;\n int end = i + j;\n if (end >= n)\n break;\n for (int k = 1; k < i; ++k)\n {\n if (dp[start][start + k] != 0 && dp[start + k + 1][end])\n {\n dp[start][end] = max(\n dp[start][end], dp[start][start + k] + dp[start + k + 1][end]);\n }\n }\n if (dp\n [start + 1][end - 1] != 0 &&\n abs(w[start] - w[end]) <= 1)\n {\n dp[start][end] = max(dp[start][end], dp[start + 1][end - 1] + 2);\n }\n }\n }\n for (int i = 0; i < n; ++i)\n {\n for (int j = 0; j < n; ++j)\n {\n int start = j;\n int end = i + j;\n if (end >= n)\n break;\n for (int k = 0; k < i; ++k)\n {\n dp[start][end] = max(\n dp[start][end], dp[start][start + k] + dp[start + k + 1][end]);\n }\n }\n }\n cout << dp[0][n - 1] << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":260,"memory_kb":3708,"score_of_the_acc":-0.5071,"final_rank":8},{"submission_id":"aoj_1611_10743627","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing P = pair<int, int>;\n#define chmin(x, y) x = min(x, y)\n#define chmax(x, y) x = max(x, y)\n\nint inf = 10010010;\n\nint main()\n{\n while (true)\n {\n int n;\n cin >> n;\n if (n == 0)\n break;\n vector<int> w;\n for (int i = 0; i < n; ++i)\n {\n int a;\n cin >> a;\n w.push_back(a);\n }\n vector<vector<int>> dp(n + 5, vector<int>(n + 5, 0));\n for (int i = 0; i < n - 1; ++i)\n {\n if (abs(w[i] - w[i + 1]) <= 1)\n {\n dp[i][i + 1] = 2;\n }\n }\n for (int i = 0; i < n; ++i)\n {\n for (int j = 0; j < n; ++j)\n {\n int start = j;\n int end = i + j;\n if (end >= n)\n break;\n for (int k = 0; k < i; ++k)\n {\n if (dp[start][start + k] != 0 && dp[start + k + 1][end])\n {\n dp[start][end] = max(\n dp[start][end], dp[start][start + k] + dp[start + k + 1][end]);\n }\n }\n if (dp\n [start + 1][end - 1] != 0 &&\n abs(w[start] - w[end]) <= 1)\n {\n dp[start][end] = max(dp[start][end], dp[start + 1][end - 1] + 2);\n }\n }\n }\n for (int i = 0; i < n; ++i)\n {\n for (int j = 0; j < n; ++j)\n {\n int start = j;\n int end = i + j;\n if (end >= n)\n break;\n for (int k = 0; k < i; ++k)\n {\n dp[start][end] = max(\n dp[start][end], dp[start][start + k] + dp[start + k + 1][end]);\n }\n }\n }\n cout << dp[0][n - 1] << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":260,"memory_kb":3736,"score_of_the_acc":-0.546,"final_rank":9}],"string":"[\n {\n \"submission_id\": \"aoj_1611_11035458\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n\\nusing namespace std;\\n\\n\\nint main(){\\n\\n while(1){\\n int n;\\n cin >> n;\\n if (n == 0) break;\\n vector<int> w(n);\\n for (int i=0; i<n; i++) cin >> w[i];\\n\\n vector<vector<int>> dp(n+1, vector<int>(n+1, 0));\\n for(int width=2; width<=n; width++){\\n for (int l=0; l+width<=n; l++){\\n int r = l + width;\\n // if (r >= n) continue;\\n // dp[l+1][r-1] == r - l - 2 : 間の全てのブロックを落とせる。\\n // cout << \\\"r=\\\" << r << \\\", l=\\\" << l << endl;\\n if (dp[l+1][r-1] == r - l - 2 && abs(w[r-1]-w[l]) <= 1){\\n dp[l][r] = width;\\n // cout << \\\"all\\\" << endl;\\n }\\n else{\\n for (int mid=l; mid<=r; mid++){\\n // cout << \\\"mid=\\\" << mid << \\\", dp[l][mid]=\\\" << dp[l][mid] << \\\", dp[mid][r]=\\\" << dp[mid][r] << endl;\\n dp[l][r] = max(dp[l][r], dp[l][mid] + dp[mid][r]);\\n }\\n }\\n // cout << \\\"dp[\\\" << l << \\\"][\\\" << r << \\\"] = \\\" << dp[l][r] << endl;\\n }\\n }\\n cout << dp[0][n] << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 3768,\n \"score_of_the_acc\": -0.449,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1611_11035150\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll=long long;\\n#define rep(a,b,c) for(int a=b;a<c;a++)\\n#define rep1(a,b,c) for(int a=b;a>=c;a--)\\n#define vc vector\\n#define pbk push_back\\n#define ebk emplace_back\\n#define fst first\\n#define snd second\\n#define sz(a) (int)a.size()\\n#define out(a,b,c,d,e) cout << a << \\\" \\\" << b << \\\" \\\" << c << \\\" \\\" << d << \\\" \\\" << e << endl\\nusing pii=pair<int,int>;\\n\\nvoid chmax(int &a,int b){a=max(a,b);return;}\\nvoid chmin(int &a,int b){a=min(a,b);return;}\\n\\nsigned main() {\\n\\tint n;\\n\\tvc<int> ans;\\n\\twhile(true){\\n\\t\\tcin >> n;\\n\\t\\tif(n==0) break;\\n\\t\\tvc<int> a(n);\\n\\t\\trep(i,0,n) cin >> a[i];\\n\\n\\n\\t\\tvc dp(n+1,vc<int>(n+2,-1));\\n\\n\\n\\t\\tauto dfs=[&](auto dfs,int s,int t)->int{\\n\\t\\t\\tif(dp[s][t]!=-1) return dp[s][t];\\n\\t\\t\\tif(t-s<=1) return 0;\\n\\t\\t\\tif(t-s==2){\\n\\t\\t\\t\\tif(abs(a[s]-a[s+1])<=1) return dp[s][t]=2;\\n\\t\\t\\t\\telse return dp[s][t]=0;\\n\\t\\t\\t}\\n\\t\\t\\tint tmp=0;\\n\\t\\t\\tif(abs(a[s]-a[t-1])<=1 && dfs(dfs,s+1,t-1)==t-s-2){\\n\\t\\t\\t\\tchmax(tmp,t-s);\\n\\t\\t\\t}\\n\\t\\t\\trep(i,s+1,t){\\n\\t\\t\\t\\tint r=dfs(dfs,s,i)+dfs(dfs,i,t);\\n\\t\\t\\t\\tchmax(tmp,r);\\n\\t\\t\\t}\\n\\t\\t\\treturn dp[s][t]=tmp;\\n\\t\\t};\\n\\n\\t\\tcout << (dfs(dfs,0,n)) << endl;\\n\\n\\t}\\n\\t//for(int x:ans) cout << x << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 840,\n \"memory_kb\": 3968,\n \"score_of_the_acc\": -1.454,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1611_11035144\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll=long long;\\n#define rep(a,b,c) for(int a=b;a<c;a++)\\n#define rep1(a,b,c) for(int a=b;a>=c;a--)\\n#define vc vector\\n#define pbk push_back\\n#define ebk emplace_back\\n#define fst first\\n#define snd second\\n#define sz(a) (int)a.size()\\n#define out(a,b,c,d,e) cout << a << \\\" \\\" << b << \\\" \\\" << c << \\\" \\\" << d << \\\" \\\" << e << endl\\nusing pii=pair<int,int>;\\n\\nvoid chmax(int &a,int b){a=max(a,b);return;}\\nvoid chmin(int &a,int b){a=min(a,b);return;}\\n\\nsigned main() {\\n\\tint n;\\n\\tvc<int> ans;\\n\\twhile(true){\\n\\t\\tcin >> n;\\n\\t\\tif(n==0) break;\\n\\t\\tvc<int> a(n);\\n\\t\\trep(i,0,n) cin >> a[i];\\n\\n\\n\\t\\tvc dp(n+1,vc<int>(n+2,-1));\\n\\n\\n\\t\\tauto dfs=[&](auto dfs,int s,int t)->int{\\n\\t\\t\\tif(dp[s][t]!=-1) return dp[s][t];\\n\\t\\t\\tif(t-s<=1) return 0;\\n\\t\\t\\tif(t-s==2){\\n\\t\\t\\t\\tif(abs(a[s]-a[s+1])<=1) return 2;\\n\\t\\t\\t\\telse return 0;\\n\\t\\t\\t}\\n\\t\\t\\tint tmp=0;\\n\\t\\t\\tif(abs(a[s]-a[t-1])<=1 && dfs(dfs,s+1,t-1)==t-s-2){\\n\\t\\t\\t\\tchmax(tmp,t-s);\\n\\t\\t\\t}\\n\\t\\t\\trep(i,s+1,t){\\n\\t\\t\\t\\tint r=dfs(dfs,s,i)+dfs(dfs,i,t);\\n\\t\\t\\t\\tchmax(tmp,r);\\n\\t\\t\\t}\\n\\t\\t\\tdp[s][t]=tmp;\\n\\t\\t\\treturn tmp;\\n\\t\\t};\\n\\n\\tcout << (dfs(dfs,0,n)) << endl;\\n\\n\\t}\\n\\t//for(int x:ans) cout << x << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 870,\n \"memory_kb\": 3968,\n \"score_of_the_acc\": -1.4843,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1611_11035119\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define ALL(obj) begin(obj), end(obj)\\nusing namespace std;\\n\\ntemplate <class T>\\nbool chmax(T &a, const T &b) {\\n if (a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\n\\nint N;\\nvector<int> w;\\nvector<vector<int>> dp;\\n\\nint rec(int l = 0, int r = N) { // メモ化再帰\\n if ((r - l) <= 1) return 0;\\n if ((r - l) == 2) {\\n if (abs(w[l] - w[l + 1]) <= 1) { // 隣り合う2つの差が1以下\\n return 2;\\n } else {\\n return 0;\\n }\\n }\\n\\n int &ret = dp[l][r]; // 更新の対象についての参照を宣言\\n if (ret != -1) return ret; // 既に計算済みならその値を使う\\n\\n // 1. 全部取り除けるとき\\n if (abs(w[l] - w[r-1]) <= 1 && rec(l + 1, r - 1) == r - l - 2) chmax(ret, r - l);\\n // 2. そうでない時\\n for (int i = l + 1; i <= r - 1; i++) {\\n chmax(ret, rec(l, i) + rec(i, r));\\n }\\n\\n return ret;\\n}\\n\\nint main() {\\n vector<int> ans;\\n while (true) {\\n cin >> N;\\n if (N == 0) break;\\n w.resize(N);\\n for (int i = 0; i < N; i++) {\\n cin >> w.at(i);\\n }\\n\\n dp.assign(N + 2, vector<int>(N + 2, -1)); // 初期化\\n\\n ans.push_back(rec());\\n }\\n\\n for (auto i : ans) {\\n cout << i << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 700,\n \"memory_kb\": 3816,\n \"score_of_the_acc\": -1.1015,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1611_10937835\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing pii = pair < int, int > ;\\nusing pll = pair < ll, ll > ;\\n#define all(x) x.begin(), x.end()\\nconst double pi = 3.141592653589793238;\\nconst string ABC = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\nconst string abc = \\\"abcdefghijklmnopqrstuvwxyz\\\";\\n//n以下の約数列挙。O(√n)\\nvector<ll> enumdiv(ll n){\\n vector<ll> res;\\n for(ll i = 1; i*i <= n; i++){\\n if(n%i==0){\\n res.push_back(i);\\n if(i*i!=n) res.push_back(n/i); \\n }\\n }\\n sort(all(res));\\n return res;\\n}\\n//nを素因数分解する。{素数、指数}\\nvector<pair<ll,ll>> prime_factorize(ll n){\\n vector<pair<ll,ll>> res;\\n for(ll a = 2; a*a<=n; a++){\\n if(n%a==0){\\n ll ex = 0;//指数部分\\n while(n%a==0){\\n n/=a;\\n ex++;\\n }\\n res.push_back({a,ex});\\n }\\n }\\n if(n!=1) res.push_back({n,1});\\n return res;\\n}\\nstruct UnionFind{\\n vector<int> par;//各要素の親 root=-1\\n UnionFind(int sz){\\n par.assign(sz,-1);\\n }\\n bool unite(int x,int y){\\n x = find(x);\\n y = find(y);\\n if(x==y) return false;\\n if(par[x]>par[y]) swap(x,y);\\n par[x] += par[y];\\n par[y] = x;\\n return true;\\n }\\n int find(int k){//kが属する根ノードを返す\\n if(par[k]<0) return k;\\n return par[k] = find(par[k]);\\n }\\n int size(int k){//kが属する木のサイズ\\n return -par[find(k)];\\n }\\n vector<vector<int>> groups(){//全ての要素を連結成分ごとにグループ分けして返す。\\n vector<vector<int>> result;\\n map<int,vector<int>> mp;\\n for(int i = 0; i < (int)par.size(); i++){\\n mp[find(i)].push_back(i);\\n }\\n for(auto [key,val] : mp){\\n result.push_back(val);\\n }\\n return result;\\n }\\n};\\n// a^n mod を計算する\\nlong long modpow(long long a, long long n, long long mod) {\\n\\tlong long res = 1;\\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;\\n}\\nint main() {\\n int n;\\n while(cin >> n){\\n if(n==0) break;\\n vector<int> w(n);\\n for(int i = 0; i < n; i++){\\n cin >> w[i];\\n }\\n vector<vector<int>> dp(n+1,vector<int>(n+1,-1));\\n auto rec = [&](auto self,int l,int r) -> int{\\n if(r-l<=1) return 0;\\n if(r-l==2){\\n if(abs(w[l+1]-w[l])<=1){\\n return 2;\\n }else return 0;\\n }\\n if(dp[l][r]!=-1) return dp[l][r];\\n if(abs(w[l]-w[r-1])<=1&&self(self,l+1,r-1)==r-l-2){//全部取り除ける時\\n dp[l][r] = max(dp[l][r],r-l);\\n }\\n for(int i = l+1; i <= r-1; i++){\\n dp[l][r] = max(dp[l][r],self(self,l,i)+self(self,i,r));\\n }\\n return dp[l][r];\\n };\\n cout << rec(rec,0,n) << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1100,\n \"memory_kb\": 3748,\n \"score_of_the_acc\": -1.4111,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1611_10891129\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#if __has_include(<atcoder/all>)\\n#include <atcoder/math>\\nusing namespace atcoder;\\n#endif\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing vi = vector<int>;\\nusing vvi = vector<vector<int>>;\\nusing vvvi = vector<vector<vector<int>>>;\\nusing vll = vector<ll>;\\nusing vvll = vector<vector<ll>>;\\nusing vvvll = vector<vector<vector<ll>>>;\\nusing vd = vector<double>;\\nusing vvd = vector<vector<double>>;\\nusing vstr = vector<string>;\\nusing vchar = vector<char>;\\nusing vvchar = vector<vector<char>>;\\nusing vb = vector<bool>;\\nusing vvb = vector<vector<bool>>;\\nusing pii = pair<int,int>;\\nusing pll = pair<long long, long long>;\\nusing Graph = vector<vector<int>>;\\nconst int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};\\nconst int dy[8] = {0, 1, 0, -1, 1, -1, 1, -1};\\n\\n#define rep(i, a, b) for(int i = (int)a; i < (int)b; i++)\\n#define REP(i, a, b) for (int i = (int)a; i <= (int)b; i++)\\n#define all(v) v.begin(), v.end()\\n#define rall(v) v.rbegin(), v.rend()\\n#define YESNO(flag) cout << (flag ? \\\"Yes\\\" : \\\"No\\\") << \\\"\\\\n\\\"\\n#define spa \\\" \\\"\\n\\nconst int inf = 1070000000;\\nconst long long INF = 4500000000000000000;\\nconst long long MOD = 998244353;\\n//const long long MOD = 1000000007;\\nconst double pi = 3.141592653589793238;\\nconst double eps = (1e-10);\\nconst string ABC = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\nconst string abc = \\\"abcdefghijklmnopqrstuvwxyz\\\";\\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\\n//xのn乗\\nll llpow(ll x, ll n) {\\n ll ans = 1;\\n while(n > 0) {\\n if(n & 1) ans *= x;\\n x *= x;\\n n >>= 1; \\n }\\n return ans;\\n}\\nll modpow(ll x, ll n, ll mod) {\\n ll ans = 1;\\n while(n > 0) {\\n if(n & 1) ans = ans * x % mod;\\n x = x * x % mod;\\n n >>= 1;\\n }\\n return ans;\\n}\\n//mod pでのaの逆元\\nll inverse(ll a, ll p) {\\n return modpow(a, p-2, p);\\n}\\n//nの階乗\\nll fact(ll n) {\\n if(n == 0) return 1;\\n else return n * fact(n-1);\\n}\\nll modfact(ll n, ll mod) {\\n if(n == 0) return 1;\\n else return (n * modfact(n-1, mod)) % mod;\\n}\\n//nCr=n!/r!(n-r)! mod p\\nll comb(ll n, ll r, ll mod) {\\n ll a = modfact(n, mod), b = modfact(r, mod), c = modfact(n-r, mod);\\n b = inverse(b, mod); c = inverse(c, mod);\\n return (((a*b)%mod)*c)%mod;\\n}\\n\\n//1+2+...+n = n(n+1)/2\\nll triangle(ll n) {\\n ll x = n*(n+1);\\n return x/2;\\n}\\n//素数判定\\nbool is_prime(long long x) {\\n if(x == 1) return false;\\n \\n for(long long i = 2; i*i <= x; i++) {\\n if(x % i == 0) return false;\\n }\\n return true;\\n}\\n\\n//座標圧縮\\nvector<int> compress(vector<int> A) {\\n vector<int> B = A;\\n\\n sort(B.begin(), B.end());\\n B.erase(unique(B.begin(), B.end()), B.end());\\n\\n vector<int> res(A.size());\\n for(int i = 0; i < (int)A.size(); i++) {\\n res[i] = lower_bound(B.begin(), B.end(), A[i]) - B.begin();\\n }\\n return res;\\n}\\n\\n//正方形グリッドの右回転\\nvoid rotate_right(vector<vector<char>> &S) {\\n int N = S.size();\\n auto T = S;\\n rep(i,0,N) rep(j,0,N) {\\n T[i][j] = S[N-1-j][i];\\n }\\n S = T;\\n}\\n//左回転\\nvoid rotate_left(vector<vector<char>> &S) {\\n int N = S.size();\\n auto T = S;\\n rep(i,0,N) rep(j,0,N) {\\n T[i][j] = S[j][N-1-i];\\n }\\n S = T;\\n}\\n\\n//2点(a,b)と(x,y)の距離\\ndouble dist2(ll a, ll b, ll x, ll y) {\\n return sqrt((a-x)*(a-x) + (b-y)*(b-y));\\n}\\nint man(int a, int b, int x, int y) {\\n return abs(a-x) + abs(b-y);\\n}\\n\\n//桁数\\nint digit(ll N) {\\n if(N <= 9) return 1;\\n\\n return 1 + digit(N / 10);\\n}\\n//A進数文字列NをB進数に変換. A,Bは10以下\\nstring base_change(string N, ll A, ll B) {\\n ll X = stoll(N), Y = 0;\\n\\n ll i = 1;\\n while(X != 0) {\\n Y += (X % 10) * i;\\n i *= A;\\n X /= 10;\\n }\\n\\n X = Y, Y = 0;\\n i = 1;\\n while(X != 0) {\\n Y += (X % B) * i;\\n i *= 10;\\n X /= B;\\n }\\n\\n return to_string(Y);\\n}\\n//回文判定\\nbool palin(string S) {\\n rep(i,0,S.size()) {\\n if(S[i] != S[S.size()-1-i]) return false;\\n }\\n return true;\\n}\\n\\n//hh:mm:ss to second\\nint convert_to_time(string S) {\\n ll h = 10*(S[0]-'0') + (S[1]-'0');\\n ll m = 10*(S[3]-'0') + (S[4]-'0');\\n ll s = 10*(S[6]-'0') + (S[7]-'0');\\n \\n return h*3600+m*60+s;\\n}\\n\\n//DFS\\nvoid dfs(const Graph &G, int v, vector<bool> &seen) { \\n seen[v] = true;\\n \\n for (auto next_v : G[v]) { \\n if (!seen[next_v]) {\\n dfs(G, next_v, seen);\\n }\\n }\\n}\\nvoid griddfs(const vector<vector<char>> &G, int x, int y, vector<vector<bool>> &seen) {\\n int H = G.size(), W = G[0].size();\\n seen[x][y] = true;\\n \\n for (int i = 0; i < 8; i++) { \\n int nx = x + dx[i], ny = y + dy[i];\\n if(nx < 0 or nx >= H or ny < 0 or ny >= W) continue;\\n if (!seen[nx][ny] and G[nx][ny] != '#') griddfs(G, nx, ny, seen);\\n }\\n}\\n//BFS\\nvoid bfs(const Graph &G, int v, vector<int> &dist) {\\n rep(i,0,dist.size()) dist[i] = inf;\\n dist[v] = 0;\\n queue<int> q;\\n q.push(v);\\n while(!q.empty()) {\\n int u = q.front();\\n q.pop();\\n for(auto next_u : G[u]) {\\n if(dist[next_u] == inf) {\\n dist[next_u] = dist[u] + 1;\\n q.push(next_u);\\n }\\n }\\n }\\n}\\nvoid gridbfs(const vector<vector<char>> &G, int x, int y, vector<vector<int>> &dist) {\\n int H = G.size(), W = G[0].size();\\n rep(i,0,H) rep(j,0,W) dist[i][j] = inf;\\n dist[x][y] = 0;\\n queue<pair<int, int>> q;\\n q.push(make_pair(x, y));\\n while(!q.empty()) {\\n int x = q.front().first, y = q.front().second;\\n q.pop();\\n for(int i = 0; i < 4; i++) {\\n int nx = x + dx[i], ny = y + dy[i];\\n if(nx < 0 or nx >= H or ny < 0 or ny >= W) continue;\\n if(dist[nx][ny] == inf and G[nx][ny] != '#') {\\n dist[nx][ny] = dist[x][y] + 1;\\n q.push(make_pair(nx, ny));\\n }\\n }\\n }\\n}\\n//ワーシャル・フロイド\\nvector<vector<ll>> floyd(vector<vector<ll>> G) {\\n int N = G.size();\\n auto dp = G;\\n for (int k = 0; k < N; k++){\\n for (int i = 0; i < N; i++) {\\n for (int j = 0; j < N; j++) {\\n if(dp[i][j] > dp[i][k] + dp[k][j] and dp[i][k] != INF and dp[k][j] != INF) {\\n dp[i][j] = dp[i][k] + dp[k][j];\\n }\\n }\\n }\\n }\\n return dp;\\n}\\n\\n//Union-Find\\nstruct UnionFind {\\n vector<int> par; // par[i]:iの親の番号 (例) par[3] = 2 : 3の親が2\\n \\n UnionFind(int N) : par(N) { //最初は全てが根であるとして初期化\\n for(int i = 0; i < N; i++) par[i] = i;\\n }\\n \\n int root(int x) { // データxが属する木の根を再帰で得る：root(x) = {xの木の根}\\n if (par[x] == x) return x;\\n return par[x] = root(par[x]);\\n }\\n \\n void unite(int x, int y) { // xとyの木を併合\\n int rx = root(x); //xの根をrx\\n int ry = root(y); //yの根をry\\n if (rx == ry) return; //xとyの根が同じ(=同じ木にある)時はそのまま\\n par[rx] = ry; //xとyの根が同じでない(=同じ木にない)時：xの根rxをyの根ryにつける\\n }\\n \\n bool same(int x, int y) { // 2つのデータx, yが属する木が同じならtrueを返す\\n int rx = root(x);\\n int ry = root(y);\\n return rx == ry;\\n }\\n};\\n\\nvoid solve() {\\n}\\n\\nint main() {\\n while(1) {\\n int N; cin >> N;\\n if(N == 0) break;\\n vi A(N); rep(i,0,N) cin >> A[i];\\n vvi dp(N+1, vi(N+1, 0));\\n REP(k,2,N) {\\n REP(l,0,N-k) {\\n int r = l+k;\\n rep(i,l+1,r) chmax(dp[l][r], dp[l][i]+dp[i][r]);\\n if(abs(A[l]-A[r-1]) <= 1 and dp[l+1][r-1] == r-l-2) dp[l][r] = r-l;\\n }\\n }\\n cout << dp[0][N] << \\\"\\\\n\\\";\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 3768,\n \"score_of_the_acc\": -0.4995,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1611_10875922\",\n \"code_snippet\": \"// #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\\n#include<bits/stdc++.h>\\nusing namespace std;\\n\\n#include<complex>\\n//#include <ext/pb_ds/tree_policy.hpp>\\n//#include <ext/pb_ds/assoc_container.hpp>\\n\\n#define x() real()\\n#define y() imag()\\n#define endl '\\\\n'\\n#define ll long long\\ntypedef long double T;\\ntypedef complex<T> point;\\n#define pii pair<int,int>\\n#define all(x) x.begin(),x.end()\\n#define fastIO cin.tie(0)->sync_with_stdio(0);\\n\\n//using namespace __gnu_pbds;\\n//template <typename T> using o_set = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;\\n\\n//If you can't solve a problem then there's an easier\\n//sub-problem that you can not solve.Find it!!\\n\\nconst int N = 310;\\nint a[N] , can[N][N] , dp[N][N];\\n\\nint main()\\n{\\n fastIO;\\n\\n //int t = 1; cin >> t;\\n\\n while (1)\\n {\\n int n; cin >> n;\\n if (n == 0) break;\\n\\n memset(can , 0 , sizeof can);\\n memset(dp , 0 , sizeof dp);\\n\\n for (int i = 1 ; i <= n ; i++) cin >> a[i];\\n\\n for (int len = 2 ; len <= n ; len += 2)\\n {\\n for (int i = 1 ; i + len - 1 <= n ; i++)\\n {\\n int lim = i + len - 1;\\n\\n for (int j = i + 1 ; j <= lim ; j++)\\n {\\n if (abs(a[i] - a[j]) > 1) continue;\\n\\n bool left = (j == i + 1) || can[i + 1][j - 1];\\n bool right = (j + 1 > lim) || can[j + 1][lim];\\n\\n if (left && right)\\n can[i][lim] |= 1;\\n }\\n }\\n }\\n\\n int ans = 0;\\n\\n for (int len = 2 ; len <= n ; len++)\\n {\\n for (int i = 1 ; i + len - 1 <= n ; i++)\\n {\\n int j = i + len - 1;\\n\\n if (can[i][j])\\n {\\n dp[i][j] = j - i + 1;\\n ans = max(ans , dp[i][j]);\\n continue;\\n }\\n\\n for (int k = i ; k < j ; k++)\\n dp[i][j] = max(dp[i][j] , dp[i][k] + dp[k + 1][j]);\\n\\n ans = max(ans , dp[i][j]);\\n }\\n }\\n\\n cout << ans << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 220,\n \"memory_kb\": 4120,\n \"score_of_the_acc\": -1.0389,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1611_10875921\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n\\n while (true) {\\n int n;\\n if (!(cin >> n)) break;\\n if (n == 0) break;\\n\\n vector<int> w(n);\\n for (int i = 0; i < n; i++) cin >> w[i];\\n\\n vector<vector<bool>> can(n, vector<bool>(n, false));\\n vector<vector<int>> dp(n, vector<int>(n, 0));\\n\\n for (int len = 2; len <= n; len++) {\\n for (int l = 0; l + len - 1 < n; l++) {\\n int r = l + len - 1;\\n\\n if (len % 2 == 0) {\\n for (int m = l + 1; m <= r; m++) {\\n if (abs(w[l] - w[m]) <= 1) {\\n bool left_ok = (m == l + 1) || can[l + 1][m - 1];\\n bool right_ok = (m == r) || can[m + 1][r];\\n if (left_ok && right_ok) {\\n can[l][r] = true;\\n break;\\n }\\n }\\n }\\n }\\n\\n int best = can[l][r] ? len : 0;\\n for (int k = l; k < r; k++) {\\n best = max(best, dp[l][k] + dp[k + 1][r]);\\n }\\n dp[l][r] = best;\\n }\\n }\\n\\n cout << dp[0][n - 1] << \\\"\\\\n\\\";\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 3532,\n \"score_of_the_acc\": -0.1919,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1611_10869963\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint main() {\\n int n;\\n while(cin >> n){\\n if(n==0){\\n return 0;\\n }\\n\\n vector<int> w(n);\\n for(int i=0; i<n; i++){\\n cin >> w[i];\\n }\\n\\n vector<vector<int>> dp(n, vector<int>(n,0));\\n for(int leng=2; leng<=n; leng++){\\n for(int i=0; i<n-leng+1; i++){\\n int j=i+leng-1;\\n \\n if(dp[i+1][j-1]==j-i-1 && abs(w[i]-w[j])<=1){\\n dp[i][j]=j-i+1;\\n continue;\\n }\\n \\n for(int k=i; k<j; k++){\\n dp[i][j]=max(dp[i][j],dp[i][k]+dp[k+1][j]);\\n }\\n }\\n }\\n\\n cout << dp[0][n-1] << '\\\\n';\\n\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 3792,\n \"score_of_the_acc\": -0.4722,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1611_10866801\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nint main() {\\n vector<int> res_list;\\n while (true) {\\n int n; cin >> n;\\n if (n == 0) break;\\n vector<int> W(n);\\n for (int i = 0; i < n; ++i) cin >> W[i];\\n\\n vector<vector<int>> dp(n, vector<int>(n,INT_MAX));\\n for (int i = 0; i < n; ++i) dp[i][i] = 1;\\n for (int l = 2; l <= n; ++l) {\\n for (int i = 0; i < n - l + 1; ++i) {\\n int j = i + l - 1;\\n if (l == 2) {\\n if (abs(W[i] - W[j]) <= 1) dp[i][j] = 0;\\n else dp[i][j] = 2;\\n continue;\\n }\\n if (abs(W[i] - W[j]) <= 1 && dp[i + 1][j - 1] == 0) {\\n dp[i][j] = 0;\\n continue;\\n }\\n for (int k = i; k < j; ++k) {\\n dp[i][j] = min(dp[i][j], dp[i][k] + dp[k + 1][j]);\\n } \\n }\\n }\\n\\n res_list.push_back(n - dp[0][n-1]);\\n }\\n for (int res: res_list) cout << res << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 3468,\n \"score_of_the_acc\": -0.0424,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1611_10864647\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll=long long;\\nusing pii=pair<int,int>;\\n#define rep(a,b,c) for(int a=b;a<c;a++)\\n#define rep1(a,b,c) for(int a=b;a>=c;a--)\\n#define vc vector\\n#define pbk push_back\\n#define ebk emplace_back\\n#define fst first\\n#define snd second\\n#define sz(a) (int)a.size()\\n#define out(a,b,c,d,e) cout << a << \\\" \\\" << b << \\\" \\\" << c << \\\" \\\" << d << \\\" \\\" << e << endl\\n\\nvoid chmax(int &a,int b){a=max(a,b);return;}\\n\\nsigned main() {\\n\\tint n;\\n\\twhile(true){\\n\\t\\tcin >> n;\\n\\t\\tif(n==0) return 0;\\n\\t\\tvc<int> w(n);\\n\\t\\trep(i,0,n) cin >> w[i];\\n\\n\\t\\tvc dp(n,vc<int>(n+1,-1));\\n\\n\\t\\tauto dfs=[&](auto dfs,int s,int t)->int{\\n\\t\\t\\tif(dp[s][t]!=-1) return dp[s][t];\\n\\t\\t\\tif(t-s==1) return dp[s][t]=0;\\n\\t\\t\\tif(t-s==2){\\n\\t\\t\\t\\tif(abs(w[s]-w[t-1])<=1) return dp[s][t]=2;\\n\\t\\t\\t\\telse return dp[s][t]=0;\\n\\t\\t\\t}\\n\\t\\t\\tint tmp=0;\\n\\t\\t\\tif(abs(w[s]-w[t-1])<=1 && dfs(dfs,s+1,t-1)==t-s-2){\\n\\t\\t\\t\\treturn dp[s][t]=t-s;\\n\\t\\t\\t}\\n\\t\\t\\trep(i,s+1,t){\\n\\t\\t\\t\\tchmax(tmp,dfs(dfs,s,i)+dfs(dfs,i,t));\\n\\t\\t\\t}\\n\\t\\t\\treturn dp[s][t]=tmp;\\n\\t\\t};\\n\\n\\t\\tint ans=dfs(dfs,0,n);\\n\\t\\tcout << ans << endl;\\n\\n\\t}\\n\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 790,\n \"memory_kb\": 3840,\n \"score_of_the_acc\": -1.2258,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1611_10856891\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define FOR(i,s,t) for(int i = s; i<t ; i++)\\n#define SZ(x) (int)x.size()\\n#define ALL(x) x.begin(), x.end()\\n\\nusing namespace std;\\n\\nusing VI = vector<int>;\\nusing LL = long long;\\nusing VL = vector<LL>;\\nusing VVI = vector<VI>;\\n\\n\\nint main() {\\n\\tint N;\\n\\twhile (cin >> N, N) {\\n\\t\\tVI a(N);\\n\\t\\tFOR(i, 0, N) {\\n\\t\\t\\tscanf(\\\"%d\\\", &a[i]);\\n\\t\\t}\\n\\t\\tVVI checkdp(N + 1, VI(N + 1, 0));\\n\\t\\tVVI dp(N + 1, VI(N + 1, 0));\\n\\t\\tint ans = 0;\\n\\n\\t\\tFOR(alen, 2, N + 1) {\\n\\t\\t\\tFOR(i, 0, N) {\\n\\t\\t\\t\\tint j = alen + i - 1;\\n\\t\\t\\t\\tif (j >= N) continue;\\n\\t\\t\\t\\tif (dp[i + 1][j - 1] == alen - 2 && abs(a[i] - a[j]) <= 1) dp[i][j] = alen;\\n\\t\\t\\t\\tFOR(k, i, j) {\\n\\t\\t\\t\\t\\tdp[i][j] = max(dp[i][j], dp[i][k] + dp[k + 1][j]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << dp[0][N - 1] << endl;\\n\\t\\t//\\n\\n\\n\\n\\t\\t//FOR(i, 0, N - 1) {\\n\\t\\t//\\tif (abs(a[i] - a[i + 1]) <= 1) {\\n\\t\\t//\\t\\tcheckdp[i][i + 1] = 1;\\n\\t\\t//\\t\\tdp[i][i + 1] = 2;\\n\\t\\t//\\t\\tans = 2;\\n\\t\\t//\\t}\\n\\t\\t//}\\n\\n\\t\\t//for (int alen = 4; alen <= N; alen += 2) {// 長さalenを合成\\n\\t\\t//\\tfor (int s = 0; s < N; s++) {\\n\\t\\t//\\t\\tfor (int spl = s + 1; spl <= N; spl++) {\\n\\t\\t//\\t\\t\\tint end = alen + s - 1;\\n\\t\\t//\\t\\t\\t// checkdp[s][spl], checkdp[spl + 1][end] merge;\\n\\t\\t//\\t\\t\\t// あとで境界処理をすること\\n\\t\\t//\\t\\t\\tif (s < end &&spl < end&& end < N) {// cond\\n\\t\\t//\\t\\t\\t\\tif (checkdp[s][spl] && checkdp[spl + 1][end]) {\\n\\t\\t//\\t\\t\\t\\t\\tcheckdp[s][end] = 1;\\n\\t\\t//\\t\\t\\t\\t\\tdp[s][end] = alen;\\n\\t\\t//\\t\\t\\t\\t\\tans = max(ans, alen);\\n\\t\\t//\\t\\t\\t\\t}\\n\\t\\t//\\t\\t\\t\\tif (abs(a[s] - a[end]) <= 1 && checkdp[s + 1][spl] && checkdp[spl + 1][end - 1]) {\\n\\t\\t//\\t\\t\\t\\t\\tcheckdp[s][end] = 1;\\n\\t\\t//\\t\\t\\t\\t\\tdp[s][end] = alen;\\n\\t\\t//\\t\\t\\t\\t\\tans = max(ans, alen);\\n\\t\\t//\\t\\t\\t\\t}\\n\\n\\t\\t//\\t\\t\\t\\tif (abs(a[s] - a[end]) <= 1 && checkdp[s + 1][end - 1]) {\\n\\n\\t\\t//\\t\\t\\t\\t\\tcheckdp[s][end] = 1;\\n\\t\\t//\\t\\t\\t\\t\\tdp[s][end] = alen;\\n\\t\\t//\\t\\t\\t\\t\\tans = max(ans, alen);\\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//}\\n\\t\\t////cout << \\\"PREANS\\\" << ans << endl;\\n\\t\\t////int ss, tt;\\n\\t\\t////while (cin >> ss >> tt) {\\n\\t\\t////\\tcout << \\\"(s:\\\" << ss << \\\",t\\\" << tt << \\\"):\\\" << checkdp[ss][tt] << endl;\\n\\t\\t////}\\n\\t\\t//// くくりはmergeできたので、O XM O みたいなのを合成する\\n\\n\\t\\t//// max / + \\n\\n\\t\\t//for (int alen = 4; alen <= N; alen++) {// 長さalenを合成\\n\\t\\t//\\tfor (int s = 0; s < N; s++) {\\n\\t\\t//\\t\\tfor (int spl = s + 1; spl <= N; spl++) {\\n\\t\\t//\\t\\t\\tint end = alen + s - 1;\\n\\t\\t//\\t\\t\\t// checkdp[s][spl], checkdp[spl + 1][end] merge;\\n\\t\\t//\\t\\t\\t// あとで境界処理をすること\\n\\t\\t//\\t\\t\\tif (s < end &&spl < end&& end < N) {// cond\\n\\n\\n\\t\\t//\\t\\t\\t\\tdp[s][end] = max({ dp[s][end],dp[s][spl] + dp[spl + 1][end] });\\n\\t\\t//\\t\\t\\t\\tans = max(ans, dp[s][end]);\\n\\t\\t//\\t\\t\\t\\t/*if (checkdp[s][spl] && checkdp[spl + 1][end]) {\\n\\t\\t//\\t\\t\\t\\t\\tcheckdp[s][end] = 1;\\n\\t\\t//\\t\\t\\t\\t\\tdp[s][end] = alen;\\n\\t\\t//\\t\\t\\t\\t\\tans = max(ans, alen);\\n\\t\\t//\\t\\t\\t\\t}\\n\\t\\t//\\t\\t\\t\\tif (abs(a[s] - a[end]) <= 1 && checkdp[s + 1][spl] && checkdp[spl + 1][end - 1]) {\\n\\t\\t//\\t\\t\\t\\t\\tcheckdp[s][end] = 1;\\n\\t\\t//\\t\\t\\t\\t\\tdp[s][end] = alen;\\n\\t\\t//\\t\\t\\t\\t\\tans = max(ans, alen);\\n\\t\\t//\\t\\t\\t\\t}\\n\\n\\t\\t//\\t\\t\\t\\tif (abs(a[s] - a[end]) <= 1 && checkdp[s + 1][end - 1]) {\\n\\n\\t\\t//\\t\\t\\t\\t\\tcheckdp[s][end] = 1;\\n\\t\\t//\\t\\t\\t\\t\\tdp[s][end] = alen;\\n\\t\\t//\\t\\t\\t\\t\\tans = max(ans, alen);\\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//}\\n\\n\\t\\t//cout << ans << endl;\\n\\n\\t}\\n\\n\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 4172,\n \"score_of_the_acc\": -1.0101,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1611_10854239\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nint main() {\\n vector<int> res_list;\\n while (true) {\\n int n; cin >> n;\\n if (n == 0) break;\\n vector<int> W(n);\\n for (int i = 0; i < n; ++i) cin >> W[i];\\n\\n vector<vector<int>> dp(n, vector<int>(n, 0));\\n for (int l = 2; l <= n; ++l) {\\n for (int i = 0; i < n - l + 1; ++i) {\\n int j = i + l - 1;\\n if (abs(W[i] - W[j]) < 2 && dp[i + 1][j - 1] == l - 2) dp[i][j] = l; \\n for (int k = i; k < j; ++k) {\\n dp[i][j] = max(dp[i][j], dp[i][k] + dp[k+1][j]);\\n }\\n }\\n }\\n\\n res_list.push_back(dp[0][n-1]);\\n }\\n\\n for (int res: res_list) cout << res << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 3452,\n \"score_of_the_acc\": -0.0202,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1611_10853208\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define FOR(i,a,b) for(int (i)=(a);(i)<(b);(i)++)\\n#define REP(i,n) FOR(i,0,(n))\\n\\ntypedef long long ll;\\n\\nconst int M=10000000;\\nint dp[400][400];\\n\\nvector<int>wass;\\nbool ok(int a, int b){\\n return abs(wass[a]-wass[b])<=1;\\n}\\nint solve(int l,int r){\\n if(dp[l][r]!=-1)return dp[l][r];\\n if(l==r)return dp[l][r]=0;\\n else if(l==r+1)return dp[l][r]=0;\\n else{\\n int ans=0;\\n for(int p=l+1;p<r;++p){\\n ans=max(ans,solve(l,p)+solve(p,r));\\n }\\n if(ok(l,r-1)){\\n if(solve(l+1,r-1)==r-l-2){\\n ans=r-l;\\n }\\n }\\n return dp[l][r]=ans;\\n }\\n}\\nint main()\\n{\\n while(true){\\n for(int i=0;i<400;++i){\\n for(int j=0;j<400;++j){\\n dp[i][j]=-1;\\n }\\n }\\n int N;cin>>N;\\n if(!N)break;\\n wass.assign(N,0);\\n\\n for(int i=0;i<N;++i){\\n cin>>wass[i];\\n }\\n int ans=solve(0,N);\\n cout<<ans<<endl;\\n }\\n \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 800,\n \"memory_kb\": 4000,\n \"score_of_the_acc\": -1.4581,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1611_10829050\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint dp[309][309];\\n\\nint main() {\\n while(true){\\n int N;\\n cin >> N;\\n if(N == 0){\\n return 0;\\n }\\n vector<int> weight(N);\\n for(int i = 0; i < N; i++){\\n cin >> weight[i];\\n }\\n for(int i = 0; i < N+2; i++){\\n for(int j = 0; j < N+2; j++){\\n dp[i][j] = 0;\\n }\\n }\\n for(int i = 0; i < N; i++){\\n dp[i][i+1] = 0;\\n }\\n\\n for(int W = 2; W <= N; W++){\\n for(int L = 0; L + W <= N; L++){\\n int R = L + W;\\n\\n if(dp[L+1][R-1] == W-2 && abs(weight[L] - weight[R-1]) <= 1){\\n dp[L][R] = W;\\n }\\n\\n for(int i = L; i <= R; i++){\\n dp[L][R] = max(dp[L][R], dp[L][i] + dp[i][R]);\\n }\\n }\\n }\\n cout << dp[0][N] << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 3808,\n \"score_of_the_acc\": -0.4944,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1611_10781360\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\nusing ll = long long;\\nusing Graph = vector<vector<int>>;\\nconst int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};\\nconst int dy[8] = {0, 1, 0, -1, 1, -1, 1, -1};\\n\\n#define rep(i, a, b) for(int i = a; i < b; i++)\\n#define all(v) v.begin(), v.end()\\n#define YESNO(flag) cout << (flag ? \\\"Yes\\\" : \\\"No\\\") << \\\"\\\\n\\\"\\n#define inf 1070000000\\n#define INF 4500000000000000000\\n#define MOD 998244353\\n//#define MOD 1000000007\\n#define pi 3.14159265358979\\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\\n//xのn乗\\nll llpow(ll x, ll n) {\\n ll ans = 1;\\n while(n > 0) {\\n if(n & 1) ans *= x;\\n x *= x;\\n n >>= 1; \\n }\\n return ans;\\n}\\nll modpow(ll x, ll n, ll mod) {\\n ll ans = 1;\\n while(n > 0) {\\n if(n & 1) ans = ans * x % mod;\\n x = x * x % mod;\\n n >>= 1;\\n }\\n return ans;\\n}\\n//nの階乗\\nll fact(ll n) {\\n if(n == 0) return 1;\\n else return n * fact(n-1);\\n}\\n//素数判定\\nbool is_prime(long long x) {\\n if(x == 1) return false;\\n \\n for(long long i = 2; i*i <= x; i++) {\\n if(x % i == 0) return false;\\n }\\n return true;\\n}\\n\\n//座標圧縮\\nvector<int> compress(vector<int> A) {\\n vector<int> B = A;\\n\\n sort(B.begin(), B.end());\\n B.erase(unique(B.begin(), B.end()), B.end());\\n\\n vector<int> res(A.size());\\n for(int i = 0; i < (int)A.size(); i++) {\\n res[i] = lower_bound(B.begin(), B.end(), A[i]) - B.begin();\\n }\\n return res;\\n}\\n\\n//正方形グリッドの右回転\\nvoid rotate_right(vector<vector<char>> &S) {\\n int N = S.size();\\n auto T = S;\\n rep(i,0,N) rep(j,0,N) {\\n T[i][j] = S[N-1-j][i];\\n }\\n S = T;\\n}\\n//左回転\\nvoid rotate_left(vector<vector<char>> &S) {\\n int N = S.size();\\n auto T = S;\\n rep(i,0,N) rep(j,0,N) {\\n T[i][j] = S[j][N-1-i];\\n }\\n S = T;\\n}\\n\\n//2点(a,b)と(x,y)の距離\\ndouble dist(ll a, ll b, ll x, ll y) {\\n return sqrt((a-x)*(a-x) + (b-y)*(b-y));\\n}\\nint man(int a, int b, int x, int y) {\\n return abs(a-x) + abs(b-y);\\n}\\n\\n//桁数\\nint digit(ll N) {\\n if(N <= 9) return 1;\\n\\n return 1 + digit(N / 10);\\n}\\n//A進数文字列NをB進数に変換. A,Bは10以下\\nstring base_change(string N, ll A, ll B) {\\n ll X = stoll(N), Y = 0;\\n\\n ll i = 1;\\n while(X != 0) {\\n Y += (X % 10) * i;\\n i *= A;\\n X /= 10;\\n }\\n\\n X = Y, Y = 0;\\n i = 1;\\n while(X != 0) {\\n Y += (X % B) * i;\\n i *= 10;\\n X /= B;\\n }\\n\\n return to_string(Y);\\n}\\n//回文判定\\nbool palin(string S) {\\n rep(i,0,S.size()) {\\n if(S[i] != S[S.size()-1-i]) return false;\\n }\\n return true;\\n}\\n\\n\\n//DFS\\nvoid dfs(const Graph &G, int v, vector<bool> &seen) { \\n seen[v] = true;\\n \\n for (auto next_v : G[v]) { \\n if (!seen[next_v]) {\\n dfs(G, next_v, seen);\\n }\\n }\\n}\\nvoid griddfs(const vector<vector<char>> &G, int x, int y, vector<vector<bool>> &seen) {\\n int H = G.size(), W = G[0].size();\\n seen[x][y] = true;\\n \\n for (int i = 0; i < 8; i++) { \\n int nx = x + dx[i], ny = y + dy[i];\\n if(nx < 0 or nx >= H or ny < 0 or ny >= W) continue;\\n if (!seen[nx][ny] and G[nx][ny] != '#') griddfs(G, nx, ny, seen);\\n }\\n}\\n//BFS\\nvoid bfs(const Graph &G, int v, vector<int> &dist) {\\n rep(i,0,dist.size()) dist[i] = inf;\\n dist[v] = 0;\\n queue<int> q;\\n q.push(v);\\n while(!q.empty()) {\\n int u = q.front();\\n q.pop();\\n for(auto next_u : G[u]) {\\n if(dist[next_u] == inf) {\\n dist[next_u] = dist[u] + 1;\\n q.push(next_u);\\n }\\n }\\n }\\n}\\nvoid gridbfs(const vector<vector<char>> &G, int x, int y, vector<vector<int>> &dist) {\\n int H = G.size(), W = G[0].size();\\n rep(i,0,H) rep(j,0,W) dist[i][j] = inf;\\n dist[x][y] = 0;\\n queue<pair<int, int>> q;\\n q.push(make_pair(x, y));\\n while(!q.empty()) {\\n int x = q.front().first, y = q.front().second;\\n q.pop();\\n for(int i = 0; i < 4; i++) {\\n int nx = x + dx[i], ny = y + dy[i];\\n if(nx < 0 or nx >= H or ny < 0 or ny >= W) continue;\\n if(dist[nx][ny] == inf and G[nx][ny] != '#') {\\n dist[nx][ny] = dist[x][y] + 1;\\n q.push(make_pair(nx, ny));\\n }\\n }\\n }\\n}\\n//ワーシャル・フロイド\\nvoid floyd(vector<vector<ll>> &G) {\\n int N = G.size();\\n for (int k = 0; k < N; k++){\\n for (int i = 0; i < N; i++) {\\n for (int j = 0; j < N; j++) {\\n if(G[i][j] > G[i][k] + G[k][j]) {\\n G[i][j] = G[i][k] + G[k][j];\\n }\\n }\\n }\\n }\\n}\\n\\nvoid solve() {\\n}\\n\\nint main() {\\n while(1) {\\n int N; cin >> N;\\n if(N == 0) break;\\n vector<int> A(N); rep(i,0,N) cin >> A[i];\\n vector<vector<int>> dp(N+1, vector<int>(N+1, 0));\\n\\n rep(i,0,N) dp[i][i+1] = 0;\\n rep(W, 2, N+1) {\\n rep(l,0,N) {\\n int r = l + W;\\n if(r > N) continue;\\n\\n if(abs(A[l] - A[r-1]) <= 1 and dp[l+1][r-1] == r-l-2) dp[l][r] = r-l;\\n\\n rep(mid,l+1,r) {\\n chmax(dp[l][r], dp[l][mid] + dp[mid][r]);\\n }\\n }\\n }\\n\\n cout << dp[0][N] << \\\"\\\\n\\\";\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 3872,\n \"score_of_the_acc\": -0.654,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1611_10769044\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <string>\\n#include <algorithm>\\n#include <cmath>\\n#include <numeric>\\n#include <iomanip>\\n#include <map>\\n#include <queue>\\n#include <set>\\n#include <bitset>\\n#include <stack>\\n#include <list>\\n#include <unordered_set>\\n#include <unordered_map>\\n#define rep(i, a, b) for (int i = a; i < b; ++i)\\nusing namespace std;\\n\\nconst int MOD = 998244353;\\nconst int mod = 1000000007;\\n\\nconst long long INF = 1LL << 60;\\nconstexpr double pi = 3.141592653589793238462643383279502884L;\\n\\nstruct Edge {\\n int to;\\n long long w;\\n Edge(int to, long long w) : to(to), w(w) {}\\n};\\n\\nusing Graph = vector<vector<Edge>>;\\nusing P = pair<int, int>;\\nusing Pll = pair<long long, int>;\\nusing ll = long long;\\n\\ntemplate<class T> bool chmin(T& a, T b) { if (a > b) { a = b; return true; } else return false; }\\ntemplate<class T> bool chmax(T& a, T b) { if (a < b) { a = b; return true; } else return false; }\\n\\nvector<vector<int>> dp;\\n\\nint rec(int l, int r, const vector<int> &w) {\\n // 計算済みの時はその値を返す\\n if (dp[l][r] != -1) return dp[l][r];\\n\\n // 一個のみの時は取り除けないので取り除かない，つまり0を返す\\n if (abs(l - r) <= 1) return 0;\\n\\n int res = 0;\\n // 区間[l, r)を計算する\\n // パターン1: [l, r)までの区間が全部取り除けるとき\\n // その中身がすべて1以下で構成されているとき取り除けることになる\\n if (abs(w[l] - w[r-1]) <= 1 && rec(l+1, r-1, w) == r - l - 2) {\\n // [l, r)を取り除く\\n res = r - l;\\n }\\n\\n // パターン2: 全部取り除かず，区間内でぼちぼち取り除く\\n for (int i = l+1; i <= r-1; ++i) {\\n // 左側部分での最適な取り除き方をしたときの取り除き個数\\n // と右側部分での最適な取り除き方をしたときの取り除き個数\\n // を合わせれば今回の[l, r)の最適な取り出し方が得られる\\n res = max(res, rec(l, i, w) + rec(i, r, w));\\n }\\n\\n // メモ化再帰\\n return dp[l][r] = res;\\n}\\n\\nint main() {\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n\\n while (true) {\\n int n; cin >> n;\\n if (n == 0) break;\\n\\n vector<int> w(n);\\n for (int i = 0; i < n; ++i) {\\n cin >> w[i];\\n }\\n\\n dp.assign(n+1, vector<int>(n+1, -1));\\n cout << rec(0, n, w) << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 700,\n \"memory_kb\": 3840,\n \"score_of_the_acc\": -1.1348,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1611_10750034\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <iomanip>\\n#include <algorithm>\\n#include <tuple>\\n#include <set>\\n#include <map>\\n#include <bitset>\\n#include <cmath>\\n#include <deque>\\n#include <queue>\\n#include <stack>\\n#include <cassert>\\n#include <unordered_set>\\n#include <unordered_map>\\n#include <cmath>\\nusing namespace std;\\ntypedef long long ll;\\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\\n#define all(v) v.begin(), v.end()\\n\\nll llpow(ll a, ll t)\\n{\\n ll res = 1;\\n rep(i, t) res *= a;\\n return res;\\n}\\n\\nll inf = std::numeric_limits<ll>::max();\\n\\nint main()\\n{\\n vector<ll> ans;\\n while (true)\\n {\\n ll n;\\n cin >> n;\\n if (!n)\\n {\\n break;\\n }\\n vector<ll> vec(n);\\n rep(i, n)\\n {\\n cin >> vec[i];\\n }\\n // lrで取り除ける最大\\n vector<vector<ll>> dp(n, vector<ll>(n, 0));\\n rep(i, n) // diff\\n {\\n rep(j, n) // left\\n {\\n if (!i)\\n {\\n continue;\\n }\\n if (i + j > n - 1)\\n {\\n continue;\\n }\\n if (i == 1)\\n {\\n if (abs(vec[j] - vec[j + i]) <= 1)\\n {\\n dp[j][j + i] = 2;\\n }\\n continue;\\n }\\n if (dp[j + 1][j + i - 1] == i - 1 && abs(vec[j] - vec[j + i]) <= 1)\\n {\\n dp[j][j + i] = i + 1;\\n continue;\\n }\\n rep(k, i)\\n {\\n dp[j][j + i] = max(dp[j][j + i], dp[j][j + k] + dp[j + k + 1][j + i]);\\n }\\n }\\n }\\n // cout << dp[0][3] << endl;\\n ans.push_back(dp[0][n - 1]);\\n }\\n for (auto num : ans)\\n {\\n cout << num << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 3896,\n \"score_of_the_acc\": -0.6571,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1611_10743637\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing P = pair<int, int>;\\n#define chmin(x, y) x = min(x, y)\\n#define chmax(x, y) x = max(x, y)\\n\\nint inf = 10010010;\\n\\nint main()\\n{\\n while (true)\\n {\\n int n;\\n cin >> n;\\n if (n == 0)\\n break;\\n vector<int> w;\\n for (int i = 0; i < n; ++i)\\n {\\n int a;\\n cin >> a;\\n w.push_back(a);\\n }\\n vector<vector<int>> dp(n + 5, vector<int>(n + 5, 0));\\n for (int i = 0; i < n - 1; ++i)\\n {\\n if (abs(w[i] - w[i + 1]) <= 1)\\n {\\n dp[i][i + 1] = 2;\\n }\\n }\\n for (int i = 0; i < n; ++i)\\n {\\n for (int j = 0; j < n; ++j)\\n {\\n int start = j;\\n int end = i + j;\\n if (end >= n)\\n break;\\n for (int k = 1; k < i; ++k)\\n {\\n if (dp[start][start + k] != 0 && dp[start + k + 1][end])\\n {\\n dp[start][end] = max(\\n dp[start][end], dp[start][start + k] + dp[start + k + 1][end]);\\n }\\n }\\n if (dp\\n [start + 1][end - 1] != 0 &&\\n abs(w[start] - w[end]) <= 1)\\n {\\n dp[start][end] = max(dp[start][end], dp[start + 1][end - 1] + 2);\\n }\\n }\\n }\\n for (int i = 0; i < n; ++i)\\n {\\n for (int j = 0; j < n; ++j)\\n {\\n int start = j;\\n int end = i + j;\\n if (end >= n)\\n break;\\n for (int k = 0; k < i; ++k)\\n {\\n dp[start][end] = max(\\n dp[start][end], dp[start][start + k] + dp[start + k + 1][end]);\\n }\\n }\\n }\\n cout << dp[0][n - 1] << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 260,\n \"memory_kb\": 3708,\n \"score_of_the_acc\": -0.5071,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1611_10743627\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing P = pair<int, int>;\\n#define chmin(x, y) x = min(x, y)\\n#define chmax(x, y) x = max(x, y)\\n\\nint inf = 10010010;\\n\\nint main()\\n{\\n while (true)\\n {\\n int n;\\n cin >> n;\\n if (n == 0)\\n break;\\n vector<int> w;\\n for (int i = 0; i < n; ++i)\\n {\\n int a;\\n cin >> a;\\n w.push_back(a);\\n }\\n vector<vector<int>> dp(n + 5, vector<int>(n + 5, 0));\\n for (int i = 0; i < n - 1; ++i)\\n {\\n if (abs(w[i] - w[i + 1]) <= 1)\\n {\\n dp[i][i + 1] = 2;\\n }\\n }\\n for (int i = 0; i < n; ++i)\\n {\\n for (int j = 0; j < n; ++j)\\n {\\n int start = j;\\n int end = i + j;\\n if (end >= n)\\n break;\\n for (int k = 0; k < i; ++k)\\n {\\n if (dp[start][start + k] != 0 && dp[start + k + 1][end])\\n {\\n dp[start][end] = max(\\n dp[start][end], dp[start][start + k] + dp[start + k + 1][end]);\\n }\\n }\\n if (dp\\n [start + 1][end - 1] != 0 &&\\n abs(w[start] - w[end]) <= 1)\\n {\\n dp[start][end] = max(dp[start][end], dp[start + 1][end - 1] + 2);\\n }\\n }\\n }\\n for (int i = 0; i < n; ++i)\\n {\\n for (int j = 0; j < n; ++j)\\n {\\n int start = j;\\n int end = i + j;\\n if (end >= n)\\n break;\\n for (int k = 0; k < i; ++k)\\n {\\n dp[start][end] = max(\\n dp[start][end], dp[start][start + k] + dp[start + k + 1][end]);\\n }\\n }\\n }\\n cout << dp[0][n - 1] << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 260,\n \"memory_kb\": 3736,\n \"score_of_the_acc\": -0.546,\n \"final_rank\": 9\n }\n]","isConversational":false}}},{"rowIdx":986,"cells":{"group_id":{"kind":"string","value":"aoj_1605_cpp"},"problem_description":{"kind":"string","value":"Bridge Construction Planning\nThere is a city consisting of many small islands, and the citizens live in these islands.\nCitizens feel inconvenience in requiring ferry rides between these islands.\nThe city mayor decided to build bridges connecting all the islands.\nThe city has two construction companies, A and B.\nThe mayor requested these companies for proposals, and obtained proposals in the form:\n\"Company A (or B) can build a bridge between islands\nu\nand\nv\nin\nw\nhundred million yen.\"\nThe mayor wants to accept some of these proposals to make a plan with the lowest budget.\nHowever, if the mayor accepts too many proposals of one company,\nthe other may go bankrupt, which is not desirable for the city with only two construction companies.\nHowever, on the other hand, to avoid criticism on wasteful construction,\nthe mayor can only accept the minimum number (i.e.,\nn\n− 1) of bridges for connecting all the islands.\nThus, the mayor made a decision that exactly\nk\nproposals by the company A\nand exactly\nn\n− 1 −\nk\nproposals by the company B should be accepted.\nYour task is to write a program that computes the cost of the plan with the lowest budget that satisfies the constraints.\nHere, the cost of a plan means the sum of all the costs mentioned in the accepted proposals.\nInput\nThe input consists of multiple datasets.\nThe number of datasets is at most 30.\nEach dataset is in the following format.\nn\nm\nk\nu\n1\nv\n1\nw\n1\nl\n1\n...\nu\nm\nv\nm\nw\nm\nl\nm\nThe first line contains three integers\nn\n,\nm\n, and\nk\n, where\nn\nis the number of islands,\nm\nis the total number of proposals,\n and\nk\nis the number of proposals that are to be ordered to company A\n(2 ≤\nn\n≤ 200, 1 ≤\nm\n≤ 600, and 0 ≤\nk\n≤\nn\n−1).\nIslands are identified by integers, 1 through\nn\n.\nThe following\nm\nlines denote the proposals each of which is described with three integers\nu\ni\n,\nv\ni\n,\nw\ni\nand one character\nl\ni\n,\nwhere\nu\ni\nand\nv\ni\ndenote two bridged islands,\nw\ni\nis the cost of the bridge (in hundred million yen),\nand\nl\ni\nis the name of the company that submits this proposal\n(1 ≤\nu\ni\n≤\nn\n, 1 ≤\nv\ni\n≤\nn\n, 1 ≤\nw\ni\n≤ 100, and\nl\ni\n= 'A' or 'B').\nYou can assume that each bridge connects distinct islands, i.e.,\nu\ni\n≠\nv\ni\n,\nand each company gives at most one proposal for each pair of islands, i.e., {\nu\ni\n,\nv\ni\n} ≠ {\nu\nj\n,\nv\nj\n} if\ni\n≠\nj\nand\nl\ni\n=\nl\nj\n.\nThe end of the input is indicated by a line with three zeros separated by single spaces.\nOutput\nFor each dataset, output a single line containing a single integer that \ndenotes the cost (in hundred million yen) of the plan with the lowest \nbudget.\nIf there are no plans that satisfy the constraints, output −1.\nSample Input\n4 5 2\n1 2 2 A\n1 3 2 A\n1 4 2 A\n2 3 1 B\n3 4 1 B\n5 8 2\n1 2 1 A\n2 3 1 A\n3 4 3 A\n4 5 3 A\n1 2 5 B\n2 3 5 B\n3 4 8 B\n4 5 8 B\n5 5 1\n1 2 1 A\n2 3 1 A\n3 4 1 A\n4 5 1 B\n3 5 1 B\n4 5 3\n1 2 2 A\n2 4 3 B\n3 4 4 B\n2 3 5 A\n3 1 6 A\n0 0 0\nOutput for the Sample Input\n5\n16\n-1\n-1"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1605_10719736","code_snippet":"/*\n\nhttps://hitonanode.github.io/cplib-cpp/combinatorial_opt/test/matroid_intersection_dijkstra.aoj1605.test.cpp\n\nedit by noya2\n\n*/\n\n#line 1 \"combinatorial_opt/test/matroid_intersection_dijkstra.aoj1605.test.cpp\"\n#define PROBLEM \"https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1605\"\n#line 2 \"combinatorial_opt/matroid_intersection_dijkstra.hpp\"\n\n#include <cassert>\n#include <queue>\n#include <vector>\n\n// Find maximum weight size k + 1 intersection of two matroids using Dijkstra's algorithm\n// Return `true` iff larger intersection is found.\n// Complexity: O(Cn + nk log n) (C: circuit query)\ntemplate <class Matroid1, class Matroid2, class T = int>\nbool augment_matroid_intersection_dijkstra(\n Matroid1 &m1, // Matroid, size n, updated\n Matroid2 &m2, // Matroid, size n, updated\n std::vector<bool> &I, // Size k maximum weight intersection, size n, updated\n const std::vector<T> &weight, // Weights of elements, size n\n std::vector<T> &potential // Potential, size n + 2, updated\n) {\n const int n = I.size();\n\n assert((int)m1.size() == n);\n assert((int)m2.size() == n);\n assert((int)weight.size() == n);\n assert(potential.empty() or ((int)potential.size() == n) or ((int)potential.size() == n + 2));\n\n m1.set(I);\n m2.set(I);\n\n potential.resize(n + 2);\n\n auto l = [&](int e) -> T { return e < n ? (I.at(e) ? weight.at(e) : -weight.at(e)) : T(); };\n auto edge_len = [&](int s, int t) -> T { return l(t) - potential.at(t) + potential.at(s); };\n\n if (false) { // 自明な追加が可能かチェック（省略してもアルゴリズムは正当）\n int max_elem = -1;\n for (int e = 0; e < n; ++e) {\n if (!I.at(e) and (max_elem < 0 or weight.at(max_elem) < weight.at(e))) max_elem = e;\n }\n if (max_elem < 0) return false;\n for (int e = 0; e < n; ++e) {\n if (!I.at(e) and weight.at(e) == weight.at(max_elem) and m1.circuit(e).empty() and\n m2.circuit(e).empty()) {\n potential.at(e) -= l(e);\n I.at(e) = true;\n return true;\n }\n }\n }\n\n // Find minimum length (& minimum num. of vertices) gs-gt path\n const int gs = n, gt = n + 1;\n std::vector<std::vector<int>> to(gt + 1);\n\n bool has_gs_edge = false, has_gt_edge = false;\n\n for (int e = 0; e < n; ++e) {\n if (I.at(e)) continue;\n\n const auto c1 = m1.circuit(e), c2 = m2.circuit(e);\n\n if (c1.empty()) {\n to.at(e).push_back(gt);\n if (!has_gt_edge) {\n has_gt_edge = true;\n potential.at(gt) = potential.at(e);\n }\n if (T el = edge_len(e, gt); el < T()) potential.at(gt) += el;\n }\n for (int f : c1) {\n if (f != e) to.at(e).push_back(f);\n }\n\n if (c2.empty()) {\n to.at(gs).push_back(e);\n if (!has_gs_edge) {\n has_gs_edge = true;\n potential.at(gs) = potential.at(e) - l(e);\n }\n if (T el = edge_len(gs, e); el < T()) potential.at(gs) -= el;\n }\n for (int f : c2) {\n if (f != e) to.at(f).push_back(e);\n }\n }\n\n if (const T e0 = potential.at(gs); e0 != T()) {\n for (auto &p : potential) p -= e0;\n }\n\n if (!has_gs_edge or !has_gt_edge) return false;\n\n std::vector<bool> potential_fixed(gt + 1);\n\n T potential_add_unfixed_es = T();\n\n auto fix_potential = [&](int e) -> void {\n assert(!potential_fixed.at(e));\n potential_fixed.at(e) = true;\n potential.at(e) += potential_add_unfixed_es;\n };\n\n std::priority_queue<std::pair<T, int>, std::vector<std::pair<T, int>>, std::greater<>> pq;\n std::vector<T> dijkstra(gt + 1);\n std::vector<int> prv(gt + 1, -1);\n\n pq.emplace(T(), gs);\n\n // noya2 begin\n int many = 1001001;\n while (!pq.empty()){\n many--;\n assert(many > 0);\n auto [d, e] = pq.top(); pq.pop();\n if (potential_fixed[e]) continue;\n potential_fixed[e] = true;\n for (int ne : to[e]){\n if (potential_fixed[ne]) continue;\n auto len = edge_len(e, ne);\n assert(len >= T());\n auto nd = d + len;\n if (prv[ne] == -1 || nd < dijkstra[ne]){\n dijkstra[ne] = nd;\n prv[ne] = e;\n pq.emplace(dijkstra[ne], ne);\n }\n }\n }\n for (int i = 0; i < gt+1; i++){\n if (prv[i] == -1) continue;\n potential[i] = dijkstra[i] + potential[i] - potential[gs];\n }\n\n /*\n\n while (!pq.empty()) {\n const int e = pq.top().second;\n pq.pop();\n if (potential_fixed.at(e)) continue;\n if (e != gs) potential_add_unfixed_es = edge_len(prv.at(e), e);\n\n std::vector<std::pair<int, int>> push_cands;\n\n auto rec = [&](auto &&self, int cur) -> bool {\n if (cur == gt) return true;\n fix_potential(cur);\n\n for (int nxt : to.at(cur)) {\n if (potential_fixed.at(nxt)) continue;\n\n const T len = edge_len(cur, nxt) - potential_add_unfixed_es;\n // if (len < T()) std::cerr << cur << ' ' << nxt << ' ' << len << std::endl;\n assert(len >= T());\n\n if (len == T()) {\n prv.at(nxt) = cur;\n if (self(self, nxt)) return true;\n } else {\n if (prv.at(nxt) == -1 or potential_add_unfixed_es + len < dijkstra.at(nxt)) {\n dijkstra.at(nxt) = potential_add_unfixed_es + len;\n prv.at(nxt) = cur;\n push_cands.emplace_back(nxt, cur);\n }\n }\n }\n return false;\n };\n if (rec(rec, e)) break;\n\n for (auto [nxt, now] : push_cands) {\n if (prv.at(nxt) == now) pq.emplace(dijkstra.at(nxt), nxt);\n }\n }\n\n for (int e = 0; e < gt + 1; ++e) {\n if (!potential_fixed.at(e)) fix_potential(e);\n }\n */\n\n // noya2 end\n\n if (prv.at(gt) < 0) return false;\n\n prv.assign(gt + 1, -1);\n std::queue<int> q;\n q.push(gs);\n\n for (int now = q.front(); now != gt; now = q.front()) {\n q.pop();\n for (int nxt : to.at(now)) {\n if (prv[nxt] == -1 && potential[now] + l(nxt) == potential[nxt]){ // noya2\n // if (prv.at(nxt) == -1 and edge_len(now, nxt) == T()) { // noya2\n prv.at(nxt) = now;\n q.push(nxt);\n }\n }\n }\n\n for (int e = prv.at(gt); e != gs; e = prv.at(e)) {\n potential.at(e) -= l(e);\n I.at(e) = !I.at(e);\n }\n\n return true;\n}\n#line 3 \"combinatorial_opt/matroids/graphic_matroid.hpp\"\n#include <utility>\n#line 5 \"combinatorial_opt/matroids/graphic_matroid.hpp\"\n\n// GraphicMatroid: subgraph of undirected graphs, without loops\nclass GraphicMatroid {\n using Vertex = int;\n using Element = int;\n int M;\n int V; // # of vertices of graph\n std::vector<std::vector<std::pair<Vertex, Element>>> to;\n std::vector<std::pair<Vertex, Vertex>> edges;\n std::vector<Element> backtrack;\n std::vector<Vertex> vprev;\n std::vector<int> depth, root;\n\npublic:\n GraphicMatroid(int V, const std::vector<std::pair<Vertex, Vertex>> &edges_)\n : M(edges_.size()), V(V), to(V), edges(edges_) {\n for (int e = 0; e < int(edges_.size()); e++) {\n int u = edges_[e].first, v = edges_[e].second;\n assert(0 <= u and u < V);\n assert(0 <= v and v < V);\n if (u != v) {\n to[u].emplace_back(v, e);\n to[v].emplace_back(u, e);\n }\n }\n }\n int size() const { return M; }\n\n std::vector<Vertex> que;\n template <class State> void set(State I) {\n assert(int(I.size()) == M);\n backtrack.assign(V, -1);\n vprev.assign(V, -1);\n depth.assign(V, -1);\n root.assign(V, -1);\n que.resize(V);\n int qb = 0, qe = 0;\n for (Vertex i = 0; i < V; i++) {\n if (backtrack[i] >= 0) continue;\n que[qb = 0] = i, qe = 1, depth[i] = 0;\n while (qb < qe) {\n Vertex now = que[qb++];\n root[now] = i;\n for (auto nxt : to[now]) {\n if (depth[nxt.first] < 0 and I[nxt.second]) {\n backtrack[nxt.first] = nxt.second;\n vprev[nxt.first] = now;\n depth[nxt.first] = depth[now] + 1;\n que[qe++] = nxt.first;\n }\n }\n }\n }\n }\n\n std::vector<Element> circuit(const Element e) const {\n assert(0 <= e and e < M);\n Vertex s = edges[e].first, t = edges[e].second;\n if (root[s] != root[t]) return {};\n std::vector<Element> ret{e};\n auto step = [&](Vertex &i) { ret.push_back(backtrack[i]), i = vprev[i]; };\n int ddepth = depth[s] - depth[t];\n for (; ddepth > 0; --ddepth) step(s);\n for (; ddepth < 0; ++ddepth) step(t);\n while (s != t) step(s), step(t);\n return ret;\n }\n};\n#line 4 \"combinatorial_opt/matroids/partition_matroid.hpp\"\n\n// Partition matroid (partitional matroid) : direct sum of uniform matroids\nclass PartitionMatroid {\n using Element = int;\n int M;\n std::vector<std::vector<Element>> parts;\n std::vector<int> belong;\n std::vector<int> R;\n std::vector<int> cnt;\n std::vector<std::vector<Element>> circuits;\n\npublic:\n // parts: partition of [0, 1, ..., M - 1]\n // R: only R[i] elements from parts[i] can be chosen for each i.\n PartitionMatroid(int M, const std::vector<std::vector<int>> &parts_, const std::vector<int> &R_)\n : M(M), parts(parts_), belong(M, -1), R(R_) {\n assert(parts.size() == R.size());\n for (int i = 0; i < int(parts.size()); i++) {\n for (Element e : parts[i]) belong[e] = i;\n }\n for (Element e = 0; e < M; e++) {\n // assert(belong[e] != -1);\n if (belong[e] == -1) {\n belong[e] = parts.size();\n parts.push_back({e});\n R.push_back(1);\n }\n }\n }\n int size() const { return M; }\n\n template <class State> void set(const State &I) {\n cnt = R;\n for (int e = 0; e < M; e++) {\n if (I[e]) cnt[belong[e]]--;\n }\n circuits.assign(cnt.size(), {});\n for (int e = 0; e < M; e++) {\n if (I[e] and cnt[belong[e]] == 0) circuits[belong[e]].push_back(e);\n }\n }\n\n std::vector<Element> circuit(const Element e) const {\n assert(0 <= e and e < M);\n int p = belong[e];\n if (cnt[p] == 0) {\n auto ret = circuits[p];\n ret.push_back(e);\n return ret;\n }\n return {};\n }\n};\n#line 5 \"combinatorial_opt/test/matroid_intersection_dijkstra.aoj1605.test.cpp\"\n#include <iostream>\n#include <numeric>\n#line 9 \"combinatorial_opt/test/matroid_intersection_dijkstra.aoj1605.test.cpp\"\nusing namespace std;\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n while (true) {\n int N, M, K;\n cin >> N >> M >> K;\n if (N == 0) break;\n vector<vector<int>> partition(2);\n vector<int> R{K, N - 1 - K};\n vector<pair<int, int>> edges;\n vector<int> weight;\n for (int e = 0; e < M; ++e) {\n int u, v, w;\n char l;\n cin >> u >> v >> w >> l;\n --u, --v;\n partition[l == 'B'].push_back(e);\n edges.emplace_back(u, v);\n weight.push_back(-w);\n }\n PartitionMatroid M1(edges.size(), partition, R);\n GraphicMatroid M2(N, edges);\n\n vector<int> potential(weight.size());\n vector<bool> ret(weight.size());\n while (augment_matroid_intersection_dijkstra(M1, M2, ret, weight, potential)) continue;\n int ne = accumulate(ret.begin(), ret.end(), 0);\n if (ne < N - 1) {\n cout << \"-1\\n\";\n } else {\n int sum = 0;\n for (int e = 0; e < M; ++e) sum -= ret.at(e) * weight.at(e);\n cout << sum << '\\n';\n }\n }\n}","accuracy":1,"time_ms":360,"memory_kb":3744,"score_of_the_acc":-0.5122,"final_rank":15},{"submission_id":"aoj_1605_10220901","code_snippet":"// AOJ #1605 Bridge Construction Planning\n// 2025.2.15\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nstruct DSU {\n vector<int> parent, rank;\n DSU(int n) : parent(n), rank(n,0) {\n for(int i = 0; i < n; i++){\n parent[i] = i;\n }\n }\n int findp(int a) {\n return parent[a] == a ? a : parent[a] = findp(parent[a]);\n }\n bool unite(int a, int b) {\n a = findp(a), b = findp(b);\n if(a == b) return false;\n if(rank[a] < rank[b]) swap(a, b);\n parent[b] = a;\n if(rank[a] == rank[b]) rank[a]++;\n return true;\n }\n};\n \nstruct Edge {\n int u, v;\n int cost;\n bool isA;\n int idx;\n};\n \nstruct MSTResult {\n bool valid;\n int redCount;\n ll origCost;\n};\n \nMSTResult computeMST(int n, const vector<Edge>& edges, int lambda) {\n int m = edges.size();\n vector<Edge> sortedEdges = edges;\n auto cmp = [lambda](const Edge &a, const Edge &b) {\n int wa = a.cost + (a.isA ? lambda : 0);\n int wb = b.cost + (b.isA ? lambda : 0);\n if(wa != wb) return wa < wb;\n return a.idx < b.idx;\n };\n sort(sortedEdges.begin(), sortedEdges.end(), cmp);\n \n DSU dsu(n);\n int edgeCount = 0;\n int redCount = 0;\n ll sumOrig = 0;\n for (int i = 0; i < m && edgeCount < n - 1; i++){\n int u = sortedEdges[i].u - 1;\n int v = sortedEdges[i].v - 1;\n if(dsu.unite(u, v)){\n edgeCount++;\n sumOrig += sortedEdges[i].cost;\n if(sortedEdges[i].isA) redCount++;\n }\n }\n MSTResult res;\n res.valid = (edgeCount == n - 1);\n res.redCount = res.valid ? redCount : -1;\n res.origCost = res.valid ? sumOrig : -1;\n return res;\n}\n \nint main(){\n ios::sync_with_stdio(0);\n cin.tie(0);\n \n while(true){\n int n, m, k;\n cin >> n >> m >> k;\n if(n == 0) break;\n \n vector<Edge> edges;\n edges.reserve(m);\n for (int i = 0; i < m; i++){\n int u, v, w;\n char comp;\n cin >> u >> v >> w >> comp;\n Edge e;\n e.u = u; e.v = v; e.cost = w;\n e.isA = (comp == 'A');\n e.idx = i;\n edges.push_back(e);\n }\n \n int lambdaLow = -1000, lambdaHigh = 1000;\n MSTResult resLow = computeMST(n, edges, lambdaLow);\n MSTResult resHigh = computeMST(n, edges, lambdaHigh);\n if(!resLow.valid || !resHigh.valid){\n cout << -1 << \"\\n\";\n continue;\n }\n int maxRed = resLow.redCount;\n int minRed = resHigh.redCount;\n \n if(k < minRed || k > maxRed){\n cout << -1 << endl;\n continue;\n }\n \n ll best = -LLONG_MAX;\n for (int lambda = lambdaLow; lambda <= lambdaHigh; lambda++){\n MSTResult cur = computeMST(n, edges, lambda);\n if(!cur.valid) continue;\n ll candidate = cur.origCost + (ll)lambda * (cur.redCount - k);\n best = max(best, candidate);\n }\n \n cout << best << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":380,"memory_kb":3424,"score_of_the_acc":-0.5056,"final_rank":13},{"submission_id":"aoj_1605_10137704","code_snippet":"#include<iostream>\n#include<algorithm>\ntemplate<typename T=int>\nstruct Edge{\n int from,to;\n T weight;\n int index;\n Edge(int from_,int to_,T weight_=T(),int index_=-1):from(from_),to(to_),weight(weight_),index(index_){}\n Edge():from(-1),to(-1),weight(),index(-1){}\n friend std::ostream &operator<<(std::ostream &os,const Edge&e){\n os<<'[';\n os<<\"from:\"<<e.from;\n os<<\"to:\"<<e.to;\n os<<\"weight:\"<<e.weight;\n os<<\"index:\"<<e.index;\n os<<']';\n return os;\n }\n};\n#include<vector>\ntemplate<typename T=int>\nstruct Graph{\nprivate:\n int n;\n std::vector<Edge<T>>edge;\n std::vector<Edge<T>>g;\n std::vector<int>ptr;\n bool directed;\n struct graph_range{\n using iterator=typename std::vector<Edge<T>>::iterator;\n iterator l,r;\n iterator begin()const{return l;}\n iterator end()const{return r;}\n int size()const{return r-l;}\n Edge<T> &operator[](int i)const{return l[i];}\n };\n struct const_graph_range{\n using iterator=typename std::vector<Edge<T>>::const_iterator;\n iterator l,r;\n iterator begin()const{return l;}\n iterator end()const{return r;}\n int size()const{return r-l;}\n const Edge<T> &operator[](int i)const{return l[i];}\n };\npublic:\n Graph(int n_,bool dir_):n(n_),directed(dir_){}\n Graph():n(0){}\n Graph(int n_,bool dir_,const std::vector<Edge<T>>&e):n(n_),directed(dir_),edge(e){build();}\n template<bool weighted=false,bool index=1>\n void read(int m){\n edge.reserve(m);\n for(int i=0;i<m;i++){\n int u,v;\n std::cin>>u>>v;\n T w;\n if constexpr(index)u--,v--;\n if constexpr(weighted)std::cin>>w;\n else w=1;\n edge.emplace_back(u,v,w,i);\n }\n build();\n }\n void add_edge(int u,int v){\n int id=edge.size();\n edge.emplace_back(u,v,1,id);\n }\n void add_edge(int u,int v,T w){\n int id=edge.size();\n edge.emplace_back(u,v,w,id);\n }\n void add_edge(int u,int v,T w,int index){\n edge.emplace_back(u,v,w,index);\n }\n void build(){\n std::vector<int>cnt(n+1,0);\n for(const Edge<T>&e:edge){\n cnt[e.from+1]++;\n if(!directed)cnt[e.to+1]++;\n }\n for(int i=1;i<=n;i++)cnt[i]+=cnt[i-1];\n ptr=cnt;\n g.resize(cnt[n]);\n for(const Edge<T>&e:edge){\n g[cnt[e.from]++]=e;\n if(!directed)g[cnt[e.to]++]=Edge<T>(e.to,e.from,e.weight,e.index);\n }\n }\n void reverse(){\n if(directed){\n for(Edge<T>&e:edge)swap(e.from,e.to);\n build();\n }\n }\n inline void to_directed(){\n directed=true;\n build();\n }\n inline void to_undirected(){\n directed=false;\n build();\n }\n void reserve(int m){edge.reserve(m);}\n graph_range operator[](int i){return graph_range{g.begin()+ptr[i],g.begin()+ptr[i+1]};}\n const_graph_range operator[](int i)const{return const_graph_range{g.begin()+ptr[i],g.begin()+ptr[i+1]};}\n const Edge<T>& get_edge(int i)const{return edge[i];}\n inline bool is_directed()const{return directed;}\n inline int size()const{return n;}\n inline int edge_size()const{return edge.size();}\n typename std::vector<Edge<T>>::iterator begin(){return edge.begin();}\n typename std::vector<Edge<T>>::iterator end(){return edge.end();}\n typename std::vector<Edge<T>>::const_iterator begin()const{return edge.begin();}\n typename std::vector<Edge<T>>::const_iterator end()const{return edge.end();}\n};\nstruct GraphicMatroid{\nprivate:\n Graph<>g;\n std::vector<std::pair<int,int>>pre;\n std::vector<int>que,dst,root;\n int p,q;\npublic:\n GraphicMatroid(const Graph<>&g_):g(g_),pre(g_.edge_size()),que(g_.edge_size()),dst(g_.size()),root(g_.size()){}\n int size()const{return g.edge_size();}\n void set(const std::vector<bool>&I){\n std::fill(pre.begin(),pre.end(),std::make_pair(-1,-1));\n for(int i=0;i<g.size();i++){\n if(pre[i].first==-1){\n for(p=q=0,que[q++]=i,dst[i]=0;p<q;){\n int x=que[p++];\n root[x]=i;\n for(const Edge<>&e:g[x])if(I[e.index]&&pre[e.to].first==-1){\n pre[e.to]=std::make_pair(e.from,e.index);\n dst[e.to]=dst[e.from]+1;\n que[q++]=e.to;\n }\n }\n }\n }\n }\n std::vector<int>circuit(int x)const{\n const Edge<>&e=g.get_edge(x);\n if(root[e.from]!=root[e.to])return {};\n std::vector<int>res;\n int u=e.from,v=e.to;\n if(dst[u]>dst[v])std::swap(u,v);\n while(dst[u]<dst[v])res.push_back(pre[v].second),v=pre[v].first;\n while(u!=v){\n res.push_back(pre[u].second),u=pre[u].first;\n res.push_back(pre[v].second),v=pre[v].first;\n }\n return res;\n }\n};\nstruct PartitionMatroid{\nprivate:\n int n;\n std::vector<std::vector<int>>s;\n std::vector<int>belong;\n std::vector<int>c,c2;\n std::vector<std::vector<int>>circuits;\npublic:\n PartitionMatroid(int n_,const std::vector<std::vector<int>>&s_,const std::vector<int>&c_):n(n_),s(s_),belong(n,-1),c2(c_){\n for(int i=0;i<(int)s.size();i++){\n for(int j:s[i])belong[j]=i;\n }\n for(int i=0;i<n;i++)if(belong[i]==-1){\n belong[i]=s.size();\n s.push_back({i});\n c2.push_back(1);\n }\n circuits.resize(s.size());\n }\n int size()const{return n;}\n void set(const std::vector<bool>&I){\n c=c2;\n for(int i=0;i<n;i++)if(I[i])c[belong[i]]--;\n for(int i=0;i<(int)circuits.size();i++)circuits[i].clear();\n for(int i=0;i<n;i++)if(I[i]&&c[belong[i]]==0)circuits[belong[i]].push_back(i);\n }\n std::vector<int>circuit(int x)const{\n if(c[belong[x]]==0){\n std::vector<int>res=circuits[belong[x]];\n res.push_back(x);\n return res;\n }\n return {};\n }\n};\n#include<cassert>\n#include<limits>\n#include<numeric>\ntemplate<typename T>\nstd::pair<std::vector<T>,std::vector<int>>shortest_path_faster_algorithm(const Graph<T>&g,int s=0){\n static constexpr T inf=std::numeric_limits<T>::max();\n static constexpr T minf=std::numeric_limits<T>::min();\n int n=g.size();\n std::vector<T>dst(n,inf);\n std::vector<int>pre(n,-1);\n dst[s]=0;\n std::vector<int>que(n+1);\n int p=0,q=0;\n std::vector<int>time(n,0);\n std::vector<bool>contain(n,false);\n que[q++]=s;\n contain[s]=true;\n while(p!=q){\n int x=que[p++];\n if(p==n+1)p=0;\n contain[x]=false;\n for(const Edge<T>&e:g[x]){\n T cost=dst[x]+e.weight;\n if(dst[e.to]>cost){\n dst[e.to]=cost;\n pre[e.to]=e.from;\n if(!contain[e.to]){\n if(++time[e.to]>=n)continue;\n contain[e.to]=true;\n que[q++]=e.to;\n if(q==n+1)q=0;\n }\n }\n }\n }\n std::fill(contain.begin(),contain.end(),false);\n p=q=0;\n for(int i=0;i<n;i++)for(const Edge<T>&e:g[i])if(dst[i]!=inf&&e.from==e.to&&e.weight<0)time[i]=n;\n for(int i=0;i<n;i++)if(time[i]>=n){\n que[q++]=i;\n contain[i]=true;\n }\n while(p!=q){\n int x=que[p++];\n dst[x]=minf;\n if(p==n+1)p=0;\n for(const Edge<T>&e:g[x])if(!contain[e.to]){\n contain[e.to]=true;\n que[q++]=e.to;\n if(q==n+1)q=0;\n }\n }\n return std::make_pair(dst,pre);\n}\ntemplate<typename M1,typename M2,typename W>\nstd::vector<bool>matroid_intersection(M1 m1,M2 m2,std::vector<W>weight={}){\n static constexpr W inf=std::numeric_limits<W>::max();\n assert(m1.size()==m2.size());\n assert(weight.empty()||(int)weight.size()==m1.size());\n int n=m1.size();\n if(weight.empty())weight=std::vector<W>(n,0);\n std::vector<bool>res(n,false);\n while(true){\n Graph<W>g(n+2,true);\n m1.set(res),m2.set(res);\n for(int i=0;i<n;i++)if(!res[i]){\n std::vector<int>c1=m1.circuit(i),c2=m2.circuit(i);\n if(c1.empty())g.add_edge(i,n+1,0);\n for(int j:c1)if(i!=j)g.add_edge(i,j,-weight[j]*(n+1)+1);\n if(c2.empty())g.add_edge(n,i,weight[i]*(n+1)+1);\n for(int j:c2)if(i!=j)g.add_edge(j,i,weight[i]*(n+1)+1);\n }\n g.build();\n auto [dst,pre]=shortest_path_faster_algorithm(g,n);\n if(dst[n+1]==inf)break;\n for(int i=pre[n+1];i!=n;i=pre[i])res[i]=!res[i];\n }\n return res;\n}\nusing namespace std;\nint main(){\n int n,m,k;\n while(true){\n cin>>n>>m>>k;\n if(n==0)break;\n Graph<>g(n,false);\n vector<int>weight(m);\n vector<vector<int>>b(2);\n for(int i=0;i<m;i++){\n int u,v,w;\n char c;\n cin>>u>>v>>w>>c;\n u--,v--;\n g.add_edge(u,v);\n weight[i]=w;\n b[c=='B'].push_back(i);\n }\n g.build();\n GraphicMatroid gm(g);\n PartitionMatroid pm(m,b,{k,n-1-k});\n auto ans=matroid_intersection(gm,pm,weight);\n int sum=0;\n for(int i=0;i<m;i++)if(ans[i])sum+=weight[i],n--;\n if(n==1)cout<<sum<<'\\n';\n else cout<<\"-1\\n\";\n }\n}","accuracy":1,"time_ms":340,"memory_kb":4804,"score_of_the_acc":-0.5919,"final_rank":18},{"submission_id":"aoj_1605_10021837","code_snippet":"#include<bits/stdc++.h>\n// #include<atcoder/all>\n// #include<boost/multiprecision/cpp_int.hpp>\n\nusing namespace std;\n// using namespace atcoder;\n// using bint = boost::multiprecision::cpp_int;\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\nusing P = pair<ll,ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vi>;\nusing vvvi = vector<vvi>;\nusing ve = vector<vector<int>>;\nusing vb = vector<bool>;\nusing vvb = vector<vb>;\n#define rep(i,n) for(ll i = 0;i < (ll)n;i++)\n#define ALL(x) (x).begin(),(x).end()\n#define sz(c) ((ll)(c).size())\n#define LB(A,x) (int)(lower_bound(A.begin(),A.end(),x)-A.begin())\n#define UB(A,x) (int)(upper_bound(A.begin(),A.end(),x)-A.begin())\n// #define MOD 1000000007\n#define MOD 998244353\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\ntemplate<typename T>ostream&operator<<(ostream&os,vector<T>&v){for(int i = 0;i < v.size();i++)os<<v[i]<<(i+1!=v.size()?\" \":\"\");return os;}\ntemplate<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}\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;}\ntemplate<typename T> inline bool chmax(T &a,T b){if(a < b){a = b;return true;}return false;}\ntemplate<typename T> inline bool chmin(T &a,T b){if(a > b){a = b;return true;}return false;}\nld dist(ld x1,ld y1,ld x2, ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}\n\n// https://hitonanode.github.io/cplib-cpp/combinatorial_opt/matroids/matroid_example.hpp\n// https://hitonanode.github.io/cplib-cpp/combinatorial_opt/matroids/graphic_matroid.hpp\n// GraphicMatroid: subgraph of undirected graphs, without loops\nclass GraphicMatroid{\n using Vertex = int;\n using Element = int;\n int M;\n int n; // # of vertices of graph\n vector<vector<pair<Vertex,Element>>> to; //{行先、辺番号}\n vector<pair<Vertex,Vertex>> edges; \n vector<Element> backtrack;\n vector<Vertex> vprev;\n vector<int> dep,root;\n\n public:\n GraphicMatroid(int n,const vector<pair<Vertex,Vertex>> &edges_)\n : M(edges_.size()),n(n),to(n),edges(edges_){\n for(int e = 0;e < int(edges_.size());e++){\n int u = edges_[e].first,v = edges_[e].second;\n assert(0 <= u && u < n);\n assert(0 <= v && v < n);\n if(u != v){\n to[u].emplace_back(v,e);\n to[v].emplace_back(u,e);\n }\n }\n }\n int size()const{return M;}\n\n vector<Vertex> que;\n // O(size of matroid)\n template<class State = vector<bool>> void set(State I){\n assert(int(I.size()) == M);\n backtrack.assign(n,-1);\n vprev.assign(n,-1);\n dep.assign(n,-1);\n root.assign(n,-1);\n que.resize(n);\n int qb = 0,qe = 0;\n for(Vertex i = 0;i < n;i++){\n if(backtrack[i] >= 0)continue;\n que[qb = 0] = i;qe = 1,dep[i] = 0;\n while(qb < qe){\n Vertex ov = que[qb++];\n root[ov] = i;\n for(auto [nv,nidx] : to[ov]){\n if(dep[nv] < 0 && I[nidx]){\n backtrack[nv] = nidx;\n vprev[nv] = ov;\n dep[nv] = dep[ov] + 1;\n que[qe++] = nv;\n }\n }\n }\n }\n }\n\n // 閉路が順番に出力されるわけではない。O(size of independent set)\n vector<Element> circuit(const Element e)const{\n assert(0 <= e && e < M);\n Vertex s = edges[e].first,t = edges[e].second;\n if(root[s] != root[t])return {};\n vector<Element> res{e};\n auto step = [&](Vertex &i){res.emplace_back(backtrack[i]),i = vprev[i];};\n int dep_diff = dep[s] - dep[t];\n for(;dep_diff > 0;--dep_diff)step(s);\n for(;dep_diff < 0;++dep_diff)step(t);\n while(s != t)step(s),step(t);\n return res;\n }\n};\n\n\n// https://hitonanode.github.io/cplib-cpp/combinatorial_opt/matroids/matroid_example.hpp\n// https://hitonanode.github.io/cplib-cpp/combinatorial_opt/matroids/partition_matroid.hpp\n// Partition matroid (partitional matroid) : direct sum of uniform matroids\nclass PartitionMatroid{\n using Element = int;\n int M;\n vector<vector<Element>> parts;\n vector<int> belong;\n vector<int> R;\n vector<int> cnt;\n vector<vector<Element>> circuits;\n\n public:\n // parts: partition of [0, 1, ..., M - 1]\n // R: only R[i] elements from parts[i] can be chosen for each i.\n PartitionMatroid(int M,const vector<vector<Element>> &parts_,const vector<int> &R_)\n : M(M),parts(parts_),belong(M,-1),R(R_) {\n assert(parts.size() == R.size());\n for(int i = 0;i < int(parts.size());i++){\n for(Element e : parts[i])belong[e] = i;\n }\n for(Element e = 0;e < M;e++){\n if(belong[e] == -1){\n belong[e] = parts.size();\n parts.push_back({e});\n R.emplace_back(1);\n }\n }\n }\n int size() const {return M;}\n\n // O(size of matroid)\n template<class State = vector<bool>>\n void set(const State &I){\n cnt = R;\n for(int e = 0;e < M;e++){\n if(I[e])cnt[belong[e]]--;\n }\n circuits.assign(cnt.size(),{});\n for(int e = 0;e < M;e++){\n if(I[e] && cnt[belong[e]] == 0)circuits[belong[e]].emplace_back(e);\n }\n }\n // O(size of independent set)\n vector<Element> circuit(const Element e)const{\n assert(0 <= e && e < M);\n int p = belong[e];\n if(cnt[p] == 0){\n auto res = circuits[p];\n res.emplace_back(e);\n return res;\n }\n return {};\n }\n};\n\n\n\n// https://hitonanode.github.io/cplib-cpp/combinatorial_opt/matroid_intersection.hpp.html\n// http://dopal.cs.uec.ac.jp/okamotoy/lect/2015/matroid/\n// ``重み付き！！！``重み付き！！！``重み付き！！！``重み付き！！！``重み付き！！！``重み付き！！！\n// m1, m2: matroids\n// I: independent set (will be updated if augmenting path is found)\n// Return `true` iff augmenting path is found.\n// Complexity: O(Cn + n^2) (C: circuit query,n:matroid台集合の要素数)\ntemplate<class Matroid1,class Matroid2,class T = int>\nbool matroid_intersection_augment(Matroid1 &m1,Matroid2 &m2,vector<bool> &I,const vector<T> &weights){\n const int n = m1.size();\n assert(m2.size() == n);\n assert((int)I.size() == n);\n\n const int gs = n,gt = n+1;\n const T INVALID = numeric_limits<T>::max();\n vector<tuple<int,int,T>> v;\n m1.set(I);\n m2.set(I);\n // 補助グラフの作成 O(nC + n^2)\n for(int e = 0;e < n;e++){\n if(I[e])continue;\n auto c1 = m1.circuit(e),c2 = m2.circuit(e);\n if(c1.empty())v.emplace_back(e,gt,T());\n for(auto f : c1)if(f != e)v.emplace_back(e,f,-weights[f]);\n if(c2.empty())v.emplace_back(gs,e,weights[e]);\n for(auto f : c2)if(f != e)v.emplace_back(f,e,weights[e]);\n }\n // 最短経路 Bellman-ford O(n^3)\n vector<T> dist(n+2,INVALID);\n vector<T> prev(n+2,INVALID);\n dist[gs] = 0;\n for(int _ = 0;_ < n+2;_++){ // 今、頂点数は n+2\n bool changed = false;\n for(auto &[ov,nv,wei] : v){\n if(dist[ov] == INVALID)continue;\n if(dist[nv] > dist[ov] + wei){\n dist[nv] = dist[ov] + wei;\n prev[nv] = ov;\n changed = true;\n }\n }\n if(!changed)break;\n }// 負閉路はそんざいしない(はず)\n \n // 経路復元。増加路実行\n if(dist[gt] == INVALID)return false;\n int now_vertex = gt;\n while(prev[now_vertex] != INVALID){\n now_vertex = prev[now_vertex];\n if(now_vertex != gs && now_vertex != gt)I[now_vertex] = !I[now_vertex];\n }\n return true;\n}\n\n// Minimum weight matroid intersection solver\n// Complexity: O(Cn^2 + n^4) (C : circuit query)\ntemplate <class Matroid1, class Matroid2, class T = int>\nvector<bool> MatroidIntersection(Matroid1 matroid1,Matroid2 matroid2,vector<T> &weights){\n const int n = matroid1.size();\n assert(matroid2.size() == n);\n assert(weights.size() == n);\n \n vector<bool> I(n);\n while(matroid_intersection_augment(matroid1,matroid2,I,weights));\n return I;\n}\nint main(){\n \n ios_base::sync_with_stdio(0), cin.tie(0);\n while(1){\n int n,m,K;cin >> n >> m >> K;\n if(!n)break;\n ve parts(2);\n vector<int> R{K,n-K-1};\n vector<pair<int,int>> edge;\n vi weight;\n rep(i,m){\n int u,v,w;char l;cin >> u >> v >> w >> l;\n u--;v--;\n edge.emplace_back(u,v);\n parts[l-'A'].emplace_back(i);\n weight.emplace_back(w);\n }\n GraphicMatroid gm(n,edge);\n PartitionMatroid pm(m,parts,R);\n vb I = MatroidIntersection(gm,pm,weight);\n int cnt = accumulate(ALL(I),0);\n if(cnt != n-1)cout << \"-1\\n\";\n else{\n int res = 0;\n rep(e,m)res += I[e]*weight[e];\n cout << res << \"\\n\";\n }\n }\n \n\n return 0;\n}","accuracy":1,"time_ms":260,"memory_kb":4988,"score_of_the_acc":-0.5101,"final_rank":14},{"submission_id":"aoj_1605_10020829","code_snippet":"#include<bits/stdc++.h>\n// #include<atcoder/all>\n// #include<boost/multiprecision/cpp_int.hpp>\n\nusing namespace std;\n// using namespace atcoder;\n// using bint = boost::multiprecision::cpp_int;\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\nusing P = pair<ll,ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vi>;\nusing vvvi = vector<vvi>;\nusing ve = vector<vector<int>>;\nusing vb = vector<bool>;\nusing vvb = vector<vb>;\n#define rep(i,n) for(ll i = 0;i < (ll)n;i++)\n#define ALL(x) (x).begin(),(x).end()\n#define sz(c) ((ll)(c).size())\n#define LB(A,x) (int)(lower_bound(A.begin(),A.end(),x)-A.begin())\n#define UB(A,x) (int)(upper_bound(A.begin(),A.end(),x)-A.begin())\n// #define MOD 1000000007\n#define MOD 998244353\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\ntemplate<typename T>ostream&operator<<(ostream&os,vector<T>&v){for(int i = 0;i < v.size();i++)os<<v[i]<<(i+1!=v.size()?\" \":\"\");return os;}\ntemplate<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}\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;}\ntemplate<typename T> inline bool chmax(T &a,T b){if(a < b){a = b;return true;}return false;}\ntemplate<typename T> inline bool chmin(T &a,T b){if(a > b){a = b;return true;}return false;}\nld dist(ld x1,ld y1,ld x2, ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}\n\n// https://hitonanode.github.io/cplib-cpp/combinatorial_opt/matroids/matroid_example.hpp\n// https://hitonanode.github.io/cplib-cpp/combinatorial_opt/matroids/graphic_matroid.hpp\n// GraphicMatroid: subgraph of undirected graphs, without loops\nclass GraphicMatroid{\n using Vertex = int;\n using Element = int;\n int M;\n int n; // # of vertices of graph\n vector<vector<pair<Vertex,Element>>> to; //{行先、辺番号}\n vector<pair<Vertex,Vertex>> edges; \n vector<Element> backtrack;\n vector<Vertex> vprev;\n vector<int> dep,root;\n\n public:\n GraphicMatroid(int n,const vector<pair<Vertex,Vertex>> &edges_)\n : M(edges_.size()),n(n),to(n),edges(edges_){\n for(int e = 0;e < int(edges_.size());e++){\n int u = edges_[e].first,v = edges_[e].second;\n assert(0 <= u && u < n);\n assert(0 <= v && v < n);\n if(u != v){\n to[u].emplace_back(v,e);\n to[v].emplace_back(u,e);\n }\n }\n }\n int size()const{return M;}\n\n vector<Vertex> que;\n // O(size of matroid)\n template<class State = vector<bool>> void set(State I){\n assert(int(I.size()) == M);\n backtrack.assign(n,-1);\n vprev.assign(n,-1);\n dep.assign(n,-1);\n root.assign(n,-1);\n que.resize(n);\n int qb = 0,qe = 0;\n for(Vertex i = 0;i < n;i++){\n if(backtrack[i] >= 0)continue;\n que[qb = 0] = i;qe = 1,dep[i] = 0;\n while(qb < qe){\n Vertex ov = que[qb++];\n root[ov] = i;\n for(auto [nv,nidx] : to[ov]){\n if(dep[nv] < 0 && I[nidx]){\n backtrack[nv] = nidx;\n vprev[nv] = ov;\n dep[nv] = dep[ov] + 1;\n que[qe++] = nv;\n }\n }\n }\n }\n }\n\n // 閉路が順番に出力されるわけではない。O(size of independent set)\n vector<Element> circuit(const Element e)const{\n assert(0 <= e && e < M);\n Vertex s = edges[e].first,t = edges[e].second;\n if(root[s] != root[t])return {};\n vector<Element> res{e};\n auto step = [&](Vertex &i){res.emplace_back(backtrack[i]),i = vprev[i];};\n int dep_diff = dep[s] - dep[t];\n for(;dep_diff > 0;--dep_diff)step(s);\n for(;dep_diff < 0;++dep_diff)step(t);\n while(s != t)step(s),step(t);\n return res;\n }\n};\n\n\n// https://hitonanode.github.io/cplib-cpp/combinatorial_opt/matroids/matroid_example.hpp\n// https://hitonanode.github.io/cplib-cpp/combinatorial_opt/matroids/partition_matroid.hpp\n// Partition matroid (partitional matroid) : direct sum of uniform matroids\nclass PartitionMatroid{\n using Element = int;\n int M;\n vector<vector<Element>> parts;\n vector<int> belong;\n vector<int> R;\n vector<int> cnt;\n vector<vector<Element>> circuits;\n\n public:\n // parts: partition of [0, 1, ..., M - 1]\n // R: only R[i] elements from parts[i] can be chosen for each i.\n PartitionMatroid(int M,const vector<vector<Element>> &parts_,const vector<int> &R_)\n : M(M),parts(parts_),belong(M,-1),R(R_) {\n assert(parts.size() == R.size());\n for(int i = 0;i < int(parts.size());i++){\n for(Element e : parts[i])belong[e] = i;\n }\n for(Element e = 0;e < M;e++){\n if(belong[e] == -1){\n belong[e] = parts.size();\n parts.push_back({e});\n R.emplace_back(1);\n }\n }\n }\n int size() const {return M;}\n\n // O(size of matroid)\n template<class State = vector<bool>>\n void set(const State &I){\n cnt = R;\n for(int e = 0;e < M;e++){\n if(I[e])cnt[belong[e]]--;\n }\n circuits.assign(cnt.size(),{});\n for(int e = 0;e < M;e++){\n if(I[e] && cnt[belong[e]] == 0)circuits[belong[e]].emplace_back(e);\n }\n }\n // O(size of independent set)\n vector<Element> circuit(const Element e)const{\n assert(0 <= e && e < M);\n int p = belong[e];\n if(cnt[p] == 0){\n auto res = circuits[p];\n res.emplace_back(e);\n return res;\n }\n return {};\n }\n};\n\n\n// https://hitonanode.github.io/cplib-cpp/combinatorial_opt/matroid_intersection.hpp.html\n// http://dopal.cs.uec.ac.jp/okamotoy/lect/2015/matroid/\n// ``重み付き！！！``重み付き！！！``重み付き！！！``重み付き！！！``重み付き！！！``重み付き！！！\n// m1, m2: matroids\n// I: independent set (will be updated if augmenting path is found)\n// Return `true` iff augmenting path is found.\n// Complexity: O(Cn + n^2) (C: circuit query,n:matroid台集合の要素数)\ntemplate<class Matroid1,class Matroid2,class T = int>\nbool matroid_intersection_augment(Matroid1 &m1,Matroid2 &m2,vector<bool> &I,const vector<T> &weights){\n const int n = m1.size();\n assert(m2.size() == n);\n assert((int)I.size() == n);\n\n // auto weight = [&](int e){return weights.empty() ? T() : weights[e]*(n+1);};\n\n const int gs = n,gt = n+1;\n const T INVALID = numeric_limits<T>::max();\n vector<tuple<int,int,T>> v(n+2);\n m1.set(I);\n m2.set(I);\n // 補助グラフの作成 O(nC + n^2)\n for(int e = 0;e < n;e++){\n if(I[e])continue;\n auto c1 = m1.circuit(e),c2 = m2.circuit(e);\n if(c1.empty())v.emplace_back(e,gt,T());\n for(auto f : c1)if(f != e)v.emplace_back(e,f,-weights[f]);\n if(c2.empty())v.emplace_back(gs,e,weights[e]);\n for(auto f : c2)if(f != e)v.emplace_back(f,e,weights[e]);\n }\n // 最短経路 Bellman-ford O(n^3)\n vector<T> dist(n+2,INVALID);\n vector<T> prev(n+2,INVALID);\n dist[gs] = 0;\n for(int _ = 0;_ < n+2;_++){ // 今、頂点数は n+2\n bool changed = false;\n for(auto &[ov,nv,wei] : v){\n if(dist[ov] == INVALID)continue;\n if(dist[nv] > dist[ov] + wei){\n dist[nv] = dist[ov] + wei;\n prev[nv] = ov;\n changed = true;\n }\n }\n if(!changed)break;\n }// 負閉路はそんざいしない(はず)\n \n // 経路復元。増加路実行\n if(dist[gt] == INVALID)return false;\n int now_vertex = gt;\n while(prev[now_vertex] != INVALID){\n now_vertex = prev[now_vertex];\n if(now_vertex != gs && now_vertex != gt)I[now_vertex] = !I[now_vertex];\n }\n return true;\n}\n\n// Minimum weight matroid intersection solver\n// Complexity: O(Cn^2 + n^4) (C : circuit query)\ntemplate <class Matroid1, class Matroid2, class T = int>\nvector<bool> MatroidIntersection(Matroid1 matroid1,Matroid2 matroid2,vector<T> &weights){\n const int n = matroid1.size();\n assert(matroid2.size() == n);\n assert(weights.size() == n);\n \n vector<bool> I(n);\n while(matroid_intersection_augment(matroid1,matroid2,I,weights));\n return I;\n}\n\nint main(){\n \n ios_base::sync_with_stdio(0), cin.tie(0);\n while(1){\n int n,m,K;cin >> n >> m >> K;\n if(!n)break;\n ve parts(2);\n vector<int> R{K,n-K-1};\n vector<pair<int,int>> edge;\n vi weight;\n rep(i,m){\n int u,v,w;char l;cin >> u >> v >> w >> l;\n u--;v--;\n edge.emplace_back(u,v);\n parts[l-'A'].emplace_back(i);\n weight.emplace_back(w);\n }\n GraphicMatroid gm(n,edge);\n PartitionMatroid pm(m,parts,R);\n vb I = MatroidIntersection(gm,pm,weight);\n int cnt = accumulate(ALL(I),0);\n if(cnt != n-1)cout << \"-1\\n\";\n else{\n int res = 0;\n rep(e,m)res += I[e]*weight[e];\n cout << res << \"\\n\";\n }\n }\n \n\n return 0;\n}","accuracy":1,"time_ms":210,"memory_kb":5000,"score_of_the_acc":-0.4488,"final_rank":12},{"submission_id":"aoj_1605_9315926","code_snippet":"#include <bits/stdc++.h>\n\n#include <algorithm>\n#include <cassert>\n#include <vector>\n\nnamespace atcoder {\n\n// Implement (union by size) + (path compression)\n// Reference:\n// Zvi Galil and Giuseppe F. Italiano,\n// Data structures and algorithms for disjoint set union problems\nstruct dsu {\n public:\n dsu() : _n(0) {}\n dsu(int n) : _n(n), parent_or_size(n, -1) {}\n\n int merge(int a, int b) {\n assert(0 <= a && a < _n);\n assert(0 <= b && b < _n);\n int x = leader(a), y = leader(b);\n if (x == y) return x;\n if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);\n parent_or_size[x] += parent_or_size[y];\n parent_or_size[y] = x;\n return x;\n }\n\n bool same(int a, int b) {\n assert(0 <= a && a < _n);\n assert(0 <= b && b < _n);\n return leader(a) == leader(b);\n }\n\n int leader(int a) {\n assert(0 <= a && a < _n);\n if (parent_or_size[a] < 0) return a;\n return parent_or_size[a] = leader(parent_or_size[a]);\n }\n\n int size(int a) {\n assert(0 <= a && a < _n);\n return -parent_or_size[leader(a)];\n }\n\n std::vector<std::vector<int>> groups() {\n std::vector<int> leader_buf(_n), group_size(_n);\n for (int i = 0; i < _n; i++) {\n leader_buf[i] = leader(i);\n group_size[leader_buf[i]]++;\n }\n std::vector<std::vector<int>> result(_n);\n for (int i = 0; i < _n; i++) {\n result[i].reserve(group_size[i]);\n }\n for (int i = 0; i < _n; i++) {\n result[leader_buf[i]].push_back(i);\n }\n result.erase(\n std::remove_if(result.begin(), result.end(),\n [&](const std::vector<int>& v) { return v.empty(); }),\n result.end());\n return result;\n }\n\n private:\n int _n;\n // root node: -1 * component size\n // otherwise: parent\n std::vector<int> parent_or_size;\n};\n\n} // namespace atcoder\n\nusing namespace atcoder;\nusing namespace std;\n\nusing ll = long long;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\nusing vd = vector<double>;\nusing vvd = vector<vd>;\nusing vvvd = vector<vvd>;\n#define all(A) A.begin(),A.end()\n#define ALL(A) A.begin(),A.end()\n#define rep(i, n) for (int i = 0; i < (int) (n); i++)\ntemplate<class T>\nbool chmax(T& p, T q) {\n if (p < q) {\n p = q; return 1;\n }\n return 0;\n};\n\n\nvoid solve(ll N,ll M,ll K) {\n vector<vector<pair<ll,ll>>> GA(N),GB(N);\n rep(i,M){\n ll U,V,W;\n char C;\n cin>>U>>V>>W>>C;\n U--;V--;\n (C=='A'?GA:GB)[U].push_back({V,W});\n (C=='A'?GA:GB)[V].push_back({U,W});\n }\n {\n dsu dA(N),dB(N),d(N);\n ll nA=0,nB=0;\n rep(i,N){\n for(auto vw:GA[i]){\n if(!dA.same(i,vw.first))nA++;\n d.merge(i,vw.first);\n dA.merge(i,vw.first);\n }\n for(auto vw:GB[i]){\n if(!dB.same(i,vw.first))nB++;\n d.merge(i,vw.first);\n dB.merge(i,vw.first);\n }\n }\n if(d.size(0)!=N){\n cout<<-1<<endl;\n return;\n }\n if(nA<K){\n cout<<-1<<endl;\n return;\n }\n if(nB<N-K-1){\n cout<<-1<<endl;\n return;\n }\n }\n\n ll L=0,R=210;\n while(R-L>1){\n ll mid=(R+L)/2;\n\n\n vector<pair<ll,pair<ll,pair<ll,ll>>>> E;\n \n rep(i,N){\n for(auto &vw:GA[i]){\n vw.second+=(mid-105);\n E.push_back({vw.second,{0,{i,vw.first}}});\n }\n for(auto vw:GB[i]){\n E.push_back({vw.second,{1,{i,vw.first}}});\n }\n }\n sort(all(E));\n dsu d(N);\n ll cnt=0;\n rep(i,E.size()){\n ll v=E[i].second.second.first;\n ll u=E[i].second.second.second;\n if(d.same(u,v))continue;\n d.merge(u,v);\n cnt+=(E[i].second.first==0?1:0);\n }\n\n if(cnt>=K){\n L=mid;\n }\n else R=mid;\n \n rep(i,N){\n for(auto &vw:GA[i]){\n vw.second-=(mid-105);\n }\n }\n\n }\n\n ll an=0;\n // cout<<L<<endl;\n vector<pair<ll,pair<ll,pair<ll,ll>>>> E;\n \n rep(i,N){\n for(auto &vw:GA[i]){\n vw.second+=(L-105);\n E.push_back({vw.second,{0,{i,vw.first}}});\n }\n for(auto vw:GB[i]){\n E.push_back({vw.second,{1,{i,vw.first}}});\n }\n }\n sort(all(E));\n dsu d(N);\n ll cnt=0;\n rep(i,E.size()){\n ll v=E[i].second.second.first;\n ll u=E[i].second.second.second;\n if(d.same(u,v))continue;\n d.merge(u,v);\n cnt+=E[i].first;\n }\n cout<<cnt-(L-105)*K<<endl;\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n\n ll N,M,K;\n while (cin >> N>>M>>K) {\n if (N == 0)return 0;\n solve(N,M,K);\n }\n\n}","accuracy":1,"time_ms":10,"memory_kb":3492,"score_of_the_acc":-0.0498,"final_rank":3},{"submission_id":"aoj_1605_9278152","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\n\nbool is_end = false;\n\nstruct UnionFind\n{\n int n;\n vector<int> par;\n \n UnionFind() = default;\n UnionFind(int _n) : n(_n), par(_n)\n {\n for (int i = 0; i < n; ++i) par[i] = i;\n }\n \n int root(int x)\n {\n if (par[x] == x) return x;\n else return par[x] = root(par[x]);\n }\n \n bool same(int x, int y)\n {\n return root(x) == root(y);\n }\n \n void merge(int x, int y)\n {\n par[root(y)] = root(x);\n return;\n }\n \n};\n\nvoid solve()\n{\n int N, M, K; cin >> N >> M >> K;\n if (N == 0)\n {\n is_end = true;\n return;\n }\n \n vector<array<int, 3>> edgeA, edgeB;\n for (int i = 0; i < M; ++i)\n {\n int u, v, w; cin >> u >> v >> w;\n u--, v--;\n char c; cin >> c;\n \n if (c == 'A') edgeA.push_back({w, u, v});\n else edgeB.push_back({w, u, v});\n }\n sort(edgeA.begin(), edgeA.end());\n sort(edgeB.begin(), edgeB.end());\n \n int A = edgeA.size(), B = edgeB.size();\n vector<vector<tuple<int, int, int, UnionFind>>> connect(N+1, vector<tuple<int, int, int, UnionFind>>(N+1));\n \n const int INF = 1e9;\n connect[0][0] = {0, 0, 0, UnionFind(N)};\n for (int i = 0; i <= K; ++i)\n {\n for (int j = 0; j <= N - 1 - K; ++j)\n {\n if (i == 0 && j == 0) continue;\n \n int s = INF, a = A, b = B;\n UnionFind uf(N);\n \n // A\n if (i > 0)\n {\n auto [sa, ida, idb, ufa] = connect[i-1][j];\n bool done = false;\n for (int k = ida; k < A; ++k)\n {\n auto [w, u, v] = edgeA[k];\n if (ufa.same(u, v)) continue;\n \n ufa.merge(u, v);\n sa += w;\n ida = k + 1;\n done = true;\n break;\n }\n \n if (done)\n {\n if (sa < s)\n {\n s = sa, a = ida, b = idb;\n uf = ufa;\n }\n }\n }\n \n // B\n if (j > 0)\n {\n auto [sb, ida, idb, ufb] = connect[i][j-1];\n bool done = false;\n for (int k = idb; k < B; ++k)\n {\n auto [w, u, v] = edgeB[k];\n if (ufb.same(u, v)) continue;\n \n ufb.merge(u, v);\n sb += w;\n idb = k + 1;\n done = true;\n break;\n }\n \n if (done)\n {\n if (sb < s)\n {\n s = sb, a = ida, b = idb;\n uf = ufb;\n }\n }\n }\n \n connect[i][j] = {s, a, b, uf};\n }\n }\n \n {\n auto [s, a, b, uf] = connect[K][N - 1 - K];\n if (s >= INF) cout << -1 << endl;\n else cout << s << endl;\n }\n \n return;\n}\n\n\nint main()\n{\n while (!is_end)\n {\n solve();\n }\n \n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":13108,"score_of_the_acc":-1.0375,"final_rank":19},{"submission_id":"aoj_1605_8887366","code_snippet":"// #line 1 \"library/Template/template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);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 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){if(a<b){a=b;return 1;}return 0;}\ntemplate<typename T>inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}\ntemplate<typename T,typename U>T ceil(T x,U y){assert(y!=0); if(y<0)x=-x,y=-y; return (x>0?(x+y-1)/y:x/y);}\ntemplate<typename T,typename U>T floor(T x,U y){assert(y!=0); if(y<0)x=-x,y=-y; return (x>0?x/y:(x-y+1)/y);}\ntemplate<typename T>int popcnt(T x){return __builtin_popcountll(x);}\ntemplate<typename T>int topbit(T x){return (x==0?-1:63-__builtin_clzll(x));}\ntemplate<typename T>int lowbit(T x){return (x==0?-1:__builtin_ctzll(x));}\n// #line 2 \"library/Utility/fastio.hpp\"\n#include <unistd.h>\n\nclass FastIO {\n static constexpr int L = 1 << 16;\n char rdbuf[L];\n int rdLeft = 0, rdRight = 0;\n inline void reload() {\n int len = rdRight - rdLeft;\n memmove(rdbuf, rdbuf + rdLeft, len);\n rdLeft = 0, rdRight = len;\n rdRight += fread(rdbuf + len, 1, L - len, stdin);\n }\n inline bool skip() {\n for (;;) {\n while (rdLeft != rdRight and rdbuf[rdLeft] <= ' ')\n rdLeft++;\n if (rdLeft == rdRight) {\n reload();\n if (rdLeft == rdRight)\n return false;\n } else\n break;\n }\n return true;\n }\n template <typename T, enable_if_t<is_integral<T>::value, int> = 0>\n inline bool _read(T &x) {\n if (!skip())\n return false;\n if (rdLeft + 20 >= rdRight)\n reload();\n bool neg = false;\n if (rdbuf[rdLeft] == '-') {\n neg = true;\n rdLeft++;\n }\n x = 0;\n while (rdbuf[rdLeft] >= '0' and rdLeft < rdRight) {\n x = x * 10 +\n (neg ? -(rdbuf[rdLeft++] ^ 48) : (rdbuf[rdLeft++] ^ 48));\n }\n return true;\n }\n inline bool _read(__int128_t &x) {\n if (!skip())\n return false;\n if (rdLeft + 40 >= rdRight)\n reload();\n bool neg = false;\n if (rdbuf[rdLeft] == '-') {\n neg = true;\n rdLeft++;\n }\n x = 0;\n while (rdbuf[rdLeft] >= '0' and rdLeft < rdRight) {\n x = x * 10 +\n (neg ? -(rdbuf[rdLeft++] ^ 48) : (rdbuf[rdLeft++] ^ 48));\n }\n return true;\n }\n inline bool _read(__uint128_t &x) {\n if (!skip())\n return false;\n if (rdLeft + 40 >= rdRight)\n reload();\n x = 0;\n while (rdbuf[rdLeft] >= '0' and rdLeft < rdRight) {\n x = x * 10 + (rdbuf[rdLeft++] ^ 48);\n }\n return true;\n }\n template <typename T, enable_if_t<is_floating_point<T>::value, int> = 0>\n inline bool _read(T &x) {\n if (!skip())\n return false;\n if (rdLeft + 20 >= rdRight)\n reload();\n bool neg = false;\n if (rdbuf[rdLeft] == '-') {\n neg = true;\n rdLeft++;\n }\n x = 0;\n while (rdbuf[rdLeft] >= '0' and rdbuf[rdLeft] <= '9' and\n rdLeft < rdRight) {\n x = x * 10 + (rdbuf[rdLeft++] ^ 48);\n }\n if (rdbuf[rdLeft] != '.')\n return true;\n rdLeft++;\n T base = .1;\n while (rdbuf[rdLeft] >= '0' and rdbuf[rdLeft] <= '9' and\n rdLeft < rdRight) {\n x += base * (rdbuf[rdLeft++] ^ 48);\n base *= .1;\n }\n if (neg)\n x = -x;\n return true;\n }\n inline bool _read(char &x) {\n if (!skip())\n return false;\n if (rdLeft + 1 >= rdRight)\n reload();\n x = rdbuf[rdLeft++];\n return true;\n }\n inline bool _read(string &x) {\n if (!skip())\n return false;\n for (;;) {\n int pos = rdLeft;\n while (pos < rdRight and rdbuf[pos] > ' ')\n pos++;\n x.append(rdbuf + rdLeft, pos - rdLeft);\n if (rdLeft == pos)\n break;\n rdLeft = pos;\n if (rdLeft == rdRight)\n reload();\n else\n break;\n }\n return true;\n }\n template <typename T> inline bool _read(vector<T> &v) {\n for (auto &x : v) {\n if (!_read(x))\n return false;\n }\n return true;\n }\n\n char wtbuf[L], tmp[50];\n int wtRight = 0;\n inline void _write(const char &x) {\n if (wtRight > L - 32)\n flush();\n wtbuf[wtRight++] = x;\n }\n inline void _write(const string &x) {\n for (auto &c : x)\n _write(c);\n }\n template <typename T, enable_if_t<is_integral<T>::value, int> = 0>\n inline void _write(T x) {\n if (wtRight > L - 32)\n flush();\n if (x == 0) {\n _write('0');\n return;\n } else if (x < 0) {\n _write('-');\n if (__builtin_expect(x == std::numeric_limits<T>::min(), 0)) {\n switch (sizeof(x)) {\n case 2:\n _write(\"32768\");\n return;\n case 4:\n _write(\"2147483648\");\n return;\n case 8:\n _write(\"9223372036854775808\");\n return;\n }\n }\n x = -x;\n }\n int pos = 0;\n while (x != 0) {\n tmp[pos++] = char((x % 10) | 48);\n x /= 10;\n }\n rep(i, 0, pos) wtbuf[wtRight + i] = tmp[pos - 1 - i];\n wtRight += pos;\n }\n inline void _write(__int128_t x) {\n if (wtRight > L - 40)\n flush();\n if (x == 0) {\n _write('0');\n return;\n } else if (x < 0) {\n _write('-');\n x = -x;\n }\n int pos = 0;\n while (x != 0) {\n tmp[pos++] = char((x % 10) | 48);\n x /= 10;\n }\n rep(i, 0, pos) wtbuf[wtRight + i] = tmp[pos - 1 - i];\n wtRight += pos;\n }\n inline void _write(__uint128_t x) {\n if (wtRight > L - 40)\n flush();\n if (x == 0) {\n _write('0');\n return;\n }\n int pos = 0;\n while (x != 0) {\n tmp[pos++] = char((x % 10) | 48);\n x /= 10;\n }\n rep(i, 0, pos) wtbuf[wtRight + i] = tmp[pos - 1 - i];\n wtRight += pos;\n }\n inline void _write(double x) {\n ostringstream oss;\n oss << fixed << setprecision(15) << double(x);\n string s = oss.str();\n _write(s);\n }\n template <typename T> inline void _write(const vector<T> &v) {\n rep(i, 0, v.size()) {\n if (i)\n _write(' ');\n _write(v[i]);\n }\n }\n\n public:\n FastIO() {}\n ~FastIO() { flush(); }\n inline void read() {}\n template <typename Head, typename... Tail>\n inline void read(Head &head, Tail &...tail) {\n assert(_read(head));\n read(tail...);\n }\n template <bool ln = true, bool space = false> inline void write() {\n if (ln)\n _write('\\n');\n }\n template <bool ln = true, bool space = false, typename Head,\n typename... Tail>\n inline void write(const Head &head, const Tail &...tail) {\n if (space)\n _write(' ');\n _write(head);\n write<ln, true>(tail...);\n }\n inline void flush() {\n fwrite(wtbuf, 1, wtRight, stdout);\n wtRight = 0;\n }\n};\n\n#define debug(var) do{std::cerr << #var << \" : \";view(var); cerr << '\\n';}while(0)\ntemplate<typename T> void view(T e){std::cerr << e;}\ntemplate<typename T,typename U> void view(pair<T,U> e){\n std::cerr << '{';\n view(e.first);\n std::cerr << ',';\n view(e.second);\n std::cerr << '}';\n}\ntemplate <typename T, template<class> class C> void view(const C<T>& v){\n std::cerr << \"[\";\n for(const auto& e : v){ view(e); cerr << ','; }\n std::cerr << \"]\";\n}\n\n\n/**\n * @brief Fast IO\n */\n// #line 3 \"sol.cpp\"\n\nstruct GraphicMatroid{\n using P=pair<int,int>;\n int n;\n vector<P> E;\n vector<vector<P>> G;\n vector<int> allow;\n GraphicMatroid(){}\n GraphicMatroid(int n,vector<P>& E):n(n),E(E),G(n){\n rep(i,0,SZ(E)){\n auto [u,v]=E[i];\n G[u].push_back({v,i});\n G[v].push_back({u,i});\n }\n }\n void set(vector<int>& I){\n allow=I;\n }\n vector<int> circuit(int e){\n auto [x,y]=E[e];\n vector<int> ret;\n ret.push_back(e);\n auto dfs=[&](auto& dfs,int v,int p)->bool{\n if(v==y)return true;\n for(auto& [to,i]:G[v])if(allow[i] and to!=p){\n ret.push_back(i);\n if(dfs(dfs,to,v))return true;\n ret.pop_back();\n }\n return false;\n };\n if(dfs(dfs,x,-1))return ret;\n else return {};\n }\n};\n\nstruct PartitionMatroid{\n vector<int> grp; // -1:not assign\n vector<int> lim;\n vector<vector<int>> cnt;\n PartitionMatroid(){}\n PartitionMatroid(vector<int>& grp,vector<int> lim):grp(grp),lim(lim){}\n void set(vector<int>& I){\n cnt.assign(SZ(lim),{});\n rep(i,0,SZ(grp))if(I[i]!=0 and grp[i]!=-1){\n cnt[grp[i]].push_back(i);\n }\n }\n vector<int> circuit(int e){\n if(grp[e]==-1)return {};\n if(SZ(cnt[grp[e]])+1>lim[grp[e]]){\n vector<int> ret=cnt[grp[e]];\n ret.push_back(e);\n return ret;\n }\n else return {};\n }\n};\n\ntemplate<typename M1,typename M2,typename Val>\npair<vector<Val>,vector<vector<int>>> MinimumMatroidIntersection(M1& m1,M2& m2,vector<Val>& ws){\n using P=pair<Val,int>;\n int n=SZ(ws);\n \n vector<Val> ret1;\n vector<vector<int>> ret2;\n \n Val profit=0;\n vector<int> I(n);\n ret1.push_back(profit);\n ret2.push_back(I);\n \n for(;;){\n vector G(n+2,vector<P>());\n int S=n,T=n+1;\n m1.set(I);\n m2.set(I);\n \n rep(e,0,n){\n if(I[e])continue;\n auto c1=m1.circuit(e);\n if(c1.empty())G[S].push_back({ws[e]*(n+1)+1,e});\n else for(auto& to:c1)if(e!=to){\n G[to].push_back({ws[e]*(n+1)+1,e});\n }\n auto c2=m2.circuit(e);\n if(c2.empty())G[e].push_back({Val(0),T});\n else for(auto& to:c2)if(e!=to){\n G[e].push_back({-ws[to]*(n+1)+1,to});\n }\n }\n \n vector<ll> dist(n+2,INF);\n dist[S]=0;\n vector<int> pre(n+2,-1);\n for(;;){\n bool upd=0;\n rep(v,0,n+2)for(auto& [cost,to]:G[v]){\n if(chmin(dist[to],dist[v]+cost)){\n pre[to]=v;\n upd=1;\n }\n }\n if(!upd)break;\n }\n \n if(dist[T]==INF)break;\n int cur=T;\n while(cur!=S){\n cur=pre[cur];\n if(cur!=S){\n I[cur]^=1;\n if(I[cur])profit+=ws[cur];\n else profit-=ws[cur];\n }\n }\n ret1.push_back(profit);\n ret2.push_back(I);\n \n // debug(profit);\n // debug(I);\n }\n return {ret1,ret2};\n}\n\n\nFastIO io;\nint main(){\n for(;;){\n int n,m,k;\n io.read(n,m,k);\n if(n==0)break;\n using P=pair<int,int>;\n vector<P> E;\n vector<ll> ws(m);\n vector<int> grp(m),lim={k,n-1-k};\n rep(i,0,m){\n int u,v,w;\n char c;\n io.read(u,v,w,c);\n u--; v--;\n E.push_back({u,v});\n ws[i]=w;\n if(c=='A')grp[i]=0;\n else grp[i]=1;\n }\n \n GraphicMatroid m1(n,E);\n PartitionMatroid m2(grp,lim);\n \n auto [ret,tmp]=MinimumMatroidIntersection(m1,m2,ws);\n if(SZ(ret)==n)io.write(ret.back());\n else io.write(-1);\n }\n return 0;\n}","accuracy":1,"time_ms":810,"memory_kb":4904,"score_of_the_acc":-1.1893,"final_rank":20},{"submission_id":"aoj_1605_8304590","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define per(i, n) for (int i = (n)-1; i >= 0; i--)\n#define rep2(i, l, r) for (int i = (l); i < (r); i++)\n#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)\n#define each(e, x) for (auto &e : x)\n#define sz(x) (int)x.size()\n#define all(x) begin(x), end(x)\n#define pb push_back\n#define eb emplace_back\n#define MM << ' ' <<\n#define TT template <typename T>\nusing ll = long long;\nusing pii = pair<int, int>;\nusing pll = pair<ll, ll>;\n\nconst int inf = (1 << 30) - 1;\n\nTT bool chmin(T &x, T y) { return x > y ? (x = y, true) : false; }\nTT bool chmax(T &x, T y) { return x < y ? (x = y, true) : false; }\n\nint main() {\n while (true) {\n int N, M, K;\n cin >> N >> M >> K;\n\n if (N == 0) break;\n\n vector<int> r(N, -1);\n\n auto root = [&](auto &&root, int v) -> int {\n if (r[v] == -1) return v;\n return r[v] = root(root, r[v]);\n };\n\n auto unite = [&](int u, int v) {\n u = root(root, u), v = root(root, v);\n if (u == v) return false;\n r[v] = u;\n return true;\n };\n\n vector<tuple<int, int, int, char>> es;\n\n rep(i, M) {\n int u, v, w;\n char c;\n cin >> u >> v >> w >> c;\n u--, v--;\n es.eb(w, u, v, c);\n }\n\n sort(all(es));\n\n int l1 = 0, l2 = 0;\n int ans = 0;\n\n vector<bool> used(M, false);\n\n rep(i, M) {\n auto [w, u, v, c] = es[i];\n if (unite(u, v)) {\n ans += w;\n if (c == 'A') l1++;\n if (c == 'B') l2++;\n used[i] = true;\n }\n }\n\n // cout << l1 MM l2 << endl;\n\n if (l1 + l2 != N - 1) {\n cout << \"-1\\n\";\n continue;\n }\n\n // cout << N MM M MM K << endl;\n\n while (l1 != K) {\n vector<vector<tuple<int, int, int, int>>> li(N);\n rep(i, M) {\n if (!used[i]) continue;\n auto [w, u, v, c] = es[i];\n li[u].eb(v, c, w, i);\n li[v].eb(u, c, w, i);\n }\n\n vector<int> d(N, inf);\n vector<tuple<int, int, int, int>> pre(N);\n queue<int> que;\n que.emplace(0);\n d[0] = 0;\n while (!empty(que)) {\n int i = que.front();\n que.pop();\n for (auto [j, c, w, id] : li[i]) {\n if (chmin(d[j], d[i] + 1)) {\n pre[j] = make_tuple(i, c, w, id);\n que.emplace(j);\n }\n }\n }\n\n char x = (l1 < K ? 'A' : 'B');\n int mi = inf;\n pii P{-1, -1};\n\n rep(i, M) {\n auto [w, u, v, c] = es[i];\n if (used[i] || c != x) continue;\n int ma = -inf, ma_id = -1;\n while (u != v) {\n if (d[u] < d[v]) swap(u, v);\n auto [p, c, w, id] = pre[u];\n if (c != x && chmax(ma, w)) {\n ma_id = id; //\n }\n u = p;\n }\n if (chmin(mi, w - ma)) {\n P = {i, ma_id}; //\n }\n }\n\n if (mi == inf) {\n ans = -1;\n break;\n }\n\n ans += mi;\n used[P.first] = true;\n used[P.second] = false;\n if (l1 < K) l1++;\n if (l1 > K) l1--;\n }\n\n cout << ans << '\\n';\n }\n}","accuracy":1,"time_ms":30,"memory_kb":3396,"score_of_the_acc":-0.0653,"final_rank":4},{"submission_id":"aoj_1605_8023450","code_snippet":"#include<iostream>\n#include<vector>\n#include<algorithm>\n#include<cassert>\nusing namespace std;\nstruct UF{\n\tvector<int>pr;\n\tUF(int n):pr(n,-1){}\n\tint find(int u)\n\t{\n\t\tif(pr[u]>=0)return pr[u]=find(pr[u]);\n\t\treturn u;\n\t}\n\tbool merge(int u,int v)\n\t{\n\t\tu=find(u);\n\t\tv=find(v);\n\t\tif(u==v)return false;\n\t\tif(-pr[u]<-pr[v])swap(u,v);\n\t\tpr[u]+=pr[v];\n\t\tpr[v]=u;\n\t\treturn true;\n\t}\n};\nstruct edge{\n\tint u,v,w;\n\tbool operator<(const edge&rhs)const{return w<rhs.w;}\n};\nostream&operator<<(ostream&os,const edge&e)\n{\n\treturn os<<\"(\"<<e.u+1<<\", \"<<e.v+1<<\", \"<<e.w<<\")\";\n}\nint N,M,K;\nvector<edge>A,B;\nvector<edge>f(vector<edge>E)\n{\n\tUF uf(N);\n\tvector<edge>ret;\n\tsort(E.begin(),E.end());\n\tfor(edge e:E)\n\t{\n\t\tif(uf.merge(e.u,e.v))ret.push_back(e);\n\t}\n\treturn ret;\n}\nint main()\n{\n\twhile(cin>>N>>M>>K,N)\n\t{\n\t\tA.clear();\n\t\tB.clear();\n\t\tfor(int i=0;i<M;i++)\n\t\t{\n\t\t\tedge E;\n\t\t\tcin>>E.u>>E.v>>E.w;\n\t\t\tE.u--,E.v--;\n\t\t\tchar l;\n\t\t\tcin>>l;\n\t\t\tif(l=='A')A.push_back(E);\n\t\t\telse B.push_back(E);\n\t\t}\n\t\tA=f(A);\n\t\tB=f(B);\n\t\tvector<edge>useA,restA;\n\t\t{\n\t\t\tUF uf(N);\n\t\t\tfor(edge e:B)uf.merge(e.u,e.v);\n\t\t\tfor(edge e:A)\n\t\t\t{\n\t\t\t\tif(uf.merge(e.u,e.v))\n\t\t\t\t{\n\t\t\t\t\tuseA.push_back(e);\n\t\t\t\t}\n\t\t\t\telse restA.push_back(e);\n\t\t\t}\n\t\t}\n\t\tint cnt=K-(int)useA.size();\n\t\tif(cnt<0||cnt>restA.size())\n\t\t{\n\t\t\tcout<<-1<<endl;\n\t\t\tcontinue;\n\t\t}\n\t\tfor(int t=0;t<cnt;t++)\n\t\t{\n\t\t\tUF uf(N);\n\t\t\tfor(edge e:useA)assert(uf.merge(e.u,e.v));\n\t\t\t/*\n\t\t\tint ALL=0;\n\t\t\tUF ALLuf=uf;\n\t\t\tfor(edge e:B)if(ALLuf.merge(e.u,e.v))ALL+=e.w;\n\t\t\t*/\n\t\t\tint MN=1e9,MNi;\n\t\t\tfor(int i=0;i<restA.size();i++)\n\t\t\t{\n\t\t\t\tUF NOWuf=uf;\n\t\t\t\tassert(NOWuf.merge(restA[i].u,restA[i].v));\n\t\t\t\tint now=restA[i].w;\n\t\t\t\tfor(edge e:B)if(NOWuf.merge(e.u,e.v))now+=e.w;\n\t\t\t\tif(MN>now)\n\t\t\t\t{\n\t\t\t\t\tMN=now;\n\t\t\t\t\tMNi=i;\n\t\t\t\t}\n\t\t\t}\n\t\t\tuseA.push_back(restA[MNi]);\n\t\t\trestA.erase(restA.begin()+MNi);\n\t\t}\n\t\tassert(useA.size()==K);\n\t\tUF uf(N);\n\t\tfor(edge e:useA)assert(uf.merge(e.u,e.v));\n\t\tfor(edge e:B)if(uf.merge(e.u,e.v))\n\t\t{\n\t\t\tuseA.push_back(e);\n\t\t\t//cout<<e<<\" from B\\n\";\n\t\t}\n\t\tif(useA.size()<N-1)\n\t\t{\n\t\t\tcout<<-1<<endl;\n\t\t\tcontinue;\n\t\t}\n\t\tassert(useA.size()==N-1);\n\t\tint ans=0;\n\t\tfor(edge e:useA)ans+=e.w;\n\t\tcout<<ans<<endl;\n\t}\n}","accuracy":1,"time_ms":60,"memory_kb":3484,"score_of_the_acc":-0.1115,"final_rank":7},{"submission_id":"aoj_1605_7967277","code_snippet":"#include <bits/stdc++.h>\n\nnamespace luz {\n\n using usize = std::size_t;\n using isize = std::ptrdiff_t;\n\n struct rep {\n struct itr {\n usize i;\n constexpr itr(const usize i) noexcept: i(i) {}\n void operator++() noexcept {\n ++i;\n }\n constexpr usize operator*() const noexcept {\n return i;\n }\n constexpr bool operator!=(\n const itr x) const noexcept {\n return i != x.i;\n }\n };\n const itr f, l;\n constexpr rep(const usize f, const usize l) noexcept\n : f(std::min(f, l)),\n l(l) {}\n constexpr auto begin() const noexcept {\n return f;\n }\n constexpr auto end() const noexcept {\n return l;\n }\n };\n\n}\n\nnamespace luz {\n class DisjointSetUnion {\n usize n_;\n\n std::vector< isize > vals_;\n\n void bound_check(usize v) const {\n assert(v < n_);\n }\n\n usize impl_leader(usize v) {\n if (vals_[v] < 0) return v;\n return vals_[v] = leader(vals_[v]);\n }\n\n public:\n DisjointSetUnion() = default;\n explicit DisjointSetUnion(usize n) : n_(n), vals_(n, -1) {}\n\n usize size() const {\n return n_;\n }\n\n usize leader(usize v) {\n bound_check(v);\n return impl_leader(v);\n }\n\n bool same(usize u, usize v) {\n bound_check(u), bound_check(v);\n return impl_leader(u) == impl_leader(v);\n }\n\n usize merge(usize u, usize v) {\n bound_check(u);\n bound_check(v);\n\n isize x = impl_leader(u);\n isize y = impl_leader(v);\n if (x == y) return x;\n if (-vals_[x] < -vals_[y]) std::swap(x, y);\n vals_[x] += vals_[y];\n vals_[y] = x;\n return x;\n }\n\n usize group_size(usize v) {\n bound_check(v);\n return -vals_[impl_leader(v)];\n }\n };\n\n}\n\nvoid solve(int n, int m, int k) {\n struct plan {\n int u, v, w, is_a;\n };\n\n luz::DisjointSetUnion dsu(n);\n std::vector< plan > plans(m);\n for (auto &p: plans) {\n char c;\n std::cin >> p.u >> p.v >> p.w >> c;\n p.is_a = (c == 'A');\n p.u--;\n p.v--;\n\n dsu.merge(p.u, p.v);\n }\n\n if (dsu.group_size(0) != n) {\n std::cout << -1 << std::endl;\n return;\n }\n\n // dw \\in [-100, 100]\n auto calc = [&](int dw) {\n for (auto &p: plans) {\n if (not p.is_a) continue;\n p.w += dw;\n }\n\n auto aplans = plans;\n auto bplans = plans;\n\n for (auto &p: plans) {\n if (not p.is_a) continue;\n p.w -= dw;\n }\n\n auto cmp_a = [&](const plan &a, const plan &b) {\n if (a.w == b.w) {\n return a.is_a < b.is_a;\n }\n return a.w < b.w;\n };\n auto cmp_b = [&](const plan &a, const plan &b) {\n if (a.w == b.w) {\n return a.is_a > b.is_a;\n }\n return a.w < b.w;\n };\n\n std::sort(aplans.begin(), aplans.end(), cmp_a);\n std::sort(bplans.begin(), bplans.end(), cmp_b);\n\n luz::DisjointSetUnion af(n), bf(n);\n int cnt_a = 0, cnt_b = 0;\n int mst_a = 0, mst_b = 0;\n \n for (auto &p: aplans) {\n int u = p.u;\n int v = p.v;\n if (af.same(u, v)) continue;\n if (p.is_a) cnt_a++;\n af.merge(u, v);\n mst_a += p.w;\n }\n for (auto &p: bplans) {\n int u = p.u;\n int v = p.v;\n if (bf.same(u, v)) continue;\n if (p.is_a) cnt_b++;\n bf.merge(u, v);\n mst_b += p.w;\n }\n\n assert(mst_a == mst_b);\n\n return std::make_tuple(cnt_a, cnt_b, mst_a);\n };\n\n int ok = 100, ng = -101;\n while (ok - ng > 1) {\n // std::cerr << \"(\" << ng << \", \" << ok << \"]\" << std::endl;\n int dw = (ok + ng) / 2;\n\n // A 側に下駄をはかせて A を使える下界、上界\n auto [lb, up, mst] = calc(dw);\n // std::cerr << lb << \" \" << up << \" \" << mst << std::endl;\n\n if (k < lb) {\n ng = dw;\n } else {\n ok = dw;\n }\n }\n\n auto [lb, up, mst] = calc(ok);\n // std::cerr << ok << std::endl;\n // std::cerr << lb << \" \" << up << \" \" << mst << std::endl;\n\n if (lb <= k and k <= up) {\n std::cout << mst - k * ok << std::endl;\n } else {\n std::cout << -1 << std::endl;\n }\n}\n\nint main() {\n int n, m, k;\n while (std::cin >> n >> m >> k, n) {\n solve(n, m, k);\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3432,"score_of_the_acc":-0.0439,"final_rank":2},{"submission_id":"aoj_1605_7965410","code_snippet":"#include <bits/stdc++.h>\n\nnamespace luz {\n\n using usize = std::size_t;\n using isize = std::ptrdiff_t;\n\n struct rep {\n struct itr {\n usize i;\n constexpr itr(const usize i) noexcept: i(i) {}\n void operator++() noexcept {\n ++i;\n }\n constexpr usize operator*() const noexcept {\n return i;\n }\n constexpr bool operator!=(\n const itr x) const noexcept {\n return i != x.i;\n }\n };\n const itr f, l;\n constexpr rep(const usize f, const usize l) noexcept\n : f(std::min(f, l)),\n l(l) {}\n constexpr auto begin() const noexcept {\n return f;\n }\n constexpr auto end() const noexcept {\n return l;\n }\n };\n\n}\n\nnamespace luz {\n class DisjointSetUnion {\n usize n_;\n\n std::vector< isize > vals_;\n\n void bound_check(usize v) const {\n assert(v < n_);\n }\n\n usize impl_leader(usize v) {\n if (vals_[v] < 0) return v;\n return vals_[v] = leader(vals_[v]);\n }\n\n public:\n DisjointSetUnion() = default;\n explicit DisjointSetUnion(usize n) : n_(n), vals_(n, -1) {}\n\n usize size() const {\n return n_;\n }\n\n usize leader(usize v) {\n bound_check(v);\n return impl_leader(v);\n }\n\n bool same(usize u, usize v) {\n bound_check(u), bound_check(v);\n return impl_leader(u) == impl_leader(v);\n }\n\n usize merge(usize u, usize v) {\n bound_check(u);\n bound_check(v);\n\n isize x = impl_leader(u);\n isize y = impl_leader(v);\n if (x == y) return x;\n if (-vals_[x] < -vals_[y]) std::swap(x, y);\n vals_[x] += vals_[y];\n vals_[y] = x;\n return x;\n }\n\n usize group_size(usize v) {\n bound_check(v);\n return -vals_[impl_leader(v)];\n }\n };\n\n}\n\nvoid solve(int n, int m, int k) {\n struct plan {\n int u, v, w, is_a;\n };\n\n luz::DisjointSetUnion dsu(n);\n std::vector< plan > plans(m);\n for (auto &p: plans) {\n char c;\n std::cin >> p.u >> p.v >> p.w >> c;\n p.is_a = (c == 'A');\n p.u--;\n p.v--;\n\n dsu.merge(p.u, p.v);\n }\n\n if (dsu.group_size(0) != n) {\n std::cout << -1 << std::endl;\n return;\n }\n\n // dw \\in [-100, 100]\n auto calc = [&](int dw) {\n for (auto &p: plans) {\n if (not p.is_a) continue;\n p.w += dw;\n }\n\n auto aplans = plans;\n auto bplans = plans;\n\n for (auto &p: plans) {\n if (not p.is_a) continue;\n p.w -= dw;\n }\n\n auto cmp_a = [&](const plan &a, const plan &b) {\n if (a.w == b.w) {\n return a.is_a < b.is_a;\n }\n return a.w < b.w;\n };\n auto cmp_b = [&](const plan &a, const plan &b) {\n if (a.w == b.w) {\n return a.is_a > b.is_a;\n }\n return a.w < b.w;\n };\n\n std::sort(aplans.begin(), aplans.end(), cmp_a);\n std::sort(bplans.begin(), bplans.end(), cmp_b);\n\n luz::DisjointSetUnion af(n), bf(n);\n int cnt_a = 0, cnt_b = 0;\n int mst_a = 0, mst_b = 0;\n \n for (auto &p: aplans) {\n int u = p.u;\n int v = p.v;\n if (af.same(u, v)) continue;\n if (p.is_a) cnt_a++;\n af.merge(u, v);\n mst_a += p.w;\n }\n for (auto &p: bplans) {\n int u = p.u;\n int v = p.v;\n if (bf.same(u, v)) continue;\n if (p.is_a) cnt_b++;\n bf.merge(u, v);\n mst_b += p.w;\n }\n\n assert(mst_a == mst_b);\n\n return std::make_tuple(cnt_a, cnt_b, mst_a);\n };\n\n int ok = 100, ng = -101;\n while (ok - ng > 1) {\n // std::cerr << \"(\" << ng << \", \" << ok << \"]\" << std::endl;\n int dw = (ok + ng) / 2;\n\n // A 側に下駄をはかせて A を使える下界、上界\n auto [lb, up, mst] = calc(dw);\n // std::cerr << lb << \" \" << up << \" \" << mst << std::endl;\n\n if (k < lb) {\n ng = dw;\n } else {\n ok = dw;\n }\n }\n\n auto [lb, up, mst] = calc(ok);\n // std::cerr << ok << std::endl;\n // std::cerr << lb << \" \" << up << \" \" << mst << std::endl;\n\n if (lb <= k and k <= up) {\n std::cout << mst - k * ok << std::endl;\n } else {\n std::cout << -1 << std::endl;\n }\n}\n\nint main() {\n int n, m, k;\n while (std::cin >> n >> m >> k, n) {\n solve(n, m, k);\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3420,"score_of_the_acc":-0.0427,"final_rank":1},{"submission_id":"aoj_1605_7698513","code_snippet":"#include <bits/stdc++.h>\n\n#define rep(i, s, n) for (int i = (int)s; i < (int)n; i++)\n#define rrep(i, s, n) for (int i = (int)(n)-1; i >= s; i--)\n#define all(v) v.begin(), v.end()\n\nusing ll = long long;\n\nstruct dsu {\n std::vector<int> par;\n\n public:\n dsu(int n = 0) : par(n, -1) {}\n\n int leader(int x) {\n if (par[x] < 0)\n return x;\n else\n return par[x] = leader(par[x]);\n }\n\n bool same(int x, int y) { return leader(x) == leader(y); }\n\n bool merge(int x, int y) {\n x = leader(x);\n y = leader(y);\n if(x == y) return false;\n if (par[x] > par[y]) std::swap(x, y);\n par[x] += par[y];\n par[y] = x;\n return true;\n }\n\n int size(int x) {\n x = leader(x);\n return -par[x];\n }\n};\n\nint main() {\n int n, m, k;\n while (std::cin >> n >> m >> k, !(n == 0 && m == 0 && k == 0)) {\n std::vector edges(m, std::vector<int>(4));\n rep(i, 0, m) {\n std::cin >> edges[i][0] >> edges[i][1];\n edges[i][0]--;\n edges[i][1]--;\n std::cin >> edges[i][2];\n char c;\n std::cin >> c;\n edges[i][3] = c - 'A';\n }\n auto check = [&](std::vector<std::vector<int>> a, std::vector<std::vector<int>> b, int cnt) -> bool {\n dsu uf(n);\n for(auto edge: b) {\n uf.merge(edge[0], edge[1]);\n }\n int t = 0;\n for(auto edge: a) {\n int u = edge[0];\n int v = edge[1];\n if(!uf.same(u, v)) {\n t++;\n uf.merge(u, v);\n }\n }\n return t <= cnt && uf.size(0) == n;\n };\n {\n std::vector<std::vector<int>> edges_a, edges_b;\n for(auto edge: edges) {\n if(edge[3] == 0) edges_a.emplace_back(edge);\n else edges_b.emplace_back(edge);\n }\n if(!(check(edges_a, edges_b, k) && check(edges_b, edges_a, n-1-k))) {\n std::cout << \"-1\\n\";\n continue;\n }\n }\n ll ok = -200, ng = 200;\n auto f = [&](ll c) -> std::pair<ll, int> {\n std::vector ps(m, std::vector<int>(4));\n rep(i, 0, m) {\n ps[i] = edges[i];\n if (ps[i][3] == 0) ps[i][2] += c;\n }\n std::sort(all(ps), [](auto lhs, auto rhs) {\n return (lhs[2] != rhs[2]) ? lhs[2] < rhs[2] : lhs[3] < rhs[3];\n });\n dsu uf(n);\n int cnt = 0;\n ll sum = 0;\n for (auto edge : ps) {\n int u = edge[0];\n int v = edge[1];\n int w = edge[2];\n if (uf.same(u, v)) continue;\n uf.merge(u, v);\n sum += w;\n if (edge[3] == 0) cnt++;\n }\n return {sum, cnt};\n };\n while (std::abs(ok - ng) > 1) {\n ll mid = (ok + ng) / 2;\n auto [sum, cnt] = f(mid);\n if (cnt >= k) {\n ok = mid;\n } else {\n ng = mid;\n }\n }\n auto [sum, cnt] = f(ok);\n sum -= k * ok;\n std::cout << sum << '\\n';\n }\n}","accuracy":1,"time_ms":20,"memory_kb":3544,"score_of_the_acc":-0.0674,"final_rank":5},{"submission_id":"aoj_1605_7210924","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 all(x) (x).begin(), (x).end()\n\nstruct UnionFind {\n vector<int> data;\n\n UnionFind(int n) : data(n, -1) {}\n\n int find(int x) {\n if (data[x] < 0) return x;\n return data[x] = find(data[x]);\n }\n\n void unite(int x, int y) {\n x = find(x);\n y = find(y);\n if (x == y) return;\n if (data[x] > data[y]) swap(x, y);\n data[x] += data[y];\n data[y] = x;\n }\n\n bool same(int x, int y) {\n return find(x) == find(y);\n }\n};\n\ntemplate <typename T>\nvoid print(set<T>& st) {\n for (auto& i : st) cout << i << \" \";\n cout << endl;\n}\n\ntemplate <typename T, typename U>\nvoid print(pair<T, U>& p) {\n cout << \"(\" << p.first << \",\" << p.second << endl;\n}\n\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n\n while (true) {\n int n, m, k;\n cin >> n >> m >> k;\n if (n == 0) break;\n vector<tuple<int, int, int, char>> edges(m);\n set<int> unused, used;\n vector<pair<int, int>> init(m);\n rep(i,0,m) {\n int u, v, w;\n char l;\n cin >> u >> v >> w >> l;\n --u, --v;\n edges[i] = {u, v, w, l};\n init[i] = {w, i};\n }\n sort(all(init));\n\n UnionFind uf(n);\n int cnt = 0;\n for (auto [_, i] : init) {\n auto [u, v, w, l] = edges[i];\n if (l == 'A' && cnt < k && !uf.same(u, v)) {\n uf.unite(u, v);\n used.insert(i);\n ++cnt;\n } else {\n unused.insert(i);\n }\n }\n\n if (cnt < k) {\n cout << -1 << \"\\n\";\n continue;\n }\n\n auto flip = [&](int i) {\n if (used.count(i)) {\n used.erase(i);\n unused.insert(i);\n } else {\n unused.erase(i);\n used.insert(i);\n }\n };\n\n // print(used);\n\n bool ok = true;\n rep(_,0,n-k-1) {\n // print(used);\n UnionFind uf(n);\n vector<vector<pair<int, int>>> G(n);\n for (int i : used) {\n auto [u, v, w, l] = edges[i];\n uf.unite(u, v);\n G[u].push_back({v, i});\n G[v].push_back({u, i});\n }\n\n // find min source\n pair<int, int> minA(1e9, -1), minB(1e9, -1);\n for (int i : unused) {\n auto [u, v, w, l] = edges[i];\n if (!uf.same(u, v)) {\n if (l == 'A') minA = min(minA, {w, i});\n else minB = min(minB, {w, i});\n }\n }\n\n // find min AB pair\n vector<int> par(n, -1), pare(n, -1), dep(n, -1);\n\n auto dfs = [&](auto& dfs, int v) -> void {\n for (auto [c, i] : G[v]) {\n if (c == par[v]) continue;\n dep[c] = dep[v] + 1;\n par[c] = v;\n pare[c] = i;\n dfs(dfs, c);\n }\n };\n\n rep(i,0,n) {\n if (dep[i] != -1) continue;\n dep[i] = 0;\n dfs(dfs, i);\n }\n\n tuple<int, int, int> minAB(1e9, -1, -1);\n for (int i : unused) {\n auto [u, v, w, l] = edges[i];\n if (l == 'A' || !uf.same(u, v)) continue;\n pair<int, int> maxA(-1e9, -1);\n while (u != v) {\n // cout << u << \" \" << v << endl;\n if (dep[u] < dep[v]) swap(u, v);\n int e = pare[u];\n if (get<3>(edges[e]) == 'A') maxA = max(maxA, {get<2>(edges[e]), e});\n u = par[u];\n }\n auto [x, j] = maxA;\n if (j == -1) continue;\n minAB = min(minAB, {w-x, i, j});\n }\n\n // print(minA);\n // print(minB);\n\n if (minB.first <= get<0>(minAB)+minA.first) {\n auto [w, i] = minB;\n if (i == -1) {\n ok = false;\n break;\n }\n flip(i);\n } else {\n auto [w, i, j] = minAB;\n auto [x, k] = minA;\n if (i == -1 || j == -1 || k == -1) {\n ok = false;\n break;\n }\n flip(i);\n flip(j);\n flip(k);\n }\n }\n // print(used);\n if (ok) {\n ll ans = 0;\n for (int i : used) {\n ans += get<2>(edges[i]);\n }\n cout << ans << \"\\n\";\n } else {\n cout << -1 << \"\\n\";\n }\n }\n}","accuracy":1,"time_ms":40,"memory_kb":3536,"score_of_the_acc":-0.0917,"final_rank":6},{"submission_id":"aoj_1605_6775879","code_snippet":"#include <algorithm>\n#include <cassert>\n#include <cstddef>\n#include <cstdint>\n#include <iomanip>\n#include <iostream>\n#include <utility>\n#include <vector>\n\nnamespace luz {\n\n using isize = std::ptrdiff_t;\n using usize = std::size_t;\n\n using i32 = std::int32_t;\n using i64 = std::int64_t;\n using u32 = std::uint32_t;\n using u64 = std::uint64_t;\n \n} // namespace luz\n\nnamespace luz {\n\n struct rep {\n struct itr {\n usize i;\n constexpr itr(const usize i) noexcept : i(i) {}\n void operator++() noexcept { ++i; }\n constexpr usize operator*() const noexcept { return i; }\n constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }\n };\n const itr f, l;\n constexpr rep(const usize f, const usize l) noexcept\n : f(std::min(f, l)), l(l) {}\n constexpr auto begin() const noexcept { return f; }\n constexpr auto end() const noexcept { return l; }\n };\n\n struct rrep {\n struct itr {\n usize i;\n constexpr itr(const usize i) noexcept : i(i) {}\n void operator++() noexcept { --i; }\n constexpr usize operator*() const noexcept { return i; }\n constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }\n };\n const itr f, l;\n constexpr rrep(const usize f, const usize l) noexcept\n : f(l - 1), l(std::min(f, l) - 1) {}\n constexpr auto begin() const noexcept { return f; }\n constexpr auto end() const noexcept { return l; }\n };\n\n} // namespace luz\n\nnamespace luz {\n\n void set_fast_ios() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n }\n\n} // namespace luz\n\nnamespace luz {\n\n void io_set(usize precision) {\n std::cout << std::fixed << std::setprecision(precision);\n std::cerr << std::fixed << std::setprecision(precision);\n }\n\n} // namespace luz\n\nnamespace luz {\n\n template< typename T = i64 > T input() {\n T tmp;\n std::cin >> tmp;\n return tmp;\n }\n\n} // namespace luz\n\nnamespace luz {\n\n template< typename T >\n std::ostream &operator<<(std::ostream &os, std::vector< T > &vs) {\n for (usize i: rep(0, vs.size())) {\n os << vs[i] << (i + 1 != vs.size() ? \" \" : \"\");\n }\n return os;\n }\n\n template< typename T >\n std::istream &operator>>(std::istream &is, std::vector< T > &vs) {\n for (T &v: vs) {\n is >> v;\n }\n return is;\n }\n\n} // namespace luz\n\nnamespace luz {\n\n template< typename T1, typename T2 >\n std::ostream &operator<<(std::ostream &os, std::pair < T1, T2 > &p) {\n os << \"(\" << p.first << \", \" << p.second << \")\";\n return os;\n }\n\n template< typename T1, typename T2 >\n std::istream &operator>>(std::istream &is, std::pair< T1, T2 > &p) {\n is >> p.first >> p.second;\n return is;\n }\n\n} // namespace luz\n\nnamespace luz {\n\n template <typename T>\n std::vector<T> make_vector(usize a, T b) {\n return std::vector<T>(a, b);\n }\n\n template <typename... Ts>\n auto make_vector(usize a, Ts... ts) {\n return std::vector<decltype(make_vector(ts...))>(a, make_vector(ts...));\n }\n\n} // namespace luz\n\nnamespace luz {\n\n template <typename T1, typename T2>\n inline bool chmax(T1 &a, T2 b) {\n return a < b and (a = b, true);\n }\n\n template <typename T1, typename T2>\n inline bool chmin(T1 &a, T2 b) {\n return a > b and (a = b, true);\n }\n\n} // namespace luz\n\n#include <map>\n\nstruct UnionFind {\n std::vector< int > data;\n\n UnionFind() = default;\n\n explicit UnionFind(size_t sz) : data(sz, -1) {}\n\n bool unite(int x, int y) {\n x = find(x), y = find(y);\n if(x == y) return false;\n if(data[x] > data[y]) std::swap(x, y);\n data[x] += data[y];\n data[y] = x;\n return true;\n }\n\n int find(int k) {\n if(data[k] < 0) return (k);\n return data[k] = find(data[k]);\n }\n\n int size(int k) {\n return -data[find(k)];\n }\n\n bool same(int x, int y) {\n return find(x) == find(y);\n }\n};\n\nnamespace luz {\n\n void solve(usize n, usize m, usize k) {\n std::vector< usize > us(m), vs(m);\n std::vector< int > ws(m);\n std::vector< bool > ls(m);\n\n for (usize i: rep(0, m)) {\n us[i] = input() - 1;\n vs[i] = input() - 1;\n ws[i] = input();\n ls[i] = (input<char>() == 'A');\n }\n\n { // reachablility\n UnionFind uf(n);\n for (usize i: rep(0, m)) {\n uf.unite(us[i], vs[i]);\n }\n for (usize v: rep(0, n)) {\n if (uf.same(0, v)) continue;\n std::cout << -1 << std::endl;\n return;\n }\n }\n\n auto check = [&](int lambda) {\n // < <cost, is_b >, idx>\n std::vector< std::pair< std::pair<int, bool>, usize > > es;\n\n // < <cost, is_a >, idx>\n std::vector< std::pair< std::pair<int, bool>, usize > > res;\n\n for (usize i: rep(0, m)) {\n int cost = ws[i] + (ls[i] ? lambda : 0);\n es.emplace_back(std::make_pair(cost, not ls[i]), i);\n res.emplace_back(std::make_pair(cost, ls[i]), i);\n }\n\n std::sort( es.begin(), es.end());\n std::sort(res.begin(), res.end());\n\n usize cnt_a0 = 0, cnt_a1 = 0;\n int mst = 0;\n\n {\n UnionFind dsu(n);\n for (auto [_, i]: es) {\n if (dsu.same(us[i], vs[i])) continue;\n dsu.unite(us[i], vs[i]);\n cnt_a0 += ls[i];\n mst += ws[i] + (ls[i] ? lambda : 0);\n }\n }\n {\n UnionFind dsu(n);\n for (auto [_, i]: res) {\n if (dsu.same(us[i], vs[i])) continue;\n dsu.unite(us[i], vs[i]);\n cnt_a1 += ls[i];\n }\n }\n\n return std::make_pair(std::make_pair(cnt_a0, cnt_a1), mst);\n };\n\n constexpr int inf = 1001001001;\n int ans = inf;\n for (int lambda = -105; lambda <= 105; lambda++) {\n auto [cnt, mst] = check(lambda);\n if (cnt.second <= k and k <= cnt.first) {\n chmin(ans, mst - k * lambda);\n }\n }\n\n if (ans == inf) ans = -1;\n std::cout << ans << std::endl;\n }\n\n void main_() {\n usize n, m, k;\n\n while (std::cin >> n >> m >> k, n) {\n solve(n, m, k);\n }\n }\n\n} // namespace luz\n\nint main() {\n luz::set_fast_ios();\n luz::io_set(15);\n\n luz::main_();\n}","accuracy":1,"time_ms":140,"memory_kb":3344,"score_of_the_acc":-0.1977,"final_rank":9},{"submission_id":"aoj_1605_6607688","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\nusing namespace std;\n\n//constexpr long long int MOD = 1000000007;\nconstexpr long long int MOD = 998244353;\nconstexpr double EPS = 1e-8;\n\n//int N, M, K, T, H, W, L, R;\nlong long int N, M, K, T, H, W, L, R;\n\nclass UnionFind {\n\tvector<int>parent;\n\tvector<int>rank;\npublic:\n\tUnionFind(int num) {\n\t\tnum++;\n\t\tparent.resize(num);\n\t\trank.resize(num);\n\t\tfor (int i = 0; i < num; i++) {\n\t\t\tparent[i] = i;\n\t\t\trank[i] = 0;\n\t\t}\n\t}\n\tint Find(int node) {\n\t\tif (parent[node] == node)return node;\n\t\telse return parent[node] = Find(parent[node]);\n\t}\n\tvoid Unite(int u, int v) {\n\t\tu = Find(u);\n\t\tv = Find(v);\n\t\tif (u == v)return;\n\t\tif (rank[u] < rank[v])parent[u] = v;\n\t\telse {\n\t\t\tparent[v] = u;\n\t\t\tif (rank[u] == rank[v])rank[u]++;\n\t\t}\n\t}\n\tbool Check_Same(int u, int v) {\n\t\treturn Find(u) == Find(v);\n\t}\n};\n\nstruct Edge {\n\tint cost;\n\tint u, v;\n\tEdge(int cost, int u, int v) :cost(cost), u(u), v(v) {\n\n\t}\n\tbool operator<(const Edge& edge)const {\n\t\treturn cost < edge.cost;\n\t}\n};\n\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\n\twhile (cin >> N >> M >> K, N) {\n\t\tvector<int>au;\n\t\tvector<int>av;\n\t\tvector<int>aw;\n\t\tvector<int>bu;\n\t\tvector<int>bv;\n\t\tvector<int>bw;\n\t\tfor (int i = 0; i < M; i++) {\n\t\t\tint a, b, c;\n\t\t\tcin >> a >> b >> c;\n\t\t\ta--, b--;\n\t\t\tchar ab;\n\t\t\tcin >> ab;\n\t\t\tif (ab == 'A') {\n\t\t\t\tau.push_back(a);\n\t\t\t\tav.push_back(b);\n\t\t\t\taw.push_back(c);\n\t\t\t}\n\t\t\telse {\n\t\t\t\tbu.push_back(a);\n\t\t\t\tbv.push_back(b);\n\t\t\t\tbw.push_back(c);\n\t\t\t}\n\t\t}\n\t\tlong long ans = LLONG_MAX;\n\t\tfor (int i = -200; i <= 200; i++) {\n\t\t\tint score = 0;\n\t\t\tint comp = N;\n\t\t\t{\n\t\t\t\tUnionFind uf(N);\n\t\t\t\tvector<Edge>edge;\n\t\t\t\tfor (int j = 0; j < au.size(); j++) {\n\t\t\t\t\tedge.push_back(Edge(aw[j] + i, au[j], av[j]));\n\t\t\t\t}\n\t\t\t\tfor (int j = 0; j < bu.size(); j++) {\n\t\t\t\t\tedge.push_back(Edge(bw[j], -bu[j], -bv[j]));\n\t\t\t\t}\n\t\t\t\treverse(edge.begin(), edge.end());\n\t\t\t\tstable_sort(edge.begin(), edge.end());\n\t\t\t\tint num = 0;\n\t\t\t\tfor (auto j : edge) {\n\t\t\t\t\tif (uf.Check_Same(abs(j.u), abs(j.v)))continue;\n\t\t\t\t\tcomp--;\n\t\t\t\t\tuf.Unite(abs(j.u), abs(j.v));\n\t\t\t\t\tscore += j.cost;\n\t\t\t\t\tnum += j.u + j.v > 0;\n\t\t\t\t}\n\t\t\t\tL = num;\n\t\t\t}\n\t\t\t{\n\t\t\t\tUnionFind uf(N);\n\t\t\t\tvector<Edge>edge;\n\t\t\t\tfor (int j = 0; j < au.size(); j++) {\n\t\t\t\t\tedge.push_back(Edge(aw[j] + i, au[j], av[j]));\n\t\t\t\t}\n\t\t\t\tfor (int j = 0; j < bu.size(); j++) {\n\t\t\t\t\tedge.push_back(Edge(bw[j], -bu[j], -bv[j]));\n\t\t\t\t}\n\t\t\t\tstable_sort(edge.begin(), edge.end());\n\t\t\t\tint num = 0;\n\t\t\t\tfor (auto j : edge) {\n\t\t\t\t\tif (uf.Check_Same(abs(j.u), abs(j.v)))continue;\n\t\t\t\t\tuf.Unite(abs(j.u), abs(j.v));\n\t\t\t\t\tnum += j.u + j.v > 0;\n\t\t\t\t}\n\t\t\t\tR = num;\n\t\t\t}\n\t\t\tif (L > R) {\n\t\t\t\tswap(L, R);\n\t\t\t}\n\t\t\tif (comp==1&&L <= K && K <= R) {\n\t\t\t\tans = min(ans, score - i * K);\n\t\t\t}\n\t\t}\n\t\tif (ans == LLONG_MAX)ans = -1;\n\t\tcout << ans << endl;\n\t}\n}","accuracy":1,"time_ms":200,"memory_kb":3448,"score_of_the_acc":-0.283,"final_rank":11},{"submission_id":"aoj_1605_6555258","code_snippet":"#line 1 \"combinatorial_opt/test/matroid_intersection.aoj1605.test.cpp\"\n#define PROBLEM \"https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1605\"\n#line 2 \"graph/shortest_path.hpp\"\n#include <algorithm>\n#include <cassert>\n#include <deque>\n#include <fstream>\n#include <functional>\n#include <limits>\n#include <queue>\n#include <string>\n#include <utility>\n#include <vector>\n\n// CUT begin\ntemplate <typename T, T INF = std::numeric_limits<T>::max() / 2, int INVALID = -1>\nstruct ShortestPath {\n int V, E;\n bool single_positive_weight;\n T wmin, wmax;\n std::vector<std::vector<std::pair<int, T>>> to;\n\n ShortestPath(int V = 0) : V(V), E(0), single_positive_weight(true), wmin(0), wmax(0), to(V) {}\n void add_edge(int s, int t, T w) {\n assert(0 <= s and s < V);\n assert(0 <= t and t < V);\n to[s].emplace_back(t, w);\n E++;\n if (w > 0 and wmax > 0 and wmax != w) single_positive_weight = false;\n wmin = std::min(wmin, w);\n wmax = std::max(wmax, w);\n }\n\n std::vector<T> dist;\n std::vector<int> prev;\n\n // Dijkstra algorithm\n // Complexity: O(E log E)\n using Pque = std::priority_queue<std::pair<T, int>, std::vector<std::pair<T, int>>,\n std::greater<std::pair<T, int>>>;\n template <class Heap = Pque> void Dijkstra(int s) {\n assert(0 <= s and s < V);\n dist.assign(V, INF);\n dist[s] = 0;\n prev.assign(V, INVALID);\n Heap pq;\n pq.emplace(0, s);\n while (!pq.empty()) {\n T d;\n int v;\n std::tie(d, v) = pq.top();\n pq.pop();\n if (dist[v] < d) continue;\n for (auto nx : to[v]) {\n T dnx = d + nx.second;\n if (dist[nx.first] > dnx) {\n dist[nx.first] = dnx, prev[nx.first] = v;\n pq.emplace(dnx, nx.first);\n }\n }\n }\n }\n\n // Dijkstra algorithm, O(V^2 + E)\n void DijkstraVquad(int s) {\n assert(0 <= s and s < V);\n dist.assign(V, INF);\n dist[s] = 0;\n prev.assign(V, INVALID);\n std::vector<char> fixed(V, false);\n while (true) {\n int r = INVALID;\n T dr = INF;\n for (int i = 0; i < V; i++) {\n if (!fixed[i] and dist[i] < dr) r = i, dr = dist[i];\n }\n if (r == INVALID) break;\n fixed[r] = true;\n int nxt;\n T dx;\n for (auto p : to[r]) {\n std::tie(nxt, dx) = p;\n if (dist[nxt] > dist[r] + dx) dist[nxt] = dist[r] + dx, prev[nxt] = r;\n }\n }\n }\n\n // Bellman-Ford algorithm\n // Complexity: O(VE)\n bool BellmanFord(int s, int nb_loop) {\n assert(0 <= s and s < V);\n dist.assign(V, INF), prev.assign(V, INVALID);\n dist[s] = 0;\n for (int l = 0; l < nb_loop; l++) {\n bool upd = false;\n for (int v = 0; v < V; v++) {\n if (dist[v] == INF) continue;\n for (auto nx : to[v]) {\n T dnx = dist[v] + nx.second;\n if (dist[nx.first] > dnx) dist[nx.first] = dnx, prev[nx.first] = v, upd = true;\n }\n }\n if (!upd) return true;\n }\n return false;\n }\n\n // Bellman-ford algorithm using queue (deque)\n // Complexity: O(VE)\n // Requirement: no negative loop\n void SPFA(int s) {\n assert(0 <= s and s < V);\n dist.assign(V, INF);\n prev.assign(V, INVALID);\n std::deque<int> q;\n std::vector<char> in_queue(V);\n dist[s] = 0;\n q.push_back(s), in_queue[s] = 1;\n while (!q.empty()) {\n int now = q.front();\n q.pop_front(), in_queue[now] = 0;\n for (auto nx : to[now]) {\n T dnx = dist[now] + nx.second;\n int nxt = nx.first;\n if (dist[nxt] > dnx) {\n dist[nxt] = dnx;\n if (!in_queue[nxt]) {\n if (q.size() and dnx < dist[q.front()]) { // Small label first optimization\n q.push_front(nxt);\n } else {\n q.push_back(nxt);\n }\n prev[nxt] = now, in_queue[nxt] = 1;\n }\n }\n }\n }\n }\n\n void ZeroOneBFS(int s) {\n assert(0 <= s and s < V);\n dist.assign(V, INF), prev.assign(V, INVALID);\n dist[s] = 0;\n std::deque<int> que;\n que.push_back(s);\n while (!que.empty()) {\n int v = que.front();\n que.pop_front();\n for (auto nx : to[v]) {\n T dnx = dist[v] + nx.second;\n if (dist[nx.first] > dnx) {\n dist[nx.first] = dnx, prev[nx.first] = v;\n if (nx.second) {\n que.push_back(nx.first);\n } else {\n que.push_front(nx.first);\n }\n }\n }\n }\n }\n\n bool dag_solver(int s) {\n assert(0 <= s and s < V);\n std::vector<int> indeg(V, 0);\n std::queue<int> que;\n que.push(s);\n while (que.size()) {\n int now = que.front();\n que.pop();\n for (auto nx : to[now]) {\n indeg[nx.first]++;\n if (indeg[nx.first] == 1) que.push(nx.first);\n }\n }\n dist.assign(V, INF), prev.assign(V, INVALID);\n dist[s] = 0;\n que.push(s);\n while (que.size()) {\n int now = que.front();\n que.pop();\n for (auto nx : to[now]) {\n indeg[nx.first]--;\n if (dist[nx.first] > dist[now] + nx.second)\n dist[nx.first] = dist[now] + nx.second, prev[nx.first] = now;\n if (indeg[nx.first] == 0) que.push(nx.first);\n }\n }\n return *max_element(indeg.begin(), indeg.end()) == 0;\n }\n\n // Retrieve a sequence of vertex ids that represents shortest path [s, ..., goal]\n // If not reachable to goal, return {}\n std::vector<int> retrieve_path(int goal) const {\n assert(int(prev.size()) == V);\n assert(0 <= goal and goal < V);\n if (dist[goal] == INF) return {};\n std::vector<int> ret{goal};\n while (prev[goal] != INVALID) {\n goal = prev[goal];\n ret.push_back(goal);\n }\n std::reverse(ret.begin(), ret.end());\n return ret;\n }\n\n void solve(int s) {\n if (wmin >= 0) {\n if (single_positive_weight) {\n ZeroOneBFS(s);\n } else {\n if ((long long)V * V < (E << 4)) {\n DijkstraVquad(s);\n } else {\n Dijkstra(s);\n }\n }\n } else {\n BellmanFord(s, V);\n }\n }\n\n // Warshall-Floyd algorithm\n // Complexity: O(E + V^3)\n std::vector<std::vector<T>> dist2d;\n void WarshallFloyd() {\n dist2d.assign(V, std::vector<T>(V, INF));\n for (int i = 0; i < V; i++) {\n dist2d[i][i] = 0;\n for (auto p : to[i]) dist2d[i][p.first] = std::min(dist2d[i][p.first], p.second);\n }\n for (int k = 0; k < V; k++) {\n for (int i = 0; i < V; i++) {\n if (dist2d[i][k] == INF) continue;\n for (int j = 0; j < V; j++) {\n if (dist2d[k][j] == INF) continue;\n dist2d[i][j] = std::min(dist2d[i][j], dist2d[i][k] + dist2d[k][j]);\n }\n }\n }\n }\n\n void dump_graphviz(std::string filename = \"shortest_path\") const {\n std::ofstream ss(filename + \".DOT\");\n ss << \"digraph{\\n\";\n for (int i = 0; i < V; i++) {\n for (const auto &e : to[i])\n ss << i << \"->\" << e.first << \"[label=\" << e.second << \"];\\n\";\n }\n ss << \"}\\n\";\n ss.close();\n return;\n }\n};\n#line 5 \"combinatorial_opt/matroid_intersection.hpp\"\n\n// CUT begin\n// (Min weight) matroid intersection solver\n// Algorithm based on http://dopal.cs.uec.ac.jp/okamotoy/lect/2015/matroid/\n// Complexity: O(CE^2 + E^3) (C : circuit query, non-weighted)\ntemplate <class M1, class M2, class T = int>\nstd::vector<bool> MatroidIntersection(M1 matroid1, M2 matroid2, std::vector<T> weights = {}) {\n using State = std::vector<bool>;\n using Element = int;\n assert(matroid1.size() == matroid2.size());\n const int M = matroid1.size();\n\n for (auto &x : weights) x *= M + 1;\n if (weights.empty()) weights.assign(M, 0);\n\n const Element gs = M, gt = M + 1;\n State I(M);\n\n while (true) {\n ShortestPath<T> sssp(M + 2);\n matroid1.set(I);\n matroid2.set(I);\n for (int e = 0; e < M; e++) {\n if (I[e]) continue;\n auto c1 = matroid1.circuit(e), c2 = matroid2.circuit(e);\n if (c1.empty()) sssp.add_edge(e, gt, 0);\n for (Element f : c1) {\n if (f != e) sssp.add_edge(e, f, -weights[f] + 1);\n }\n if (c2.empty()) sssp.add_edge(gs, e, weights[e] + 1);\n for (Element f : c2) {\n if (f != e) sssp.add_edge(f, e, weights[e] + 1);\n }\n }\n sssp.solve(gs);\n auto aug_path = sssp.retrieve_path(gt);\n if (aug_path.empty()) break;\n for (auto e : aug_path) {\n if (e != gs and e != gt) I[e] = !I[e];\n }\n }\n return I;\n}\n#line 5 \"combinatorial_opt/matroids/graphic_matroid.hpp\"\n\n// GraphicMatroid: subgraph of undirected graphs, without loops\nclass GraphicMatroid {\n using Vertex = int;\n using Element = int;\n int M;\n int V; // # of vertices of graph\n std::vector<std::vector<std::pair<Vertex, Element>>> to;\n std::vector<std::pair<Vertex, Vertex>> edges;\n std::vector<Element> backtrack;\n std::vector<Vertex> vprev;\n std::vector<int> depth, root;\n\npublic:\n GraphicMatroid(int V, const std::vector<std::pair<Vertex, Vertex>> &edges_)\n : M(edges_.size()), V(V), to(V), edges(edges_) {\n for (int e = 0; e < int(edges_.size()); e++) {\n int u = edges_[e].first, v = edges_[e].second;\n assert(0 <= u and u < V);\n assert(0 <= v and v < V);\n if (u != v) {\n to[u].emplace_back(v, e);\n to[v].emplace_back(u, e);\n }\n }\n }\n int size() const { return M; }\n\n std::vector<Vertex> que;\n template <class State> void set(State I) {\n assert(int(I.size()) == M);\n backtrack.assign(V, -1);\n vprev.assign(V, -1);\n depth.assign(V, -1);\n root.assign(V, -1);\n que.resize(V);\n int qb = 0, qe = 0;\n for (Vertex i = 0; i < V; i++) {\n if (backtrack[i] >= 0) continue;\n que[qb = 0] = i, qe = 1, depth[i] = 0;\n while (qb < qe) {\n Vertex now = que[qb++];\n root[now] = i;\n for (auto nxt : to[now]) {\n if (depth[nxt.first] < 0 and I[nxt.second]) {\n backtrack[nxt.first] = nxt.second;\n vprev[nxt.first] = now;\n depth[nxt.first] = depth[now] + 1;\n que[qe++] = nxt.first;\n }\n }\n }\n }\n }\n\n std::vector<Element> circuit(const Element e) const {\n assert(0 <= e and e < M);\n Vertex s = edges[e].first, t = edges[e].second;\n if (root[s] != root[t]) return {};\n std::vector<Element> ret{e};\n auto step = [&](Vertex &i) { ret.push_back(backtrack[i]), i = vprev[i]; };\n int ddepth = depth[s] - depth[t];\n for (; ddepth > 0; --ddepth) step(s);\n for (; ddepth < 0; ++ddepth) step(t);\n while (s != t) step(s), step(t);\n return ret;\n }\n};\n#line 4 \"combinatorial_opt/matroids/partition_matroid.hpp\"\n\n// Partition matroid (partitional matroid) : direct sum of uniform matroids\nclass PartitionMatroid {\n using Element = int;\n int M;\n std::vector<std::vector<Element>> parts;\n std::vector<int> belong;\n std::vector<int> R;\n std::vector<int> cnt;\n std::vector<std::vector<Element>> circuits;\n\npublic:\n // parts: partition of [0, 1, ..., M - 1]\n // R: only R[i] elements from parts[i] can be chosen for each i.\n PartitionMatroid(int M, const std::vector<std::vector<int>> &parts_, const std::vector<int> &R_)\n : M(M), parts(parts_), belong(M, -1), R(R_) {\n assert(parts.size() == R.size());\n for (int i = 0; i < int(parts.size()); i++) {\n for (Element e : parts[i]) belong[e] = i;\n }\n for (Element e = 0; e < M; e++) {\n // assert(belong[e] != -1);\n if (belong[e] == -1) {\n belong[e] = parts.size();\n parts.push_back({e});\n R.push_back(1);\n }\n }\n }\n int size() const { return M; }\n\n template <class State> void set(const State &I) {\n cnt = R;\n for (int e = 0; e < M; e++) {\n if (I[e]) cnt[belong[e]]--;\n }\n circuits.assign(cnt.size(), {});\n for (int e = 0; e < M; e++) {\n if (I[e] and cnt[belong[e]] == 0) circuits[belong[e]].push_back(e);\n }\n }\n\n std::vector<Element> circuit(const Element e) const {\n assert(0 <= e and e < M);\n int p = belong[e];\n if (cnt[p] == 0) {\n auto ret = circuits[p];\n ret.push_back(e);\n return ret;\n }\n return {};\n }\n};\n#line 5 \"combinatorial_opt/test/matroid_intersection.aoj1605.test.cpp\"\n#include <iostream>\n#include <numeric>\n#line 9 \"combinatorial_opt/test/matroid_intersection.aoj1605.test.cpp\"\nusing namespace std;\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n while (true) {\n int N, M, K;\n cin >> N >> M >> K;\n if (N == 0) break;\n vector<vector<int>> partition(2);\n vector<int> R{K, N - 1 - K};\n vector<pair<int, int>> edges;\n vector<int> weights;\n for (int e = 0; e < M; ++e) {\n int u, v, w;\n char l;\n cin >> u >> v >> w >> l;\n --u, --v;\n partition[l == 'B'].push_back(e);\n edges.emplace_back(u, v);\n weights.push_back(w);\n }\n PartitionMatroid M1(edges.size(), partition, R);\n GraphicMatroid M2(N, edges);\n vector<bool> ret = MatroidIntersection(M1, M2, weights);\n int ne = accumulate(ret.begin(), ret.end(), 0);\n if (ne < N - 1) {\n cout << \"-1\\n\";\n } else {\n int sum = 0;\n for (int e = 0; e < M; ++e) sum += ret[e] * weights[e];\n cout << sum << '\\n';\n }\n }\n}","accuracy":1,"time_ms":360,"memory_kb":4072,"score_of_the_acc":-0.5446,"final_rank":16},{"submission_id":"aoj_1605_6340217","code_snippet":"#line 2 \"library/bits/stdc++.h\"\n\n// C\n#ifndef _GLIBCXX_NO_ASSERT\n#include <cassert>\n#endif\n#include <cctype>\n#include <cerrno>\n#include <cfloat>\n#include <ciso646>\n#include <climits>\n#include <clocale>\n#include <cmath>\n#include <csetjmp>\n#include <csignal>\n#include <cstdarg>\n#include <cstddef>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n\n#if __cplusplus >= 201103L\n#include <ccomplex>\n#include <cfenv>\n#include <cinttypes>\n#include <cstdbool>\n#include <cstdint>\n#include <ctgmath>\n#include <cwchar>\n#include <cwctype>\n#endif\n\n// C++\n#include <algorithm>\n#include <bitset>\n#include <complex>\n#include <deque>\n#include <exception>\n#include <fstream>\n#include <functional>\n#include <iomanip>\n#include <ios>\n#include <iosfwd>\n#include <iostream>\n#include <istream>\n#include <iterator>\n#include <limits>\n#include <list>\n#include <locale>\n#include <map>\n#include <memory>\n#include <new>\n#include <numeric>\n#include <ostream>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <stdexcept>\n#include <streambuf>\n#include <string>\n#include <typeinfo>\n#include <utility>\n#include <valarray>\n#include <vector>\n\n#if __cplusplus >= 201103L\n#include <array>\n#include <atomic>\n#include <chrono>\n#include <condition_variable>\n#include <forward_list>\n#include <future>\n#include <initializer_list>\n#include <mutex>\n#include <random>\n#include <ratio>\n#include <regex>\n#include <scoped_allocator>\n#include <system_error>\n#include <thread>\n#include <tuple>\n#include <typeindex>\n#include <type_traits>\n#include <unordered_map>\n#include <unordered_set>\n#endif\n#line 2 \"Source.cpp\"\nusing namespace std;\n\n#define REP(a, b) for (long long a = 0; a < b; ++a)\n#define ll long long\n#define ld long double\n#define ALL(x) begin(x), end(x)\n\n#line 1 \"library/atcoder/dsu.hpp\"\n\n\n\n#line 5 \"library/atcoder/dsu.hpp\"\n#include <cassert>\n#line 7 \"library/atcoder/dsu.hpp\"\n\nnamespace atcoder {\n\n// Implement (union by size) + (path compression)\n// Reference:\n// Zvi Galil and Giuseppe F. Italiano,\n// Data structures and algorithms for disjoint set union problems\nstruct dsu {\n public:\n dsu() : _n(0) {}\n explicit dsu(int n) : _n(n), parent_or_size(n, -1) {}\n\n int merge(int a, int b) {\n assert(0 <= a && a < _n);\n assert(0 <= b && b < _n);\n int x = leader(a), y = leader(b);\n if (x == y) return x;\n if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);\n parent_or_size[x] += parent_or_size[y];\n parent_or_size[y] = x;\n return x;\n }\n\n bool same(int a, int b) {\n assert(0 <= a && a < _n);\n assert(0 <= b && b < _n);\n return leader(a) == leader(b);\n }\n\n int leader(int a) {\n assert(0 <= a && a < _n);\n if (parent_or_size[a] < 0) return a;\n return parent_or_size[a] = leader(parent_or_size[a]);\n }\n\n int size(int a) {\n assert(0 <= a && a < _n);\n return -parent_or_size[leader(a)];\n }\n\n std::vector<std::vector<int>> groups() {\n std::vector<int> leader_buf(_n), group_size(_n);\n for (int i = 0; i < _n; i++) {\n leader_buf[i] = leader(i);\n group_size[leader_buf[i]]++;\n }\n std::vector<std::vector<int>> result(_n);\n for (int i = 0; i < _n; i++) {\n result[i].reserve(group_size[i]);\n }\n for (int i = 0; i < _n; i++) {\n result[leader_buf[i]].push_back(i);\n }\n result.erase(\n std::remove_if(result.begin(), result.end(),\n [&](const std::vector<int>& v) { return v.empty(); }),\n result.end());\n return result;\n }\n\n private:\n int _n;\n // root node: -1 * component size\n // otherwise: parent\n std::vector<int> parent_or_size;\n};\n\n} // namespace atcoder\n\n\n#line 10 \"Source.cpp\"\n\n#define int long long\nvoid solve()\n{\n int n, m, k;\n cin >> n >> m >> k;\n if (n == 0)\n exit(0);\n vector<tuple<int, int, int, int>> edges;\n REP(i, m)\n {\n int a, b, c;\n string d;\n cin >> a >> b >> c >> d;\n a--;\n b--;\n edges.push_back({c, a, b, d[0] - 'A'});\n }\n sort(ALL(edges));\n atcoder::dsu graph(n);\n vector<tuple<int, int, int, int>> current_edges;\n for (int i = 0; i < m; ++i)\n {\n if (graph.same(get<1>(edges[i]), get<2>(edges[i])))\n continue;\n current_edges.push_back(edges[i]);\n graph.merge(get<1>(edges[i]), get<2>(edges[i]));\n k -= 1 - get<3>(edges[i]);\n edges.erase(edges.begin() + i);\n i--;\n }\n\n REP(i, n)\n {\n if (!graph.same(i, 0))\n {\n cout << -1 << endl;\n return;\n }\n }\n while (k != 0)\n {\n tuple<int, int, int> target = make_tuple(1e18, 0, 0);\n REP(i, current_edges.size())\n {\n if (k < 0)\n {\n if (get<3>(current_edges[i]) == 1)\n continue;\n }\n else\n {\n if (get<3>(current_edges[i]) == 0)\n continue;\n }\n\n atcoder::dsu graph(n);\n REP(q, current_edges.size())\n {\n if (i == q)\n continue;\n graph.merge(get<1>(current_edges[q]), get<2>(current_edges[q]));\n }\n\n REP(q, edges.size())\n {\n if (get<3>(edges[q]) == get<3>(current_edges[i]))\n continue;\n if (graph.same(get<1>(edges[q]), get<2>(edges[q])))\n continue;\n tuple<int, int, int> now;\n get<0>(now) = get<0>(edges[q]) - get<0>(current_edges[i]);\n get<1>(now) = i;\n get<2>(now) = q;\n if (get<0>(now) < get<0>(target))\n {\n target = now;\n }\n break;\n }\n }\n if (get<0>(target) == 1e18)\n {\n cout << -1 << endl;\n return;\n }\n swap(current_edges[get<1>(target)], edges[get<2>(target)]);\n if (k > 0)\n k--;\n else\n k++;\n sort(ALL(current_edges));\n sort(ALL(edges));\n }\n int ans = 0;\n for (auto x : current_edges)\n {\n ans += get<0>(x);\n }\n cout << ans << endl;\n}\n\n#undef int\nint main()\n{\n iostream::sync_with_stdio(false);\n cout << fixed << setprecision(100);\n while (true)\n solve();\n}","accuracy":1,"time_ms":140,"memory_kb":3412,"score_of_the_acc":-0.2044,"final_rank":10},{"submission_id":"aoj_1605_6049288","code_snippet":"#include <algorithm>\n#include <array>\n#include <bitset>\n#include <cassert>\n#include <chrono>\n#include <cmath>\n#include <complex>\n#include <deque>\n#include <forward_list>\n#include <fstream>\n#include <functional>\n#include <iomanip>\n#include <ios>\n#include <iostream>\n#include <limits>\n#include <list>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <random>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <type_traits>\n#include <unordered_map>\n#include <unordered_set>\n#include <utility>\n#include <vector>\nusing namespace std;\nusing lint = long long;\nusing pint = pair<int, int>;\nusing plint = pair<lint, lint>;\nstruct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;\n#define ALL(x) (x).begin(), (x).end()\n#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)\n#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)\n#define REP(i, n) FOR(i,0,n)\n#define IREP(i, n) IFOR(i,0,n)\ntemplate <typename T, typename V>\nvoid ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }\ntemplate <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }\ntemplate <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }\ntemplate <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }\nint floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }\ntemplate <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }\ntemplate <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }\ntemplate <typename T> vector<T> sort_unique(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }\ntemplate <typename T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }\ntemplate <typename T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }\ntemplate <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }\ntemplate <typename T, size_t sz> ostream &operator<<(ostream &os, const array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }\n#if __cplusplus >= 201703L\ntemplate <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }\ntemplate <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }\n#endif\ntemplate <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << \"deq[\"; for (auto v : vec) os << v << ','; os << ']'; return os; }\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }\ntemplate <typename T, typename TH> ostream &operator<<(ostream &os, const unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }\ntemplate <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }\ntemplate <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }\ntemplate <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; }\ntemplate <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << \"=>\" << v.second << ','; os << '}'; return os; }\ntemplate <typename TK, typename TV, typename TH> ostream &operator<<(ostream &os, const unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << \"=>\" << v.second << ','; os << '}'; return os; }\n#ifdef HITONANODE_LOCAL\nconst string COLOR_RESET = \"\\033[0m\", BRIGHT_GREEN = \"\\033[1;32m\", BRIGHT_RED = \"\\033[1;31m\", BRIGHT_CYAN = \"\\033[1;36m\", NORMAL_CROSSED = \"\\033[0;9;37m\", RED_BACKGROUND = \"\\033[1;41m\", NORMAL_FAINT = \"\\033[0;2m\";\n#define dbg(x) cerr << BRIGHT_CYAN << #x << COLOR_RESET << \" = \" << (x) << NORMAL_FAINT << \" (L\" << __LINE__ << \") \" << __FILE__ << COLOR_RESET << endl\n#define dbgif(cond, x) ((cond) ? cerr << BRIGHT_CYAN << #x << COLOR_RESET << \" = \" << (x) << NORMAL_FAINT << \" (L\" << __LINE__ << \") \" << __FILE__ << COLOR_RESET << endl : cerr)\n#else\n#define dbg(x) (x)\n#define dbgif(cond, x) 0\n#endif\n\ntemplate <typename T, T INF = std::numeric_limits<T>::max() / 2, int INVALID = -1> struct ShortestPath {\n int V, E;\n bool single_positive_weight;\n T wmin, wmax;\n std::vector<std::vector<std::pair<int, T>>> to;\n\n ShortestPath(int V = 0) : V(V), E(0), single_positive_weight(true), wmin(0), wmax(0), to(V) {}\n void add_edge(int s, int t, T w) {\n assert(0 <= s and s < V);\n assert(0 <= t and t < V);\n to[s].emplace_back(t, w);\n E++;\n if (w > 0 and wmax > 0 and wmax != w) single_positive_weight = false;\n wmin = std::min(wmin, w);\n wmax = std::max(wmax, w);\n }\n\n std::vector<T> dist;\n std::vector<int> prev;\n\n // Dijkstra algorithm\n // Complexity: O(E log E)\n using Pque = std::priority_queue<std::pair<T, int>, std::vector<std::pair<T, int>>, std::greater<std::pair<T, int>>>;\n template <class Heap = Pque> void Dijkstra(int s) {\n assert(0 <= s and s < V);\n dist.assign(V, INF);\n dist[s] = 0;\n prev.assign(V, INVALID);\n Heap pq;\n pq.emplace(0, s);\n while (!pq.empty()) {\n T d;\n int v;\n std::tie(d, v) = pq.top();\n pq.pop();\n if (dist[v] < d) continue;\n for (auto nx : to[v]) {\n T dnx = d + nx.second;\n if (dist[nx.first] > dnx) {\n dist[nx.first] = dnx, prev[nx.first] = v;\n pq.emplace(dnx, nx.first);\n }\n }\n }\n }\n\n // Dijkstra algorithm, O(V^2 + E)\n void DijkstraVquad(int s) {\n assert(0 <= s and s < V);\n dist.assign(V, INF);\n dist[s] = 0;\n prev.assign(V, INVALID);\n std::vector<char> fixed(V, false);\n while (true) {\n int r = INVALID;\n T dr = INF;\n for (int i = 0; i < V; i++) {\n if (!fixed[i] and dist[i] < dr) r = i, dr = dist[i];\n }\n if (r == INVALID) break;\n fixed[r] = true;\n int nxt;\n T dx;\n for (auto p : to[r]) {\n std::tie(nxt, dx) = p;\n if (dist[nxt] > dist[r] + dx) dist[nxt] = dist[r] + dx, prev[nxt] = r;\n }\n }\n }\n\n // Bellman-Ford algorithm\n // Complexity: O(VE)\n bool BellmanFord(int s, int nb_loop) {\n assert(0 <= s and s < V);\n dist.assign(V, INF), prev.assign(V, INVALID);\n dist[s] = 0;\n for (int l = 0; l < nb_loop; l++) {\n bool upd = false;\n for (int v = 0; v < V; v++) {\n if (dist[v] == INF) continue;\n for (auto nx : to[v]) {\n T dnx = dist[v] + nx.second;\n if (dist[nx.first] > dnx) dist[nx.first] = dnx, prev[nx.first] = v, upd = true;\n }\n }\n if (!upd) return true;\n }\n return false;\n }\n\n // Bellman-ford algorithm using queue (deque)\n // Complexity: O(VE)\n // Requirement: no negative loop\n void SPFA(int s) {\n assert(0 <= s and s < V);\n dist.assign(V, INF);\n prev.assign(V, INVALID);\n std::deque<int> q;\n std::vector<char> in_queue(V);\n dist[s] = 0;\n q.push_back(s), in_queue[s] = 1;\n while (!q.empty()) {\n int now = q.front();\n q.pop_front(), in_queue[now] = 0;\n for (auto nx : to[now]) {\n T dnx = dist[now] + nx.second;\n int nxt = nx.first;\n if (dist[nxt] > dnx) {\n dist[nxt] = dnx;\n if (!in_queue[nxt]) {\n if (q.size() and dnx < dist[q.front()]) { // Small label first optimization\n q.push_front(nxt);\n } else {\n q.push_back(nxt);\n }\n prev[nxt] = now, in_queue[nxt] = 1;\n }\n }\n }\n }\n }\n\n void ZeroOneBFS(int s) {\n assert(0 <= s and s < V);\n dist.assign(V, INF), prev.assign(V, INVALID);\n dist[s] = 0;\n std::deque<int> que;\n que.push_back(s);\n while (!que.empty()) {\n int v = que.front();\n que.pop_front();\n for (auto nx : to[v]) {\n T dnx = dist[v] + nx.second;\n if (dist[nx.first] > dnx) {\n dist[nx.first] = dnx, prev[nx.first] = v;\n if (nx.second) {\n que.push_back(nx.first);\n } else {\n que.push_front(nx.first);\n }\n }\n }\n }\n }\n\n bool dag_solver(int s) {\n assert(0 <= s and s < V);\n std::vector<int> indeg(V, 0);\n std::queue<int> que;\n que.push(s);\n while (que.size()) {\n int now = que.front();\n que.pop();\n for (auto nx : to[now]) {\n indeg[nx.first]++;\n if (indeg[nx.first] == 1) que.push(nx.first);\n }\n }\n dist.assign(V, INF), prev.assign(V, INVALID);\n dist[s] = 0;\n que.push(s);\n while (que.size()) {\n int now = que.front();\n que.pop();\n for (auto nx : to[now]) {\n indeg[nx.first]--;\n if (dist[nx.first] > dist[now] + nx.second)\n dist[nx.first] = dist[now] + nx.second, prev[nx.first] = now;\n if (indeg[nx.first] == 0) que.push(nx.first);\n }\n }\n return *max_element(indeg.begin(), indeg.end()) == 0;\n }\n\n // Retrieve a sequence of vertex ids that represents shortest path [s, ..., goal]\n // If not reachable to goal, return {}\n std::vector<int> retrieve_path(int goal) const {\n assert(int(prev.size()) == V);\n assert(0 <= goal and goal < V);\n if (dist[goal] == INF) return {};\n std::vector<int> ret{goal};\n while (prev[goal] != INVALID) {\n goal = prev[goal];\n ret.push_back(goal);\n }\n std::reverse(ret.begin(), ret.end());\n return ret;\n }\n\n void solve(int s) {\n if (wmin >= 0) {\n if (single_positive_weight) {\n ZeroOneBFS(s);\n } else {\n if ((long long)V * V < (E << 4)) {\n DijkstraVquad(s);\n } else {\n Dijkstra(s);\n }\n }\n } else {\n BellmanFord(s, V);\n }\n }\n\n // Warshall-Floyd algorithm\n // Complexity: O(E + V^3)\n std::vector<std::vector<T>> dist2d;\n void WarshallFloyd() {\n dist2d.assign(V, std::vector<T>(V, INF));\n for (int i = 0; i < V; i++) {\n dist2d[i][i] = 0;\n for (auto p : to[i]) dist2d[i][p.first] = std::min(dist2d[i][p.first], p.second);\n }\n for (int k = 0; k < V; k++) {\n for (int i = 0; i < V; i++) {\n if (dist2d[i][k] == INF) continue;\n for (int j = 0; j < V; j++) {\n if (dist2d[k][j] == INF) continue;\n dist2d[i][j] = std::min(dist2d[i][j], dist2d[i][k] + dist2d[k][j]);\n }\n }\n }\n }\n\n void dump_graphviz(std::string filename = \"shortest_path\") const {\n std::ofstream ss(filename + \".DOT\");\n ss << \"digraph{\\n\";\n for (int i = 0; i < V; i++) {\n for (const auto &e : to[i]) ss << i << \"->\" << e.first << \"[label=\" << e.second << \"];\\n\";\n }\n ss << \"}\\n\";\n ss.close();\n return;\n }\n};\n\n\n// Partition matroid (partitional matroid) : direct sum of uniform matroids\nclass PartitionMatroid {\n using Element = int;\n int M;\n std::vector<std::vector<Element>> parts;\n std::vector<int> belong;\n std::vector<int> R;\n std::vector<int> cnt;\n std::vector<std::vector<Element>> circuits;\n\npublic:\n // parts: partition of [0, 1, ..., M - 1]\n // R: only R[i] elements from parts[i] can be chosen for each i.\n PartitionMatroid(int M, const std::vector<std::vector<int>> &parts_, const std::vector<int> &R_)\n : M(M), parts(parts_), belong(M, -1), R(R_) {\n assert(parts.size() == R.size());\n for (int i = 0; i < int(parts.size()); i++) {\n for (Element e : parts[i]) belong[e] = i;\n }\n for (Element e = 0; e < M; e++) {\n // assert(belong[e] != -1);\n if (belong[e] == -1) {\n belong[e] = parts.size();\n parts.push_back({e});\n R.push_back(1);\n }\n }\n }\n int size() const { return M; }\n\n template <class State> void set(const State &I) {\n cnt = R;\n for (int e = 0; e < M; e++) {\n if (I[e]) cnt[belong[e]]--;\n }\n circuits.assign(cnt.size(), {});\n for (int e = 0; e < M; e++) {\n if (I[e] and cnt[belong[e]] == 0) circuits[belong[e]].push_back(e);\n }\n }\n\n std::vector<Element> circuit(const Element e) const {\n assert(0 <= e and e < M);\n int p = belong[e];\n if (cnt[p] == 0) {\n auto ret = circuits[p];\n ret.push_back(e);\n return ret;\n }\n return {};\n }\n};\n\n// GraphicMatroid: subgraph of undirected graphs, without loops\nclass GraphicMatroid {\n using Vertex = int;\n using Element = int;\n int M;\n int V; // # of vertices of graph\n std::vector<std::vector<std::pair<Vertex, Element>>> to;\n std::vector<std::pair<Vertex, Vertex>> edges;\n std::vector<Element> backtrack;\n std::vector<Vertex> vprev;\n std::vector<int> depth, root;\n\npublic:\n GraphicMatroid(int V, const std::vector<std::pair<Vertex, Vertex>> &edges_)\n : M(edges_.size()), V(V), to(V), edges(edges_) {\n for (int e = 0; e < int(edges_.size()); e++) {\n int u = edges_[e].first, v = edges_[e].second;\n assert(0 <= u and u < V);\n assert(0 <= v and v < V);\n if (u != v) {\n to[u].emplace_back(v, e);\n to[v].emplace_back(u, e);\n }\n }\n }\n int size() const { return M; }\n\n std::vector<Vertex> que;\n template <class State> void set(State I) {\n assert(int(I.size()) == M);\n backtrack.assign(V, -1);\n vprev.assign(V, -1);\n depth.assign(V, -1);\n root.assign(V, -1);\n que.resize(V);\n int qb = 0, qe = 0;\n for (Vertex i = 0; i < V; i++) {\n if (backtrack[i] >= 0) continue;\n que[qb = 0] = i, qe = 1, depth[i] = 0;\n while (qb < qe) {\n Vertex now = que[qb++];\n root[now] = i;\n for (auto nxt : to[now]) {\n if (depth[nxt.first] < 0 and I[nxt.second]) {\n backtrack[nxt.first] = nxt.second;\n vprev[nxt.first] = now;\n depth[nxt.first] = depth[now] + 1;\n que[qe++] = nxt.first;\n }\n }\n }\n }\n }\n\n std::vector<Element> circuit(const Element e) const {\n assert(0 <= e and e < M);\n Vertex s = edges[e].first, t = edges[e].second;\n if (root[s] != root[t]) return {};\n std::vector<Element> ret{e};\n auto step = [&](Vertex &i) { ret.push_back(backtrack[i]), i = vprev[i]; };\n int ddepth = depth[s] - depth[t];\n for (; ddepth > 0; --ddepth) step(s);\n for (; ddepth < 0; ++ddepth) step(t);\n while (s != t) step(s), step(t);\n return ret;\n }\n};\n\n// (Min weight) matroid intersection solver\n// Algorithm based on http://dopal.cs.uec.ac.jp/okamotoy/lect/2015/matroid/\n// Complexity: O(CE^2 + E^3) (C : circuit query, non-weighted)\ntemplate <class M1, class M2, class T = int>\nstd::vector<bool> MatroidIntersection(M1 matroid1, M2 matroid2, std::vector<T> weights = {}) {\n using State = std::vector<bool>;\n using Element = int;\n assert(matroid1.size() == matroid2.size());\n const int M = matroid1.size();\n\n for (auto &x : weights) x *= M + 1;\n if (weights.empty()) weights.assign(M, 0);\n\n const Element gs = M, gt = M + 1;\n State I(M);\n\n while (true) {\n ShortestPath<T> sssp(M + 2);\n matroid1.set(I);\n matroid2.set(I);\n for (int e = 0; e < M; e++) {\n if (I[e]) continue;\n auto c1 = matroid1.circuit(e), c2 = matroid2.circuit(e);\n if (c1.empty()) sssp.add_edge(e, gt, 0);\n for (Element f : c1) {\n if (f != e) sssp.add_edge(e, f, -weights[f] + 1);\n }\n if (c2.empty()) sssp.add_edge(gs, e, weights[e] + 1);\n for (Element f : c2) {\n if (f != e) sssp.add_edge(f, e, weights[e] + 1);\n }\n }\n sssp.solve(gs);\n auto aug_path = sssp.retrieve_path(gt);\n if (aug_path.empty()) break;\n for (auto e : aug_path) {\n if (e != gs and e != gt) I[e] = !I[e];\n }\n }\n return I;\n}\n\n\n\nint main() {\n while (true) {\n int N, M, K;\n cin >> N >> M >> K;\n if (N == 0) break;\n vector<vector<int>> partition(2);\n vector<int> R{K, N - 1 - K};\n vector<pint> edges;\n vector<int> weights;\n REP(e, M) {\n int u, v, w;\n char l;\n cin >> u >> v >> w >> l;\n --u, --v;\n partition[l == 'B'].push_back(e);\n edges.emplace_back(u, v);\n weights.push_back(w);\n }\n PartitionMatroid M1(M, partition, R);\n GraphicMatroid M2(N, edges);\n vector<bool> ret = MatroidIntersection(M1, M2, weights);\n int ne = accumulate(ret.begin(), ret.end(), 0);\n if (ne < N - 1) {\n cout << \"-1\\n\";\n } else {\n int sum = 0;\n for (int e = 0; e < M; ++e) sum += ret[e] * weights[e];\n cout << sum << '\\n';\n }\n }\n}","accuracy":1,"time_ms":360,"memory_kb":4144,"score_of_the_acc":-0.5517,"final_rank":17},{"submission_id":"aoj_1605_6030082","code_snippet":"#include<cstdio>\n#include<queue>\n#include<set>\n#include<algorithm>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll, ll> P;\ntypedef pair<ll, P> Q;\nconstexpr ll INF = 1000000000000000LL;\nconstexpr Q QINF = Q(INF+10, P(INF, INF));\nconstexpr Q QINF2 = Q(-INF, P(INF, INF));\n\nclass UnionFind {\n vector<ll> par, rank; // par > 0: number, par < 0: -par\npublic:\n UnionFind(ll n) : par(n, 1), rank(n, 0) {}\n ll getSize(ll x) {\n return par[find(x)];\n }\n ll find(ll x) {\n if (par[x] > 0) return x;\n return -(par[x] = -find(-par[x]));\n }\n void merge(ll x, ll y) {\n x = find(x);\n y = find(y);\n if (x == y) return;\n if (rank[x] < rank[y]) {\n par[y] += par[x];\n par[x] = -y;\n } else {\n par[x] += par[y];\n par[y] = -x;\n if (rank[x] == rank[y]) rank[x]++;\n }\n }\n bool isSame(ll x, ll y) {\n return find(x) == find(y);\n }\n};\n\n\nll n, m, k, u, v, w;\nchar l[2];\nset<P> e[200];\n\nQ dfs(ll now, ll to, ll par) {\n if (now == to) return QINF2;\n for (P p : e[now]) if (p.first != par) {\n Q q = dfs(p.first, to, now);\n if (q.first != INF + 10) {\n return max(q, Q(p.second, P(now, p.first)));\n }\n }\n return QINF;\n}\n\nint main() {\n while (scanf(\"%lld%lld%lld\", &n, &m, &k), n) {\n ll ans = 0;\n vector<Q> ea, eb;\n set<Q> rest;\n for (ll i = 0; i < n; i++) e[i].clear();\n for (ll i = 0; i < m; i++) {\n scanf(\"%lld%lld%lld%s\", &u, &v, &w, l);\n if (l[0] == 'A') ea.push_back(Q(w, P(u-1, v-1)));\n else eb.push_back(Q(w, P(u-1, v-1)));\n }\n sort(ea.begin(), ea.end());\n sort(eb.begin(), eb.end());\n UnionFind uf(n);\n for (Q q : eb) {\n u = q.second.first, v = q.second.second, w = q.first;\n if (uf.isSame(u, v)) continue;\n ans += w;\n uf.merge(u, v);\n e[u].insert(P(v, w));\n e[v].insert(P(u, w));\n }\n for (Q q : ea) {\n u = q.second.first, v = q.second.second, w = q.first;\n if (uf.isSame(u, v)) {\n rest.insert(Q(w, P(u, v)));\n continue;\n }\n ans += w;\n uf.merge(u, v);\n e[u].insert(P(v, -INF));\n e[v].insert(P(u, -INF));\n k--;\n }\n if (uf.getSize(0) != n or k < 0 or k > (ll)rest.size()) {\n printf(\"-1\\n\");\n continue;\n }\n for (ll i = 0; i < k; i++) {\n ll mn = INF;\n Q result, result2;\n for (Q q : rest) {\n u = q.second.first, v = q.second.second, w = q.first;\n Q t = dfs(u, v, -1);\n if (t.first == -INF) continue;\n ll tmp = w - t.first;\n if (mn > tmp) {\n mn = tmp;\n result = q;\n result2 = t;\n }\n }\n if (mn == INF) {\n ans = -1;\n break;\n }\n ans += mn;\n u = result.second.first, v = result.second.second, w = result.first;\n e[u].insert(P(v, -INF));\n e[v].insert(P(u, -INF));\n u = result2.second.first, v = result2.second.second, w = result2.first;\n e[u].erase(P(v, w));\n e[v].erase(P(u, w));\n rest.erase(result);\n }\n printf(\"%lld\\n\", ans);\n }\n}","accuracy":1,"time_ms":160,"memory_kb":2988,"score_of_the_acc":-0.1875,"final_rank":8}],"string":"[\n {\n \"submission_id\": \"aoj_1605_10719736\",\n \"code_snippet\": \"/*\\n\\nhttps://hitonanode.github.io/cplib-cpp/combinatorial_opt/test/matroid_intersection_dijkstra.aoj1605.test.cpp\\n\\nedit by noya2\\n\\n*/\\n\\n#line 1 \\\"combinatorial_opt/test/matroid_intersection_dijkstra.aoj1605.test.cpp\\\"\\n#define PROBLEM \\\"https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1605\\\"\\n#line 2 \\\"combinatorial_opt/matroid_intersection_dijkstra.hpp\\\"\\n\\n#include <cassert>\\n#include <queue>\\n#include <vector>\\n\\n// Find maximum weight size k + 1 intersection of two matroids using Dijkstra's algorithm\\n// Return `true` iff larger intersection is found.\\n// Complexity: O(Cn + nk log n) (C: circuit query)\\ntemplate <class Matroid1, class Matroid2, class T = int>\\nbool augment_matroid_intersection_dijkstra(\\n Matroid1 &m1, // Matroid, size n, updated\\n Matroid2 &m2, // Matroid, size n, updated\\n std::vector<bool> &I, // Size k maximum weight intersection, size n, updated\\n const std::vector<T> &weight, // Weights of elements, size n\\n std::vector<T> &potential // Potential, size n + 2, updated\\n) {\\n const int n = I.size();\\n\\n assert((int)m1.size() == n);\\n assert((int)m2.size() == n);\\n assert((int)weight.size() == n);\\n assert(potential.empty() or ((int)potential.size() == n) or ((int)potential.size() == n + 2));\\n\\n m1.set(I);\\n m2.set(I);\\n\\n potential.resize(n + 2);\\n\\n auto l = [&](int e) -> T { return e < n ? (I.at(e) ? weight.at(e) : -weight.at(e)) : T(); };\\n auto edge_len = [&](int s, int t) -> T { return l(t) - potential.at(t) + potential.at(s); };\\n\\n if (false) { // 自明な追加が可能かチェック（省略してもアルゴリズムは正当）\\n int max_elem = -1;\\n for (int e = 0; e < n; ++e) {\\n if (!I.at(e) and (max_elem < 0 or weight.at(max_elem) < weight.at(e))) max_elem = e;\\n }\\n if (max_elem < 0) return false;\\n for (int e = 0; e < n; ++e) {\\n if (!I.at(e) and weight.at(e) == weight.at(max_elem) and m1.circuit(e).empty() and\\n m2.circuit(e).empty()) {\\n potential.at(e) -= l(e);\\n I.at(e) = true;\\n return true;\\n }\\n }\\n }\\n\\n // Find minimum length (& minimum num. of vertices) gs-gt path\\n const int gs = n, gt = n + 1;\\n std::vector<std::vector<int>> to(gt + 1);\\n\\n bool has_gs_edge = false, has_gt_edge = false;\\n\\n for (int e = 0; e < n; ++e) {\\n if (I.at(e)) continue;\\n\\n const auto c1 = m1.circuit(e), c2 = m2.circuit(e);\\n\\n if (c1.empty()) {\\n to.at(e).push_back(gt);\\n if (!has_gt_edge) {\\n has_gt_edge = true;\\n potential.at(gt) = potential.at(e);\\n }\\n if (T el = edge_len(e, gt); el < T()) potential.at(gt) += el;\\n }\\n for (int f : c1) {\\n if (f != e) to.at(e).push_back(f);\\n }\\n\\n if (c2.empty()) {\\n to.at(gs).push_back(e);\\n if (!has_gs_edge) {\\n has_gs_edge = true;\\n potential.at(gs) = potential.at(e) - l(e);\\n }\\n if (T el = edge_len(gs, e); el < T()) potential.at(gs) -= el;\\n }\\n for (int f : c2) {\\n if (f != e) to.at(f).push_back(e);\\n }\\n }\\n\\n if (const T e0 = potential.at(gs); e0 != T()) {\\n for (auto &p : potential) p -= e0;\\n }\\n\\n if (!has_gs_edge or !has_gt_edge) return false;\\n\\n std::vector<bool> potential_fixed(gt + 1);\\n\\n T potential_add_unfixed_es = T();\\n\\n auto fix_potential = [&](int e) -> void {\\n assert(!potential_fixed.at(e));\\n potential_fixed.at(e) = true;\\n potential.at(e) += potential_add_unfixed_es;\\n };\\n\\n std::priority_queue<std::pair<T, int>, std::vector<std::pair<T, int>>, std::greater<>> pq;\\n std::vector<T> dijkstra(gt + 1);\\n std::vector<int> prv(gt + 1, -1);\\n\\n pq.emplace(T(), gs);\\n\\n // noya2 begin\\n int many = 1001001;\\n while (!pq.empty()){\\n many--;\\n assert(many > 0);\\n auto [d, e] = pq.top(); pq.pop();\\n if (potential_fixed[e]) continue;\\n potential_fixed[e] = true;\\n for (int ne : to[e]){\\n if (potential_fixed[ne]) continue;\\n auto len = edge_len(e, ne);\\n assert(len >= T());\\n auto nd = d + len;\\n if (prv[ne] == -1 || nd < dijkstra[ne]){\\n dijkstra[ne] = nd;\\n prv[ne] = e;\\n pq.emplace(dijkstra[ne], ne);\\n }\\n }\\n }\\n for (int i = 0; i < gt+1; i++){\\n if (prv[i] == -1) continue;\\n potential[i] = dijkstra[i] + potential[i] - potential[gs];\\n }\\n\\n /*\\n\\n while (!pq.empty()) {\\n const int e = pq.top().second;\\n pq.pop();\\n if (potential_fixed.at(e)) continue;\\n if (e != gs) potential_add_unfixed_es = edge_len(prv.at(e), e);\\n\\n std::vector<std::pair<int, int>> push_cands;\\n\\n auto rec = [&](auto &&self, int cur) -> bool {\\n if (cur == gt) return true;\\n fix_potential(cur);\\n\\n for (int nxt : to.at(cur)) {\\n if (potential_fixed.at(nxt)) continue;\\n\\n const T len = edge_len(cur, nxt) - potential_add_unfixed_es;\\n // if (len < T()) std::cerr << cur << ' ' << nxt << ' ' << len << std::endl;\\n assert(len >= T());\\n\\n if (len == T()) {\\n prv.at(nxt) = cur;\\n if (self(self, nxt)) return true;\\n } else {\\n if (prv.at(nxt) == -1 or potential_add_unfixed_es + len < dijkstra.at(nxt)) {\\n dijkstra.at(nxt) = potential_add_unfixed_es + len;\\n prv.at(nxt) = cur;\\n push_cands.emplace_back(nxt, cur);\\n }\\n }\\n }\\n return false;\\n };\\n if (rec(rec, e)) break;\\n\\n for (auto [nxt, now] : push_cands) {\\n if (prv.at(nxt) == now) pq.emplace(dijkstra.at(nxt), nxt);\\n }\\n }\\n\\n for (int e = 0; e < gt + 1; ++e) {\\n if (!potential_fixed.at(e)) fix_potential(e);\\n }\\n */\\n\\n // noya2 end\\n\\n if (prv.at(gt) < 0) return false;\\n\\n prv.assign(gt + 1, -1);\\n std::queue<int> q;\\n q.push(gs);\\n\\n for (int now = q.front(); now != gt; now = q.front()) {\\n q.pop();\\n for (int nxt : to.at(now)) {\\n if (prv[nxt] == -1 && potential[now] + l(nxt) == potential[nxt]){ // noya2\\n // if (prv.at(nxt) == -1 and edge_len(now, nxt) == T()) { // noya2\\n prv.at(nxt) = now;\\n q.push(nxt);\\n }\\n }\\n }\\n\\n for (int e = prv.at(gt); e != gs; e = prv.at(e)) {\\n potential.at(e) -= l(e);\\n I.at(e) = !I.at(e);\\n }\\n\\n return true;\\n}\\n#line 3 \\\"combinatorial_opt/matroids/graphic_matroid.hpp\\\"\\n#include <utility>\\n#line 5 \\\"combinatorial_opt/matroids/graphic_matroid.hpp\\\"\\n\\n// GraphicMatroid: subgraph of undirected graphs, without loops\\nclass GraphicMatroid {\\n using Vertex = int;\\n using Element = int;\\n int M;\\n int V; // # of vertices of graph\\n std::vector<std::vector<std::pair<Vertex, Element>>> to;\\n std::vector<std::pair<Vertex, Vertex>> edges;\\n std::vector<Element> backtrack;\\n std::vector<Vertex> vprev;\\n std::vector<int> depth, root;\\n\\npublic:\\n GraphicMatroid(int V, const std::vector<std::pair<Vertex, Vertex>> &edges_)\\n : M(edges_.size()), V(V), to(V), edges(edges_) {\\n for (int e = 0; e < int(edges_.size()); e++) {\\n int u = edges_[e].first, v = edges_[e].second;\\n assert(0 <= u and u < V);\\n assert(0 <= v and v < V);\\n if (u != v) {\\n to[u].emplace_back(v, e);\\n to[v].emplace_back(u, e);\\n }\\n }\\n }\\n int size() const { return M; }\\n\\n std::vector<Vertex> que;\\n template <class State> void set(State I) {\\n assert(int(I.size()) == M);\\n backtrack.assign(V, -1);\\n vprev.assign(V, -1);\\n depth.assign(V, -1);\\n root.assign(V, -1);\\n que.resize(V);\\n int qb = 0, qe = 0;\\n for (Vertex i = 0; i < V; i++) {\\n if (backtrack[i] >= 0) continue;\\n que[qb = 0] = i, qe = 1, depth[i] = 0;\\n while (qb < qe) {\\n Vertex now = que[qb++];\\n root[now] = i;\\n for (auto nxt : to[now]) {\\n if (depth[nxt.first] < 0 and I[nxt.second]) {\\n backtrack[nxt.first] = nxt.second;\\n vprev[nxt.first] = now;\\n depth[nxt.first] = depth[now] + 1;\\n que[qe++] = nxt.first;\\n }\\n }\\n }\\n }\\n }\\n\\n std::vector<Element> circuit(const Element e) const {\\n assert(0 <= e and e < M);\\n Vertex s = edges[e].first, t = edges[e].second;\\n if (root[s] != root[t]) return {};\\n std::vector<Element> ret{e};\\n auto step = [&](Vertex &i) { ret.push_back(backtrack[i]), i = vprev[i]; };\\n int ddepth = depth[s] - depth[t];\\n for (; ddepth > 0; --ddepth) step(s);\\n for (; ddepth < 0; ++ddepth) step(t);\\n while (s != t) step(s), step(t);\\n return ret;\\n }\\n};\\n#line 4 \\\"combinatorial_opt/matroids/partition_matroid.hpp\\\"\\n\\n// Partition matroid (partitional matroid) : direct sum of uniform matroids\\nclass PartitionMatroid {\\n using Element = int;\\n int M;\\n std::vector<std::vector<Element>> parts;\\n std::vector<int> belong;\\n std::vector<int> R;\\n std::vector<int> cnt;\\n std::vector<std::vector<Element>> circuits;\\n\\npublic:\\n // parts: partition of [0, 1, ..., M - 1]\\n // R: only R[i] elements from parts[i] can be chosen for each i.\\n PartitionMatroid(int M, const std::vector<std::vector<int>> &parts_, const std::vector<int> &R_)\\n : M(M), parts(parts_), belong(M, -1), R(R_) {\\n assert(parts.size() == R.size());\\n for (int i = 0; i < int(parts.size()); i++) {\\n for (Element e : parts[i]) belong[e] = i;\\n }\\n for (Element e = 0; e < M; e++) {\\n // assert(belong[e] != -1);\\n if (belong[e] == -1) {\\n belong[e] = parts.size();\\n parts.push_back({e});\\n R.push_back(1);\\n }\\n }\\n }\\n int size() const { return M; }\\n\\n template <class State> void set(const State &I) {\\n cnt = R;\\n for (int e = 0; e < M; e++) {\\n if (I[e]) cnt[belong[e]]--;\\n }\\n circuits.assign(cnt.size(), {});\\n for (int e = 0; e < M; e++) {\\n if (I[e] and cnt[belong[e]] == 0) circuits[belong[e]].push_back(e);\\n }\\n }\\n\\n std::vector<Element> circuit(const Element e) const {\\n assert(0 <= e and e < M);\\n int p = belong[e];\\n if (cnt[p] == 0) {\\n auto ret = circuits[p];\\n ret.push_back(e);\\n return ret;\\n }\\n return {};\\n }\\n};\\n#line 5 \\\"combinatorial_opt/test/matroid_intersection_dijkstra.aoj1605.test.cpp\\\"\\n#include <iostream>\\n#include <numeric>\\n#line 9 \\\"combinatorial_opt/test/matroid_intersection_dijkstra.aoj1605.test.cpp\\\"\\nusing namespace std;\\n\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n while (true) {\\n int N, M, K;\\n cin >> N >> M >> K;\\n if (N == 0) break;\\n vector<vector<int>> partition(2);\\n vector<int> R{K, N - 1 - K};\\n vector<pair<int, int>> edges;\\n vector<int> weight;\\n for (int e = 0; e < M; ++e) {\\n int u, v, w;\\n char l;\\n cin >> u >> v >> w >> l;\\n --u, --v;\\n partition[l == 'B'].push_back(e);\\n edges.emplace_back(u, v);\\n weight.push_back(-w);\\n }\\n PartitionMatroid M1(edges.size(), partition, R);\\n GraphicMatroid M2(N, edges);\\n\\n vector<int> potential(weight.size());\\n vector<bool> ret(weight.size());\\n while (augment_matroid_intersection_dijkstra(M1, M2, ret, weight, potential)) continue;\\n int ne = accumulate(ret.begin(), ret.end(), 0);\\n if (ne < N - 1) {\\n cout << \\\"-1\\\\n\\\";\\n } else {\\n int sum = 0;\\n for (int e = 0; e < M; ++e) sum -= ret.at(e) * weight.at(e);\\n cout << sum << '\\\\n';\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 360,\n \"memory_kb\": 3744,\n \"score_of_the_acc\": -0.5122,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1605_10220901\",\n \"code_snippet\": \"// AOJ #1605 Bridge Construction Planning\\n// 2025.2.15\\n\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\nstruct DSU {\\n vector<int> parent, rank;\\n DSU(int n) : parent(n), rank(n,0) {\\n for(int i = 0; i < n; i++){\\n parent[i] = i;\\n }\\n }\\n int findp(int a) {\\n return parent[a] == a ? a : parent[a] = findp(parent[a]);\\n }\\n bool unite(int a, int b) {\\n a = findp(a), b = findp(b);\\n if(a == b) return false;\\n if(rank[a] < rank[b]) swap(a, b);\\n parent[b] = a;\\n if(rank[a] == rank[b]) rank[a]++;\\n return true;\\n }\\n};\\n \\nstruct Edge {\\n int u, v;\\n int cost;\\n bool isA;\\n int idx;\\n};\\n \\nstruct MSTResult {\\n bool valid;\\n int redCount;\\n ll origCost;\\n};\\n \\nMSTResult computeMST(int n, const vector<Edge>& edges, int lambda) {\\n int m = edges.size();\\n vector<Edge> sortedEdges = edges;\\n auto cmp = [lambda](const Edge &a, const Edge &b) {\\n int wa = a.cost + (a.isA ? lambda : 0);\\n int wb = b.cost + (b.isA ? lambda : 0);\\n if(wa != wb) return wa < wb;\\n return a.idx < b.idx;\\n };\\n sort(sortedEdges.begin(), sortedEdges.end(), cmp);\\n \\n DSU dsu(n);\\n int edgeCount = 0;\\n int redCount = 0;\\n ll sumOrig = 0;\\n for (int i = 0; i < m && edgeCount < n - 1; i++){\\n int u = sortedEdges[i].u - 1;\\n int v = sortedEdges[i].v - 1;\\n if(dsu.unite(u, v)){\\n edgeCount++;\\n sumOrig += sortedEdges[i].cost;\\n if(sortedEdges[i].isA) redCount++;\\n }\\n }\\n MSTResult res;\\n res.valid = (edgeCount == n - 1);\\n res.redCount = res.valid ? redCount : -1;\\n res.origCost = res.valid ? sumOrig : -1;\\n return res;\\n}\\n \\nint main(){\\n ios::sync_with_stdio(0);\\n cin.tie(0);\\n \\n while(true){\\n int n, m, k;\\n cin >> n >> m >> k;\\n if(n == 0) break;\\n \\n vector<Edge> edges;\\n edges.reserve(m);\\n for (int i = 0; i < m; i++){\\n int u, v, w;\\n char comp;\\n cin >> u >> v >> w >> comp;\\n Edge e;\\n e.u = u; e.v = v; e.cost = w;\\n e.isA = (comp == 'A');\\n e.idx = i;\\n edges.push_back(e);\\n }\\n \\n int lambdaLow = -1000, lambdaHigh = 1000;\\n MSTResult resLow = computeMST(n, edges, lambdaLow);\\n MSTResult resHigh = computeMST(n, edges, lambdaHigh);\\n if(!resLow.valid || !resHigh.valid){\\n cout << -1 << \\\"\\\\n\\\";\\n continue;\\n }\\n int maxRed = resLow.redCount;\\n int minRed = resHigh.redCount;\\n \\n if(k < minRed || k > maxRed){\\n cout << -1 << endl;\\n continue;\\n }\\n \\n ll best = -LLONG_MAX;\\n for (int lambda = lambdaLow; lambda <= lambdaHigh; lambda++){\\n MSTResult cur = computeMST(n, edges, lambda);\\n if(!cur.valid) continue;\\n ll candidate = cur.origCost + (ll)lambda * (cur.redCount - k);\\n best = max(best, candidate);\\n }\\n \\n cout << best << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 380,\n \"memory_kb\": 3424,\n \"score_of_the_acc\": -0.5056,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1605_10137704\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\ntemplate<typename T=int>\\nstruct Edge{\\n int from,to;\\n T weight;\\n int index;\\n Edge(int from_,int to_,T weight_=T(),int index_=-1):from(from_),to(to_),weight(weight_),index(index_){}\\n Edge():from(-1),to(-1),weight(),index(-1){}\\n friend std::ostream &operator<<(std::ostream &os,const Edge&e){\\n os<<'[';\\n os<<\\\"from:\\\"<<e.from;\\n os<<\\\"to:\\\"<<e.to;\\n os<<\\\"weight:\\\"<<e.weight;\\n os<<\\\"index:\\\"<<e.index;\\n os<<']';\\n return os;\\n }\\n};\\n#include<vector>\\ntemplate<typename T=int>\\nstruct Graph{\\nprivate:\\n int n;\\n std::vector<Edge<T>>edge;\\n std::vector<Edge<T>>g;\\n std::vector<int>ptr;\\n bool directed;\\n struct graph_range{\\n using iterator=typename std::vector<Edge<T>>::iterator;\\n iterator l,r;\\n iterator begin()const{return l;}\\n iterator end()const{return r;}\\n int size()const{return r-l;}\\n Edge<T> &operator[](int i)const{return l[i];}\\n };\\n struct const_graph_range{\\n using iterator=typename std::vector<Edge<T>>::const_iterator;\\n iterator l,r;\\n iterator begin()const{return l;}\\n iterator end()const{return r;}\\n int size()const{return r-l;}\\n const Edge<T> &operator[](int i)const{return l[i];}\\n };\\npublic:\\n Graph(int n_,bool dir_):n(n_),directed(dir_){}\\n Graph():n(0){}\\n Graph(int n_,bool dir_,const std::vector<Edge<T>>&e):n(n_),directed(dir_),edge(e){build();}\\n template<bool weighted=false,bool index=1>\\n void read(int m){\\n edge.reserve(m);\\n for(int i=0;i<m;i++){\\n int u,v;\\n std::cin>>u>>v;\\n T w;\\n if constexpr(index)u--,v--;\\n if constexpr(weighted)std::cin>>w;\\n else w=1;\\n edge.emplace_back(u,v,w,i);\\n }\\n build();\\n }\\n void add_edge(int u,int v){\\n int id=edge.size();\\n edge.emplace_back(u,v,1,id);\\n }\\n void add_edge(int u,int v,T w){\\n int id=edge.size();\\n edge.emplace_back(u,v,w,id);\\n }\\n void add_edge(int u,int v,T w,int index){\\n edge.emplace_back(u,v,w,index);\\n }\\n void build(){\\n std::vector<int>cnt(n+1,0);\\n for(const Edge<T>&e:edge){\\n cnt[e.from+1]++;\\n if(!directed)cnt[e.to+1]++;\\n }\\n for(int i=1;i<=n;i++)cnt[i]+=cnt[i-1];\\n ptr=cnt;\\n g.resize(cnt[n]);\\n for(const Edge<T>&e:edge){\\n g[cnt[e.from]++]=e;\\n if(!directed)g[cnt[e.to]++]=Edge<T>(e.to,e.from,e.weight,e.index);\\n }\\n }\\n void reverse(){\\n if(directed){\\n for(Edge<T>&e:edge)swap(e.from,e.to);\\n build();\\n }\\n }\\n inline void to_directed(){\\n directed=true;\\n build();\\n }\\n inline void to_undirected(){\\n directed=false;\\n build();\\n }\\n void reserve(int m){edge.reserve(m);}\\n graph_range operator[](int i){return graph_range{g.begin()+ptr[i],g.begin()+ptr[i+1]};}\\n const_graph_range operator[](int i)const{return const_graph_range{g.begin()+ptr[i],g.begin()+ptr[i+1]};}\\n const Edge<T>& get_edge(int i)const{return edge[i];}\\n inline bool is_directed()const{return directed;}\\n inline int size()const{return n;}\\n inline int edge_size()const{return edge.size();}\\n typename std::vector<Edge<T>>::iterator begin(){return edge.begin();}\\n typename std::vector<Edge<T>>::iterator end(){return edge.end();}\\n typename std::vector<Edge<T>>::const_iterator begin()const{return edge.begin();}\\n typename std::vector<Edge<T>>::const_iterator end()const{return edge.end();}\\n};\\nstruct GraphicMatroid{\\nprivate:\\n Graph<>g;\\n std::vector<std::pair<int,int>>pre;\\n std::vector<int>que,dst,root;\\n int p,q;\\npublic:\\n GraphicMatroid(const Graph<>&g_):g(g_),pre(g_.edge_size()),que(g_.edge_size()),dst(g_.size()),root(g_.size()){}\\n int size()const{return g.edge_size();}\\n void set(const std::vector<bool>&I){\\n std::fill(pre.begin(),pre.end(),std::make_pair(-1,-1));\\n for(int i=0;i<g.size();i++){\\n if(pre[i].first==-1){\\n for(p=q=0,que[q++]=i,dst[i]=0;p<q;){\\n int x=que[p++];\\n root[x]=i;\\n for(const Edge<>&e:g[x])if(I[e.index]&&pre[e.to].first==-1){\\n pre[e.to]=std::make_pair(e.from,e.index);\\n dst[e.to]=dst[e.from]+1;\\n que[q++]=e.to;\\n }\\n }\\n }\\n }\\n }\\n std::vector<int>circuit(int x)const{\\n const Edge<>&e=g.get_edge(x);\\n if(root[e.from]!=root[e.to])return {};\\n std::vector<int>res;\\n int u=e.from,v=e.to;\\n if(dst[u]>dst[v])std::swap(u,v);\\n while(dst[u]<dst[v])res.push_back(pre[v].second),v=pre[v].first;\\n while(u!=v){\\n res.push_back(pre[u].second),u=pre[u].first;\\n res.push_back(pre[v].second),v=pre[v].first;\\n }\\n return res;\\n }\\n};\\nstruct PartitionMatroid{\\nprivate:\\n int n;\\n std::vector<std::vector<int>>s;\\n std::vector<int>belong;\\n std::vector<int>c,c2;\\n std::vector<std::vector<int>>circuits;\\npublic:\\n PartitionMatroid(int n_,const std::vector<std::vector<int>>&s_,const std::vector<int>&c_):n(n_),s(s_),belong(n,-1),c2(c_){\\n for(int i=0;i<(int)s.size();i++){\\n for(int j:s[i])belong[j]=i;\\n }\\n for(int i=0;i<n;i++)if(belong[i]==-1){\\n belong[i]=s.size();\\n s.push_back({i});\\n c2.push_back(1);\\n }\\n circuits.resize(s.size());\\n }\\n int size()const{return n;}\\n void set(const std::vector<bool>&I){\\n c=c2;\\n for(int i=0;i<n;i++)if(I[i])c[belong[i]]--;\\n for(int i=0;i<(int)circuits.size();i++)circuits[i].clear();\\n for(int i=0;i<n;i++)if(I[i]&&c[belong[i]]==0)circuits[belong[i]].push_back(i);\\n }\\n std::vector<int>circuit(int x)const{\\n if(c[belong[x]]==0){\\n std::vector<int>res=circuits[belong[x]];\\n res.push_back(x);\\n return res;\\n }\\n return {};\\n }\\n};\\n#include<cassert>\\n#include<limits>\\n#include<numeric>\\ntemplate<typename T>\\nstd::pair<std::vector<T>,std::vector<int>>shortest_path_faster_algorithm(const Graph<T>&g,int s=0){\\n static constexpr T inf=std::numeric_limits<T>::max();\\n static constexpr T minf=std::numeric_limits<T>::min();\\n int n=g.size();\\n std::vector<T>dst(n,inf);\\n std::vector<int>pre(n,-1);\\n dst[s]=0;\\n std::vector<int>que(n+1);\\n int p=0,q=0;\\n std::vector<int>time(n,0);\\n std::vector<bool>contain(n,false);\\n que[q++]=s;\\n contain[s]=true;\\n while(p!=q){\\n int x=que[p++];\\n if(p==n+1)p=0;\\n contain[x]=false;\\n for(const Edge<T>&e:g[x]){\\n T cost=dst[x]+e.weight;\\n if(dst[e.to]>cost){\\n dst[e.to]=cost;\\n pre[e.to]=e.from;\\n if(!contain[e.to]){\\n if(++time[e.to]>=n)continue;\\n contain[e.to]=true;\\n que[q++]=e.to;\\n if(q==n+1)q=0;\\n }\\n }\\n }\\n }\\n std::fill(contain.begin(),contain.end(),false);\\n p=q=0;\\n for(int i=0;i<n;i++)for(const Edge<T>&e:g[i])if(dst[i]!=inf&&e.from==e.to&&e.weight<0)time[i]=n;\\n for(int i=0;i<n;i++)if(time[i]>=n){\\n que[q++]=i;\\n contain[i]=true;\\n }\\n while(p!=q){\\n int x=que[p++];\\n dst[x]=minf;\\n if(p==n+1)p=0;\\n for(const Edge<T>&e:g[x])if(!contain[e.to]){\\n contain[e.to]=true;\\n que[q++]=e.to;\\n if(q==n+1)q=0;\\n }\\n }\\n return std::make_pair(dst,pre);\\n}\\ntemplate<typename M1,typename M2,typename W>\\nstd::vector<bool>matroid_intersection(M1 m1,M2 m2,std::vector<W>weight={}){\\n static constexpr W inf=std::numeric_limits<W>::max();\\n assert(m1.size()==m2.size());\\n assert(weight.empty()||(int)weight.size()==m1.size());\\n int n=m1.size();\\n if(weight.empty())weight=std::vector<W>(n,0);\\n std::vector<bool>res(n,false);\\n while(true){\\n Graph<W>g(n+2,true);\\n m1.set(res),m2.set(res);\\n for(int i=0;i<n;i++)if(!res[i]){\\n std::vector<int>c1=m1.circuit(i),c2=m2.circuit(i);\\n if(c1.empty())g.add_edge(i,n+1,0);\\n for(int j:c1)if(i!=j)g.add_edge(i,j,-weight[j]*(n+1)+1);\\n if(c2.empty())g.add_edge(n,i,weight[i]*(n+1)+1);\\n for(int j:c2)if(i!=j)g.add_edge(j,i,weight[i]*(n+1)+1);\\n }\\n g.build();\\n auto [dst,pre]=shortest_path_faster_algorithm(g,n);\\n if(dst[n+1]==inf)break;\\n for(int i=pre[n+1];i!=n;i=pre[i])res[i]=!res[i];\\n }\\n return res;\\n}\\nusing namespace std;\\nint main(){\\n int n,m,k;\\n while(true){\\n cin>>n>>m>>k;\\n if(n==0)break;\\n Graph<>g(n,false);\\n vector<int>weight(m);\\n vector<vector<int>>b(2);\\n for(int i=0;i<m;i++){\\n int u,v,w;\\n char c;\\n cin>>u>>v>>w>>c;\\n u--,v--;\\n g.add_edge(u,v);\\n weight[i]=w;\\n b[c=='B'].push_back(i);\\n }\\n g.build();\\n GraphicMatroid gm(g);\\n PartitionMatroid pm(m,b,{k,n-1-k});\\n auto ans=matroid_intersection(gm,pm,weight);\\n int sum=0;\\n for(int i=0;i<m;i++)if(ans[i])sum+=weight[i],n--;\\n if(n==1)cout<<sum<<'\\\\n';\\n else cout<<\\\"-1\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 340,\n \"memory_kb\": 4804,\n \"score_of_the_acc\": -0.5919,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1605_10021837\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n// #include<atcoder/all>\\n// #include<boost/multiprecision/cpp_int.hpp>\\n\\nusing namespace std;\\n// using namespace atcoder;\\n// using bint = boost::multiprecision::cpp_int;\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing ld = long double;\\nusing P = pair<ll,ll>;\\nusing vi = vector<ll>;\\nusing vvi = vector<vi>;\\nusing vvvi = vector<vvi>;\\nusing ve = vector<vector<int>>;\\nusing vb = vector<bool>;\\nusing vvb = vector<vb>;\\n#define rep(i,n) for(ll i = 0;i < (ll)n;i++)\\n#define ALL(x) (x).begin(),(x).end()\\n#define sz(c) ((ll)(c).size())\\n#define LB(A,x) (int)(lower_bound(A.begin(),A.end(),x)-A.begin())\\n#define UB(A,x) (int)(upper_bound(A.begin(),A.end(),x)-A.begin())\\n// #define MOD 1000000007\\n#define MOD 998244353\\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\\ntemplate<typename T>ostream&operator<<(ostream&os,vector<T>&v){for(int i = 0;i < v.size();i++)os<<v[i]<<(i+1!=v.size()?\\\" \\\":\\\"\\\");return os;}\\ntemplate<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}\\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;}\\ntemplate<typename T> inline bool chmax(T &a,T b){if(a < b){a = b;return true;}return false;}\\ntemplate<typename T> inline bool chmin(T &a,T b){if(a > b){a = b;return true;}return false;}\\nld dist(ld x1,ld y1,ld x2, ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}\\n\\n// https://hitonanode.github.io/cplib-cpp/combinatorial_opt/matroids/matroid_example.hpp\\n// https://hitonanode.github.io/cplib-cpp/combinatorial_opt/matroids/graphic_matroid.hpp\\n// GraphicMatroid: subgraph of undirected graphs, without loops\\nclass GraphicMatroid{\\n using Vertex = int;\\n using Element = int;\\n int M;\\n int n; // # of vertices of graph\\n vector<vector<pair<Vertex,Element>>> to; //{行先、辺番号}\\n vector<pair<Vertex,Vertex>> edges; \\n vector<Element> backtrack;\\n vector<Vertex> vprev;\\n vector<int> dep,root;\\n\\n public:\\n GraphicMatroid(int n,const vector<pair<Vertex,Vertex>> &edges_)\\n : M(edges_.size()),n(n),to(n),edges(edges_){\\n for(int e = 0;e < int(edges_.size());e++){\\n int u = edges_[e].first,v = edges_[e].second;\\n assert(0 <= u && u < n);\\n assert(0 <= v && v < n);\\n if(u != v){\\n to[u].emplace_back(v,e);\\n to[v].emplace_back(u,e);\\n }\\n }\\n }\\n int size()const{return M;}\\n\\n vector<Vertex> que;\\n // O(size of matroid)\\n template<class State = vector<bool>> void set(State I){\\n assert(int(I.size()) == M);\\n backtrack.assign(n,-1);\\n vprev.assign(n,-1);\\n dep.assign(n,-1);\\n root.assign(n,-1);\\n que.resize(n);\\n int qb = 0,qe = 0;\\n for(Vertex i = 0;i < n;i++){\\n if(backtrack[i] >= 0)continue;\\n que[qb = 0] = i;qe = 1,dep[i] = 0;\\n while(qb < qe){\\n Vertex ov = que[qb++];\\n root[ov] = i;\\n for(auto [nv,nidx] : to[ov]){\\n if(dep[nv] < 0 && I[nidx]){\\n backtrack[nv] = nidx;\\n vprev[nv] = ov;\\n dep[nv] = dep[ov] + 1;\\n que[qe++] = nv;\\n }\\n }\\n }\\n }\\n }\\n\\n // 閉路が順番に出力されるわけではない。O(size of independent set)\\n vector<Element> circuit(const Element e)const{\\n assert(0 <= e && e < M);\\n Vertex s = edges[e].first,t = edges[e].second;\\n if(root[s] != root[t])return {};\\n vector<Element> res{e};\\n auto step = [&](Vertex &i){res.emplace_back(backtrack[i]),i = vprev[i];};\\n int dep_diff = dep[s] - dep[t];\\n for(;dep_diff > 0;--dep_diff)step(s);\\n for(;dep_diff < 0;++dep_diff)step(t);\\n while(s != t)step(s),step(t);\\n return res;\\n }\\n};\\n\\n\\n// https://hitonanode.github.io/cplib-cpp/combinatorial_opt/matroids/matroid_example.hpp\\n// https://hitonanode.github.io/cplib-cpp/combinatorial_opt/matroids/partition_matroid.hpp\\n// Partition matroid (partitional matroid) : direct sum of uniform matroids\\nclass PartitionMatroid{\\n using Element = int;\\n int M;\\n vector<vector<Element>> parts;\\n vector<int> belong;\\n vector<int> R;\\n vector<int> cnt;\\n vector<vector<Element>> circuits;\\n\\n public:\\n // parts: partition of [0, 1, ..., M - 1]\\n // R: only R[i] elements from parts[i] can be chosen for each i.\\n PartitionMatroid(int M,const vector<vector<Element>> &parts_,const vector<int> &R_)\\n : M(M),parts(parts_),belong(M,-1),R(R_) {\\n assert(parts.size() == R.size());\\n for(int i = 0;i < int(parts.size());i++){\\n for(Element e : parts[i])belong[e] = i;\\n }\\n for(Element e = 0;e < M;e++){\\n if(belong[e] == -1){\\n belong[e] = parts.size();\\n parts.push_back({e});\\n R.emplace_back(1);\\n }\\n }\\n }\\n int size() const {return M;}\\n\\n // O(size of matroid)\\n template<class State = vector<bool>>\\n void set(const State &I){\\n cnt = R;\\n for(int e = 0;e < M;e++){\\n if(I[e])cnt[belong[e]]--;\\n }\\n circuits.assign(cnt.size(),{});\\n for(int e = 0;e < M;e++){\\n if(I[e] && cnt[belong[e]] == 0)circuits[belong[e]].emplace_back(e);\\n }\\n }\\n // O(size of independent set)\\n vector<Element> circuit(const Element e)const{\\n assert(0 <= e && e < M);\\n int p = belong[e];\\n if(cnt[p] == 0){\\n auto res = circuits[p];\\n res.emplace_back(e);\\n return res;\\n }\\n return {};\\n }\\n};\\n\\n\\n\\n// https://hitonanode.github.io/cplib-cpp/combinatorial_opt/matroid_intersection.hpp.html\\n// http://dopal.cs.uec.ac.jp/okamotoy/lect/2015/matroid/\\n// ``重み付き！！！``重み付き！！！``重み付き！！！``重み付き！！！``重み付き！！！``重み付き！！！\\n// m1, m2: matroids\\n// I: independent set (will be updated if augmenting path is found)\\n// Return `true` iff augmenting path is found.\\n// Complexity: O(Cn + n^2) (C: circuit query,n:matroid台集合の要素数)\\ntemplate<class Matroid1,class Matroid2,class T = int>\\nbool matroid_intersection_augment(Matroid1 &m1,Matroid2 &m2,vector<bool> &I,const vector<T> &weights){\\n const int n = m1.size();\\n assert(m2.size() == n);\\n assert((int)I.size() == n);\\n\\n const int gs = n,gt = n+1;\\n const T INVALID = numeric_limits<T>::max();\\n vector<tuple<int,int,T>> v;\\n m1.set(I);\\n m2.set(I);\\n // 補助グラフの作成 O(nC + n^2)\\n for(int e = 0;e < n;e++){\\n if(I[e])continue;\\n auto c1 = m1.circuit(e),c2 = m2.circuit(e);\\n if(c1.empty())v.emplace_back(e,gt,T());\\n for(auto f : c1)if(f != e)v.emplace_back(e,f,-weights[f]);\\n if(c2.empty())v.emplace_back(gs,e,weights[e]);\\n for(auto f : c2)if(f != e)v.emplace_back(f,e,weights[e]);\\n }\\n // 最短経路 Bellman-ford O(n^3)\\n vector<T> dist(n+2,INVALID);\\n vector<T> prev(n+2,INVALID);\\n dist[gs] = 0;\\n for(int _ = 0;_ < n+2;_++){ // 今、頂点数は n+2\\n bool changed = false;\\n for(auto &[ov,nv,wei] : v){\\n if(dist[ov] == INVALID)continue;\\n if(dist[nv] > dist[ov] + wei){\\n dist[nv] = dist[ov] + wei;\\n prev[nv] = ov;\\n changed = true;\\n }\\n }\\n if(!changed)break;\\n }// 負閉路はそんざいしない(はず)\\n \\n // 経路復元。増加路実行\\n if(dist[gt] == INVALID)return false;\\n int now_vertex = gt;\\n while(prev[now_vertex] != INVALID){\\n now_vertex = prev[now_vertex];\\n if(now_vertex != gs && now_vertex != gt)I[now_vertex] = !I[now_vertex];\\n }\\n return true;\\n}\\n\\n// Minimum weight matroid intersection solver\\n// Complexity: O(Cn^2 + n^4) (C : circuit query)\\ntemplate <class Matroid1, class Matroid2, class T = int>\\nvector<bool> MatroidIntersection(Matroid1 matroid1,Matroid2 matroid2,vector<T> &weights){\\n const int n = matroid1.size();\\n assert(matroid2.size() == n);\\n assert(weights.size() == n);\\n \\n vector<bool> I(n);\\n while(matroid_intersection_augment(matroid1,matroid2,I,weights));\\n return I;\\n}\\nint main(){\\n \\n ios_base::sync_with_stdio(0), cin.tie(0);\\n while(1){\\n int n,m,K;cin >> n >> m >> K;\\n if(!n)break;\\n ve parts(2);\\n vector<int> R{K,n-K-1};\\n vector<pair<int,int>> edge;\\n vi weight;\\n rep(i,m){\\n int u,v,w;char l;cin >> u >> v >> w >> l;\\n u--;v--;\\n edge.emplace_back(u,v);\\n parts[l-'A'].emplace_back(i);\\n weight.emplace_back(w);\\n }\\n GraphicMatroid gm(n,edge);\\n PartitionMatroid pm(m,parts,R);\\n vb I = MatroidIntersection(gm,pm,weight);\\n int cnt = accumulate(ALL(I),0);\\n if(cnt != n-1)cout << \\\"-1\\\\n\\\";\\n else{\\n int res = 0;\\n rep(e,m)res += I[e]*weight[e];\\n cout << res << \\\"\\\\n\\\";\\n }\\n }\\n \\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 260,\n \"memory_kb\": 4988,\n \"score_of_the_acc\": -0.5101,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1605_10020829\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n// #include<atcoder/all>\\n// #include<boost/multiprecision/cpp_int.hpp>\\n\\nusing namespace std;\\n// using namespace atcoder;\\n// using bint = boost::multiprecision::cpp_int;\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing ld = long double;\\nusing P = pair<ll,ll>;\\nusing vi = vector<ll>;\\nusing vvi = vector<vi>;\\nusing vvvi = vector<vvi>;\\nusing ve = vector<vector<int>>;\\nusing vb = vector<bool>;\\nusing vvb = vector<vb>;\\n#define rep(i,n) for(ll i = 0;i < (ll)n;i++)\\n#define ALL(x) (x).begin(),(x).end()\\n#define sz(c) ((ll)(c).size())\\n#define LB(A,x) (int)(lower_bound(A.begin(),A.end(),x)-A.begin())\\n#define UB(A,x) (int)(upper_bound(A.begin(),A.end(),x)-A.begin())\\n// #define MOD 1000000007\\n#define MOD 998244353\\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\\ntemplate<typename T>ostream&operator<<(ostream&os,vector<T>&v){for(int i = 0;i < v.size();i++)os<<v[i]<<(i+1!=v.size()?\\\" \\\":\\\"\\\");return os;}\\ntemplate<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}\\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;}\\ntemplate<typename T> inline bool chmax(T &a,T b){if(a < b){a = b;return true;}return false;}\\ntemplate<typename T> inline bool chmin(T &a,T b){if(a > b){a = b;return true;}return false;}\\nld dist(ld x1,ld y1,ld x2, ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}\\n\\n// https://hitonanode.github.io/cplib-cpp/combinatorial_opt/matroids/matroid_example.hpp\\n// https://hitonanode.github.io/cplib-cpp/combinatorial_opt/matroids/graphic_matroid.hpp\\n// GraphicMatroid: subgraph of undirected graphs, without loops\\nclass GraphicMatroid{\\n using Vertex = int;\\n using Element = int;\\n int M;\\n int n; // # of vertices of graph\\n vector<vector<pair<Vertex,Element>>> to; //{行先、辺番号}\\n vector<pair<Vertex,Vertex>> edges; \\n vector<Element> backtrack;\\n vector<Vertex> vprev;\\n vector<int> dep,root;\\n\\n public:\\n GraphicMatroid(int n,const vector<pair<Vertex,Vertex>> &edges_)\\n : M(edges_.size()),n(n),to(n),edges(edges_){\\n for(int e = 0;e < int(edges_.size());e++){\\n int u = edges_[e].first,v = edges_[e].second;\\n assert(0 <= u && u < n);\\n assert(0 <= v && v < n);\\n if(u != v){\\n to[u].emplace_back(v,e);\\n to[v].emplace_back(u,e);\\n }\\n }\\n }\\n int size()const{return M;}\\n\\n vector<Vertex> que;\\n // O(size of matroid)\\n template<class State = vector<bool>> void set(State I){\\n assert(int(I.size()) == M);\\n backtrack.assign(n,-1);\\n vprev.assign(n,-1);\\n dep.assign(n,-1);\\n root.assign(n,-1);\\n que.resize(n);\\n int qb = 0,qe = 0;\\n for(Vertex i = 0;i < n;i++){\\n if(backtrack[i] >= 0)continue;\\n que[qb = 0] = i;qe = 1,dep[i] = 0;\\n while(qb < qe){\\n Vertex ov = que[qb++];\\n root[ov] = i;\\n for(auto [nv,nidx] : to[ov]){\\n if(dep[nv] < 0 && I[nidx]){\\n backtrack[nv] = nidx;\\n vprev[nv] = ov;\\n dep[nv] = dep[ov] + 1;\\n que[qe++] = nv;\\n }\\n }\\n }\\n }\\n }\\n\\n // 閉路が順番に出力されるわけではない。O(size of independent set)\\n vector<Element> circuit(const Element e)const{\\n assert(0 <= e && e < M);\\n Vertex s = edges[e].first,t = edges[e].second;\\n if(root[s] != root[t])return {};\\n vector<Element> res{e};\\n auto step = [&](Vertex &i){res.emplace_back(backtrack[i]),i = vprev[i];};\\n int dep_diff = dep[s] - dep[t];\\n for(;dep_diff > 0;--dep_diff)step(s);\\n for(;dep_diff < 0;++dep_diff)step(t);\\n while(s != t)step(s),step(t);\\n return res;\\n }\\n};\\n\\n\\n// https://hitonanode.github.io/cplib-cpp/combinatorial_opt/matroids/matroid_example.hpp\\n// https://hitonanode.github.io/cplib-cpp/combinatorial_opt/matroids/partition_matroid.hpp\\n// Partition matroid (partitional matroid) : direct sum of uniform matroids\\nclass PartitionMatroid{\\n using Element = int;\\n int M;\\n vector<vector<Element>> parts;\\n vector<int> belong;\\n vector<int> R;\\n vector<int> cnt;\\n vector<vector<Element>> circuits;\\n\\n public:\\n // parts: partition of [0, 1, ..., M - 1]\\n // R: only R[i] elements from parts[i] can be chosen for each i.\\n PartitionMatroid(int M,const vector<vector<Element>> &parts_,const vector<int> &R_)\\n : M(M),parts(parts_),belong(M,-1),R(R_) {\\n assert(parts.size() == R.size());\\n for(int i = 0;i < int(parts.size());i++){\\n for(Element e : parts[i])belong[e] = i;\\n }\\n for(Element e = 0;e < M;e++){\\n if(belong[e] == -1){\\n belong[e] = parts.size();\\n parts.push_back({e});\\n R.emplace_back(1);\\n }\\n }\\n }\\n int size() const {return M;}\\n\\n // O(size of matroid)\\n template<class State = vector<bool>>\\n void set(const State &I){\\n cnt = R;\\n for(int e = 0;e < M;e++){\\n if(I[e])cnt[belong[e]]--;\\n }\\n circuits.assign(cnt.size(),{});\\n for(int e = 0;e < M;e++){\\n if(I[e] && cnt[belong[e]] == 0)circuits[belong[e]].emplace_back(e);\\n }\\n }\\n // O(size of independent set)\\n vector<Element> circuit(const Element e)const{\\n assert(0 <= e && e < M);\\n int p = belong[e];\\n if(cnt[p] == 0){\\n auto res = circuits[p];\\n res.emplace_back(e);\\n return res;\\n }\\n return {};\\n }\\n};\\n\\n\\n// https://hitonanode.github.io/cplib-cpp/combinatorial_opt/matroid_intersection.hpp.html\\n// http://dopal.cs.uec.ac.jp/okamotoy/lect/2015/matroid/\\n// ``重み付き！！！``重み付き！！！``重み付き！！！``重み付き！！！``重み付き！！！``重み付き！！！\\n// m1, m2: matroids\\n// I: independent set (will be updated if augmenting path is found)\\n// Return `true` iff augmenting path is found.\\n// Complexity: O(Cn + n^2) (C: circuit query,n:matroid台集合の要素数)\\ntemplate<class Matroid1,class Matroid2,class T = int>\\nbool matroid_intersection_augment(Matroid1 &m1,Matroid2 &m2,vector<bool> &I,const vector<T> &weights){\\n const int n = m1.size();\\n assert(m2.size() == n);\\n assert((int)I.size() == n);\\n\\n // auto weight = [&](int e){return weights.empty() ? T() : weights[e]*(n+1);};\\n\\n const int gs = n,gt = n+1;\\n const T INVALID = numeric_limits<T>::max();\\n vector<tuple<int,int,T>> v(n+2);\\n m1.set(I);\\n m2.set(I);\\n // 補助グラフの作成 O(nC + n^2)\\n for(int e = 0;e < n;e++){\\n if(I[e])continue;\\n auto c1 = m1.circuit(e),c2 = m2.circuit(e);\\n if(c1.empty())v.emplace_back(e,gt,T());\\n for(auto f : c1)if(f != e)v.emplace_back(e,f,-weights[f]);\\n if(c2.empty())v.emplace_back(gs,e,weights[e]);\\n for(auto f : c2)if(f != e)v.emplace_back(f,e,weights[e]);\\n }\\n // 最短経路 Bellman-ford O(n^3)\\n vector<T> dist(n+2,INVALID);\\n vector<T> prev(n+2,INVALID);\\n dist[gs] = 0;\\n for(int _ = 0;_ < n+2;_++){ // 今、頂点数は n+2\\n bool changed = false;\\n for(auto &[ov,nv,wei] : v){\\n if(dist[ov] == INVALID)continue;\\n if(dist[nv] > dist[ov] + wei){\\n dist[nv] = dist[ov] + wei;\\n prev[nv] = ov;\\n changed = true;\\n }\\n }\\n if(!changed)break;\\n }// 負閉路はそんざいしない(はず)\\n \\n // 経路復元。増加路実行\\n if(dist[gt] == INVALID)return false;\\n int now_vertex = gt;\\n while(prev[now_vertex] != INVALID){\\n now_vertex = prev[now_vertex];\\n if(now_vertex != gs && now_vertex != gt)I[now_vertex] = !I[now_vertex];\\n }\\n return true;\\n}\\n\\n// Minimum weight matroid intersection solver\\n// Complexity: O(Cn^2 + n^4) (C : circuit query)\\ntemplate <class Matroid1, class Matroid2, class T = int>\\nvector<bool> MatroidIntersection(Matroid1 matroid1,Matroid2 matroid2,vector<T> &weights){\\n const int n = matroid1.size();\\n assert(matroid2.size() == n);\\n assert(weights.size() == n);\\n \\n vector<bool> I(n);\\n while(matroid_intersection_augment(matroid1,matroid2,I,weights));\\n return I;\\n}\\n\\nint main(){\\n \\n ios_base::sync_with_stdio(0), cin.tie(0);\\n while(1){\\n int n,m,K;cin >> n >> m >> K;\\n if(!n)break;\\n ve parts(2);\\n vector<int> R{K,n-K-1};\\n vector<pair<int,int>> edge;\\n vi weight;\\n rep(i,m){\\n int u,v,w;char l;cin >> u >> v >> w >> l;\\n u--;v--;\\n edge.emplace_back(u,v);\\n parts[l-'A'].emplace_back(i);\\n weight.emplace_back(w);\\n }\\n GraphicMatroid gm(n,edge);\\n PartitionMatroid pm(m,parts,R);\\n vb I = MatroidIntersection(gm,pm,weight);\\n int cnt = accumulate(ALL(I),0);\\n if(cnt != n-1)cout << \\\"-1\\\\n\\\";\\n else{\\n int res = 0;\\n rep(e,m)res += I[e]*weight[e];\\n cout << res << \\\"\\\\n\\\";\\n }\\n }\\n \\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 5000,\n \"score_of_the_acc\": -0.4488,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1605_9315926\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n#include <algorithm>\\n#include <cassert>\\n#include <vector>\\n\\nnamespace atcoder {\\n\\n// Implement (union by size) + (path compression)\\n// Reference:\\n// Zvi Galil and Giuseppe F. Italiano,\\n// Data structures and algorithms for disjoint set union problems\\nstruct dsu {\\n public:\\n dsu() : _n(0) {}\\n dsu(int n) : _n(n), parent_or_size(n, -1) {}\\n\\n int merge(int a, int b) {\\n assert(0 <= a && a < _n);\\n assert(0 <= b && b < _n);\\n int x = leader(a), y = leader(b);\\n if (x == y) return x;\\n if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);\\n parent_or_size[x] += parent_or_size[y];\\n parent_or_size[y] = x;\\n return x;\\n }\\n\\n bool same(int a, int b) {\\n assert(0 <= a && a < _n);\\n assert(0 <= b && b < _n);\\n return leader(a) == leader(b);\\n }\\n\\n int leader(int a) {\\n assert(0 <= a && a < _n);\\n if (parent_or_size[a] < 0) return a;\\n return parent_or_size[a] = leader(parent_or_size[a]);\\n }\\n\\n int size(int a) {\\n assert(0 <= a && a < _n);\\n return -parent_or_size[leader(a)];\\n }\\n\\n std::vector<std::vector<int>> groups() {\\n std::vector<int> leader_buf(_n), group_size(_n);\\n for (int i = 0; i < _n; i++) {\\n leader_buf[i] = leader(i);\\n group_size[leader_buf[i]]++;\\n }\\n std::vector<std::vector<int>> result(_n);\\n for (int i = 0; i < _n; i++) {\\n result[i].reserve(group_size[i]);\\n }\\n for (int i = 0; i < _n; i++) {\\n result[leader_buf[i]].push_back(i);\\n }\\n result.erase(\\n std::remove_if(result.begin(), result.end(),\\n [&](const std::vector<int>& v) { return v.empty(); }),\\n result.end());\\n return result;\\n }\\n\\n private:\\n int _n;\\n // root node: -1 * component size\\n // otherwise: parent\\n std::vector<int> parent_or_size;\\n};\\n\\n} // namespace atcoder\\n\\nusing namespace atcoder;\\nusing namespace std;\\n\\nusing ll = long long;\\nusing vll = vector<ll>;\\nusing vvll = vector<vll>;\\nusing vvvll = vector<vvll>;\\nusing vd = vector<double>;\\nusing vvd = vector<vd>;\\nusing vvvd = vector<vvd>;\\n#define all(A) A.begin(),A.end()\\n#define ALL(A) A.begin(),A.end()\\n#define rep(i, n) for (int i = 0; i < (int) (n); i++)\\ntemplate<class T>\\nbool chmax(T& p, T q) {\\n if (p < q) {\\n p = q; return 1;\\n }\\n return 0;\\n};\\n\\n\\nvoid solve(ll N,ll M,ll K) {\\n vector<vector<pair<ll,ll>>> GA(N),GB(N);\\n rep(i,M){\\n ll U,V,W;\\n char C;\\n cin>>U>>V>>W>>C;\\n U--;V--;\\n (C=='A'?GA:GB)[U].push_back({V,W});\\n (C=='A'?GA:GB)[V].push_back({U,W});\\n }\\n {\\n dsu dA(N),dB(N),d(N);\\n ll nA=0,nB=0;\\n rep(i,N){\\n for(auto vw:GA[i]){\\n if(!dA.same(i,vw.first))nA++;\\n d.merge(i,vw.first);\\n dA.merge(i,vw.first);\\n }\\n for(auto vw:GB[i]){\\n if(!dB.same(i,vw.first))nB++;\\n d.merge(i,vw.first);\\n dB.merge(i,vw.first);\\n }\\n }\\n if(d.size(0)!=N){\\n cout<<-1<<endl;\\n return;\\n }\\n if(nA<K){\\n cout<<-1<<endl;\\n return;\\n }\\n if(nB<N-K-1){\\n cout<<-1<<endl;\\n return;\\n }\\n }\\n\\n ll L=0,R=210;\\n while(R-L>1){\\n ll mid=(R+L)/2;\\n\\n\\n vector<pair<ll,pair<ll,pair<ll,ll>>>> E;\\n \\n rep(i,N){\\n for(auto &vw:GA[i]){\\n vw.second+=(mid-105);\\n E.push_back({vw.second,{0,{i,vw.first}}});\\n }\\n for(auto vw:GB[i]){\\n E.push_back({vw.second,{1,{i,vw.first}}});\\n }\\n }\\n sort(all(E));\\n dsu d(N);\\n ll cnt=0;\\n rep(i,E.size()){\\n ll v=E[i].second.second.first;\\n ll u=E[i].second.second.second;\\n if(d.same(u,v))continue;\\n d.merge(u,v);\\n cnt+=(E[i].second.first==0?1:0);\\n }\\n\\n if(cnt>=K){\\n L=mid;\\n }\\n else R=mid;\\n \\n rep(i,N){\\n for(auto &vw:GA[i]){\\n vw.second-=(mid-105);\\n }\\n }\\n\\n }\\n\\n ll an=0;\\n // cout<<L<<endl;\\n vector<pair<ll,pair<ll,pair<ll,ll>>>> E;\\n \\n rep(i,N){\\n for(auto &vw:GA[i]){\\n vw.second+=(L-105);\\n E.push_back({vw.second,{0,{i,vw.first}}});\\n }\\n for(auto vw:GB[i]){\\n E.push_back({vw.second,{1,{i,vw.first}}});\\n }\\n }\\n sort(all(E));\\n dsu d(N);\\n ll cnt=0;\\n rep(i,E.size()){\\n ll v=E[i].second.second.first;\\n ll u=E[i].second.second.second;\\n if(d.same(u,v))continue;\\n d.merge(u,v);\\n cnt+=E[i].first;\\n }\\n cout<<cnt-(L-105)*K<<endl;\\n}\\n\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n\\n\\n ll N,M,K;\\n while (cin >> N>>M>>K) {\\n if (N == 0)return 0;\\n solve(N,M,K);\\n }\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3492,\n \"score_of_the_acc\": -0.0498,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1605_9278152\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long;\\n\\nbool is_end = false;\\n\\nstruct UnionFind\\n{\\n int n;\\n vector<int> par;\\n \\n UnionFind() = default;\\n UnionFind(int _n) : n(_n), par(_n)\\n {\\n for (int i = 0; i < n; ++i) par[i] = i;\\n }\\n \\n int root(int x)\\n {\\n if (par[x] == x) return x;\\n else return par[x] = root(par[x]);\\n }\\n \\n bool same(int x, int y)\\n {\\n return root(x) == root(y);\\n }\\n \\n void merge(int x, int y)\\n {\\n par[root(y)] = root(x);\\n return;\\n }\\n \\n};\\n\\nvoid solve()\\n{\\n int N, M, K; cin >> N >> M >> K;\\n if (N == 0)\\n {\\n is_end = true;\\n return;\\n }\\n \\n vector<array<int, 3>> edgeA, edgeB;\\n for (int i = 0; i < M; ++i)\\n {\\n int u, v, w; cin >> u >> v >> w;\\n u--, v--;\\n char c; cin >> c;\\n \\n if (c == 'A') edgeA.push_back({w, u, v});\\n else edgeB.push_back({w, u, v});\\n }\\n sort(edgeA.begin(), edgeA.end());\\n sort(edgeB.begin(), edgeB.end());\\n \\n int A = edgeA.size(), B = edgeB.size();\\n vector<vector<tuple<int, int, int, UnionFind>>> connect(N+1, vector<tuple<int, int, int, UnionFind>>(N+1));\\n \\n const int INF = 1e9;\\n connect[0][0] = {0, 0, 0, UnionFind(N)};\\n for (int i = 0; i <= K; ++i)\\n {\\n for (int j = 0; j <= N - 1 - K; ++j)\\n {\\n if (i == 0 && j == 0) continue;\\n \\n int s = INF, a = A, b = B;\\n UnionFind uf(N);\\n \\n // A\\n if (i > 0)\\n {\\n auto [sa, ida, idb, ufa] = connect[i-1][j];\\n bool done = false;\\n for (int k = ida; k < A; ++k)\\n {\\n auto [w, u, v] = edgeA[k];\\n if (ufa.same(u, v)) continue;\\n \\n ufa.merge(u, v);\\n sa += w;\\n ida = k + 1;\\n done = true;\\n break;\\n }\\n \\n if (done)\\n {\\n if (sa < s)\\n {\\n s = sa, a = ida, b = idb;\\n uf = ufa;\\n }\\n }\\n }\\n \\n // B\\n if (j > 0)\\n {\\n auto [sb, ida, idb, ufb] = connect[i][j-1];\\n bool done = false;\\n for (int k = idb; k < B; ++k)\\n {\\n auto [w, u, v] = edgeB[k];\\n if (ufb.same(u, v)) continue;\\n \\n ufb.merge(u, v);\\n sb += w;\\n idb = k + 1;\\n done = true;\\n break;\\n }\\n \\n if (done)\\n {\\n if (sb < s)\\n {\\n s = sb, a = ida, b = idb;\\n uf = ufb;\\n }\\n }\\n }\\n \\n connect[i][j] = {s, a, b, uf};\\n }\\n }\\n \\n {\\n auto [s, a, b, uf] = connect[K][N - 1 - K];\\n if (s >= INF) cout << -1 << endl;\\n else cout << s << endl;\\n }\\n \\n return;\\n}\\n\\n\\nint main()\\n{\\n while (!is_end)\\n {\\n solve();\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 13108,\n \"score_of_the_acc\": -1.0375,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1605_8887366\",\n \"code_snippet\": \"// #line 1 \\\"library/Template/template.hpp\\\"\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);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 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){if(a<b){a=b;return 1;}return 0;}\\ntemplate<typename T>inline bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}\\ntemplate<typename T,typename U>T ceil(T x,U y){assert(y!=0); if(y<0)x=-x,y=-y; return (x>0?(x+y-1)/y:x/y);}\\ntemplate<typename T,typename U>T floor(T x,U y){assert(y!=0); if(y<0)x=-x,y=-y; return (x>0?x/y:(x-y+1)/y);}\\ntemplate<typename T>int popcnt(T x){return __builtin_popcountll(x);}\\ntemplate<typename T>int topbit(T x){return (x==0?-1:63-__builtin_clzll(x));}\\ntemplate<typename T>int lowbit(T x){return (x==0?-1:__builtin_ctzll(x));}\\n// #line 2 \\\"library/Utility/fastio.hpp\\\"\\n#include <unistd.h>\\n\\nclass FastIO {\\n static constexpr int L = 1 << 16;\\n char rdbuf[L];\\n int rdLeft = 0, rdRight = 0;\\n inline void reload() {\\n int len = rdRight - rdLeft;\\n memmove(rdbuf, rdbuf + rdLeft, len);\\n rdLeft = 0, rdRight = len;\\n rdRight += fread(rdbuf + len, 1, L - len, stdin);\\n }\\n inline bool skip() {\\n for (;;) {\\n while (rdLeft != rdRight and rdbuf[rdLeft] <= ' ')\\n rdLeft++;\\n if (rdLeft == rdRight) {\\n reload();\\n if (rdLeft == rdRight)\\n return false;\\n } else\\n break;\\n }\\n return true;\\n }\\n template <typename T, enable_if_t<is_integral<T>::value, int> = 0>\\n inline bool _read(T &x) {\\n if (!skip())\\n return false;\\n if (rdLeft + 20 >= rdRight)\\n reload();\\n bool neg = false;\\n if (rdbuf[rdLeft] == '-') {\\n neg = true;\\n rdLeft++;\\n }\\n x = 0;\\n while (rdbuf[rdLeft] >= '0' and rdLeft < rdRight) {\\n x = x * 10 +\\n (neg ? -(rdbuf[rdLeft++] ^ 48) : (rdbuf[rdLeft++] ^ 48));\\n }\\n return true;\\n }\\n inline bool _read(__int128_t &x) {\\n if (!skip())\\n return false;\\n if (rdLeft + 40 >= rdRight)\\n reload();\\n bool neg = false;\\n if (rdbuf[rdLeft] == '-') {\\n neg = true;\\n rdLeft++;\\n }\\n x = 0;\\n while (rdbuf[rdLeft] >= '0' and rdLeft < rdRight) {\\n x = x * 10 +\\n (neg ? -(rdbuf[rdLeft++] ^ 48) : (rdbuf[rdLeft++] ^ 48));\\n }\\n return true;\\n }\\n inline bool _read(__uint128_t &x) {\\n if (!skip())\\n return false;\\n if (rdLeft + 40 >= rdRight)\\n reload();\\n x = 0;\\n while (rdbuf[rdLeft] >= '0' and rdLeft < rdRight) {\\n x = x * 10 + (rdbuf[rdLeft++] ^ 48);\\n }\\n return true;\\n }\\n template <typename T, enable_if_t<is_floating_point<T>::value, int> = 0>\\n inline bool _read(T &x) {\\n if (!skip())\\n return false;\\n if (rdLeft + 20 >= rdRight)\\n reload();\\n bool neg = false;\\n if (rdbuf[rdLeft] == '-') {\\n neg = true;\\n rdLeft++;\\n }\\n x = 0;\\n while (rdbuf[rdLeft] >= '0' and rdbuf[rdLeft] <= '9' and\\n rdLeft < rdRight) {\\n x = x * 10 + (rdbuf[rdLeft++] ^ 48);\\n }\\n if (rdbuf[rdLeft] != '.')\\n return true;\\n rdLeft++;\\n T base = .1;\\n while (rdbuf[rdLeft] >= '0' and rdbuf[rdLeft] <= '9' and\\n rdLeft < rdRight) {\\n x += base * (rdbuf[rdLeft++] ^ 48);\\n base *= .1;\\n }\\n if (neg)\\n x = -x;\\n return true;\\n }\\n inline bool _read(char &x) {\\n if (!skip())\\n return false;\\n if (rdLeft + 1 >= rdRight)\\n reload();\\n x = rdbuf[rdLeft++];\\n return true;\\n }\\n inline bool _read(string &x) {\\n if (!skip())\\n return false;\\n for (;;) {\\n int pos = rdLeft;\\n while (pos < rdRight and rdbuf[pos] > ' ')\\n pos++;\\n x.append(rdbuf + rdLeft, pos - rdLeft);\\n if (rdLeft == pos)\\n break;\\n rdLeft = pos;\\n if (rdLeft == rdRight)\\n reload();\\n else\\n break;\\n }\\n return true;\\n }\\n template <typename T> inline bool _read(vector<T> &v) {\\n for (auto &x : v) {\\n if (!_read(x))\\n return false;\\n }\\n return true;\\n }\\n\\n char wtbuf[L], tmp[50];\\n int wtRight = 0;\\n inline void _write(const char &x) {\\n if (wtRight > L - 32)\\n flush();\\n wtbuf[wtRight++] = x;\\n }\\n inline void _write(const string &x) {\\n for (auto &c : x)\\n _write(c);\\n }\\n template <typename T, enable_if_t<is_integral<T>::value, int> = 0>\\n inline void _write(T x) {\\n if (wtRight > L - 32)\\n flush();\\n if (x == 0) {\\n _write('0');\\n return;\\n } else if (x < 0) {\\n _write('-');\\n if (__builtin_expect(x == std::numeric_limits<T>::min(), 0)) {\\n switch (sizeof(x)) {\\n case 2:\\n _write(\\\"32768\\\");\\n return;\\n case 4:\\n _write(\\\"2147483648\\\");\\n return;\\n case 8:\\n _write(\\\"9223372036854775808\\\");\\n return;\\n }\\n }\\n x = -x;\\n }\\n int pos = 0;\\n while (x != 0) {\\n tmp[pos++] = char((x % 10) | 48);\\n x /= 10;\\n }\\n rep(i, 0, pos) wtbuf[wtRight + i] = tmp[pos - 1 - i];\\n wtRight += pos;\\n }\\n inline void _write(__int128_t x) {\\n if (wtRight > L - 40)\\n flush();\\n if (x == 0) {\\n _write('0');\\n return;\\n } else if (x < 0) {\\n _write('-');\\n x = -x;\\n }\\n int pos = 0;\\n while (x != 0) {\\n tmp[pos++] = char((x % 10) | 48);\\n x /= 10;\\n }\\n rep(i, 0, pos) wtbuf[wtRight + i] = tmp[pos - 1 - i];\\n wtRight += pos;\\n }\\n inline void _write(__uint128_t x) {\\n if (wtRight > L - 40)\\n flush();\\n if (x == 0) {\\n _write('0');\\n return;\\n }\\n int pos = 0;\\n while (x != 0) {\\n tmp[pos++] = char((x % 10) | 48);\\n x /= 10;\\n }\\n rep(i, 0, pos) wtbuf[wtRight + i] = tmp[pos - 1 - i];\\n wtRight += pos;\\n }\\n inline void _write(double x) {\\n ostringstream oss;\\n oss << fixed << setprecision(15) << double(x);\\n string s = oss.str();\\n _write(s);\\n }\\n template <typename T> inline void _write(const vector<T> &v) {\\n rep(i, 0, v.size()) {\\n if (i)\\n _write(' ');\\n _write(v[i]);\\n }\\n }\\n\\n public:\\n FastIO() {}\\n ~FastIO() { flush(); }\\n inline void read() {}\\n template <typename Head, typename... Tail>\\n inline void read(Head &head, Tail &...tail) {\\n assert(_read(head));\\n read(tail...);\\n }\\n template <bool ln = true, bool space = false> inline void write() {\\n if (ln)\\n _write('\\\\n');\\n }\\n template <bool ln = true, bool space = false, typename Head,\\n typename... Tail>\\n inline void write(const Head &head, const Tail &...tail) {\\n if (space)\\n _write(' ');\\n _write(head);\\n write<ln, true>(tail...);\\n }\\n inline void flush() {\\n fwrite(wtbuf, 1, wtRight, stdout);\\n wtRight = 0;\\n }\\n};\\n\\n#define debug(var) do{std::cerr << #var << \\\" : \\\";view(var); cerr << '\\\\n';}while(0)\\ntemplate<typename T> void view(T e){std::cerr << e;}\\ntemplate<typename T,typename U> void view(pair<T,U> e){\\n std::cerr << '{';\\n view(e.first);\\n std::cerr << ',';\\n view(e.second);\\n std::cerr << '}';\\n}\\ntemplate <typename T, template<class> class C> void view(const C<T>& v){\\n std::cerr << \\\"[\\\";\\n for(const auto& e : v){ view(e); cerr << ','; }\\n std::cerr << \\\"]\\\";\\n}\\n\\n\\n/**\\n * @brief Fast IO\\n */\\n// #line 3 \\\"sol.cpp\\\"\\n\\nstruct GraphicMatroid{\\n using P=pair<int,int>;\\n int n;\\n vector<P> E;\\n vector<vector<P>> G;\\n vector<int> allow;\\n GraphicMatroid(){}\\n GraphicMatroid(int n,vector<P>& E):n(n),E(E),G(n){\\n rep(i,0,SZ(E)){\\n auto [u,v]=E[i];\\n G[u].push_back({v,i});\\n G[v].push_back({u,i});\\n }\\n }\\n void set(vector<int>& I){\\n allow=I;\\n }\\n vector<int> circuit(int e){\\n auto [x,y]=E[e];\\n vector<int> ret;\\n ret.push_back(e);\\n auto dfs=[&](auto& dfs,int v,int p)->bool{\\n if(v==y)return true;\\n for(auto& [to,i]:G[v])if(allow[i] and to!=p){\\n ret.push_back(i);\\n if(dfs(dfs,to,v))return true;\\n ret.pop_back();\\n }\\n return false;\\n };\\n if(dfs(dfs,x,-1))return ret;\\n else return {};\\n }\\n};\\n\\nstruct PartitionMatroid{\\n vector<int> grp; // -1:not assign\\n vector<int> lim;\\n vector<vector<int>> cnt;\\n PartitionMatroid(){}\\n PartitionMatroid(vector<int>& grp,vector<int> lim):grp(grp),lim(lim){}\\n void set(vector<int>& I){\\n cnt.assign(SZ(lim),{});\\n rep(i,0,SZ(grp))if(I[i]!=0 and grp[i]!=-1){\\n cnt[grp[i]].push_back(i);\\n }\\n }\\n vector<int> circuit(int e){\\n if(grp[e]==-1)return {};\\n if(SZ(cnt[grp[e]])+1>lim[grp[e]]){\\n vector<int> ret=cnt[grp[e]];\\n ret.push_back(e);\\n return ret;\\n }\\n else return {};\\n }\\n};\\n\\ntemplate<typename M1,typename M2,typename Val>\\npair<vector<Val>,vector<vector<int>>> MinimumMatroidIntersection(M1& m1,M2& m2,vector<Val>& ws){\\n using P=pair<Val,int>;\\n int n=SZ(ws);\\n \\n vector<Val> ret1;\\n vector<vector<int>> ret2;\\n \\n Val profit=0;\\n vector<int> I(n);\\n ret1.push_back(profit);\\n ret2.push_back(I);\\n \\n for(;;){\\n vector G(n+2,vector<P>());\\n int S=n,T=n+1;\\n m1.set(I);\\n m2.set(I);\\n \\n rep(e,0,n){\\n if(I[e])continue;\\n auto c1=m1.circuit(e);\\n if(c1.empty())G[S].push_back({ws[e]*(n+1)+1,e});\\n else for(auto& to:c1)if(e!=to){\\n G[to].push_back({ws[e]*(n+1)+1,e});\\n }\\n auto c2=m2.circuit(e);\\n if(c2.empty())G[e].push_back({Val(0),T});\\n else for(auto& to:c2)if(e!=to){\\n G[e].push_back({-ws[to]*(n+1)+1,to});\\n }\\n }\\n \\n vector<ll> dist(n+2,INF);\\n dist[S]=0;\\n vector<int> pre(n+2,-1);\\n for(;;){\\n bool upd=0;\\n rep(v,0,n+2)for(auto& [cost,to]:G[v]){\\n if(chmin(dist[to],dist[v]+cost)){\\n pre[to]=v;\\n upd=1;\\n }\\n }\\n if(!upd)break;\\n }\\n \\n if(dist[T]==INF)break;\\n int cur=T;\\n while(cur!=S){\\n cur=pre[cur];\\n if(cur!=S){\\n I[cur]^=1;\\n if(I[cur])profit+=ws[cur];\\n else profit-=ws[cur];\\n }\\n }\\n ret1.push_back(profit);\\n ret2.push_back(I);\\n \\n // debug(profit);\\n // debug(I);\\n }\\n return {ret1,ret2};\\n}\\n\\n\\nFastIO io;\\nint main(){\\n for(;;){\\n int n,m,k;\\n io.read(n,m,k);\\n if(n==0)break;\\n using P=pair<int,int>;\\n vector<P> E;\\n vector<ll> ws(m);\\n vector<int> grp(m),lim={k,n-1-k};\\n rep(i,0,m){\\n int u,v,w;\\n char c;\\n io.read(u,v,w,c);\\n u--; v--;\\n E.push_back({u,v});\\n ws[i]=w;\\n if(c=='A')grp[i]=0;\\n else grp[i]=1;\\n }\\n \\n GraphicMatroid m1(n,E);\\n PartitionMatroid m2(grp,lim);\\n \\n auto [ret,tmp]=MinimumMatroidIntersection(m1,m2,ws);\\n if(SZ(ret)==n)io.write(ret.back());\\n else io.write(-1);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 810,\n \"memory_kb\": 4904,\n \"score_of_the_acc\": -1.1893,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1605_8304590\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define rep(i, n) for (int i = 0; i < (n); i++)\\n#define per(i, n) for (int i = (n)-1; i >= 0; i--)\\n#define rep2(i, l, r) for (int i = (l); i < (r); i++)\\n#define per2(i, l, r) for (int i = (r)-1; i >= (l); i--)\\n#define each(e, x) for (auto &e : x)\\n#define sz(x) (int)x.size()\\n#define all(x) begin(x), end(x)\\n#define pb push_back\\n#define eb emplace_back\\n#define MM << ' ' <<\\n#define TT template <typename T>\\nusing ll = long long;\\nusing pii = pair<int, int>;\\nusing pll = pair<ll, ll>;\\n\\nconst int inf = (1 << 30) - 1;\\n\\nTT bool chmin(T &x, T y) { return x > y ? (x = y, true) : false; }\\nTT bool chmax(T &x, T y) { return x < y ? (x = y, true) : false; }\\n\\nint main() {\\n while (true) {\\n int N, M, K;\\n cin >> N >> M >> K;\\n\\n if (N == 0) break;\\n\\n vector<int> r(N, -1);\\n\\n auto root = [&](auto &&root, int v) -> int {\\n if (r[v] == -1) return v;\\n return r[v] = root(root, r[v]);\\n };\\n\\n auto unite = [&](int u, int v) {\\n u = root(root, u), v = root(root, v);\\n if (u == v) return false;\\n r[v] = u;\\n return true;\\n };\\n\\n vector<tuple<int, int, int, char>> es;\\n\\n rep(i, M) {\\n int u, v, w;\\n char c;\\n cin >> u >> v >> w >> c;\\n u--, v--;\\n es.eb(w, u, v, c);\\n }\\n\\n sort(all(es));\\n\\n int l1 = 0, l2 = 0;\\n int ans = 0;\\n\\n vector<bool> used(M, false);\\n\\n rep(i, M) {\\n auto [w, u, v, c] = es[i];\\n if (unite(u, v)) {\\n ans += w;\\n if (c == 'A') l1++;\\n if (c == 'B') l2++;\\n used[i] = true;\\n }\\n }\\n\\n // cout << l1 MM l2 << endl;\\n\\n if (l1 + l2 != N - 1) {\\n cout << \\\"-1\\\\n\\\";\\n continue;\\n }\\n\\n // cout << N MM M MM K << endl;\\n\\n while (l1 != K) {\\n vector<vector<tuple<int, int, int, int>>> li(N);\\n rep(i, M) {\\n if (!used[i]) continue;\\n auto [w, u, v, c] = es[i];\\n li[u].eb(v, c, w, i);\\n li[v].eb(u, c, w, i);\\n }\\n\\n vector<int> d(N, inf);\\n vector<tuple<int, int, int, int>> pre(N);\\n queue<int> que;\\n que.emplace(0);\\n d[0] = 0;\\n while (!empty(que)) {\\n int i = que.front();\\n que.pop();\\n for (auto [j, c, w, id] : li[i]) {\\n if (chmin(d[j], d[i] + 1)) {\\n pre[j] = make_tuple(i, c, w, id);\\n que.emplace(j);\\n }\\n }\\n }\\n\\n char x = (l1 < K ? 'A' : 'B');\\n int mi = inf;\\n pii P{-1, -1};\\n\\n rep(i, M) {\\n auto [w, u, v, c] = es[i];\\n if (used[i] || c != x) continue;\\n int ma = -inf, ma_id = -1;\\n while (u != v) {\\n if (d[u] < d[v]) swap(u, v);\\n auto [p, c, w, id] = pre[u];\\n if (c != x && chmax(ma, w)) {\\n ma_id = id; //\\n }\\n u = p;\\n }\\n if (chmin(mi, w - ma)) {\\n P = {i, ma_id}; //\\n }\\n }\\n\\n if (mi == inf) {\\n ans = -1;\\n break;\\n }\\n\\n ans += mi;\\n used[P.first] = true;\\n used[P.second] = false;\\n if (l1 < K) l1++;\\n if (l1 > K) l1--;\\n }\\n\\n cout << ans << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3396,\n \"score_of_the_acc\": -0.0653,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1605_8023450\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<algorithm>\\n#include<cassert>\\nusing namespace std;\\nstruct UF{\\n\\tvector<int>pr;\\n\\tUF(int n):pr(n,-1){}\\n\\tint find(int u)\\n\\t{\\n\\t\\tif(pr[u]>=0)return pr[u]=find(pr[u]);\\n\\t\\treturn u;\\n\\t}\\n\\tbool merge(int u,int v)\\n\\t{\\n\\t\\tu=find(u);\\n\\t\\tv=find(v);\\n\\t\\tif(u==v)return false;\\n\\t\\tif(-pr[u]<-pr[v])swap(u,v);\\n\\t\\tpr[u]+=pr[v];\\n\\t\\tpr[v]=u;\\n\\t\\treturn true;\\n\\t}\\n};\\nstruct edge{\\n\\tint u,v,w;\\n\\tbool operator<(const edge&rhs)const{return w<rhs.w;}\\n};\\nostream&operator<<(ostream&os,const edge&e)\\n{\\n\\treturn os<<\\\"(\\\"<<e.u+1<<\\\", \\\"<<e.v+1<<\\\", \\\"<<e.w<<\\\")\\\";\\n}\\nint N,M,K;\\nvector<edge>A,B;\\nvector<edge>f(vector<edge>E)\\n{\\n\\tUF uf(N);\\n\\tvector<edge>ret;\\n\\tsort(E.begin(),E.end());\\n\\tfor(edge e:E)\\n\\t{\\n\\t\\tif(uf.merge(e.u,e.v))ret.push_back(e);\\n\\t}\\n\\treturn ret;\\n}\\nint main()\\n{\\n\\twhile(cin>>N>>M>>K,N)\\n\\t{\\n\\t\\tA.clear();\\n\\t\\tB.clear();\\n\\t\\tfor(int i=0;i<M;i++)\\n\\t\\t{\\n\\t\\t\\tedge E;\\n\\t\\t\\tcin>>E.u>>E.v>>E.w;\\n\\t\\t\\tE.u--,E.v--;\\n\\t\\t\\tchar l;\\n\\t\\t\\tcin>>l;\\n\\t\\t\\tif(l=='A')A.push_back(E);\\n\\t\\t\\telse B.push_back(E);\\n\\t\\t}\\n\\t\\tA=f(A);\\n\\t\\tB=f(B);\\n\\t\\tvector<edge>useA,restA;\\n\\t\\t{\\n\\t\\t\\tUF uf(N);\\n\\t\\t\\tfor(edge e:B)uf.merge(e.u,e.v);\\n\\t\\t\\tfor(edge e:A)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif(uf.merge(e.u,e.v))\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tuseA.push_back(e);\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse restA.push_back(e);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tint cnt=K-(int)useA.size();\\n\\t\\tif(cnt<0||cnt>restA.size())\\n\\t\\t{\\n\\t\\t\\tcout<<-1<<endl;\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tfor(int t=0;t<cnt;t++)\\n\\t\\t{\\n\\t\\t\\tUF uf(N);\\n\\t\\t\\tfor(edge e:useA)assert(uf.merge(e.u,e.v));\\n\\t\\t\\t/*\\n\\t\\t\\tint ALL=0;\\n\\t\\t\\tUF ALLuf=uf;\\n\\t\\t\\tfor(edge e:B)if(ALLuf.merge(e.u,e.v))ALL+=e.w;\\n\\t\\t\\t*/\\n\\t\\t\\tint MN=1e9,MNi;\\n\\t\\t\\tfor(int i=0;i<restA.size();i++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tUF NOWuf=uf;\\n\\t\\t\\t\\tassert(NOWuf.merge(restA[i].u,restA[i].v));\\n\\t\\t\\t\\tint now=restA[i].w;\\n\\t\\t\\t\\tfor(edge e:B)if(NOWuf.merge(e.u,e.v))now+=e.w;\\n\\t\\t\\t\\tif(MN>now)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tMN=now;\\n\\t\\t\\t\\t\\tMNi=i;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tuseA.push_back(restA[MNi]);\\n\\t\\t\\trestA.erase(restA.begin()+MNi);\\n\\t\\t}\\n\\t\\tassert(useA.size()==K);\\n\\t\\tUF uf(N);\\n\\t\\tfor(edge e:useA)assert(uf.merge(e.u,e.v));\\n\\t\\tfor(edge e:B)if(uf.merge(e.u,e.v))\\n\\t\\t{\\n\\t\\t\\tuseA.push_back(e);\\n\\t\\t\\t//cout<<e<<\\\" from B\\\\n\\\";\\n\\t\\t}\\n\\t\\tif(useA.size()<N-1)\\n\\t\\t{\\n\\t\\t\\tcout<<-1<<endl;\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tassert(useA.size()==N-1);\\n\\t\\tint ans=0;\\n\\t\\tfor(edge e:useA)ans+=e.w;\\n\\t\\tcout<<ans<<endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3484,\n \"score_of_the_acc\": -0.1115,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1605_7967277\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nnamespace luz {\\n\\n using usize = std::size_t;\\n using isize = std::ptrdiff_t;\\n\\n struct rep {\\n struct itr {\\n usize i;\\n constexpr itr(const usize i) noexcept: i(i) {}\\n void operator++() noexcept {\\n ++i;\\n }\\n constexpr usize operator*() const noexcept {\\n return i;\\n }\\n constexpr bool operator!=(\\n const itr x) const noexcept {\\n return i != x.i;\\n }\\n };\\n const itr f, l;\\n constexpr rep(const usize f, const usize l) noexcept\\n : f(std::min(f, l)),\\n l(l) {}\\n constexpr auto begin() const noexcept {\\n return f;\\n }\\n constexpr auto end() const noexcept {\\n return l;\\n }\\n };\\n\\n}\\n\\nnamespace luz {\\n class DisjointSetUnion {\\n usize n_;\\n\\n std::vector< isize > vals_;\\n\\n void bound_check(usize v) const {\\n assert(v < n_);\\n }\\n\\n usize impl_leader(usize v) {\\n if (vals_[v] < 0) return v;\\n return vals_[v] = leader(vals_[v]);\\n }\\n\\n public:\\n DisjointSetUnion() = default;\\n explicit DisjointSetUnion(usize n) : n_(n), vals_(n, -1) {}\\n\\n usize size() const {\\n return n_;\\n }\\n\\n usize leader(usize v) {\\n bound_check(v);\\n return impl_leader(v);\\n }\\n\\n bool same(usize u, usize v) {\\n bound_check(u), bound_check(v);\\n return impl_leader(u) == impl_leader(v);\\n }\\n\\n usize merge(usize u, usize v) {\\n bound_check(u);\\n bound_check(v);\\n\\n isize x = impl_leader(u);\\n isize y = impl_leader(v);\\n if (x == y) return x;\\n if (-vals_[x] < -vals_[y]) std::swap(x, y);\\n vals_[x] += vals_[y];\\n vals_[y] = x;\\n return x;\\n }\\n\\n usize group_size(usize v) {\\n bound_check(v);\\n return -vals_[impl_leader(v)];\\n }\\n };\\n\\n}\\n\\nvoid solve(int n, int m, int k) {\\n struct plan {\\n int u, v, w, is_a;\\n };\\n\\n luz::DisjointSetUnion dsu(n);\\n std::vector< plan > plans(m);\\n for (auto &p: plans) {\\n char c;\\n std::cin >> p.u >> p.v >> p.w >> c;\\n p.is_a = (c == 'A');\\n p.u--;\\n p.v--;\\n\\n dsu.merge(p.u, p.v);\\n }\\n\\n if (dsu.group_size(0) != n) {\\n std::cout << -1 << std::endl;\\n return;\\n }\\n\\n // dw \\\\in [-100, 100]\\n auto calc = [&](int dw) {\\n for (auto &p: plans) {\\n if (not p.is_a) continue;\\n p.w += dw;\\n }\\n\\n auto aplans = plans;\\n auto bplans = plans;\\n\\n for (auto &p: plans) {\\n if (not p.is_a) continue;\\n p.w -= dw;\\n }\\n\\n auto cmp_a = [&](const plan &a, const plan &b) {\\n if (a.w == b.w) {\\n return a.is_a < b.is_a;\\n }\\n return a.w < b.w;\\n };\\n auto cmp_b = [&](const plan &a, const plan &b) {\\n if (a.w == b.w) {\\n return a.is_a > b.is_a;\\n }\\n return a.w < b.w;\\n };\\n\\n std::sort(aplans.begin(), aplans.end(), cmp_a);\\n std::sort(bplans.begin(), bplans.end(), cmp_b);\\n\\n luz::DisjointSetUnion af(n), bf(n);\\n int cnt_a = 0, cnt_b = 0;\\n int mst_a = 0, mst_b = 0;\\n \\n for (auto &p: aplans) {\\n int u = p.u;\\n int v = p.v;\\n if (af.same(u, v)) continue;\\n if (p.is_a) cnt_a++;\\n af.merge(u, v);\\n mst_a += p.w;\\n }\\n for (auto &p: bplans) {\\n int u = p.u;\\n int v = p.v;\\n if (bf.same(u, v)) continue;\\n if (p.is_a) cnt_b++;\\n bf.merge(u, v);\\n mst_b += p.w;\\n }\\n\\n assert(mst_a == mst_b);\\n\\n return std::make_tuple(cnt_a, cnt_b, mst_a);\\n };\\n\\n int ok = 100, ng = -101;\\n while (ok - ng > 1) {\\n // std::cerr << \\\"(\\\" << ng << \\\", \\\" << ok << \\\"]\\\" << std::endl;\\n int dw = (ok + ng) / 2;\\n\\n // A 側に下駄をはかせて A を使える下界、上界\\n auto [lb, up, mst] = calc(dw);\\n // std::cerr << lb << \\\" \\\" << up << \\\" \\\" << mst << std::endl;\\n\\n if (k < lb) {\\n ng = dw;\\n } else {\\n ok = dw;\\n }\\n }\\n\\n auto [lb, up, mst] = calc(ok);\\n // std::cerr << ok << std::endl;\\n // std::cerr << lb << \\\" \\\" << up << \\\" \\\" << mst << std::endl;\\n\\n if (lb <= k and k <= up) {\\n std::cout << mst - k * ok << std::endl;\\n } else {\\n std::cout << -1 << std::endl;\\n }\\n}\\n\\nint main() {\\n int n, m, k;\\n while (std::cin >> n >> m >> k, n) {\\n solve(n, m, k);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3432,\n \"score_of_the_acc\": -0.0439,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1605_7965410\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nnamespace luz {\\n\\n using usize = std::size_t;\\n using isize = std::ptrdiff_t;\\n\\n struct rep {\\n struct itr {\\n usize i;\\n constexpr itr(const usize i) noexcept: i(i) {}\\n void operator++() noexcept {\\n ++i;\\n }\\n constexpr usize operator*() const noexcept {\\n return i;\\n }\\n constexpr bool operator!=(\\n const itr x) const noexcept {\\n return i != x.i;\\n }\\n };\\n const itr f, l;\\n constexpr rep(const usize f, const usize l) noexcept\\n : f(std::min(f, l)),\\n l(l) {}\\n constexpr auto begin() const noexcept {\\n return f;\\n }\\n constexpr auto end() const noexcept {\\n return l;\\n }\\n };\\n\\n}\\n\\nnamespace luz {\\n class DisjointSetUnion {\\n usize n_;\\n\\n std::vector< isize > vals_;\\n\\n void bound_check(usize v) const {\\n assert(v < n_);\\n }\\n\\n usize impl_leader(usize v) {\\n if (vals_[v] < 0) return v;\\n return vals_[v] = leader(vals_[v]);\\n }\\n\\n public:\\n DisjointSetUnion() = default;\\n explicit DisjointSetUnion(usize n) : n_(n), vals_(n, -1) {}\\n\\n usize size() const {\\n return n_;\\n }\\n\\n usize leader(usize v) {\\n bound_check(v);\\n return impl_leader(v);\\n }\\n\\n bool same(usize u, usize v) {\\n bound_check(u), bound_check(v);\\n return impl_leader(u) == impl_leader(v);\\n }\\n\\n usize merge(usize u, usize v) {\\n bound_check(u);\\n bound_check(v);\\n\\n isize x = impl_leader(u);\\n isize y = impl_leader(v);\\n if (x == y) return x;\\n if (-vals_[x] < -vals_[y]) std::swap(x, y);\\n vals_[x] += vals_[y];\\n vals_[y] = x;\\n return x;\\n }\\n\\n usize group_size(usize v) {\\n bound_check(v);\\n return -vals_[impl_leader(v)];\\n }\\n };\\n\\n}\\n\\nvoid solve(int n, int m, int k) {\\n struct plan {\\n int u, v, w, is_a;\\n };\\n\\n luz::DisjointSetUnion dsu(n);\\n std::vector< plan > plans(m);\\n for (auto &p: plans) {\\n char c;\\n std::cin >> p.u >> p.v >> p.w >> c;\\n p.is_a = (c == 'A');\\n p.u--;\\n p.v--;\\n\\n dsu.merge(p.u, p.v);\\n }\\n\\n if (dsu.group_size(0) != n) {\\n std::cout << -1 << std::endl;\\n return;\\n }\\n\\n // dw \\\\in [-100, 100]\\n auto calc = [&](int dw) {\\n for (auto &p: plans) {\\n if (not p.is_a) continue;\\n p.w += dw;\\n }\\n\\n auto aplans = plans;\\n auto bplans = plans;\\n\\n for (auto &p: plans) {\\n if (not p.is_a) continue;\\n p.w -= dw;\\n }\\n\\n auto cmp_a = [&](const plan &a, const plan &b) {\\n if (a.w == b.w) {\\n return a.is_a < b.is_a;\\n }\\n return a.w < b.w;\\n };\\n auto cmp_b = [&](const plan &a, const plan &b) {\\n if (a.w == b.w) {\\n return a.is_a > b.is_a;\\n }\\n return a.w < b.w;\\n };\\n\\n std::sort(aplans.begin(), aplans.end(), cmp_a);\\n std::sort(bplans.begin(), bplans.end(), cmp_b);\\n\\n luz::DisjointSetUnion af(n), bf(n);\\n int cnt_a = 0, cnt_b = 0;\\n int mst_a = 0, mst_b = 0;\\n \\n for (auto &p: aplans) {\\n int u = p.u;\\n int v = p.v;\\n if (af.same(u, v)) continue;\\n if (p.is_a) cnt_a++;\\n af.merge(u, v);\\n mst_a += p.w;\\n }\\n for (auto &p: bplans) {\\n int u = p.u;\\n int v = p.v;\\n if (bf.same(u, v)) continue;\\n if (p.is_a) cnt_b++;\\n bf.merge(u, v);\\n mst_b += p.w;\\n }\\n\\n assert(mst_a == mst_b);\\n\\n return std::make_tuple(cnt_a, cnt_b, mst_a);\\n };\\n\\n int ok = 100, ng = -101;\\n while (ok - ng > 1) {\\n // std::cerr << \\\"(\\\" << ng << \\\", \\\" << ok << \\\"]\\\" << std::endl;\\n int dw = (ok + ng) / 2;\\n\\n // A 側に下駄をはかせて A を使える下界、上界\\n auto [lb, up, mst] = calc(dw);\\n // std::cerr << lb << \\\" \\\" << up << \\\" \\\" << mst << std::endl;\\n\\n if (k < lb) {\\n ng = dw;\\n } else {\\n ok = dw;\\n }\\n }\\n\\n auto [lb, up, mst] = calc(ok);\\n // std::cerr << ok << std::endl;\\n // std::cerr << lb << \\\" \\\" << up << \\\" \\\" << mst << std::endl;\\n\\n if (lb <= k and k <= up) {\\n std::cout << mst - k * ok << std::endl;\\n } else {\\n std::cout << -1 << std::endl;\\n }\\n}\\n\\nint main() {\\n int n, m, k;\\n while (std::cin >> n >> m >> k, n) {\\n solve(n, m, k);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3420,\n \"score_of_the_acc\": -0.0427,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1605_7698513\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n#define rep(i, s, n) for (int i = (int)s; i < (int)n; i++)\\n#define rrep(i, s, n) for (int i = (int)(n)-1; i >= s; i--)\\n#define all(v) v.begin(), v.end()\\n\\nusing ll = long long;\\n\\nstruct dsu {\\n std::vector<int> par;\\n\\n public:\\n dsu(int n = 0) : par(n, -1) {}\\n\\n int leader(int x) {\\n if (par[x] < 0)\\n return x;\\n else\\n return par[x] = leader(par[x]);\\n }\\n\\n bool same(int x, int y) { return leader(x) == leader(y); }\\n\\n bool merge(int x, int y) {\\n x = leader(x);\\n y = leader(y);\\n if(x == y) return false;\\n if (par[x] > par[y]) std::swap(x, y);\\n par[x] += par[y];\\n par[y] = x;\\n return true;\\n }\\n\\n int size(int x) {\\n x = leader(x);\\n return -par[x];\\n }\\n};\\n\\nint main() {\\n int n, m, k;\\n while (std::cin >> n >> m >> k, !(n == 0 && m == 0 && k == 0)) {\\n std::vector edges(m, std::vector<int>(4));\\n rep(i, 0, m) {\\n std::cin >> edges[i][0] >> edges[i][1];\\n edges[i][0]--;\\n edges[i][1]--;\\n std::cin >> edges[i][2];\\n char c;\\n std::cin >> c;\\n edges[i][3] = c - 'A';\\n }\\n auto check = [&](std::vector<std::vector<int>> a, std::vector<std::vector<int>> b, int cnt) -> bool {\\n dsu uf(n);\\n for(auto edge: b) {\\n uf.merge(edge[0], edge[1]);\\n }\\n int t = 0;\\n for(auto edge: a) {\\n int u = edge[0];\\n int v = edge[1];\\n if(!uf.same(u, v)) {\\n t++;\\n uf.merge(u, v);\\n }\\n }\\n return t <= cnt && uf.size(0) == n;\\n };\\n {\\n std::vector<std::vector<int>> edges_a, edges_b;\\n for(auto edge: edges) {\\n if(edge[3] == 0) edges_a.emplace_back(edge);\\n else edges_b.emplace_back(edge);\\n }\\n if(!(check(edges_a, edges_b, k) && check(edges_b, edges_a, n-1-k))) {\\n std::cout << \\\"-1\\\\n\\\";\\n continue;\\n }\\n }\\n ll ok = -200, ng = 200;\\n auto f = [&](ll c) -> std::pair<ll, int> {\\n std::vector ps(m, std::vector<int>(4));\\n rep(i, 0, m) {\\n ps[i] = edges[i];\\n if (ps[i][3] == 0) ps[i][2] += c;\\n }\\n std::sort(all(ps), [](auto lhs, auto rhs) {\\n return (lhs[2] != rhs[2]) ? lhs[2] < rhs[2] : lhs[3] < rhs[3];\\n });\\n dsu uf(n);\\n int cnt = 0;\\n ll sum = 0;\\n for (auto edge : ps) {\\n int u = edge[0];\\n int v = edge[1];\\n int w = edge[2];\\n if (uf.same(u, v)) continue;\\n uf.merge(u, v);\\n sum += w;\\n if (edge[3] == 0) cnt++;\\n }\\n return {sum, cnt};\\n };\\n while (std::abs(ok - ng) > 1) {\\n ll mid = (ok + ng) / 2;\\n auto [sum, cnt] = f(mid);\\n if (cnt >= k) {\\n ok = mid;\\n } else {\\n ng = mid;\\n }\\n }\\n auto [sum, cnt] = f(ok);\\n sum -= k * ok;\\n std::cout << sum << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3544,\n \"score_of_the_acc\": -0.0674,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1605_7210924\",\n \"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 all(x) (x).begin(), (x).end()\\n\\nstruct UnionFind {\\n vector<int> data;\\n\\n UnionFind(int n) : data(n, -1) {}\\n\\n int find(int x) {\\n if (data[x] < 0) return x;\\n return data[x] = find(data[x]);\\n }\\n\\n void unite(int x, int y) {\\n x = find(x);\\n y = find(y);\\n if (x == y) return;\\n if (data[x] > data[y]) swap(x, y);\\n data[x] += data[y];\\n data[y] = x;\\n }\\n\\n bool same(int x, int y) {\\n return find(x) == find(y);\\n }\\n};\\n\\ntemplate <typename T>\\nvoid print(set<T>& st) {\\n for (auto& i : st) cout << i << \\\" \\\";\\n cout << endl;\\n}\\n\\ntemplate <typename T, typename U>\\nvoid print(pair<T, U>& p) {\\n cout << \\\"(\\\" << p.first << \\\",\\\" << p.second << endl;\\n}\\n\\nint main() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(nullptr);\\n\\n while (true) {\\n int n, m, k;\\n cin >> n >> m >> k;\\n if (n == 0) break;\\n vector<tuple<int, int, int, char>> edges(m);\\n set<int> unused, used;\\n vector<pair<int, int>> init(m);\\n rep(i,0,m) {\\n int u, v, w;\\n char l;\\n cin >> u >> v >> w >> l;\\n --u, --v;\\n edges[i] = {u, v, w, l};\\n init[i] = {w, i};\\n }\\n sort(all(init));\\n\\n UnionFind uf(n);\\n int cnt = 0;\\n for (auto [_, i] : init) {\\n auto [u, v, w, l] = edges[i];\\n if (l == 'A' && cnt < k && !uf.same(u, v)) {\\n uf.unite(u, v);\\n used.insert(i);\\n ++cnt;\\n } else {\\n unused.insert(i);\\n }\\n }\\n\\n if (cnt < k) {\\n cout << -1 << \\\"\\\\n\\\";\\n continue;\\n }\\n\\n auto flip = [&](int i) {\\n if (used.count(i)) {\\n used.erase(i);\\n unused.insert(i);\\n } else {\\n unused.erase(i);\\n used.insert(i);\\n }\\n };\\n\\n // print(used);\\n\\n bool ok = true;\\n rep(_,0,n-k-1) {\\n // print(used);\\n UnionFind uf(n);\\n vector<vector<pair<int, int>>> G(n);\\n for (int i : used) {\\n auto [u, v, w, l] = edges[i];\\n uf.unite(u, v);\\n G[u].push_back({v, i});\\n G[v].push_back({u, i});\\n }\\n\\n // find min source\\n pair<int, int> minA(1e9, -1), minB(1e9, -1);\\n for (int i : unused) {\\n auto [u, v, w, l] = edges[i];\\n if (!uf.same(u, v)) {\\n if (l == 'A') minA = min(minA, {w, i});\\n else minB = min(minB, {w, i});\\n }\\n }\\n\\n // find min AB pair\\n vector<int> par(n, -1), pare(n, -1), dep(n, -1);\\n\\n auto dfs = [&](auto& dfs, int v) -> void {\\n for (auto [c, i] : G[v]) {\\n if (c == par[v]) continue;\\n dep[c] = dep[v] + 1;\\n par[c] = v;\\n pare[c] = i;\\n dfs(dfs, c);\\n }\\n };\\n\\n rep(i,0,n) {\\n if (dep[i] != -1) continue;\\n dep[i] = 0;\\n dfs(dfs, i);\\n }\\n\\n tuple<int, int, int> minAB(1e9, -1, -1);\\n for (int i : unused) {\\n auto [u, v, w, l] = edges[i];\\n if (l == 'A' || !uf.same(u, v)) continue;\\n pair<int, int> maxA(-1e9, -1);\\n while (u != v) {\\n // cout << u << \\\" \\\" << v << endl;\\n if (dep[u] < dep[v]) swap(u, v);\\n int e = pare[u];\\n if (get<3>(edges[e]) == 'A') maxA = max(maxA, {get<2>(edges[e]), e});\\n u = par[u];\\n }\\n auto [x, j] = maxA;\\n if (j == -1) continue;\\n minAB = min(minAB, {w-x, i, j});\\n }\\n\\n // print(minA);\\n // print(minB);\\n\\n if (minB.first <= get<0>(minAB)+minA.first) {\\n auto [w, i] = minB;\\n if (i == -1) {\\n ok = false;\\n break;\\n }\\n flip(i);\\n } else {\\n auto [w, i, j] = minAB;\\n auto [x, k] = minA;\\n if (i == -1 || j == -1 || k == -1) {\\n ok = false;\\n break;\\n }\\n flip(i);\\n flip(j);\\n flip(k);\\n }\\n }\\n // print(used);\\n if (ok) {\\n ll ans = 0;\\n for (int i : used) {\\n ans += get<2>(edges[i]);\\n }\\n cout << ans << \\\"\\\\n\\\";\\n } else {\\n cout << -1 << \\\"\\\\n\\\";\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3536,\n \"score_of_the_acc\": -0.0917,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1605_6775879\",\n \"code_snippet\": \"#include <algorithm>\\n#include <cassert>\\n#include <cstddef>\\n#include <cstdint>\\n#include <iomanip>\\n#include <iostream>\\n#include <utility>\\n#include <vector>\\n\\nnamespace luz {\\n\\n using isize = std::ptrdiff_t;\\n using usize = std::size_t;\\n\\n using i32 = std::int32_t;\\n using i64 = std::int64_t;\\n using u32 = std::uint32_t;\\n using u64 = std::uint64_t;\\n \\n} // namespace luz\\n\\nnamespace luz {\\n\\n struct rep {\\n struct itr {\\n usize i;\\n constexpr itr(const usize i) noexcept : i(i) {}\\n void operator++() noexcept { ++i; }\\n constexpr usize operator*() const noexcept { return i; }\\n constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }\\n };\\n const itr f, l;\\n constexpr rep(const usize f, const usize l) noexcept\\n : f(std::min(f, l)), l(l) {}\\n constexpr auto begin() const noexcept { return f; }\\n constexpr auto end() const noexcept { return l; }\\n };\\n\\n struct rrep {\\n struct itr {\\n usize i;\\n constexpr itr(const usize i) noexcept : i(i) {}\\n void operator++() noexcept { --i; }\\n constexpr usize operator*() const noexcept { return i; }\\n constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }\\n };\\n const itr f, l;\\n constexpr rrep(const usize f, const usize l) noexcept\\n : f(l - 1), l(std::min(f, l) - 1) {}\\n constexpr auto begin() const noexcept { return f; }\\n constexpr auto end() const noexcept { return l; }\\n };\\n\\n} // namespace luz\\n\\nnamespace luz {\\n\\n void set_fast_ios() {\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n }\\n\\n} // namespace luz\\n\\nnamespace luz {\\n\\n void io_set(usize precision) {\\n std::cout << std::fixed << std::setprecision(precision);\\n std::cerr << std::fixed << std::setprecision(precision);\\n }\\n\\n} // namespace luz\\n\\nnamespace luz {\\n\\n template< typename T = i64 > T input() {\\n T tmp;\\n std::cin >> tmp;\\n return tmp;\\n }\\n\\n} // namespace luz\\n\\nnamespace luz {\\n\\n template< typename T >\\n std::ostream &operator<<(std::ostream &os, std::vector< T > &vs) {\\n for (usize i: rep(0, vs.size())) {\\n os << vs[i] << (i + 1 != vs.size() ? \\\" \\\" : \\\"\\\");\\n }\\n return os;\\n }\\n\\n template< typename T >\\n std::istream &operator>>(std::istream &is, std::vector< T > &vs) {\\n for (T &v: vs) {\\n is >> v;\\n }\\n return is;\\n }\\n\\n} // namespace luz\\n\\nnamespace luz {\\n\\n template< typename T1, typename T2 >\\n std::ostream &operator<<(std::ostream &os, std::pair < T1, T2 > &p) {\\n os << \\\"(\\\" << p.first << \\\", \\\" << p.second << \\\")\\\";\\n return os;\\n }\\n\\n template< typename T1, typename T2 >\\n std::istream &operator>>(std::istream &is, std::pair< T1, T2 > &p) {\\n is >> p.first >> p.second;\\n return is;\\n }\\n\\n} // namespace luz\\n\\nnamespace luz {\\n\\n template <typename T>\\n std::vector<T> make_vector(usize a, T b) {\\n return std::vector<T>(a, b);\\n }\\n\\n template <typename... Ts>\\n auto make_vector(usize a, Ts... ts) {\\n return std::vector<decltype(make_vector(ts...))>(a, make_vector(ts...));\\n }\\n\\n} // namespace luz\\n\\nnamespace luz {\\n\\n template <typename T1, typename T2>\\n inline bool chmax(T1 &a, T2 b) {\\n return a < b and (a = b, true);\\n }\\n\\n template <typename T1, typename T2>\\n inline bool chmin(T1 &a, T2 b) {\\n return a > b and (a = b, true);\\n }\\n\\n} // namespace luz\\n\\n#include <map>\\n\\nstruct UnionFind {\\n std::vector< int > data;\\n\\n UnionFind() = default;\\n\\n explicit UnionFind(size_t sz) : data(sz, -1) {}\\n\\n bool unite(int x, int y) {\\n x = find(x), y = find(y);\\n if(x == y) return false;\\n if(data[x] > data[y]) std::swap(x, y);\\n data[x] += data[y];\\n data[y] = x;\\n return true;\\n }\\n\\n int find(int k) {\\n if(data[k] < 0) return (k);\\n return data[k] = find(data[k]);\\n }\\n\\n int size(int k) {\\n return -data[find(k)];\\n }\\n\\n bool same(int x, int y) {\\n return find(x) == find(y);\\n }\\n};\\n\\nnamespace luz {\\n\\n void solve(usize n, usize m, usize k) {\\n std::vector< usize > us(m), vs(m);\\n std::vector< int > ws(m);\\n std::vector< bool > ls(m);\\n\\n for (usize i: rep(0, m)) {\\n us[i] = input() - 1;\\n vs[i] = input() - 1;\\n ws[i] = input();\\n ls[i] = (input<char>() == 'A');\\n }\\n\\n { // reachablility\\n UnionFind uf(n);\\n for (usize i: rep(0, m)) {\\n uf.unite(us[i], vs[i]);\\n }\\n for (usize v: rep(0, n)) {\\n if (uf.same(0, v)) continue;\\n std::cout << -1 << std::endl;\\n return;\\n }\\n }\\n\\n auto check = [&](int lambda) {\\n // < <cost, is_b >, idx>\\n std::vector< std::pair< std::pair<int, bool>, usize > > es;\\n\\n // < <cost, is_a >, idx>\\n std::vector< std::pair< std::pair<int, bool>, usize > > res;\\n\\n for (usize i: rep(0, m)) {\\n int cost = ws[i] + (ls[i] ? lambda : 0);\\n es.emplace_back(std::make_pair(cost, not ls[i]), i);\\n res.emplace_back(std::make_pair(cost, ls[i]), i);\\n }\\n\\n std::sort( es.begin(), es.end());\\n std::sort(res.begin(), res.end());\\n\\n usize cnt_a0 = 0, cnt_a1 = 0;\\n int mst = 0;\\n\\n {\\n UnionFind dsu(n);\\n for (auto [_, i]: es) {\\n if (dsu.same(us[i], vs[i])) continue;\\n dsu.unite(us[i], vs[i]);\\n cnt_a0 += ls[i];\\n mst += ws[i] + (ls[i] ? lambda : 0);\\n }\\n }\\n {\\n UnionFind dsu(n);\\n for (auto [_, i]: res) {\\n if (dsu.same(us[i], vs[i])) continue;\\n dsu.unite(us[i], vs[i]);\\n cnt_a1 += ls[i];\\n }\\n }\\n\\n return std::make_pair(std::make_pair(cnt_a0, cnt_a1), mst);\\n };\\n\\n constexpr int inf = 1001001001;\\n int ans = inf;\\n for (int lambda = -105; lambda <= 105; lambda++) {\\n auto [cnt, mst] = check(lambda);\\n if (cnt.second <= k and k <= cnt.first) {\\n chmin(ans, mst - k * lambda);\\n }\\n }\\n\\n if (ans == inf) ans = -1;\\n std::cout << ans << std::endl;\\n }\\n\\n void main_() {\\n usize n, m, k;\\n\\n while (std::cin >> n >> m >> k, n) {\\n solve(n, m, k);\\n }\\n }\\n\\n} // namespace luz\\n\\nint main() {\\n luz::set_fast_ios();\\n luz::io_set(15);\\n\\n luz::main_();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 3344,\n \"score_of_the_acc\": -0.1977,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1605_6607688\",\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\\nusing namespace std;\\n\\n//constexpr long long int MOD = 1000000007;\\nconstexpr long long int MOD = 998244353;\\nconstexpr double EPS = 1e-8;\\n\\n//int N, M, K, T, H, W, L, R;\\nlong long int N, M, K, T, H, W, L, R;\\n\\nclass UnionFind {\\n\\tvector<int>parent;\\n\\tvector<int>rank;\\npublic:\\n\\tUnionFind(int num) {\\n\\t\\tnum++;\\n\\t\\tparent.resize(num);\\n\\t\\trank.resize(num);\\n\\t\\tfor (int i = 0; i < num; i++) {\\n\\t\\t\\tparent[i] = i;\\n\\t\\t\\trank[i] = 0;\\n\\t\\t}\\n\\t}\\n\\tint Find(int node) {\\n\\t\\tif (parent[node] == node)return node;\\n\\t\\telse return parent[node] = Find(parent[node]);\\n\\t}\\n\\tvoid Unite(int u, int v) {\\n\\t\\tu = Find(u);\\n\\t\\tv = Find(v);\\n\\t\\tif (u == v)return;\\n\\t\\tif (rank[u] < rank[v])parent[u] = v;\\n\\t\\telse {\\n\\t\\t\\tparent[v] = u;\\n\\t\\t\\tif (rank[u] == rank[v])rank[u]++;\\n\\t\\t}\\n\\t}\\n\\tbool Check_Same(int u, int v) {\\n\\t\\treturn Find(u) == Find(v);\\n\\t}\\n};\\n\\nstruct Edge {\\n\\tint cost;\\n\\tint u, v;\\n\\tEdge(int cost, int u, int v) :cost(cost), u(u), v(v) {\\n\\n\\t}\\n\\tbool operator<(const Edge& edge)const {\\n\\t\\treturn cost < edge.cost;\\n\\t}\\n};\\n\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\n\\twhile (cin >> N >> M >> K, N) {\\n\\t\\tvector<int>au;\\n\\t\\tvector<int>av;\\n\\t\\tvector<int>aw;\\n\\t\\tvector<int>bu;\\n\\t\\tvector<int>bv;\\n\\t\\tvector<int>bw;\\n\\t\\tfor (int i = 0; i < M; i++) {\\n\\t\\t\\tint a, b, c;\\n\\t\\t\\tcin >> a >> b >> c;\\n\\t\\t\\ta--, b--;\\n\\t\\t\\tchar ab;\\n\\t\\t\\tcin >> ab;\\n\\t\\t\\tif (ab == 'A') {\\n\\t\\t\\t\\tau.push_back(a);\\n\\t\\t\\t\\tav.push_back(b);\\n\\t\\t\\t\\taw.push_back(c);\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tbu.push_back(a);\\n\\t\\t\\t\\tbv.push_back(b);\\n\\t\\t\\t\\tbw.push_back(c);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tlong long ans = LLONG_MAX;\\n\\t\\tfor (int i = -200; i <= 200; i++) {\\n\\t\\t\\tint score = 0;\\n\\t\\t\\tint comp = N;\\n\\t\\t\\t{\\n\\t\\t\\t\\tUnionFind uf(N);\\n\\t\\t\\t\\tvector<Edge>edge;\\n\\t\\t\\t\\tfor (int j = 0; j < au.size(); j++) {\\n\\t\\t\\t\\t\\tedge.push_back(Edge(aw[j] + i, au[j], av[j]));\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tfor (int j = 0; j < bu.size(); j++) {\\n\\t\\t\\t\\t\\tedge.push_back(Edge(bw[j], -bu[j], -bv[j]));\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treverse(edge.begin(), edge.end());\\n\\t\\t\\t\\tstable_sort(edge.begin(), edge.end());\\n\\t\\t\\t\\tint num = 0;\\n\\t\\t\\t\\tfor (auto j : edge) {\\n\\t\\t\\t\\t\\tif (uf.Check_Same(abs(j.u), abs(j.v)))continue;\\n\\t\\t\\t\\t\\tcomp--;\\n\\t\\t\\t\\t\\tuf.Unite(abs(j.u), abs(j.v));\\n\\t\\t\\t\\t\\tscore += j.cost;\\n\\t\\t\\t\\t\\tnum += j.u + j.v > 0;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tL = num;\\n\\t\\t\\t}\\n\\t\\t\\t{\\n\\t\\t\\t\\tUnionFind uf(N);\\n\\t\\t\\t\\tvector<Edge>edge;\\n\\t\\t\\t\\tfor (int j = 0; j < au.size(); j++) {\\n\\t\\t\\t\\t\\tedge.push_back(Edge(aw[j] + i, au[j], av[j]));\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tfor (int j = 0; j < bu.size(); j++) {\\n\\t\\t\\t\\t\\tedge.push_back(Edge(bw[j], -bu[j], -bv[j]));\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tstable_sort(edge.begin(), edge.end());\\n\\t\\t\\t\\tint num = 0;\\n\\t\\t\\t\\tfor (auto j : edge) {\\n\\t\\t\\t\\t\\tif (uf.Check_Same(abs(j.u), abs(j.v)))continue;\\n\\t\\t\\t\\t\\tuf.Unite(abs(j.u), abs(j.v));\\n\\t\\t\\t\\t\\tnum += j.u + j.v > 0;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tR = num;\\n\\t\\t\\t}\\n\\t\\t\\tif (L > R) {\\n\\t\\t\\t\\tswap(L, R);\\n\\t\\t\\t}\\n\\t\\t\\tif (comp==1&&L <= K && K <= R) {\\n\\t\\t\\t\\tans = min(ans, score - i * K);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (ans == LLONG_MAX)ans = -1;\\n\\t\\tcout << ans << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 200,\n \"memory_kb\": 3448,\n \"score_of_the_acc\": -0.283,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1605_6555258\",\n \"code_snippet\": \"#line 1 \\\"combinatorial_opt/test/matroid_intersection.aoj1605.test.cpp\\\"\\n#define PROBLEM \\\"https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1605\\\"\\n#line 2 \\\"graph/shortest_path.hpp\\\"\\n#include <algorithm>\\n#include <cassert>\\n#include <deque>\\n#include <fstream>\\n#include <functional>\\n#include <limits>\\n#include <queue>\\n#include <string>\\n#include <utility>\\n#include <vector>\\n\\n// CUT begin\\ntemplate <typename T, T INF = std::numeric_limits<T>::max() / 2, int INVALID = -1>\\nstruct ShortestPath {\\n int V, E;\\n bool single_positive_weight;\\n T wmin, wmax;\\n std::vector<std::vector<std::pair<int, T>>> to;\\n\\n ShortestPath(int V = 0) : V(V), E(0), single_positive_weight(true), wmin(0), wmax(0), to(V) {}\\n void add_edge(int s, int t, T w) {\\n assert(0 <= s and s < V);\\n assert(0 <= t and t < V);\\n to[s].emplace_back(t, w);\\n E++;\\n if (w > 0 and wmax > 0 and wmax != w) single_positive_weight = false;\\n wmin = std::min(wmin, w);\\n wmax = std::max(wmax, w);\\n }\\n\\n std::vector<T> dist;\\n std::vector<int> prev;\\n\\n // Dijkstra algorithm\\n // Complexity: O(E log E)\\n using Pque = std::priority_queue<std::pair<T, int>, std::vector<std::pair<T, int>>,\\n std::greater<std::pair<T, int>>>;\\n template <class Heap = Pque> void Dijkstra(int s) {\\n assert(0 <= s and s < V);\\n dist.assign(V, INF);\\n dist[s] = 0;\\n prev.assign(V, INVALID);\\n Heap pq;\\n pq.emplace(0, s);\\n while (!pq.empty()) {\\n T d;\\n int v;\\n std::tie(d, v) = pq.top();\\n pq.pop();\\n if (dist[v] < d) continue;\\n for (auto nx : to[v]) {\\n T dnx = d + nx.second;\\n if (dist[nx.first] > dnx) {\\n dist[nx.first] = dnx, prev[nx.first] = v;\\n pq.emplace(dnx, nx.first);\\n }\\n }\\n }\\n }\\n\\n // Dijkstra algorithm, O(V^2 + E)\\n void DijkstraVquad(int s) {\\n assert(0 <= s and s < V);\\n dist.assign(V, INF);\\n dist[s] = 0;\\n prev.assign(V, INVALID);\\n std::vector<char> fixed(V, false);\\n while (true) {\\n int r = INVALID;\\n T dr = INF;\\n for (int i = 0; i < V; i++) {\\n if (!fixed[i] and dist[i] < dr) r = i, dr = dist[i];\\n }\\n if (r == INVALID) break;\\n fixed[r] = true;\\n int nxt;\\n T dx;\\n for (auto p : to[r]) {\\n std::tie(nxt, dx) = p;\\n if (dist[nxt] > dist[r] + dx) dist[nxt] = dist[r] + dx, prev[nxt] = r;\\n }\\n }\\n }\\n\\n // Bellman-Ford algorithm\\n // Complexity: O(VE)\\n bool BellmanFord(int s, int nb_loop) {\\n assert(0 <= s and s < V);\\n dist.assign(V, INF), prev.assign(V, INVALID);\\n dist[s] = 0;\\n for (int l = 0; l < nb_loop; l++) {\\n bool upd = false;\\n for (int v = 0; v < V; v++) {\\n if (dist[v] == INF) continue;\\n for (auto nx : to[v]) {\\n T dnx = dist[v] + nx.second;\\n if (dist[nx.first] > dnx) dist[nx.first] = dnx, prev[nx.first] = v, upd = true;\\n }\\n }\\n if (!upd) return true;\\n }\\n return false;\\n }\\n\\n // Bellman-ford algorithm using queue (deque)\\n // Complexity: O(VE)\\n // Requirement: no negative loop\\n void SPFA(int s) {\\n assert(0 <= s and s < V);\\n dist.assign(V, INF);\\n prev.assign(V, INVALID);\\n std::deque<int> q;\\n std::vector<char> in_queue(V);\\n dist[s] = 0;\\n q.push_back(s), in_queue[s] = 1;\\n while (!q.empty()) {\\n int now = q.front();\\n q.pop_front(), in_queue[now] = 0;\\n for (auto nx : to[now]) {\\n T dnx = dist[now] + nx.second;\\n int nxt = nx.first;\\n if (dist[nxt] > dnx) {\\n dist[nxt] = dnx;\\n if (!in_queue[nxt]) {\\n if (q.size() and dnx < dist[q.front()]) { // Small label first optimization\\n q.push_front(nxt);\\n } else {\\n q.push_back(nxt);\\n }\\n prev[nxt] = now, in_queue[nxt] = 1;\\n }\\n }\\n }\\n }\\n }\\n\\n void ZeroOneBFS(int s) {\\n assert(0 <= s and s < V);\\n dist.assign(V, INF), prev.assign(V, INVALID);\\n dist[s] = 0;\\n std::deque<int> que;\\n que.push_back(s);\\n while (!que.empty()) {\\n int v = que.front();\\n que.pop_front();\\n for (auto nx : to[v]) {\\n T dnx = dist[v] + nx.second;\\n if (dist[nx.first] > dnx) {\\n dist[nx.first] = dnx, prev[nx.first] = v;\\n if (nx.second) {\\n que.push_back(nx.first);\\n } else {\\n que.push_front(nx.first);\\n }\\n }\\n }\\n }\\n }\\n\\n bool dag_solver(int s) {\\n assert(0 <= s and s < V);\\n std::vector<int> indeg(V, 0);\\n std::queue<int> que;\\n que.push(s);\\n while (que.size()) {\\n int now = que.front();\\n que.pop();\\n for (auto nx : to[now]) {\\n indeg[nx.first]++;\\n if (indeg[nx.first] == 1) que.push(nx.first);\\n }\\n }\\n dist.assign(V, INF), prev.assign(V, INVALID);\\n dist[s] = 0;\\n que.push(s);\\n while (que.size()) {\\n int now = que.front();\\n que.pop();\\n for (auto nx : to[now]) {\\n indeg[nx.first]--;\\n if (dist[nx.first] > dist[now] + nx.second)\\n dist[nx.first] = dist[now] + nx.second, prev[nx.first] = now;\\n if (indeg[nx.first] == 0) que.push(nx.first);\\n }\\n }\\n return *max_element(indeg.begin(), indeg.end()) == 0;\\n }\\n\\n // Retrieve a sequence of vertex ids that represents shortest path [s, ..., goal]\\n // If not reachable to goal, return {}\\n std::vector<int> retrieve_path(int goal) const {\\n assert(int(prev.size()) == V);\\n assert(0 <= goal and goal < V);\\n if (dist[goal] == INF) return {};\\n std::vector<int> ret{goal};\\n while (prev[goal] != INVALID) {\\n goal = prev[goal];\\n ret.push_back(goal);\\n }\\n std::reverse(ret.begin(), ret.end());\\n return ret;\\n }\\n\\n void solve(int s) {\\n if (wmin >= 0) {\\n if (single_positive_weight) {\\n ZeroOneBFS(s);\\n } else {\\n if ((long long)V * V < (E << 4)) {\\n DijkstraVquad(s);\\n } else {\\n Dijkstra(s);\\n }\\n }\\n } else {\\n BellmanFord(s, V);\\n }\\n }\\n\\n // Warshall-Floyd algorithm\\n // Complexity: O(E + V^3)\\n std::vector<std::vector<T>> dist2d;\\n void WarshallFloyd() {\\n dist2d.assign(V, std::vector<T>(V, INF));\\n for (int i = 0; i < V; i++) {\\n dist2d[i][i] = 0;\\n for (auto p : to[i]) dist2d[i][p.first] = std::min(dist2d[i][p.first], p.second);\\n }\\n for (int k = 0; k < V; k++) {\\n for (int i = 0; i < V; i++) {\\n if (dist2d[i][k] == INF) continue;\\n for (int j = 0; j < V; j++) {\\n if (dist2d[k][j] == INF) continue;\\n dist2d[i][j] = std::min(dist2d[i][j], dist2d[i][k] + dist2d[k][j]);\\n }\\n }\\n }\\n }\\n\\n void dump_graphviz(std::string filename = \\\"shortest_path\\\") const {\\n std::ofstream ss(filename + \\\".DOT\\\");\\n ss << \\\"digraph{\\\\n\\\";\\n for (int i = 0; i < V; i++) {\\n for (const auto &e : to[i])\\n ss << i << \\\"->\\\" << e.first << \\\"[label=\\\" << e.second << \\\"];\\\\n\\\";\\n }\\n ss << \\\"}\\\\n\\\";\\n ss.close();\\n return;\\n }\\n};\\n#line 5 \\\"combinatorial_opt/matroid_intersection.hpp\\\"\\n\\n// CUT begin\\n// (Min weight) matroid intersection solver\\n// Algorithm based on http://dopal.cs.uec.ac.jp/okamotoy/lect/2015/matroid/\\n// Complexity: O(CE^2 + E^3) (C : circuit query, non-weighted)\\ntemplate <class M1, class M2, class T = int>\\nstd::vector<bool> MatroidIntersection(M1 matroid1, M2 matroid2, std::vector<T> weights = {}) {\\n using State = std::vector<bool>;\\n using Element = int;\\n assert(matroid1.size() == matroid2.size());\\n const int M = matroid1.size();\\n\\n for (auto &x : weights) x *= M + 1;\\n if (weights.empty()) weights.assign(M, 0);\\n\\n const Element gs = M, gt = M + 1;\\n State I(M);\\n\\n while (true) {\\n ShortestPath<T> sssp(M + 2);\\n matroid1.set(I);\\n matroid2.set(I);\\n for (int e = 0; e < M; e++) {\\n if (I[e]) continue;\\n auto c1 = matroid1.circuit(e), c2 = matroid2.circuit(e);\\n if (c1.empty()) sssp.add_edge(e, gt, 0);\\n for (Element f : c1) {\\n if (f != e) sssp.add_edge(e, f, -weights[f] + 1);\\n }\\n if (c2.empty()) sssp.add_edge(gs, e, weights[e] + 1);\\n for (Element f : c2) {\\n if (f != e) sssp.add_edge(f, e, weights[e] + 1);\\n }\\n }\\n sssp.solve(gs);\\n auto aug_path = sssp.retrieve_path(gt);\\n if (aug_path.empty()) break;\\n for (auto e : aug_path) {\\n if (e != gs and e != gt) I[e] = !I[e];\\n }\\n }\\n return I;\\n}\\n#line 5 \\\"combinatorial_opt/matroids/graphic_matroid.hpp\\\"\\n\\n// GraphicMatroid: subgraph of undirected graphs, without loops\\nclass GraphicMatroid {\\n using Vertex = int;\\n using Element = int;\\n int M;\\n int V; // # of vertices of graph\\n std::vector<std::vector<std::pair<Vertex, Element>>> to;\\n std::vector<std::pair<Vertex, Vertex>> edges;\\n std::vector<Element> backtrack;\\n std::vector<Vertex> vprev;\\n std::vector<int> depth, root;\\n\\npublic:\\n GraphicMatroid(int V, const std::vector<std::pair<Vertex, Vertex>> &edges_)\\n : M(edges_.size()), V(V), to(V), edges(edges_) {\\n for (int e = 0; e < int(edges_.size()); e++) {\\n int u = edges_[e].first, v = edges_[e].second;\\n assert(0 <= u and u < V);\\n assert(0 <= v and v < V);\\n if (u != v) {\\n to[u].emplace_back(v, e);\\n to[v].emplace_back(u, e);\\n }\\n }\\n }\\n int size() const { return M; }\\n\\n std::vector<Vertex> que;\\n template <class State> void set(State I) {\\n assert(int(I.size()) == M);\\n backtrack.assign(V, -1);\\n vprev.assign(V, -1);\\n depth.assign(V, -1);\\n root.assign(V, -1);\\n que.resize(V);\\n int qb = 0, qe = 0;\\n for (Vertex i = 0; i < V; i++) {\\n if (backtrack[i] >= 0) continue;\\n que[qb = 0] = i, qe = 1, depth[i] = 0;\\n while (qb < qe) {\\n Vertex now = que[qb++];\\n root[now] = i;\\n for (auto nxt : to[now]) {\\n if (depth[nxt.first] < 0 and I[nxt.second]) {\\n backtrack[nxt.first] = nxt.second;\\n vprev[nxt.first] = now;\\n depth[nxt.first] = depth[now] + 1;\\n que[qe++] = nxt.first;\\n }\\n }\\n }\\n }\\n }\\n\\n std::vector<Element> circuit(const Element e) const {\\n assert(0 <= e and e < M);\\n Vertex s = edges[e].first, t = edges[e].second;\\n if (root[s] != root[t]) return {};\\n std::vector<Element> ret{e};\\n auto step = [&](Vertex &i) { ret.push_back(backtrack[i]), i = vprev[i]; };\\n int ddepth = depth[s] - depth[t];\\n for (; ddepth > 0; --ddepth) step(s);\\n for (; ddepth < 0; ++ddepth) step(t);\\n while (s != t) step(s), step(t);\\n return ret;\\n }\\n};\\n#line 4 \\\"combinatorial_opt/matroids/partition_matroid.hpp\\\"\\n\\n// Partition matroid (partitional matroid) : direct sum of uniform matroids\\nclass PartitionMatroid {\\n using Element = int;\\n int M;\\n std::vector<std::vector<Element>> parts;\\n std::vector<int> belong;\\n std::vector<int> R;\\n std::vector<int> cnt;\\n std::vector<std::vector<Element>> circuits;\\n\\npublic:\\n // parts: partition of [0, 1, ..., M - 1]\\n // R: only R[i] elements from parts[i] can be chosen for each i.\\n PartitionMatroid(int M, const std::vector<std::vector<int>> &parts_, const std::vector<int> &R_)\\n : M(M), parts(parts_), belong(M, -1), R(R_) {\\n assert(parts.size() == R.size());\\n for (int i = 0; i < int(parts.size()); i++) {\\n for (Element e : parts[i]) belong[e] = i;\\n }\\n for (Element e = 0; e < M; e++) {\\n // assert(belong[e] != -1);\\n if (belong[e] == -1) {\\n belong[e] = parts.size();\\n parts.push_back({e});\\n R.push_back(1);\\n }\\n }\\n }\\n int size() const { return M; }\\n\\n template <class State> void set(const State &I) {\\n cnt = R;\\n for (int e = 0; e < M; e++) {\\n if (I[e]) cnt[belong[e]]--;\\n }\\n circuits.assign(cnt.size(), {});\\n for (int e = 0; e < M; e++) {\\n if (I[e] and cnt[belong[e]] == 0) circuits[belong[e]].push_back(e);\\n }\\n }\\n\\n std::vector<Element> circuit(const Element e) const {\\n assert(0 <= e and e < M);\\n int p = belong[e];\\n if (cnt[p] == 0) {\\n auto ret = circuits[p];\\n ret.push_back(e);\\n return ret;\\n }\\n return {};\\n }\\n};\\n#line 5 \\\"combinatorial_opt/test/matroid_intersection.aoj1605.test.cpp\\\"\\n#include <iostream>\\n#include <numeric>\\n#line 9 \\\"combinatorial_opt/test/matroid_intersection.aoj1605.test.cpp\\\"\\nusing namespace std;\\n\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n while (true) {\\n int N, M, K;\\n cin >> N >> M >> K;\\n if (N == 0) break;\\n vector<vector<int>> partition(2);\\n vector<int> R{K, N - 1 - K};\\n vector<pair<int, int>> edges;\\n vector<int> weights;\\n for (int e = 0; e < M; ++e) {\\n int u, v, w;\\n char l;\\n cin >> u >> v >> w >> l;\\n --u, --v;\\n partition[l == 'B'].push_back(e);\\n edges.emplace_back(u, v);\\n weights.push_back(w);\\n }\\n PartitionMatroid M1(edges.size(), partition, R);\\n GraphicMatroid M2(N, edges);\\n vector<bool> ret = MatroidIntersection(M1, M2, weights);\\n int ne = accumulate(ret.begin(), ret.end(), 0);\\n if (ne < N - 1) {\\n cout << \\\"-1\\\\n\\\";\\n } else {\\n int sum = 0;\\n for (int e = 0; e < M; ++e) sum += ret[e] * weights[e];\\n cout << sum << '\\\\n';\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 360,\n \"memory_kb\": 4072,\n \"score_of_the_acc\": -0.5446,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1605_6340217\",\n \"code_snippet\": \"#line 2 \\\"library/bits/stdc++.h\\\"\\n\\n// C\\n#ifndef _GLIBCXX_NO_ASSERT\\n#include <cassert>\\n#endif\\n#include <cctype>\\n#include <cerrno>\\n#include <cfloat>\\n#include <ciso646>\\n#include <climits>\\n#include <clocale>\\n#include <cmath>\\n#include <csetjmp>\\n#include <csignal>\\n#include <cstdarg>\\n#include <cstddef>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <ctime>\\n\\n#if __cplusplus >= 201103L\\n#include <ccomplex>\\n#include <cfenv>\\n#include <cinttypes>\\n#include <cstdbool>\\n#include <cstdint>\\n#include <ctgmath>\\n#include <cwchar>\\n#include <cwctype>\\n#endif\\n\\n// C++\\n#include <algorithm>\\n#include <bitset>\\n#include <complex>\\n#include <deque>\\n#include <exception>\\n#include <fstream>\\n#include <functional>\\n#include <iomanip>\\n#include <ios>\\n#include <iosfwd>\\n#include <iostream>\\n#include <istream>\\n#include <iterator>\\n#include <limits>\\n#include <list>\\n#include <locale>\\n#include <map>\\n#include <memory>\\n#include <new>\\n#include <numeric>\\n#include <ostream>\\n#include <queue>\\n#include <set>\\n#include <sstream>\\n#include <stack>\\n#include <stdexcept>\\n#include <streambuf>\\n#include <string>\\n#include <typeinfo>\\n#include <utility>\\n#include <valarray>\\n#include <vector>\\n\\n#if __cplusplus >= 201103L\\n#include <array>\\n#include <atomic>\\n#include <chrono>\\n#include <condition_variable>\\n#include <forward_list>\\n#include <future>\\n#include <initializer_list>\\n#include <mutex>\\n#include <random>\\n#include <ratio>\\n#include <regex>\\n#include <scoped_allocator>\\n#include <system_error>\\n#include <thread>\\n#include <tuple>\\n#include <typeindex>\\n#include <type_traits>\\n#include <unordered_map>\\n#include <unordered_set>\\n#endif\\n#line 2 \\\"Source.cpp\\\"\\nusing namespace std;\\n\\n#define REP(a, b) for (long long a = 0; a < b; ++a)\\n#define ll long long\\n#define ld long double\\n#define ALL(x) begin(x), end(x)\\n\\n#line 1 \\\"library/atcoder/dsu.hpp\\\"\\n\\n\\n\\n#line 5 \\\"library/atcoder/dsu.hpp\\\"\\n#include <cassert>\\n#line 7 \\\"library/atcoder/dsu.hpp\\\"\\n\\nnamespace atcoder {\\n\\n// Implement (union by size) + (path compression)\\n// Reference:\\n// Zvi Galil and Giuseppe F. Italiano,\\n// Data structures and algorithms for disjoint set union problems\\nstruct dsu {\\n public:\\n dsu() : _n(0) {}\\n explicit dsu(int n) : _n(n), parent_or_size(n, -1) {}\\n\\n int merge(int a, int b) {\\n assert(0 <= a && a < _n);\\n assert(0 <= b && b < _n);\\n int x = leader(a), y = leader(b);\\n if (x == y) return x;\\n if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);\\n parent_or_size[x] += parent_or_size[y];\\n parent_or_size[y] = x;\\n return x;\\n }\\n\\n bool same(int a, int b) {\\n assert(0 <= a && a < _n);\\n assert(0 <= b && b < _n);\\n return leader(a) == leader(b);\\n }\\n\\n int leader(int a) {\\n assert(0 <= a && a < _n);\\n if (parent_or_size[a] < 0) return a;\\n return parent_or_size[a] = leader(parent_or_size[a]);\\n }\\n\\n int size(int a) {\\n assert(0 <= a && a < _n);\\n return -parent_or_size[leader(a)];\\n }\\n\\n std::vector<std::vector<int>> groups() {\\n std::vector<int> leader_buf(_n), group_size(_n);\\n for (int i = 0; i < _n; i++) {\\n leader_buf[i] = leader(i);\\n group_size[leader_buf[i]]++;\\n }\\n std::vector<std::vector<int>> result(_n);\\n for (int i = 0; i < _n; i++) {\\n result[i].reserve(group_size[i]);\\n }\\n for (int i = 0; i < _n; i++) {\\n result[leader_buf[i]].push_back(i);\\n }\\n result.erase(\\n std::remove_if(result.begin(), result.end(),\\n [&](const std::vector<int>& v) { return v.empty(); }),\\n result.end());\\n return result;\\n }\\n\\n private:\\n int _n;\\n // root node: -1 * component size\\n // otherwise: parent\\n std::vector<int> parent_or_size;\\n};\\n\\n} // namespace atcoder\\n\\n\\n#line 10 \\\"Source.cpp\\\"\\n\\n#define int long long\\nvoid solve()\\n{\\n int n, m, k;\\n cin >> n >> m >> k;\\n if (n == 0)\\n exit(0);\\n vector<tuple<int, int, int, int>> edges;\\n REP(i, m)\\n {\\n int a, b, c;\\n string d;\\n cin >> a >> b >> c >> d;\\n a--;\\n b--;\\n edges.push_back({c, a, b, d[0] - 'A'});\\n }\\n sort(ALL(edges));\\n atcoder::dsu graph(n);\\n vector<tuple<int, int, int, int>> current_edges;\\n for (int i = 0; i < m; ++i)\\n {\\n if (graph.same(get<1>(edges[i]), get<2>(edges[i])))\\n continue;\\n current_edges.push_back(edges[i]);\\n graph.merge(get<1>(edges[i]), get<2>(edges[i]));\\n k -= 1 - get<3>(edges[i]);\\n edges.erase(edges.begin() + i);\\n i--;\\n }\\n\\n REP(i, n)\\n {\\n if (!graph.same(i, 0))\\n {\\n cout << -1 << endl;\\n return;\\n }\\n }\\n while (k != 0)\\n {\\n tuple<int, int, int> target = make_tuple(1e18, 0, 0);\\n REP(i, current_edges.size())\\n {\\n if (k < 0)\\n {\\n if (get<3>(current_edges[i]) == 1)\\n continue;\\n }\\n else\\n {\\n if (get<3>(current_edges[i]) == 0)\\n continue;\\n }\\n\\n atcoder::dsu graph(n);\\n REP(q, current_edges.size())\\n {\\n if (i == q)\\n continue;\\n graph.merge(get<1>(current_edges[q]), get<2>(current_edges[q]));\\n }\\n\\n REP(q, edges.size())\\n {\\n if (get<3>(edges[q]) == get<3>(current_edges[i]))\\n continue;\\n if (graph.same(get<1>(edges[q]), get<2>(edges[q])))\\n continue;\\n tuple<int, int, int> now;\\n get<0>(now) = get<0>(edges[q]) - get<0>(current_edges[i]);\\n get<1>(now) = i;\\n get<2>(now) = q;\\n if (get<0>(now) < get<0>(target))\\n {\\n target = now;\\n }\\n break;\\n }\\n }\\n if (get<0>(target) == 1e18)\\n {\\n cout << -1 << endl;\\n return;\\n }\\n swap(current_edges[get<1>(target)], edges[get<2>(target)]);\\n if (k > 0)\\n k--;\\n else\\n k++;\\n sort(ALL(current_edges));\\n sort(ALL(edges));\\n }\\n int ans = 0;\\n for (auto x : current_edges)\\n {\\n ans += get<0>(x);\\n }\\n cout << ans << endl;\\n}\\n\\n#undef int\\nint main()\\n{\\n iostream::sync_with_stdio(false);\\n cout << fixed << setprecision(100);\\n while (true)\\n solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 3412,\n \"score_of_the_acc\": -0.2044,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1605_6049288\",\n \"code_snippet\": \"#include <algorithm>\\n#include <array>\\n#include <bitset>\\n#include <cassert>\\n#include <chrono>\\n#include <cmath>\\n#include <complex>\\n#include <deque>\\n#include <forward_list>\\n#include <fstream>\\n#include <functional>\\n#include <iomanip>\\n#include <ios>\\n#include <iostream>\\n#include <limits>\\n#include <list>\\n#include <map>\\n#include <numeric>\\n#include <queue>\\n#include <random>\\n#include <set>\\n#include <sstream>\\n#include <stack>\\n#include <string>\\n#include <tuple>\\n#include <type_traits>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <utility>\\n#include <vector>\\nusing namespace std;\\nusing lint = long long;\\nusing pint = pair<int, int>;\\nusing plint = pair<lint, lint>;\\nstruct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;\\n#define ALL(x) (x).begin(), (x).end()\\n#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)\\n#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)\\n#define REP(i, n) FOR(i,0,n)\\n#define IREP(i, n) IFOR(i,0,n)\\ntemplate <typename T, typename V>\\nvoid ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }\\ntemplate <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }\\ntemplate <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }\\ntemplate <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }\\nint floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }\\ntemplate <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }\\ntemplate <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }\\ntemplate <typename T> vector<T> sort_unique(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }\\ntemplate <typename T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }\\ntemplate <typename T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }\\ntemplate <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }\\ntemplate <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }\\ntemplate <typename T, size_t sz> ostream &operator<<(ostream &os, const array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }\\n#if __cplusplus >= 201703L\\ntemplate <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }\\ntemplate <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }\\n#endif\\ntemplate <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << \\\"deq[\\\"; for (auto v : vec) os << v << ','; os << ']'; return os; }\\ntemplate <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }\\ntemplate <typename T, typename TH> ostream &operator<<(ostream &os, const unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }\\ntemplate <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }\\ntemplate <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }\\ntemplate <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; }\\ntemplate <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << \\\"=>\\\" << v.second << ','; os << '}'; return os; }\\ntemplate <typename TK, typename TV, typename TH> ostream &operator<<(ostream &os, const unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << \\\"=>\\\" << v.second << ','; os << '}'; return os; }\\n#ifdef HITONANODE_LOCAL\\nconst string COLOR_RESET = \\\"\\\\033[0m\\\", BRIGHT_GREEN = \\\"\\\\033[1;32m\\\", BRIGHT_RED = \\\"\\\\033[1;31m\\\", BRIGHT_CYAN = \\\"\\\\033[1;36m\\\", NORMAL_CROSSED = \\\"\\\\033[0;9;37m\\\", RED_BACKGROUND = \\\"\\\\033[1;41m\\\", NORMAL_FAINT = \\\"\\\\033[0;2m\\\";\\n#define dbg(x) cerr << BRIGHT_CYAN << #x << COLOR_RESET << \\\" = \\\" << (x) << NORMAL_FAINT << \\\" (L\\\" << __LINE__ << \\\") \\\" << __FILE__ << COLOR_RESET << endl\\n#define dbgif(cond, x) ((cond) ? cerr << BRIGHT_CYAN << #x << COLOR_RESET << \\\" = \\\" << (x) << NORMAL_FAINT << \\\" (L\\\" << __LINE__ << \\\") \\\" << __FILE__ << COLOR_RESET << endl : cerr)\\n#else\\n#define dbg(x) (x)\\n#define dbgif(cond, x) 0\\n#endif\\n\\ntemplate <typename T, T INF = std::numeric_limits<T>::max() / 2, int INVALID = -1> struct ShortestPath {\\n int V, E;\\n bool single_positive_weight;\\n T wmin, wmax;\\n std::vector<std::vector<std::pair<int, T>>> to;\\n\\n ShortestPath(int V = 0) : V(V), E(0), single_positive_weight(true), wmin(0), wmax(0), to(V) {}\\n void add_edge(int s, int t, T w) {\\n assert(0 <= s and s < V);\\n assert(0 <= t and t < V);\\n to[s].emplace_back(t, w);\\n E++;\\n if (w > 0 and wmax > 0 and wmax != w) single_positive_weight = false;\\n wmin = std::min(wmin, w);\\n wmax = std::max(wmax, w);\\n }\\n\\n std::vector<T> dist;\\n std::vector<int> prev;\\n\\n // Dijkstra algorithm\\n // Complexity: O(E log E)\\n using Pque = std::priority_queue<std::pair<T, int>, std::vector<std::pair<T, int>>, std::greater<std::pair<T, int>>>;\\n template <class Heap = Pque> void Dijkstra(int s) {\\n assert(0 <= s and s < V);\\n dist.assign(V, INF);\\n dist[s] = 0;\\n prev.assign(V, INVALID);\\n Heap pq;\\n pq.emplace(0, s);\\n while (!pq.empty()) {\\n T d;\\n int v;\\n std::tie(d, v) = pq.top();\\n pq.pop();\\n if (dist[v] < d) continue;\\n for (auto nx : to[v]) {\\n T dnx = d + nx.second;\\n if (dist[nx.first] > dnx) {\\n dist[nx.first] = dnx, prev[nx.first] = v;\\n pq.emplace(dnx, nx.first);\\n }\\n }\\n }\\n }\\n\\n // Dijkstra algorithm, O(V^2 + E)\\n void DijkstraVquad(int s) {\\n assert(0 <= s and s < V);\\n dist.assign(V, INF);\\n dist[s] = 0;\\n prev.assign(V, INVALID);\\n std::vector<char> fixed(V, false);\\n while (true) {\\n int r = INVALID;\\n T dr = INF;\\n for (int i = 0; i < V; i++) {\\n if (!fixed[i] and dist[i] < dr) r = i, dr = dist[i];\\n }\\n if (r == INVALID) break;\\n fixed[r] = true;\\n int nxt;\\n T dx;\\n for (auto p : to[r]) {\\n std::tie(nxt, dx) = p;\\n if (dist[nxt] > dist[r] + dx) dist[nxt] = dist[r] + dx, prev[nxt] = r;\\n }\\n }\\n }\\n\\n // Bellman-Ford algorithm\\n // Complexity: O(VE)\\n bool BellmanFord(int s, int nb_loop) {\\n assert(0 <= s and s < V);\\n dist.assign(V, INF), prev.assign(V, INVALID);\\n dist[s] = 0;\\n for (int l = 0; l < nb_loop; l++) {\\n bool upd = false;\\n for (int v = 0; v < V; v++) {\\n if (dist[v] == INF) continue;\\n for (auto nx : to[v]) {\\n T dnx = dist[v] + nx.second;\\n if (dist[nx.first] > dnx) dist[nx.first] = dnx, prev[nx.first] = v, upd = true;\\n }\\n }\\n if (!upd) return true;\\n }\\n return false;\\n }\\n\\n // Bellman-ford algorithm using queue (deque)\\n // Complexity: O(VE)\\n // Requirement: no negative loop\\n void SPFA(int s) {\\n assert(0 <= s and s < V);\\n dist.assign(V, INF);\\n prev.assign(V, INVALID);\\n std::deque<int> q;\\n std::vector<char> in_queue(V);\\n dist[s] = 0;\\n q.push_back(s), in_queue[s] = 1;\\n while (!q.empty()) {\\n int now = q.front();\\n q.pop_front(), in_queue[now] = 0;\\n for (auto nx : to[now]) {\\n T dnx = dist[now] + nx.second;\\n int nxt = nx.first;\\n if (dist[nxt] > dnx) {\\n dist[nxt] = dnx;\\n if (!in_queue[nxt]) {\\n if (q.size() and dnx < dist[q.front()]) { // Small label first optimization\\n q.push_front(nxt);\\n } else {\\n q.push_back(nxt);\\n }\\n prev[nxt] = now, in_queue[nxt] = 1;\\n }\\n }\\n }\\n }\\n }\\n\\n void ZeroOneBFS(int s) {\\n assert(0 <= s and s < V);\\n dist.assign(V, INF), prev.assign(V, INVALID);\\n dist[s] = 0;\\n std::deque<int> que;\\n que.push_back(s);\\n while (!que.empty()) {\\n int v = que.front();\\n que.pop_front();\\n for (auto nx : to[v]) {\\n T dnx = dist[v] + nx.second;\\n if (dist[nx.first] > dnx) {\\n dist[nx.first] = dnx, prev[nx.first] = v;\\n if (nx.second) {\\n que.push_back(nx.first);\\n } else {\\n que.push_front(nx.first);\\n }\\n }\\n }\\n }\\n }\\n\\n bool dag_solver(int s) {\\n assert(0 <= s and s < V);\\n std::vector<int> indeg(V, 0);\\n std::queue<int> que;\\n que.push(s);\\n while (que.size()) {\\n int now = que.front();\\n que.pop();\\n for (auto nx : to[now]) {\\n indeg[nx.first]++;\\n if (indeg[nx.first] == 1) que.push(nx.first);\\n }\\n }\\n dist.assign(V, INF), prev.assign(V, INVALID);\\n dist[s] = 0;\\n que.push(s);\\n while (que.size()) {\\n int now = que.front();\\n que.pop();\\n for (auto nx : to[now]) {\\n indeg[nx.first]--;\\n if (dist[nx.first] > dist[now] + nx.second)\\n dist[nx.first] = dist[now] + nx.second, prev[nx.first] = now;\\n if (indeg[nx.first] == 0) que.push(nx.first);\\n }\\n }\\n return *max_element(indeg.begin(), indeg.end()) == 0;\\n }\\n\\n // Retrieve a sequence of vertex ids that represents shortest path [s, ..., goal]\\n // If not reachable to goal, return {}\\n std::vector<int> retrieve_path(int goal) const {\\n assert(int(prev.size()) == V);\\n assert(0 <= goal and goal < V);\\n if (dist[goal] == INF) return {};\\n std::vector<int> ret{goal};\\n while (prev[goal] != INVALID) {\\n goal = prev[goal];\\n ret.push_back(goal);\\n }\\n std::reverse(ret.begin(), ret.end());\\n return ret;\\n }\\n\\n void solve(int s) {\\n if (wmin >= 0) {\\n if (single_positive_weight) {\\n ZeroOneBFS(s);\\n } else {\\n if ((long long)V * V < (E << 4)) {\\n DijkstraVquad(s);\\n } else {\\n Dijkstra(s);\\n }\\n }\\n } else {\\n BellmanFord(s, V);\\n }\\n }\\n\\n // Warshall-Floyd algorithm\\n // Complexity: O(E + V^3)\\n std::vector<std::vector<T>> dist2d;\\n void WarshallFloyd() {\\n dist2d.assign(V, std::vector<T>(V, INF));\\n for (int i = 0; i < V; i++) {\\n dist2d[i][i] = 0;\\n for (auto p : to[i]) dist2d[i][p.first] = std::min(dist2d[i][p.first], p.second);\\n }\\n for (int k = 0; k < V; k++) {\\n for (int i = 0; i < V; i++) {\\n if (dist2d[i][k] == INF) continue;\\n for (int j = 0; j < V; j++) {\\n if (dist2d[k][j] == INF) continue;\\n dist2d[i][j] = std::min(dist2d[i][j], dist2d[i][k] + dist2d[k][j]);\\n }\\n }\\n }\\n }\\n\\n void dump_graphviz(std::string filename = \\\"shortest_path\\\") const {\\n std::ofstream ss(filename + \\\".DOT\\\");\\n ss << \\\"digraph{\\\\n\\\";\\n for (int i = 0; i < V; i++) {\\n for (const auto &e : to[i]) ss << i << \\\"->\\\" << e.first << \\\"[label=\\\" << e.second << \\\"];\\\\n\\\";\\n }\\n ss << \\\"}\\\\n\\\";\\n ss.close();\\n return;\\n }\\n};\\n\\n\\n// Partition matroid (partitional matroid) : direct sum of uniform matroids\\nclass PartitionMatroid {\\n using Element = int;\\n int M;\\n std::vector<std::vector<Element>> parts;\\n std::vector<int> belong;\\n std::vector<int> R;\\n std::vector<int> cnt;\\n std::vector<std::vector<Element>> circuits;\\n\\npublic:\\n // parts: partition of [0, 1, ..., M - 1]\\n // R: only R[i] elements from parts[i] can be chosen for each i.\\n PartitionMatroid(int M, const std::vector<std::vector<int>> &parts_, const std::vector<int> &R_)\\n : M(M), parts(parts_), belong(M, -1), R(R_) {\\n assert(parts.size() == R.size());\\n for (int i = 0; i < int(parts.size()); i++) {\\n for (Element e : parts[i]) belong[e] = i;\\n }\\n for (Element e = 0; e < M; e++) {\\n // assert(belong[e] != -1);\\n if (belong[e] == -1) {\\n belong[e] = parts.size();\\n parts.push_back({e});\\n R.push_back(1);\\n }\\n }\\n }\\n int size() const { return M; }\\n\\n template <class State> void set(const State &I) {\\n cnt = R;\\n for (int e = 0; e < M; e++) {\\n if (I[e]) cnt[belong[e]]--;\\n }\\n circuits.assign(cnt.size(), {});\\n for (int e = 0; e < M; e++) {\\n if (I[e] and cnt[belong[e]] == 0) circuits[belong[e]].push_back(e);\\n }\\n }\\n\\n std::vector<Element> circuit(const Element e) const {\\n assert(0 <= e and e < M);\\n int p = belong[e];\\n if (cnt[p] == 0) {\\n auto ret = circuits[p];\\n ret.push_back(e);\\n return ret;\\n }\\n return {};\\n }\\n};\\n\\n// GraphicMatroid: subgraph of undirected graphs, without loops\\nclass GraphicMatroid {\\n using Vertex = int;\\n using Element = int;\\n int M;\\n int V; // # of vertices of graph\\n std::vector<std::vector<std::pair<Vertex, Element>>> to;\\n std::vector<std::pair<Vertex, Vertex>> edges;\\n std::vector<Element> backtrack;\\n std::vector<Vertex> vprev;\\n std::vector<int> depth, root;\\n\\npublic:\\n GraphicMatroid(int V, const std::vector<std::pair<Vertex, Vertex>> &edges_)\\n : M(edges_.size()), V(V), to(V), edges(edges_) {\\n for (int e = 0; e < int(edges_.size()); e++) {\\n int u = edges_[e].first, v = edges_[e].second;\\n assert(0 <= u and u < V);\\n assert(0 <= v and v < V);\\n if (u != v) {\\n to[u].emplace_back(v, e);\\n to[v].emplace_back(u, e);\\n }\\n }\\n }\\n int size() const { return M; }\\n\\n std::vector<Vertex> que;\\n template <class State> void set(State I) {\\n assert(int(I.size()) == M);\\n backtrack.assign(V, -1);\\n vprev.assign(V, -1);\\n depth.assign(V, -1);\\n root.assign(V, -1);\\n que.resize(V);\\n int qb = 0, qe = 0;\\n for (Vertex i = 0; i < V; i++) {\\n if (backtrack[i] >= 0) continue;\\n que[qb = 0] = i, qe = 1, depth[i] = 0;\\n while (qb < qe) {\\n Vertex now = que[qb++];\\n root[now] = i;\\n for (auto nxt : to[now]) {\\n if (depth[nxt.first] < 0 and I[nxt.second]) {\\n backtrack[nxt.first] = nxt.second;\\n vprev[nxt.first] = now;\\n depth[nxt.first] = depth[now] + 1;\\n que[qe++] = nxt.first;\\n }\\n }\\n }\\n }\\n }\\n\\n std::vector<Element> circuit(const Element e) const {\\n assert(0 <= e and e < M);\\n Vertex s = edges[e].first, t = edges[e].second;\\n if (root[s] != root[t]) return {};\\n std::vector<Element> ret{e};\\n auto step = [&](Vertex &i) { ret.push_back(backtrack[i]), i = vprev[i]; };\\n int ddepth = depth[s] - depth[t];\\n for (; ddepth > 0; --ddepth) step(s);\\n for (; ddepth < 0; ++ddepth) step(t);\\n while (s != t) step(s), step(t);\\n return ret;\\n }\\n};\\n\\n// (Min weight) matroid intersection solver\\n// Algorithm based on http://dopal.cs.uec.ac.jp/okamotoy/lect/2015/matroid/\\n// Complexity: O(CE^2 + E^3) (C : circuit query, non-weighted)\\ntemplate <class M1, class M2, class T = int>\\nstd::vector<bool> MatroidIntersection(M1 matroid1, M2 matroid2, std::vector<T> weights = {}) {\\n using State = std::vector<bool>;\\n using Element = int;\\n assert(matroid1.size() == matroid2.size());\\n const int M = matroid1.size();\\n\\n for (auto &x : weights) x *= M + 1;\\n if (weights.empty()) weights.assign(M, 0);\\n\\n const Element gs = M, gt = M + 1;\\n State I(M);\\n\\n while (true) {\\n ShortestPath<T> sssp(M + 2);\\n matroid1.set(I);\\n matroid2.set(I);\\n for (int e = 0; e < M; e++) {\\n if (I[e]) continue;\\n auto c1 = matroid1.circuit(e), c2 = matroid2.circuit(e);\\n if (c1.empty()) sssp.add_edge(e, gt, 0);\\n for (Element f : c1) {\\n if (f != e) sssp.add_edge(e, f, -weights[f] + 1);\\n }\\n if (c2.empty()) sssp.add_edge(gs, e, weights[e] + 1);\\n for (Element f : c2) {\\n if (f != e) sssp.add_edge(f, e, weights[e] + 1);\\n }\\n }\\n sssp.solve(gs);\\n auto aug_path = sssp.retrieve_path(gt);\\n if (aug_path.empty()) break;\\n for (auto e : aug_path) {\\n if (e != gs and e != gt) I[e] = !I[e];\\n }\\n }\\n return I;\\n}\\n\\n\\n\\nint main() {\\n while (true) {\\n int N, M, K;\\n cin >> N >> M >> K;\\n if (N == 0) break;\\n vector<vector<int>> partition(2);\\n vector<int> R{K, N - 1 - K};\\n vector<pint> edges;\\n vector<int> weights;\\n REP(e, M) {\\n int u, v, w;\\n char l;\\n cin >> u >> v >> w >> l;\\n --u, --v;\\n partition[l == 'B'].push_back(e);\\n edges.emplace_back(u, v);\\n weights.push_back(w);\\n }\\n PartitionMatroid M1(M, partition, R);\\n GraphicMatroid M2(N, edges);\\n vector<bool> ret = MatroidIntersection(M1, M2, weights);\\n int ne = accumulate(ret.begin(), ret.end(), 0);\\n if (ne < N - 1) {\\n cout << \\\"-1\\\\n\\\";\\n } else {\\n int sum = 0;\\n for (int e = 0; e < M; ++e) sum += ret[e] * weights[e];\\n cout << sum << '\\\\n';\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 360,\n \"memory_kb\": 4144,\n \"score_of_the_acc\": -0.5517,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1605_6030082\",\n \"code_snippet\": \"#include<cstdio>\\n#include<queue>\\n#include<set>\\n#include<algorithm>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<ll, ll> P;\\ntypedef pair<ll, P> Q;\\nconstexpr ll INF = 1000000000000000LL;\\nconstexpr Q QINF = Q(INF+10, P(INF, INF));\\nconstexpr Q QINF2 = Q(-INF, P(INF, INF));\\n\\nclass UnionFind {\\n vector<ll> par, rank; // par > 0: number, par < 0: -par\\npublic:\\n UnionFind(ll n) : par(n, 1), rank(n, 0) {}\\n ll getSize(ll x) {\\n return par[find(x)];\\n }\\n ll find(ll x) {\\n if (par[x] > 0) return x;\\n return -(par[x] = -find(-par[x]));\\n }\\n void merge(ll x, ll y) {\\n x = find(x);\\n y = find(y);\\n if (x == y) return;\\n if (rank[x] < rank[y]) {\\n par[y] += par[x];\\n par[x] = -y;\\n } else {\\n par[x] += par[y];\\n par[y] = -x;\\n if (rank[x] == rank[y]) rank[x]++;\\n }\\n }\\n bool isSame(ll x, ll y) {\\n return find(x) == find(y);\\n }\\n};\\n\\n\\nll n, m, k, u, v, w;\\nchar l[2];\\nset<P> e[200];\\n\\nQ dfs(ll now, ll to, ll par) {\\n if (now == to) return QINF2;\\n for (P p : e[now]) if (p.first != par) {\\n Q q = dfs(p.first, to, now);\\n if (q.first != INF + 10) {\\n return max(q, Q(p.second, P(now, p.first)));\\n }\\n }\\n return QINF;\\n}\\n\\nint main() {\\n while (scanf(\\\"%lld%lld%lld\\\", &n, &m, &k), n) {\\n ll ans = 0;\\n vector<Q> ea, eb;\\n set<Q> rest;\\n for (ll i = 0; i < n; i++) e[i].clear();\\n for (ll i = 0; i < m; i++) {\\n scanf(\\\"%lld%lld%lld%s\\\", &u, &v, &w, l);\\n if (l[0] == 'A') ea.push_back(Q(w, P(u-1, v-1)));\\n else eb.push_back(Q(w, P(u-1, v-1)));\\n }\\n sort(ea.begin(), ea.end());\\n sort(eb.begin(), eb.end());\\n UnionFind uf(n);\\n for (Q q : eb) {\\n u = q.second.first, v = q.second.second, w = q.first;\\n if (uf.isSame(u, v)) continue;\\n ans += w;\\n uf.merge(u, v);\\n e[u].insert(P(v, w));\\n e[v].insert(P(u, w));\\n }\\n for (Q q : ea) {\\n u = q.second.first, v = q.second.second, w = q.first;\\n if (uf.isSame(u, v)) {\\n rest.insert(Q(w, P(u, v)));\\n continue;\\n }\\n ans += w;\\n uf.merge(u, v);\\n e[u].insert(P(v, -INF));\\n e[v].insert(P(u, -INF));\\n k--;\\n }\\n if (uf.getSize(0) != n or k < 0 or k > (ll)rest.size()) {\\n printf(\\\"-1\\\\n\\\");\\n continue;\\n }\\n for (ll i = 0; i < k; i++) {\\n ll mn = INF;\\n Q result, result2;\\n for (Q q : rest) {\\n u = q.second.first, v = q.second.second, w = q.first;\\n Q t = dfs(u, v, -1);\\n if (t.first == -INF) continue;\\n ll tmp = w - t.first;\\n if (mn > tmp) {\\n mn = tmp;\\n result = q;\\n result2 = t;\\n }\\n }\\n if (mn == INF) {\\n ans = -1;\\n break;\\n }\\n ans += mn;\\n u = result.second.first, v = result.second.second, w = result.first;\\n e[u].insert(P(v, -INF));\\n e[v].insert(P(u, -INF));\\n u = result2.second.first, v = result2.second.second, w = result2.first;\\n e[u].erase(P(v, w));\\n e[v].erase(P(u, w));\\n rest.erase(result);\\n }\\n printf(\\\"%lld\\\\n\\\", ans);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 160,\n \"memory_kb\": 2988,\n \"score_of_the_acc\": -0.1875,\n \"final_rank\": 8\n }\n]","isConversational":false}}},{"rowIdx":987,"cells":{"group_id":{"kind":"string","value":"aoj_1615_cpp"},"problem_description":{"kind":"string","value":"Gift Exchange Party\nA gift exchange party will be held at a school in TKB City.\nFor every pair of students who are close friends, one gift must be given from one to the other at this party, but not the other way around.\nIt is decided in advance the gift directions, that is, which student of each pair receives a gift.\nNo other gift exchanges are made.\nIf each pair randomly decided the gift direction,\nsome might receive countless gifts, while some might receive only few or even none.\nYou'd like to decide the gift directions for all the friend pairs\nthat minimize the difference between the smallest and the largest numbers of gifts received by a student.\nFind the smallest and the largest numbers of gifts received\nwhen the difference between them is minimized.\nWhen there is more than one way to realize that, \nfind the way that maximizes the smallest number of received gifts.\nInput\nThe input consists of at most 10 datasets, each in the following format.\nn\nm\nu\n1\nv\n1\n...\nu\nm\nv\nm\nn\nis the number of students, and\nm\nis the number of friendship relations (2 ≤\nn\n≤ 100, 1 ≤\nm\n≤\nn\n(\nn\n-1)/2). \nStudents are denoted by integers between 1 and\nn\n, inclusive.\nThe following\nm\nlines describe the friendship relations: for each\ni\n, student\nu\ni\nand\nv\ni\nare close friends (\nu\ni\n<\nv\ni\n).\nThe same friendship relations do not appear more than once.\nThe end of the input is indicated by a line containing two zeros.\nOutput\nFor each dataset, output a single line containing two integers\nl\nand\nh\nseparated by a single space.\nHere,\nl\nand\nh\nare the smallest and the largest numbers, respectively, of gifts received by a student.\nSample Input\n3 3\n1 2\n2 3\n1 3\n4 3\n1 2\n1 3\n1 4\n4 6\n1 2\n1 3\n1 4\n2 3\n3 4\n2 4\n0 0\nOutput for the Sample Input\n1 1\n0 1\n1 2"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1615_10945981","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define FOR(i,k,n) for(int i = (int)(k); i < (int)(n); i++)\n#define REP(i,n) FOR(i,0,n)\n#define ALL(a) a.begin(), a.end()\n#define MS(m,v) memset(m,v,sizeof(m))\ntypedef long long ll;\ntypedef long double ld;\ntypedef vector<int> vi;\ntypedef vector<string> vs;\ntypedef pair<int, int> pii;\nconst int MOD = 1e9 + 7;\ntemplate<class T> T &chmin(T &a, const T &b) { return a = min(a, b); }\ntemplate<class T> T &chmax(T &a, const T &b) { return a = max(a, b); }\ntemplate<class T>\nistream& operator >> (istream& is, vector<T>& v)\n{\n\tfor (auto &i : v) is >> i;\n\treturn is;\n}\ntemplate<class T>\nostream& operator<<(ostream& os, vector<T>& v)\n{\n\tconst string delimiter = \"\\n\";\n\tREP(i, v.size())\n\t{\n\t\tos << v[i];\n\t\tif (i != v.size() - 1) os << delimiter;\n\t}\n\treturn os;\n}\n/*--------------------template--------------------*/\n\nconst int INF = 1e6;\n\ntypedef int Weight;\ntypedef int Flow;\nstruct Edge {\n\tint src, dest, rev;\n\tFlow cap;\n\tWeight cost;\n\tbool operator < (const Edge &rhs) const\n\t{\n\t\treturn cost > rhs.cost;\n\t}\n\tEdge(int s, int d) : src(s), dest(d) { ; }\n\tEdge(int s, int d, int c) : src(s), dest(d), cost(c) { ; }\n\tEdge(int s, int d, int r, Flow cp, Weight cst) : src(s), dest(d), rev(r), cap(cp), cost(cst) { ; }\n};\ntypedef vector<Edge> Edges;\ntypedef vector<Edges> Graph;\ntypedef vector<Weight> Array;\ntypedef vector<Array> Matrix;\nvoid add_edge(Graph &g, int src, int dest, Flow cap)\n{\n\tg[src].push_back(Edge{ src, dest, (int)g[dest].size(), cap, 0 });\n\tg[dest].push_back(Edge{ dest, src, (int)g[src].size() - 1, 0, 0 });\n}\n\nvoid add_edge(Graph &g, int from, int to, Flow cap, Weight cost)\n{\n\tg[from].push_back(Edge(from, to, (int)g[to].size(), cap, cost));\n\tg[to].push_back(Edge(to, from, (int)g[from].size() - 1, 0, -cost));\n}\n\nFlow dfs(Graph &g, vector<bool> &used, int v, int t, Flow f)\n{\n\tif (v == t) return f;\n\tused[v] = true;\n\tfor (Edge& e : g[v])\n\t{\n\t\tif (!used[e.dest] && e.cap > 0)\n\t\t{\n\t\t\tFlow d = dfs(g, used, e.dest, t, min(f, e.cap));\n\t\t\tif (d > 0)\n\t\t\t{\n\t\t\t\te.cap -= d;\n\t\t\t\tg[e.dest][e.rev].cap += d;\n\t\t\t\treturn d;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}\n\nFlow ford_fulkerson(Graph &g, int s, int t)\n{\n\tFlow flow = 0;\n\tfor (;;)\n\t{\n\t\tvector<bool> used(g.size(), false);\n\t\tFlow f = dfs(g, used, s, t, INF);\n\t\tif (f == 0) return flow;\n\t\tflow += f;\n\t}\n}\n\n\nint main()\n{\n\tcin.sync_with_stdio(false); cout << fixed << setprecision(10);\n\tint n, m;\n\twhile (cin >> n >> m, n)\n\t{\n\t\tGraph g(n + m + 2);\n\t\tint src = n + m, sink = n + m + 1;\n\t\tREP(i, m) add_edge(g, src, i, 1);\n\t\tREP(i, m)\n\t\t{\n\t\t\tint a, b; cin >> a >> b;\n\t\t\ta--; b--;\n\t\t\tadd_edge(g, i, m + a, 1);\n\t\t\tadd_edge(g, i, m + b, 1);\n\t\t}\n\t\tint tmpcap = -1;\n\t\tint mn = -1, mx = -1;\n\t\twhile(1)\n\t\t{\n\t\t\ttmpcap++;\n\t\t\tGraph h = g;\n\t\t\tREP(i, n) add_edge(h, m + i, sink, tmpcap);\n\t\t\tint f = ford_fulkerson(h, src, sink);\n\t\t\tif (tmpcap * n == f)\n\t\t\t{\n\t\t\t\tmn = tmpcap;\n\t\t\t}\n\t\t\tif (m == f)\n\t\t\t{\n\t\t\t\tmx = tmpcap;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t\tcout << mn << \" \" << mx << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":650,"memory_kb":4832,"score_of_the_acc":-0.8085,"final_rank":16},{"submission_id":"aoj_1615_10684468","code_snippet":"#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\nusing namespace std;\n\n// 数値型\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\nusing P = pair<int,int>;\nusing Pll = pair<ll, ll>;\nusing Pli = pair<ll, int>;\nusing Pil = pair<int, ll>;\n\n// vector関連\nusing vi = vector<int>;\nusing vvi = vector<vi>;\nusing vvvi = vector<vvi>;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\ntemplate<typename T>\nusing vc = vector<T>;\ntemplate<typename T>\nusing vvc = vector<vc<T>>;\ntemplate<typename T>\nusing vvvc = vector<vvc<T>>;\ntemplate<typename T>\nusing vvvvc = vector<vvvc<T>>;\n\n// priority_queue\ntemplate<typename T>\nusing pq = priority_queue<T>;\ntemplate<typename T>\nusing pqg = priority_queue<T, vc<T>, greater<T>>;\n\n#define rep(i, n) for(int i = 0; i < (int)(n); i++)\n#define FOR(i, a, b) for(int i = a; i < (int)(b); i++)\n#define all(a) (a).begin(),(a).end()\n#define rall(a) (a).rbegin(),(a).rend()\n#define MIN(vec) *min_element(vec)\n#define MAX(vec) *max_element(vec)\n#define next_perm(vec) (vec).begin(), (vec).end()\n#define UNIQUE(vec) vec.erase(unique(vec.begin(), vec.end()), vec.end())\n#define el \"\\n\"\n#define Yes cout << \"Yes\" << el\n#define No cout << \"No\" << el\n#define YES cout << \"YES\" << el\n#define NO cout << \"NO\" << el\n#define EPS 1e-8\n#define Equal(a, b) (fabs((a)-(b)) < EPS) \n#define dbg(x) cerr << #x << \"=\" << x << el \n\n// 定数\nconst string abc = \"abcdefghijklmnopqrstuvwxyz\";\nconst string ABC = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconstexpr int INF = 1001001001;\nconstexpr ll LINF = 1001001001001001001ll;\nconstexpr int DX[] = {1, 0, -1, 0};\nconstexpr int DY[] = {0, 1, 0, -1};\nconstexpr int DX8[] = {1, 0, -1, 0, 1, 1, -1, -1};\nconstexpr int DY8[] = {0, 1, 0, -1, 1, -1, 1, -1};\n\ntemplate<typename T1, typename T2>\nostream &operator<< (ostream &os, pair<T1, T2> p) {\n os << \"{\" << p.first << \",\" << p.second << \"}\";\n return os;\n}\ntemplate<typename T>\nostream &operator<< (ostream &os, vc<T> &vec) {\n int sz = vec.size();\n rep(i, sz){\n os << vec[i] << (i==sz-1?\"\":\" \");\n }\n return os;\n}\n\ntemplate<typename T1, typename T2>\nistream &operator>> (istream &is, pair<T1, T2> &p) {\n is >> p.first >> p.second;\n return is;\n}\ntemplate<typename T>\nistream &operator>> (istream &is, vc<T> &vec) {\n int sz = vec.size();\n rep(i, sz) { is >> vec[i]; }\n return is;\n}\n/// @brief aとｂの最大値をaに格納。更新があったかbool値を返す\n/// @tparam T1 \n/// @tparam T2 \n/// @param a \n/// @param b \n/// @return bool\ntemplate<typename T1, typename T2>\ninline bool chmax(T1 &a, T2 b){\n bool ret = a<b;\n if(ret) a = b;\n return ret;\n}\n\n/// @brief aとｂの最小値をaに格納。更新があったかbool値を返す\n/// @tparam T1 \n/// @tparam T2 \n/// @param a \n/// @param b \n/// @return bool\ntemplate<typename T1, typename T2>\ninline bool chmin(T1 &a, T2 b){\n bool ret = a>b;\n if(ret) {a = b;}\n return ret;\n}\n\ninline void YesNo(bool flag){\n if(flag) {Yes;}\n else {No;}\n return;\n}\n\ninline void YESNO(bool flag){\n if(flag) {YES;}\n else {NO;}\n return;\n}\n\ninline bool outof(ll x, ll xlim){\n return (x<0 || x>=xlim);\n}\n\ntemplate<typename T>\ninline T sqnorm(T x, T y){\n return x*x+y*y;\n}\n\n/// @brief char->int\n/// @param c \n/// @return int\ninline int ctoi(char c){\n return c-'0';\n}\n\n/// @brief xを素因数分解\n/// @param x \n/// @return vector<Pli>, 素因数の昇順に {p, cnt}\nvector<Pli> prime_fact(ll x){\n vector<Pli> ret;\n for(ll i=2; i*i<=x; i++){\n if(x%i == 0){\n ret.emplace_back(i, 0);\n while(x%i == 0){\n ret.back().second++;\n x /= i;\n }\n }\n }\n if(x != 1) ret.emplace_back(x, 1);\n return ret;\n}\n\n/// @brief xの約数列挙\n/// @param x \n/// @return vll, 約数の昇順\nvll divisor_enum(ll x){\n vector<ll> ret;\n for(ll i=1; i*i<=x; i++){\n if(x%i == 0){\n ret.push_back(x/i);\n ret.push_back(i);\n }\n }\n sort(all(ret));\n UNIQUE(ret);\n return ret;\n}\n\n/// @brief 繰り返し二乗法。\n/// @tparam T \n/// @param x \n/// @param k \n/// @param op \n/// @param e \n/// @return \ntemplate<typename T>\nT pow_t(T x, ll k, T (*op)(T, T), T (*e)()){\n T ret = e();\n while(k){\n if(k&1) ret *= x;\n x *= x;\n k >>= 1;\n }\n return ret;\n}\n\nll powll(ll x, ll k){\n return pow_t<ll>(x, k, [](ll a, ll b) -> ll{return a*b;}, []() -> ll{return 1;});\n}\n\ninline int pop_cnt(ll x) { return __builtin_popcountll(x); }\ninline int top_bit(ll x) { return (x==0?-1:63-__builtin_clzll(x));}\n\ntemplate< typename flow_t >\nstruct Dinic {\n const flow_t INF;\n\n struct edge {\n int to;\n flow_t cap;\n int rev;\n bool isrev;\n int idx;\n };\n\n vector< vector< edge > > graph;\n vector< int > min_cost, iter;\n\n Dinic(int V) : INF(numeric_limits< flow_t >::max()), graph(V) {}\n\n void add_edge(int from, int to, flow_t cap, int idx = -1) {\n graph[from].emplace_back((edge) {to, cap, (int) graph[to].size(), false, idx});\n graph[to].emplace_back((edge) {from, 0, (int) graph[from].size() - 1, true, idx});\n }\n\n bool bfs(int s, int t) {\n min_cost.assign(graph.size(), -1);\n queue< int > que;\n min_cost[s] = 0;\n que.push(s);\n while(!que.empty() && min_cost[t] == -1) {\n int p = que.front();\n que.pop();\n for(auto &e : graph[p]) {\n if(e.cap > 0 && min_cost[e.to] == -1) {\n min_cost[e.to] = min_cost[p] + 1;\n que.push(e.to);\n }\n }\n }\n return min_cost[t] != -1;\n }\n\n flow_t dfs(int idx, const int t, flow_t flow) {\n if(idx == t) return flow;\n for(int &i = iter[idx]; i < graph[idx].size(); i++) {\n edge &e = graph[idx][i];\n if(e.cap > 0 && min_cost[idx] < min_cost[e.to]) {\n flow_t d = dfs(e.to, t, min(flow, e.cap));\n if(d > 0) {\n e.cap -= d;\n graph[e.to][e.rev].cap += d;\n return d;\n }\n }\n }\n return 0;\n }\n\n flow_t max_flow(int s, int t) {\n flow_t flow = 0;\n while(bfs(s, t)) {\n iter.assign(graph.size(), 0);\n flow_t f = 0;\n while((f = dfs(s, t, INF)) > 0) flow += f;\n }\n return flow;\n }\n\n void output() {\n for(int i = 0; i < graph.size(); i++) {\n for(auto &e : graph[i]) {\n if(e.isrev) continue;\n auto &rev_e = graph[e.to][e.rev];\n cout << i << \"->\" << e.to << \" (flow: \" << rev_e.cap << \"/\" << e.cap + rev_e.cap << \")\" << endl;\n }\n }\n }\n};\n\n\ntemplate< typename flow_t, template< typename > class F >\nstruct MaxFlowLowerBound {\n F< flow_t > flow;\n vector< flow_t > in, up;\n typename F< flow_t >::edge *latte, *malta;\n int X, Y, V;\n flow_t sum;\n\n MaxFlowLowerBound(int V) : V(V), flow(V + 2), X(V), Y(V + 1), sum(0), in(V) {}\n\n void add_edge(int from, int to, flow_t low, flow_t high) {\n assert(from != to);\n flow.add_edge(from, to, high - low, up.size());\n in[from] -= low;\n in[to] += low;\n up.emplace_back(high);\n }\n\n void build() {\n for(int i = 0; i < V; i++) {\n if(in[i] > 0) {\n flow.add_edge(X, i, in[i]);\n sum += in[i];\n } else if(in[i] < 0) {\n flow.add_edge(i, Y, -in[i]);\n }\n }\n }\n\n bool can_flow(int s, int t) {\n assert(s != t);\n flow.add_edge(t, s, flow.INF);\n latte = &flow.graph[t].back();\n malta = &flow.graph[s].back();\n return can_flow();\n }\n\n bool can_flow() {\n build();\n auto ret = flow.max_flow(X, Y);\n return ret >= sum;\n }\n\n flow_t max_flow(int s, int t) {\n if(can_flow(s, t)) {\n return flow.max_flow(s, t);\n } else {\n return -1;\n }\n }\n\n flow_t min_flow(int s, int t) {\n if(can_flow(s, t)) {\n auto ret = flow.INF - latte->cap;\n latte->cap = malta->cap = 0;\n return ret - flow.max_flow(t, s);\n } else {\n return -1;\n }\n }\n\n void output(int M) {\n vector< flow_t > ans(M);\n for(int i = 0; i < flow.graph.size(); i++) {\n for(auto &e : flow.graph[i]) {\n if(!e.isrev && ~e.idx) ans[e.idx] = up[e.idx] - e.cap;\n }\n }\n for(auto &p : ans) cout << p << endl;\n }\n};\n\n\n\n\nvoid main2();\n\nint main(){\n ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n main2();\n}\n\nbool solve(){\n int n, m;\n cin >> n >> m;\n if(n == 0) return false;\n vc<P> es(m);\n rep(i, m){\n int u, v;\n cin >> u >> v;\n u--;v--;\n es[i] = {u, v};\n }\n int ma = 0;\n P ans = {INF, 2*INF};\n rep(mi, n+1){\n bool ng = false;\n chmax(ma, mi);\n while(true){\n vi vvv(1, 2+n+m);\n MaxFlowLowerBound<int, Dinic> mf(n+m+2);\n rep(i, m){\n auto [u, v] = es[i];\n mf.add_edge(n+m, i, 1, 1);\n mf.add_edge(i, m+u, 0, 1);\n mf.add_edge(i, m+v, 0, 1);\n }\n rep(i, n){\n mf.add_edge(m+i, n+m+1, mi, ma);\n }\n auto flow = mf.max_flow(n+m, n+m+1);\n if(flow >= m) break;\n if(ma == n){\n ng = true;\n break;\n }\n ma++;\n }\n if(ng) break;\n if(ans.second - ans.first > ma - mi){\n ans.first = mi;\n ans.second = ma;\n }\n }\n cout << ans.first << \" \" << ans.second << el;\n \n \n return true;\n}\n\nvoid main2(){\n while(solve()){\n ;\n }\n}","accuracy":1,"time_ms":220,"memory_kb":4608,"score_of_the_acc":-0.615,"final_rank":8},{"submission_id":"aoj_1615_10682955","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing uint = unsigned int;\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define all(v) v.begin(), v.end()\ntemplate <class T, class U>\ninline bool chmax(T &a, U b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T, class U>\ninline bool chmin(T &a, U b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T>\ninline void compress(vector<T> &a) {\n sort(a.begin(), a.end());\n a.erase(unique(a.begin(), a.end()), a.end());\n}\ntemplate <class T>\nT rand(T l, T r) {\n static mt19937 mt(random_device{}());\n // [l, r)\n if constexpr (is_integral_v<T>) {\n return uniform_int_distribution<T>(l, r - 1)(mt);\n } else if constexpr (is_floating_point_v<T>) {\n return uniform_real_distribution<T>(l, r)(mt);\n }\n}\nconstexpr int INF = 1001001001;\nconstexpr ll llINF = 3000000000000000010;\nstruct HLD {\n vector<vector<int>> g;\n vector<int> sz, in, out, par, head, dep, ord;\n HLD(vector<vector<int>> &g_, int root = 0)\n : g(g_), sz((int)g_.size()), in((int)g_.size()), out((int)g_.size()), par((int)g_.size()), head((int)g_.size(), root), dep((int)g_.size()) {\n dfs_sz(root, -1);\n dfs_hld(root, -1);\n }\n void dfs_sz(int v, int p) {\n par[v] = p;\n sz[v] = 1;\n if (g[v].size() && g[v][0] == p) swap(g[v][0], g[v].back());\n for (auto &i : g[v]) {\n if (i != p) {\n dep[i] = dep[v] + 1;\n dfs_sz(i, v);\n sz[v] += sz[i];\n if (sz[g[v][0]] < sz[i]) swap(g[v][0], i);\n }\n }\n }\n void dfs_hld(int v, int p) {\n in[v] = ord.size();\n ord.push_back(v);\n for (auto i : g[v]) {\n if (i != p) {\n if (i == g[v][0]) {\n // Heavy\n head[i] = head[v];\n } else {\n // Light\n head[i] = i;\n }\n dfs_hld(i, v);\n }\n }\n out[v] = ord.size();\n }\n int lca(int u, int v) {\n while (1) {\n if (in[u] > in[v]) swap(u, v);\n if (head[u] == head[v]) return u;\n v = par[head[v]];\n }\n }\n int dist(int u, int v) { return dep[u] + dep[v] - 2 * dep[lca(u, v)]; }\n int la(int v, int d) {\n while (v != -1) {\n int u = head[v];\n if (in[v] - d >= in[u]) return ord[in[v] - d];\n d -= in[v] - in[u] + 1, v = par[u];\n }\n return -1;\n }\n int jump(int from, int to, int d) {\n int l = lca(from, to);\n if (d <= dep[from] - dep[l]) return la(from, d);\n d -= dep[from] - dep[l];\n if (d <= dep[to] - dep[l]) return la(to, dep[to] - dep[l] - d);\n return -1;\n }\n};\ntemplate <typename T, typename U>\ninline istream &operator>>(istream &is, pair<T, U> &rhs) {\n return is >> rhs.first >> rhs.second;\n}\ntemplate <typename T>\ninline istream &operator>>(istream &is, vector<T> &v) {\n for (auto &e : v) is >> e;\n return is;\n}\ntemplate <typename T, typename U>\ninline ostream &operator<<(ostream &os, const pair<T, U> &rhs) {\n return os << rhs.first << \" \" << rhs.second;\n}\ntemplate <typename T>\ninline ostream &operator<<(ostream &os, const vector<T> &v) {\n for (auto itr = v.begin(), end_itr = v.end(); itr != end_itr;) {\n os << *itr;\n if (++itr != end_itr) os << \" \";\n }\n return os;\n}\n\nstruct FunctionMo {\n int n;\n vector<pair<int, int>> xy;\n\n explicit FunctionMo(int n) : n(n) {}\n\n void add(int x, int y) { xy.emplace_back(x, y); }\n\n template <typename AX, typename SX, typename AY, typename SY, typename O>\n void build(const AX &add_x, const SX &sub_x, const AY &add_y, const SY &sub_y, const O &out) {\n int q = (int)xy.size();\n int bs = max<int>(1, sqrt(n));\n vector<int> ord(q);\n iota(begin(ord), end(ord), 0);\n sort(begin(ord), end(ord), [&](int a, int b) {\n int ablock = xy[a].first / bs, bblock = xy[b].first / bs;\n if (ablock != bblock) return ablock < bblock;\n return (ablock & 1) ? xy[a].second > xy[b].second : xy[a].second < xy[b].second;\n });\n int x = 0, y = 0;\n for (auto idx : ord) {\n while (x > xy[idx].first) add_x(x++, y);\n while (y < xy[idx].second) add_y(x, y++);\n while (x < xy[idx].first) sub_x(x--, y);\n while (y > xy[idx].second) sub_y(x, y--);\n out(idx);\n }\n }\n\n template <typename A, typename E, typename O>\n void build(const A &add, const E &erase, const O &out) {\n build(add, add, erase, erase, out);\n }\n};\nstruct UnionFind {\n vector<int> par, siz;\n UnionFind(int x) {\n par.resize(x);\n siz.resize(x);\n for (int i = 0; i < x; i++) {\n par[i] = i;\n siz[i] = 1;\n }\n }\n int find(int x) {\n if (par[x] == x) return x;\n return par[x] = find(par[x]);\n }\n bool unite(int x, int y) {\n x = find(x), y = find(y);\n if (x == y) return false;\n if (siz[x] < siz[y]) swap(x, y);\n par[y] = x;\n siz[x] += siz[y];\n\n return true;\n }\n bool same(int x, int y) { return find(x) == find(y); }\n int size(int x) { return siz[find(x)]; }\n};\ntemplate <class T>\nstruct BIT {\n // 1-indexed\n int n, beki = 1;\n vector<T> bit;\n BIT(int x) {\n bit.resize(x + 1, 0);\n n = x;\n while (beki * 2 <= n) beki *= 2;\n }\n T sum(int i) {\n T res = 0;\n while (i > 0) {\n res += bit[i];\n i -= i & -i;\n }\n return res;\n }\n T sum(int l, int r) {\n //[l,r]\n return sum(r) - (l == 0 ? 0 : sum(l - 1));\n }\n void add(int i, T x) {\n while (i <= n) {\n bit[i] += x;\n i += i & -i;\n }\n }\n int lowerbound(T w) {\n if (w <= 0) return 0;\n int x = 0;\n for (int k = beki; k > 0; k >>= 1) {\n if (x + k <= n && bit[x + k] < w) {\n w -= bit[x + k];\n x += k;\n }\n }\n return x + 1;\n }\n};\ntemplate <typename T, typename Compare = less<T>>\nvector<pair<int, T>> monotone_minima(int H, int W, const function<T(int, int)> &f, const Compare &comp = Compare()) {\n vector<pair<int, T>> dp(H);\n function<void(int, int, int, int)> dfs = [&](int top, int bottom, int left, int right) {\n if (top > bottom) return;\n int line = (top + bottom) / 2;\n T ma;\n int mi = -1;\n for (int i = left; i <= right; i++) {\n T cst = f(line, i);\n if (mi == -1 || comp(cst, ma)) {\n ma = cst;\n mi = i;\n }\n }\n dp[line] = make_pair(mi, ma);\n dfs(top, line - 1, left, mi);\n dfs(line + 1, bottom, mi, right);\n };\n dfs(0, H - 1, 0, W - 1);\n return dp;\n}\n#include <algorithm>\n\n#include <vector>\n\nnamespace atcoder {\n\nnamespace internal {\n\ntemplate <class T> struct simple_queue {\n std::vector<T> payload;\n int pos = 0;\n void reserve(int n) { payload.reserve(n); }\n int size() const { return int(payload.size()) - pos; }\n bool empty() const { return pos == int(payload.size()); }\n void push(const T& t) { payload.push_back(t); }\n T& front() { return payload[pos]; }\n void clear() {\n payload.clear();\n pos = 0;\n }\n void pop() { pos++; }\n};\n\n} // namespace internal\n\n} // namespace atcoder\n\n#include <cassert>\n#include <limits>\n#include <queue>\n#include <vector>\n\nnamespace atcoder {\n\ntemplate <class Cap> struct mf_graph {\n public:\n mf_graph() : _n(0) {}\n mf_graph(int n) : _n(n), g(n) {}\n\n int add_edge(int from, int to, Cap cap) {\n assert(0 <= from && from < _n);\n assert(0 <= to && to < _n);\n assert(0 <= cap);\n int m = int(pos.size());\n pos.push_back({from, int(g[from].size())});\n int from_id = int(g[from].size());\n int to_id = int(g[to].size());\n if (from == to) to_id++;\n g[from].push_back(_edge{to, to_id, cap});\n g[to].push_back(_edge{from, from_id, 0});\n return m;\n }\n\n struct edge {\n int from, to;\n Cap cap, flow;\n };\n\n edge get_edge(int i) {\n int m = int(pos.size());\n assert(0 <= i && i < m);\n auto _e = g[pos[i].first][pos[i].second];\n auto _re = g[_e.to][_e.rev];\n return edge{pos[i].first, _e.to, _e.cap + _re.cap, _re.cap};\n }\n std::vector<edge> edges() {\n int m = int(pos.size());\n std::vector<edge> result;\n for (int i = 0; i < m; i++) {\n result.push_back(get_edge(i));\n }\n return result;\n }\n void change_edge(int i, Cap new_cap, Cap new_flow) {\n int m = int(pos.size());\n assert(0 <= i && i < m);\n assert(0 <= new_flow && new_flow <= new_cap);\n auto& _e = g[pos[i].first][pos[i].second];\n auto& _re = g[_e.to][_e.rev];\n _e.cap = new_cap - new_flow;\n _re.cap = new_flow;\n }\n\n Cap flow(int s, int t) {\n return flow(s, t, std::numeric_limits<Cap>::max());\n }\n Cap flow(int s, int t, Cap flow_limit) {\n assert(0 <= s && s < _n);\n assert(0 <= t && t < _n);\n assert(s != t);\n\n std::vector<int> level(_n), iter(_n);\n internal::simple_queue<int> que;\n\n auto bfs = [&]() {\n std::fill(level.begin(), level.end(), -1);\n level[s] = 0;\n que.clear();\n que.push(s);\n while (!que.empty()) {\n int v = que.front();\n que.pop();\n for (auto e : g[v]) {\n if (e.cap == 0 || level[e.to] >= 0) continue;\n level[e.to] = level[v] + 1;\n if (e.to == t) return;\n que.push(e.to);\n }\n }\n };\n auto dfs = [&](auto self, int v, Cap up) {\n if (v == s) return up;\n Cap res = 0;\n int level_v = level[v];\n for (int& i = iter[v]; i < int(g[v].size()); i++) {\n _edge& e = g[v][i];\n if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0) continue;\n Cap d =\n self(self, e.to, std::min(up - res, g[e.to][e.rev].cap));\n if (d <= 0) continue;\n g[v][i].cap += d;\n g[e.to][e.rev].cap -= d;\n res += d;\n if (res == up) break;\n }\n return res;\n };\n\n Cap flow = 0;\n while (flow < flow_limit) {\n bfs();\n if (level[t] == -1) break;\n std::fill(iter.begin(), iter.end(), 0);\n while (flow < flow_limit) {\n Cap f = dfs(dfs, t, flow_limit - flow);\n if (!f) break;\n flow += f;\n }\n }\n return flow;\n }\n\n std::vector<bool> min_cut(int s) {\n std::vector<bool> visited(_n);\n internal::simple_queue<int> que;\n que.push(s);\n while (!que.empty()) {\n int p = que.front();\n que.pop();\n visited[p] = true;\n for (auto e : g[p]) {\n if (e.cap && !visited[e.to]) {\n visited[e.to] = true;\n que.push(e.to);\n }\n }\n }\n return visited;\n }\n\n private:\n int _n;\n struct _edge {\n int to, rev;\n Cap cap;\n };\n std::vector<std::pair<int, int>> pos;\n std::vector<std::vector<_edge>> g;\n};\n\n} // namespace atcoder\n\nvoid solve() {\n int n, m;\n cin >> n >> m;\n if (n == 0) exit(0);\n vector<int> u(m), v(m);\n rep(i, m) {\n cin >> u[i] >> v[i];\n u[i]--, v[i]--;\n }\n atcoder::mf_graph<int> g_tmp(n + m + 4);\n int S = n + m, T = S + 1, e1 = T + 1, e2 = e1 + 1;\n rep(i, m) g_tmp.add_edge(S, n + i, 1);\n rep(i, m) {\n g_tmp.add_edge(n + i, u[i], 1);\n g_tmp.add_edge(n + i, v[i], 1);\n }\n // g_tmp.add_edge(e1, S, INF);\n // g_tmp.add_edge(T, e2, INF);\n int d = INF, ansl = -1, ansu = -1;\n for (int lb = m / n; lb >= 0; lb--) {\n int ok = n+1 , ng = lb - 1;\n while (ok - ng > 1) {\n int ub = (ok + ng) / 2;\n auto g = g_tmp;\n int cp=m;\n rep(i, n) {\n // i->T,[lb,ub]\n g.add_edge(i, T, lb);\n g.add_edge(i, e2, ub-lb);\n cp-=lb;\n }\n g.add_edge(e2,T,cp);\n if (g.flow(S, T) == m)\n ok = ub;\n else\n ng = ub;\n }\n if (ok == n + 1) continue;\n // cout << lb << \" \" << ok << endl;\n if (chmin(d, ok - lb)) {\n ansl = lb;\n ansu = ok;\n }\n }\n cout << ansl << \" \" << ansu << endl;\n}\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n int t = 1;\n // cin >> t;\n while (t) solve();\n}","accuracy":1,"time_ms":130,"memory_kb":4760,"score_of_the_acc":-0.675,"final_rank":14},{"submission_id":"aoj_1615_10673158","code_snippet":"#include <bits/stdc++.h>\n#define FAST_IO \n\n#define OVERRIDE(a,b,c,d,...) d\n#define REP2(i,n) for (i32 i = 0; i < (i32)(n); ++i)\n#define REP3(i,m,n) for (i32 i = (i32)(m); i < (i32)(n); ++i)\n#define REP(...) OVERRIDE(__VA_ARGS__, REP3, REP2)(__VA_ARGS__)\n#define PER2(i,n) for (i32 i = (i32)(n)-1; i >= 0; --i)\n#define PER3(i,m,n) for (i32 i = (i32)(n)-1; i >= (i32)(m); --i)\n#define PER(...) OVERRIDE(__VA_ARGS__, PER3, PER2)(__VA_ARGS__)\n#define ALL(x) begin(x), end(x)\n#define LEN(x) (i32)(x.size())\nusing namespace std;\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nusing i32 = signed int;\nusing i64 = signed long long;\nusing f64 = double;\nusing f80 = long double;\nusing pi = pair<i32, i32>;\nusing pl = pair<i64, i64>;\ntemplate <typename T>\nusing V = vector<T>;\ntemplate <typename T>\nusing VV = V<V<T>>;\ntemplate <typename T>\nusing VVV = V<V<V<T>>>;\ntemplate <typename T>\nusing VVVV = V<V<V<V<T>>>>;\ntemplate <typename T>\nusing PQR = priority_queue<T, V<T>, greater<T>>;\ntemplate <typename T>\nbool chmin(T &x, const T &y) {\n if (x > y) {\n x = y;\n return true;\n }\n return false;\n}\ntemplate <typename T>\nbool chmax(T &x, const T &y) {\n if (x < y) {\n x = y;\n return true;\n }\n return false;\n}\ntemplate <typename T>\ni32 lob(const V<T> &arr, const T &v) {\n return (i32)(lower_bound(ALL(arr), v) - arr.begin());\n}\ntemplate <typename T>\ni32 upb(const V<T> &arr, const T &v) {\n return (i32)(upper_bound(ALL(arr), v) - arr.begin());\n}\ntemplate <typename T>\nV<i32> argsort(const V<T> &arr) {\n V<i32> ret(arr.size());\n iota(ALL(ret), 0);\n sort(ALL(ret), [&](i32 i, i32 j) -> bool {\n if (arr[i] == arr[j]) {\n return i < j;\n } else {\n return arr[i] < arr[j];\n }\n });\n return ret;\n}\n[[maybe_unused]] constexpr i32 INF = 1000000100;\n[[maybe_unused]] constexpr i64 INF64 = 3000000000000000100;\nstruct SetUpIO {\n SetUpIO() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(15);\n }\n} set_up_io;\nvoid scan(char &x) { cin >> x; }\nvoid scan(u32 &x) { cin >> x; }\nvoid scan(u64 &x) { cin >> x; }\nvoid scan(i32 &x) { cin >> x; }\nvoid scan(i64 &x) { cin >> x; }\nvoid scan(string &x) { cin >> x; }\ntemplate <typename T>\nvoid scan(V<T> &x) {\n for (T &ele : x) {\n scan(ele);\n }\n}\nvoid read() {}\ntemplate <typename Head, typename... Tail>\nvoid read(Head &head, Tail &...tail) {\n scan(head);\n read(tail...);\n}\n#define CHAR(...) char __VA_ARGS__; read(__VA_ARGS__);\n#define U32(...) u32 __VA_ARGS__; read(__VA_ARGS__);\n#define U64(...) u64 __VA_ARGS__; read(__VA_ARGS__);\n#define I32(...) i32 __VA_ARGS__; read(__VA_ARGS__);\n#define I64(...) i64 __VA_ARGS__; read(__VA_ARGS__);\n#define STR(...) string __VA_ARGS__; read(__VA_ARGS__);\n#define VEC(type,name,size) V<type> name(size); read(name);\n#define VVEC(type,name,size1,size2) VV<type> name(size1, V<type>(size2)); read(name);\n#define DBG(...) (void)0\n\n#define ATCODER_MAXFLOW_HPP 1\n\n#define ATCODER_INTERNAL_QUEUE_HPP 1\nnamespace atcoder {\nnamespace internal {\ntemplate <class T> struct simple_queue {\n std::vector<T> payload;\n int pos = 0;\n void reserve(int n) { payload.reserve(n); }\n int size() const { return int(payload.size()) - pos; }\n bool empty() const { return pos == int(payload.size()); }\n void push(const T& t) { payload.push_back(t); }\n T& front() { return payload[pos]; }\n void clear() {\n payload.clear();\n pos = 0;\n }\n void pop() { pos++; }\n};\n}\n}\n\nnamespace atcoder {\ntemplate <class Cap> struct mf_graph {\n public:\n mf_graph() : _n(0) {}\n explicit mf_graph(int n) : _n(n), g(n) {}\n int add_edge(int from, int to, Cap cap) {\n assert(0 <= from && from < _n);\n assert(0 <= to && to < _n);\n assert(0 <= cap);\n int m = int(pos.size());\n pos.push_back({from, int(g[from].size())});\n int from_id = int(g[from].size());\n int to_id = int(g[to].size());\n if (from == to) to_id++;\n g[from].push_back(_edge{to, to_id, cap});\n g[to].push_back(_edge{from, from_id, 0});\n return m;\n }\n struct edge {\n int from, to;\n Cap cap, flow;\n };\n edge get_edge(int i) {\n int m = int(pos.size());\n assert(0 <= i && i < m);\n auto _e = g[pos[i].first][pos[i].second];\n auto _re = g[_e.to][_e.rev];\n return edge{pos[i].first, _e.to, _e.cap + _re.cap, _re.cap};\n }\n std::vector<edge> edges() {\n int m = int(pos.size());\n std::vector<edge> result;\n for (int i = 0; i < m; i++) {\n result.push_back(get_edge(i));\n }\n return result;\n }\n void change_edge(int i, Cap new_cap, Cap new_flow) {\n int m = int(pos.size());\n assert(0 <= i && i < m);\n assert(0 <= new_flow && new_flow <= new_cap);\n auto& _e = g[pos[i].first][pos[i].second];\n auto& _re = g[_e.to][_e.rev];\n _e.cap = new_cap - new_flow;\n _re.cap = new_flow;\n }\n Cap flow(int s, int t) {\n return flow(s, t, std::numeric_limits<Cap>::max());\n }\n Cap flow(int s, int t, Cap flow_limit) {\n assert(0 <= s && s < _n);\n assert(0 <= t && t < _n);\n assert(s != t);\n std::vector<int> level(_n), iter(_n);\n internal::simple_queue<int> que;\n auto bfs = [&]() {\n std::fill(level.begin(), level.end(), -1);\n level[s] = 0;\n que.clear();\n que.push(s);\n while (!que.empty()) {\n int v = que.front();\n que.pop();\n for (auto e : g[v]) {\n if (e.cap == 0 || level[e.to] >= 0) continue;\n level[e.to] = level[v] + 1;\n if (e.to == t) return;\n que.push(e.to);\n }\n }\n };\n auto dfs = [&](auto self, int v, Cap up) {\n if (v == s) return up;\n Cap res = 0;\n int level_v = level[v];\n for (int& i = iter[v]; i < int(g[v].size()); i++) {\n _edge& e = g[v][i];\n if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0) continue;\n Cap d =\n self(self, e.to, std::min(up - res, g[e.to][e.rev].cap));\n if (d <= 0) continue;\n g[v][i].cap += d;\n g[e.to][e.rev].cap -= d;\n res += d;\n if (res == up) return res;\n }\n level[v] = _n;\n return res;\n };\n Cap flow = 0;\n while (flow < flow_limit) {\n bfs();\n if (level[t] == -1) break;\n std::fill(iter.begin(), iter.end(), 0);\n Cap f = dfs(dfs, t, flow_limit - flow);\n if (!f) break;\n flow += f;\n }\n return flow;\n }\n std::vector<bool> min_cut(int s) {\n std::vector<bool> visited(_n);\n internal::simple_queue<int> que;\n que.push(s);\n while (!que.empty()) {\n int p = que.front();\n que.pop();\n visited[p] = true;\n for (auto e : g[p]) {\n if (e.cap && !visited[e.to]) {\n visited[e.to] = true;\n que.push(e.to);\n }\n }\n }\n return visited;\n }\n private:\n int _n;\n struct _edge {\n int to, rev;\n Cap cap;\n };\n std::vector<std::pair<int, int>> pos;\n std::vector<std::vector<_edge>> g;\n};\n}\nvoid solve(i32 n, i32 m) {\n V<i32> u(m), v(m);\n REP(i, m) {\n read(u[i], v[i]);\n --u[i];\n --v[i];\n }\n pi ans(0, n - 1);\n auto judge = [&](i32 l, i32 r) -> bool {\n atcoder::mf_graph<i32> g(n + m + 3);\n i32 s = n + m, t = n + m + 1, p = n + m + 2;\n REP(i, m) {\n g.add_edge(u[i], n + i, 1);\n g.add_edge(v[i], n + i, 1);\n }\n REP(i, n) { g.add_edge(p, i, r - l); }\n g.add_edge(s, p, m - n * l);\n REP(i, n) { g.add_edge(s, i, l); }\n REP(i, m) { g.add_edge(n + i, t, 1); }\n return g.flow(s, t) == m;\n };\n REP(l, n) {\n if (m < n * l) {\n break;\n }\n i32 ok = n, ng = l - 1;\n while (ok - ng > 1) {\n i32 mid = (ok + ng) / 2;\n if (judge(l, mid)) {\n ok = mid;\n } else {\n ng = mid;\n }\n }\n if (ok != n) {\n if (ok - l < ans.second - ans.first) {\n ans.first = l;\n ans.second = ok;\n } else if (ok - l == ans.second - ans.first && l >= ans.first) {\n ans.first = l;\n ans.second = ok;\n }\n }\n }\n cout << ans.first << ' ' << ans.second << endl;\n}\nint main() {\n while (1) {\n I32(n, m);\n if (n == 0) {\n break;\n }\n solve(n, m);\n }\n}","accuracy":1,"time_ms":250,"memory_kb":4200,"score_of_the_acc":-0.4146,"final_rank":3},{"submission_id":"aoj_1615_10578667","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nnamespace atcoder {\n\n// Implement (union by size) + (path compression)\n// Reference:\n// Zvi Galil and Giuseppe F. Italiano,\n// Data structures and algorithms for disjoint set union problems\nstruct dsu {\n public:\n dsu() : _n(0) {}\n explicit dsu(int n) : _n(n), parent_or_size(n, -1) {}\n\n int merge(int a, int b) {\n assert(0 <= a && a < _n);\n assert(0 <= b && b < _n);\n int x = leader(a), y = leader(b);\n if (x == y) return x;\n if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);\n parent_or_size[x] += parent_or_size[y];\n parent_or_size[y] = x;\n return x;\n }\n\n bool same(int a, int b) {\n assert(0 <= a && a < _n);\n assert(0 <= b && b < _n);\n return leader(a) == leader(b);\n }\n\n int leader(int a) {\n assert(0 <= a && a < _n);\n if (parent_or_size[a] < 0) return a;\n return parent_or_size[a] = leader(parent_or_size[a]);\n }\n\n int size(int a) {\n assert(0 <= a && a < _n);\n return -parent_or_size[leader(a)];\n }\n\n std::vector<std::vector<int>> groups() {\n std::vector<int> leader_buf(_n), group_size(_n);\n for (int i = 0; i < _n; i++) {\n leader_buf[i] = leader(i);\n group_size[leader_buf[i]]++;\n }\n std::vector<std::vector<int>> result(_n);\n for (int i = 0; i < _n; i++) {\n result[i].reserve(group_size[i]);\n }\n for (int i = 0; i < _n; i++) {\n result[leader_buf[i]].push_back(i);\n }\n result.erase(\n std::remove_if(result.begin(), result.end(),\n [&](const std::vector<int>& v) { return v.empty(); }),\n result.end());\n return result;\n }\n\n private:\n int _n;\n // root node: -1 * component size\n // otherwise: parent\n std::vector<int> parent_or_size;\n};\n\n} // namespace atcoder\n/* BOOST MULTIPRECISION\n#include<boost/multiprecision/cpp_int.hpp>\nusing namespace boost::multiprecision;\n//*/\n\ntypedef long long ll;\n\n#define rep(i, s, n) for (int i = (int)(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) begin(v),end(v)\n\ntemplate <typename T> bool chmin(T &a, const T &b) {\n\tif (a <= b) return false;\n\ta = b;\n\treturn true;\n}\n\ntemplate <typename T> bool chmax(T &a, const T &b) {\n\tif (a >= b) return false;\n\ta = b;\n\treturn true;\n}\n\ntemplate <typename T> T max(vector<T> &a){\n\tassert(!a.empty());\n\tT ret = a[0];\n\tfor (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);\n\treturn ret;\n}\n\ntemplate <typename T> T min(vector<T> &a){\n\tassert(!a.empty());\n\tT ret = a[0];\n\tfor (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);\n\treturn ret;\n}\n\ntemplate <typename T> T sum(vector<T> &a){\n\tT ret = 0;\n\tfor (int i=0; i<(int)a.size(); i++) ret += a[i];\n\treturn ret;\n}\n\n// importbisect\ntemplate <typename T>\nint bisect_left(vector<T> &X, T v){\n\treturn lower_bound(X.begin(), X.end(), v) - X.begin();\n}\n\ntemplate <typename T>\nint bisect_right(vector<T> &X, T v){\n\treturn upper_bound(X.begin(), X.end(), v) - X.begin();\n}\n// ----\n\n// defcomp\ntemplate <typename T>\nvector<T> compress(vector<T> &X) {\n\tvector<T> vals = X;\n\tsort(vals.begin(), vals.end());\n\tvals.erase(unique(vals.begin(), vals.end()), vals.end());\n\treturn vals;\n}\n// -----\nstruct edge {\n\tint to, cap, rev;\n};\n\n\nvoid solve(int n, int m) {\n\tvector<int> u(m), v(m);\n\trep(i,0,m) {\n\t\tcin >> u[i] >> v[i];\n\t\tu[i]--; v[i]--;\n\t}\n\n\tvector<vector<edge>> mf(n+m+2, vector<edge>(0));\n\tauto add_edge = [&](int i, int j, int cap) -> void {\n\t\tmf[i].push_back(\n\t\t\tedge{j, cap, (int)mf[j].size()}\n\t\t);\n\t\tmf[j].push_back(\n\t\t\tedge{i, 0, (int)mf[i].size()-1}\n\t\t);\n\t};\n\n\tvector<bool> seen(n+m+2);\n\tvector<pair<int,int>> road;\n\tauto dfs = [&](auto self, int i, int j, int dat) -> int {\n\t\tif (i == j) return dat;\n\t\tseen[i] = 1;\n\n\t\trep(x,0,(int)mf[i].size()) {\n\t\t\tauto e = mf[i][x];\n\t\t\tif (e.cap == 0) continue;\n\t\t\tif (seen[e.to]) continue;\n\t\t\tint r = self(self, e.to, j, min(e.cap, dat));\n\t\t\tif (r > 0) {\n\t\t\t\troad.push_back(pair(i, x));\n\t\t\t\treturn r;\n\t\t\t}\n\t\t}\n\n\t\treturn 0;\n\t};\n\n\tauto flow = [&](int i, int j) -> int {\n\t\tint f = 0;\n\t\twhile (true) {\n\t\t\tfill(all(seen), false);\n\t\t\tvector<pair<int,int>>().swap(road);\n\t\t\tint g = dfs(dfs, i, j, (int)1e9);\n\t\t\tf += g;\n\t\t\tif (g == 0) break;\n\t\t\tfor (auto [r,x]: road) {\n\t\t\t\tmf[r][x].cap -= g;\n\t\t\t\tmf[mf[r][x].to][mf[r][x].rev].cap += g;\n\t\t\t\t//assert(mf[mf[r][x].to][mf[r][x].rev].rev==x);\n\t\t\t}\n\t\t};\n\t\treturn f;\n\t};\n\n\tint ans = (int)1e9;\n\tint ansmin = -1;\n\tint ansmax = -1;\n\n\n\trep(mins,0,n+1) {\n\t\trep(i,0,n+m+2) {\n\t\t\tvector<edge>().swap(mf[i]);\n\t\t}\n\n\t\tvector<int> jun(n);\n\t\tvector<int> rev(n);\n\n\t\trep(i,0,m){\n\t\t\tadd_edge(i,m+u[i],1);\n\t\t\tadd_edge(i,m+v[i],1);\n\t\t\tadd_edge(n+m,i,1);\n\t\t}\n\n\t\trep(i,0,n){\n\t\t\tadd_edge(i+m,n+m+1,mins);\n\t\t\tjun[i] = (int)mf[i+m].size()-1;\n\t\t\trev[i] = (int)mf[n+m+1].size()-1;\n\t\t}\n\n\t\tint f = flow(n+m,n+m+1);\n\n\t\tbool mode = 1;\n\t\trep(i,0,n) {\n\t\t\tif (mf[i+m][jun[i]].cap != 0) {\n\t\t\t\tmode = 0;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\tassert(mf[n+m+1][rev[i]].cap == mins);\n\t\t\tmf[n+m+1][rev[i]].cap = 0;\n\t\t}\n\t\tif (!mode) break;\n\n\t\tint maxs = mins;\n\t\twhile (f != m) {\n\t\t\trep(i,0,n){\n\t\t\t\tmf[i+m][jun[i]].cap += 1;\n\t\t\t\t//cout << mf[i+m][jun[i]].cap << endl;\n\t\t\t}\n\t\t\tmaxs++;\n\t\t\tf += flow(n+m,n+m+1);\n\t\t\t\n\t\t\t//cout << mins << ' ' << maxs << ' ' << f << endl;\n\t\t}\n\t\t\n\t\tif (ans >= maxs-mins){\n\t\t\tansmin = mins;\n\t\t\tansmax = maxs;\n\t\t\tans = maxs-mins;\n\t\t}\n\t}\n\n\tcout << ansmin << ' ' << ansmax << endl;\n}\n\nint main(){\n\tios_base::sync_with_stdio(false);\n\tcin.tie(NULL);\n\twhile(true) {\n\t\tint n, m;\n\t\tcin >> n >> m;\n\t\tif (n == 0) break;\n\t\tsolve(n, m);\n\t}\n}","accuracy":1,"time_ms":1990,"memory_kb":4224,"score_of_the_acc":-0.7519,"final_rank":15},{"submission_id":"aoj_1615_10312283","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n\nstruct Flow{\n\tstruct edge {long long to, cap, rev; };\n\tvector<vector<edge>> G;\n vector<int> level;\n vector<int> iter;\n\tint MAX_V;\n \n\tFlow(int v){\n\t\tG.resize(v);\n\t\titer.resize(v);\n level.resize(v , -1);\n\t\tMAX_V = v;\n\t}\n \n\tvoid add_edge(int from, int to, long long cap){\n\t\tG[from].push_back(edge{to, cap, (long long)G[to].size()});\n\t\tG[to].push_back(edge{from, 0, (long long)G[from].size()-1});\n\t};\n \n void bfs(int s){\n for(int i = 0; i < MAX_V; i++)level[i] = -1;\n queue<int> que;\n que.push(s);\n level[s] = 0;\n while(!que.empty()){\n int v = que.front(); que.pop();\n for(int i = 0; i < (int)(G[v].size()); i++){\n edge &e = G[v][i];\n if(e.cap > 0 && level[e.to] < 0){\n level[e.to] = level[v] + 1;\n que.push(e.to);\n }\n }\n }\n }\n \n\tlong long dfs(int v, int t, long long f){\n\t\tif(v == t)return f;\n\t\tfor(int &i = iter[v]; i < (int)(G[v].size()); i++){\n\t\t\tedge &e = G[v][i];\n\t\t\tif(e.cap > 0 && level[v] < level[e.to]){\n\t\t\t\tlong long d = dfs(e.to, t, min(f, e.cap));\n\t\t\t\tif(d > 0){\n\t\t\t\t\te.cap -= d;\n\t\t\t\t\tG[e.to][e.rev].cap += d;\n\t\t\t\t\treturn d;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn 0;\n\t}\n \n\tlong long max_flow(int s, int t){\n\t\tlong long flow = 0;\n\t\twhile(1){\n\t\t\tbfs(s);\n\t\t\tif(level[t] < 0)return flow;\n for(int i = 0; i < MAX_V; i++)iter[i] = 0;\n\t\t\tlong long f;\n while((f = dfs(s , t , 1LL<<60)) > 0)flow += f;\n\t\t}\n\t\treturn 0;\n\t}\n};\n\n\n\nint main(){\n\twhile(1){\n\t\tint N,M; cin >> N >> M;\n\t\tif(N == 0)break;\n\t\tvector<int> v(M) , u(M);\n\t\tfor(int i = 0; i < M; i++){\n\t\t\tcin >> v[i] >> u[i];\n\t\t\t--v[i];\n\t\t\t--u[i];\n\t\t}\n\t\tauto ok = [&](int low , int high)->bool{\n\t\t\tFlow f(N+M+4);\n\t\t\tint S = N+M+3;\n\t\t\tint T = S-1;\n\t\t\tint S2 = T-1;\n\t\t\tint T2 = S2-1;\n\t\t\tfor(int i = 0; i < M; i++){\n\t\t\t\tf.add_edge(S , i , 1);\n\t\t\t\tf.add_edge(i , M+v[i] , 1);\n\t\t\t\tf.add_edge(i , M+u[i] , 1);\n\t\t\t}\n\t\t\tfor(int i = 0; i < N; i++){\n\t\t\t\tf.add_edge(M+i , T , high - low);\n\t\t\t\tf.add_edge(S2 , T , low);\n\t\t\t\tf.add_edge(M+i , T2 , low);\n\t\t\t}\n\t\t\tll FLOW = 0;\n\t\t\tFLOW += f.max_flow(S2 , T2);\n\t\t\tFLOW += f.max_flow(S2 , T);\n\t\t\tFLOW += f.max_flow(S , T2);\n\t\t\tFLOW += f.max_flow(S , T);\n\t\t\tif(FLOW < M)return 0;\n\t\t\tfor(auto e:f.G[S2]){\n\t\t\t\tif(e.cap > 0)return 0;\n\t\t\t}\n\t\t\tfor(auto e:f.G[T2]){\n\t\t\t\tif(e.cap < low)return 0;\n\t\t\t}\n\t\t\treturn 1;\n\t\t};\n\t\tint LO = -1 , HI = M;\n\t\tint hi = 1;\n\t\tfor(int lo = 0; lo < N; lo++){\n\t\t\thi = max(hi , lo);\n\t\t\twhile(hi <= N && !ok(lo, hi))hi++;\n\t\t\tif(hi == N+1)break;\n\t\t\tif(HI - LO >= hi - lo){\n\t\t\t\tHI = hi;\n\t\t\t\tLO = lo;\n\t\t\t}\n\t\t}\n\t\t/*\n\t\tfor(int i = 0; i < N; i++){\n\t\t\tfor(int j = i; j < N; j++){\n\t\t\t\tcout << i << ' ' << j << ' ' << ok(i,j) << endl;\n\t\t\t}\n\t\t}\n\t\t*/\n\t\tcout << LO << ' ' << HI << endl;\n\t}\n}","accuracy":1,"time_ms":230,"memory_kb":4608,"score_of_the_acc":-0.6169,"final_rank":9},{"submission_id":"aoj_1615_9632804","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define pii pair<int, int>\n#define pll pair<ll, ll>\n#define vi vector<int>\n#define vl vector<ll>\n#define ov4(a, b, c, d, name, ...) name\n#define rep3(i, a, b, c) for(ll i = (a); i < (b); i += (c))\n#define rep2(i, a, b) rep3(i, a, b, 1)\n#define rep1(i, n) rep2(i, 0, n)\n#define rep0(n) rep1(aaaaa, n)\n#define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)\n#define per(i, a, b) for(ll i = (a) - 1; i >= (b); i--)\n#define fore(e, v) for(auto &&e : v)\n#define all(a) begin(a), end(a)\n#define si(a) (int)(size(a))\n#define lb(v, x) (lower_bound(all(v), x) - begin(v))\n#define eb emplace_back\n\ntemplate <typename T, typename S> bool chmin(T &a, const S &b) { return a > b ? a = b, 1 : 0; }\ntemplate <typename T, typename S> bool chmax(T &a, const S &b) { return a < b ? a = b, 1 : 0; }\n\nconst int INF = 1e9 + 100;\nconst ll INFL = 3e18 + 100;\n\n#define i128 __int128_t\n\nstruct _ {\n _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); }\n} __;\ntemplate <typename T> struct Dinic {\n const T INF;\n\n struct edge {\n int to;\n T cap;\n int rev;\n bool isrev;\n int idx;\n };\n\n vector<vector<edge>> g;\n vector<int> c, iter;\n Dinic(int V) : INF(numeric_limits<T>::max()), g(V) {}\n void add_edge(int from, int to, T cap, int idx = -1) {\n g[from].emplace_back((edge){to, cap, si(g[to]), false, idx});\n g[to].emplace_back((edge){from, 0, si(g[from]) - 1, true, idx});\n }\n\n bool bfs(int s, int t) {\n c.assign(si(g), -1);\n queue<int> q;\n c[s] = 0;\n q.push(s);\n while(!q.empty() && c[t] == -1) {\n int x = q.front();\n q.pop();\n fore(e, g[x]) {\n if(e.cap > 0 && c[e.to] == -1) {\n c[e.to] = c[x] + 1;\n q.push(e.to);\n }\n }\n }\n return c[t] != -1;\n }\n\n T dfs(int x, int t, T flow) {\n if(x == t) return flow;\n for(int &i = iter[x]; i < si(g[x]); i++) {\n edge &e = g[x][i];\n if(e.cap > 0 && c[x] < c[e.to]) {\n T d = dfs(e.to, t, min(flow, e.cap));\n if(d > 0) {\n e.cap -= d;\n g[e.to][e.rev].cap += d;\n return d;\n }\n }\n }\n return 0;\n }\n\n T max_flow(int s, int t) {\n T flow = 0;\n while(bfs(s, t)) {\n iter.assign(si(g), 0);\n T f = 0;\n while((f = dfs(s, t, INF)) > 0) flow += f;\n }\n return flow;\n }\n\n // void output() {\n // for(int i = 0; i < g.size(); i++) {\n // for(auto &e : g[i]) {\n // if(e.isrev) continue;\n // auto &rev_e = g[e.to][e.rev];\n // cout << i << \"->\" << e.to << \" (flow: \" << rev_e.cap << \"/\" << e.cap + rev_e.cap << \")\" << endl;\n // }\n // }\n // }\n};\n\ntemplate <typename T> struct lrFlow {\n Dinic<T> flow;\n vector<T> in, up;\n int X, Y, n;\n T sum;\n typename Dinic<T>::edge *p, *q;\n\n lrFlow(int n) : n(n), X(n), Y(n + 1), sum(0), in(n), flow(n + 2) {}\n\n void add_edge(int from, int to, T low, T high) {\n flow.add_edge(from, to, high - low, si(up));\n in[from] -= low, in[to] += low;\n up.eb(high);\n }\n\n void build() {\n rep(i, n) {\n if(in[i] > 0) {\n flow.add_edge(X, i, in[i]);\n sum += in[i];\n } else if(in[i] < 0) {\n flow.add_edge(i, Y, -in[i]);\n }\n }\n }\n\n bool can_flow(int s, int t) {\n flow.add_edge(t, s, flow.INF);\n p = &flow.g[t].back();\n q = &flow.g[s].back();\n return can_flow();\n }\n\n bool can_flow() {\n build();\n auto ret = flow.max_flow(X, Y);\n return ret >= sum;\n }\n\n T max_flow(int s, int t) {\n if(can_flow(s, t)) {\n return flow.max_flow(s, t);\n } else {\n return -1;\n }\n }\n\n T min_flow(int s, int t) {\n if(can_flow(s, t)) {\n auto ret = flow.INF - p->cap;\n p->cap = q->cap = 0;\n return ret - flow.max_flow(t, s);\n } else {\n return -1;\n }\n }\n\n // void output(int M) {\n // vector<flow_t> ans(M);\n // for(int i = 0; i < flow.graph.size(); i++) {\n // for(auto &e : flow.graph[i]) {\n // if(!e.isrev && ~e.idx) ans[e.idx] = up[e.idx] - e.cap;\n // }\n // }\n // for(auto &p : ans) cout << p << endl;\n // }\n};\n\nint main() {\n int n, m;\n while(cin >> n >> m, n) {\n vi u(m), v(m);\n rep(i, m) {\n cin >> u[i] >> v[i];\n --u[i], --v[i];\n }\n auto check = [&](int l, int r) {\n lrFlow<int> flow(n + m + 2);\n int s = n + m, t = n + m + 1;\n rep(i, m) {\n flow.add_edge(s, i, 1, 1);\n flow.add_edge(i, m + u[i], 0, 1);\n flow.add_edge(i, m + v[i], 0, 1);\n }\n rep(i, n) { flow.add_edge(m + i, t, l, r); }\n auto res = flow.max_flow(s, t) == m;\n return res;\n };\n int p = 0, q = n;\n int l = 0;\n rep(r, n + 1) {\n while(l <= r and check(l, r)) {\n p = l, q = r;\n ++l;\n }\n }\n cout << p << \" \" << q << endl;\n }\n}","accuracy":1,"time_ms":350,"memory_kb":4412,"score_of_the_acc":-0.5403,"final_rank":5},{"submission_id":"aoj_1615_9566917","code_snippet":"#include<bits/stdc++.h>\n// #include<atcoder/all>\n// #include<boost/multiprecision/cpp_int.hpp>\n\nusing namespace std;\n// using namespace atcoder;\n// using bint = boost::multiprecision::cpp_int;\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\nusing P = pair<ll,ll>;\nusing vi = vector<ll>;\nusing vvi = vector<vi>;\nusing vvvi = vector<vvi>;\nusing ve = vector<vector<int>>;\nusing vb = vector<bool>;\nusing vvb = vector<vb>;\n#define rep(i,n) for(ll i = 0;i < (ll)n;i++)\n#define ALL(x) (x).begin(),(x).end()\n#define sz(c) ((ll)(c).size())\n#define LB(A,x) (int)(lower_bound(A.begin(),A.end(),x)-A.begin())\n#define UB(A,x) (int)(upper_bound(A.begin(),A.end(),x)-A.begin())\n// #define MOD 1000000007\n#define MOD 998244353\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\ntemplate<typename T>ostream&operator<<(ostream&os,vector<T>&v){for(int i = 0;i < v.size();i++)os<<v[i]<<(i+1!=v.size()?\" \":\"\");return os;}\ntemplate<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}\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;}\ntemplate<typename T> inline bool chmax(T &a,T b){if(a < b){a = b;return true;}return false;}\ntemplate<typename T> inline bool chmin(T &a,T b){if(a > b){a = b;return true;}return false;}\nld dist(ld x1,ld y1,ld x2, ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}\n\n\n// https://ei1333.github.io/luzhiled/snippets/graph/dinic.html\ntemplate<typename flow_t>\nstruct Dinic{\n /*\n 復元をするときはfromの頂点から出る辺からのcapを出力．\n is_e == trueの時その辺は元のグラフにあった\"本当の\"辺．\n \"本当の\"辺eについてfr -> toにv[e.to][e.ref].capだけフローが流れている．\n 二部マッチングの復元の場合，仮想の始点（終点）から（へ）の辺に注意．\n */\n struct edge{\n int to;\n flow_t cap;\n int ref;//逆辺の番号\n bool is_e;//本物の辺かどうか\n int idx;//入力で与えられる辺としてのindex\n };\n vector<vector<edge>> v;\n vector<int> mn_cost,iter;\n const flow_t inf;\n Dinic(int n):inf(numeric_limits<flow_t>::max()),v(n){}\n void add_edge(int fr,int to,flow_t cap,int idx = -1){\n v[fr].emplace_back((edge){to,cap,(int)v[to].size(),true,idx});\n v[to].emplace_back((edge){fr,0,(int)v[fr].size()-1,false,idx});\n }\n bool bfs(int s,int t){\n mn_cost.assign(v.size(),-1);\n queue<int> que;\n mn_cost[s] = 0;\n que.push(s);\n while(!que.empty() && mn_cost[t] == -1){\n int ov = que.front();que.pop();\n for(auto &e : v[ov]){\n if(e.cap > 0 && mn_cost[e.to] == -1){\n mn_cost[e.to] = mn_cost[ov] + 1;\n que.push(e.to);\n }\n }\n }\n return mn_cost[t] != -1;\n }\n flow_t dfs(int ov,const int t,flow_t flow){\n if(ov == t)return flow;\n for(int &i = iter[ov];i < v[ov].size();i++){\n edge &e = v[ov][i];\n if(e.cap > 0 && mn_cost[ov] < mn_cost[e.to]){\n flow_t d = dfs(e.to,t,min(flow,e.cap));\n if(d > 0){\n e.cap -= d;\n v[e.to][e.ref].cap += d;\n return d;\n }\n }\n }\n return 0;\n }\n // O(m n^2)(n:頂点数 m:辺数)\n flow_t max_flow(int s,int t){\n flow_t flow = 0;\n while(bfs(s,t)){\n iter.assign(v.size(),0);\n flow_t f = 0;\n while((f = dfs(s,t,inf)) > 0)flow += f;\n }\n return flow;\n }\n void output(){\n for(int i = 0;i < v.size();i++){\n for(auto &e : v[i]) {\n if(!e.is_e) continue;\n auto &rev_e = v[e.to][e.ref];\n cout << i << \"->\" << e.to << \" (flow: \" << rev_e.cap << \"/\" << e.cap + rev_e.cap << \")\" << \"\\n\";\n }\n }\n }\n};\n\nint main(){\n \n ios_base::sync_with_stdio(0), cin.tie(0);\n while(1){\n int n,m;cin >> n >> m;\n if(!n)break;\n P res = {0,n+100};\n vector<P> v(m);cin >> v;\n for(auto &[a,b] : v)a--,b--;\n int r = 1;\n rep(l,n){\n if(r < l)r = l;\n while(1){\n if(r >= n)break;\n Dinic<ll> dn(4 + n + m);\n ll sm = 0;\n const int s = n+m,t = n+m+1,S = n+m+2,T = n+m+3;\n rep(i,m){\n auto [a,b] = v[i];\n dn.add_edge(a,n+i,1);\n dn.add_edge(b,n+i,1);\n dn.add_edge(n+i,t,1);\n }\n rep(i,n){\n if(l != r)dn.add_edge(s,i,r-l);\n if(l){\n dn.add_edge(S,i,l);\n dn.add_edge(s,T,l);\n sm += l;\n }\n }\n ll a = dn.max_flow(S,T);\n ll b = dn.max_flow(s,T);\n ll c = dn.max_flow(S,t);\n ll d = dn.max_flow(s,t);\n // cout << b + d << \" a\\n\";\n // cout << a << \" \" << b << \" \" << c << \" \" << d << \" : \" << sm << \" a\\n\";\n if(sm == a + c && sm == a + b && m == b + d){\n auto [L,R] = res;\n if(r-l < R-L)res = {l,r};\n break;\n }\n r++;\n }\n }\n cout << res << \"\\n\";\n }\n \n\n return 0;\n}","accuracy":1,"time_ms":310,"memory_kb":4656,"score_of_the_acc":-0.6561,"final_rank":11},{"submission_id":"aoj_1615_9480955","code_snippet":"#include <bits/stdc++.h>\n// #include <atcoder/all>\n\nusing namespace std;\nusing ll = long long;\nusing pll = pair<ll, ll>;\n#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)\n#define rrep(i, s, t) for (ll i = (ll)(t) - 1; i >= (ll)(s); i--)\n#define all(x) begin(x), end(x)\n\n#define TT template <typename T>\nTT using vec = vector<T>;\nTT using vvec = vec<vec<T>>;\nTT using vvvec = vec<vvec<T>>;\nTT using minheap = priority_queue<T, vector<T>, greater<T>>;\nTT using maxheap = priority_queue<T>;\ntemplate <class T1, class T2> bool chmin(T1 &x, T2 y) {\n return x > y ? (x = y, true) : false;\n}\ntemplate <class T1, class T2> bool chmax(T1 &x, T2 y) {\n return x < y ? (x = y, true) : false;\n}\nTT int pre_id(vec<T> &A, T x) { // must sorted\n return lower_bound(all(A), x) - A.begin() - 1;\n}\nTT int nex_id(vec<T> &A, T x) { // must sorted\n return upper_bound(all(A), x) - A.begin();\n}\nstruct io_setup {\n io_setup() {\n ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n cout << fixed << setprecision(15);\n }\n} io_setup;\n\ntemplate <class T> struct mf_graph {\n struct edge {\n int st, to;\n T cap, flow;\n };\n\n struct nedge {\n int to, rev;\n T cap;\n };\n\n int n;\n vec<unordered_map<int, int>> rev;\n vec<pair<int, int>> pos;\n vec<vec<nedge>> g;\n\n mf_graph(int _n) : n(_n), g(n), rev(n) {}\n\n int add_edge(int s, int t, T cap) {\n int m = pos.size();\n pos.push_back({s, g[s].size()});\n int fi = g[s].size();\n int ti = g[t].size();\n if (s == t) ti++;\n g[s].push_back(nedge{t, ti, cap});\n g[t].push_back(nedge{s, fi, 0});\n rev[s][t] = m;\n return m;\n }\n\n T flow(int s, int t, T flow_limit = numeric_limits<T>::max()) {\n vec<int> lv(n), it(n, 0);\n\n auto bfs = [&]() {\n queue<int> que;\n fill(lv.begin(), lv.end(), -1);\n lv[s] = 0;\n que.push(s);\n while (!que.empty()) {\n int v = que.front();\n que.pop();\n\n for (auto e : g[v]) {\n if (e.cap == 0 || lv[e.to] >= 0) continue;\n lv[e.to] = lv[v] + 1;\n if (e.to == t) return;\n que.push(e.to);\n }\n }\n };\n\n auto dfs = [&](auto f, int v, T up) {\n if (v == s) return up;\n T res = 0;\n int LV = lv[v];\n for (int &i = it[v]; i < int(g[v].size()); i++) {\n nedge &e = g[v][i];\n if (LV <= lv[e.to] || g[e.to][e.rev].cap == 0) continue;\n T d = f(f, e.to, min(up - res, g[e.to][e.rev].cap));\n if (d <= 0) continue;\n g[v][i].cap += d;\n g[e.to][e.rev].cap -= d;\n res += d;\n if (res == up) return res;\n }\n lv[v] = n;\n return res;\n };\n\n T flow = 0;\n while (flow < flow_limit) {\n bfs();\n if (lv[t] == -1) break;\n fill(it.begin(), it.end(), 0);\n T f = dfs(dfs, t, flow_limit - flow);\n if (!f) break;\n flow += f;\n }\n return flow;\n }\n\n // 以下、不要なら省略\n\n int get_id(int s, int t) { return rev[s][t]; }\n\n edge get_edge(int i) {\n int m = pos.size();\n auto e = g[pos[i].first][pos[i].second];\n auto re = g[e.to][e.rev];\n return edge{pos[i].first, e.to, e.cap + re.cap, re.cap};\n }\n\n void change_edge(int i, T nc, T nf) {\n int m = pos.size();\n auto &e = g[pos[i].first][pos[i].second];\n auto &re = g[e.to][e.rev];\n e.cap = nc - nf;\n re.cap = nf;\n }\n\n vec<bool> min_cut(int s) {\n vec<bool> seen(n);\n queue<int> que;\n que.push(s);\n while (!que.empty()) {\n int p = que.front();\n que.pop();\n seen[p] = true;\n for (auto e : g[p]) {\n if (e.cap && !seen[e.to]) {\n seen[e.to] = true;\n que.push(e.to);\n }\n }\n }\n return seen;\n }\n};\n\n/*\n@brief Maxflow\n@docs doc/maxflow.md\n*/\n\nstruct mf_graph_with_lowerbound {\n int n;\n mf_graph<ll> mf;\n int S, T;\n ll sum;\n vector<ll> lows, d;\n ll total_flow;\n\n mf_graph_with_lowerbound(int n)\n : n(n), mf(n + 2), S(n), T(n + 1), sum(0), d(n, 0), total_flow(0) {}\n\n int add_edge(int from, int to, ll low, ll high) {\n lows.push_back(low);\n d[from] -= low;\n d[to] += low;\n return mf.add_edge(from, to, high - low);\n }\n\n void build() {\n rep(i, 0, n) {\n if (d[i] > 0) {\n mf.add_edge(S, i, d[i]);\n sum += d[i];\n } else if(d[i] < 0) {\n mf.add_edge(i, T, -d[i]);\n }\n }\n }\n\n bool is_feasable(int s, int t) {\n build();\n mf.add_edge(t, s, LLONG_MAX / 4); // INF = LLONG_MAX / 4\n total_flow += mf.flow(S, T);\n return total_flow == sum;\n }\n\n ll flow(int s, int t) {\n if (is_feasable(s, t) == false) return -1;\n mf.add_edge(S, s, LLONG_MAX / 4);\n mf.add_edge(t, T, LLONG_MAX / 4);\n return (total_flow += mf.flow(S, T)) - sum;\n }\n\n vector<ll> output() {\n vector<ll> res;\n rep(i, 0, lows.size()) { res.push_back(lows[i] + mf.get_edge(i).flow); }\n return res;\n }\n};\n\nint main() {\n int n, m;\n while (1) {\n cin >> n >> m;\n\n if (n == 0) break;\n\n vector<pll> es;\n rep(i, 0, m) {\n int u, v;\n cin >> u >> v;\n u--, v--;\n es.emplace_back(u, v);\n }\n\n int ans_m = -1;\n int ans_M = -1;\n\n auto che = [&](int mi, int Mi) {\n int s = n + m;\n int t = s + 1;\n\n mf_graph_with_lowerbound mf(t + 1);\n\n rep(i, 0, m) {\n mf.add_edge(s, i, 1, 1);\n mf.add_edge(i, m + es[i].first, 0, 1);\n mf.add_edge(i, m + es[i].second, 0, 1);\n }\n\n rep(i, 0, n) { mf.add_edge(m + i, t, mi, Mi); }\n\n if (mf.is_feasable(s, t)) {\n return true;\n } else\n return false;\n };\n\n ll w = 1e7;\n rrep(mi, 0, n + 1) {\n ll li = 0;\n ll ri = li + min<ll>(w, m);\n while (li < ri) { /// xxxxoooo\n ll mid = (li + ri) / 2;\n if (che(mi, mi + mid)) {\n ri = mid;\n } else {\n li = mid + 1;\n }\n }\n if (che(mi, mi + li) && chmin(w, li - mi)) {\n ans_m = mi;\n ans_M = mi + li;\n }\n }\n\n cout << ans_m << \" \" << ans_M << endl;\n }\n}","accuracy":1,"time_ms":4540,"memory_kb":5392,"score_of_the_acc":-1.8184,"final_rank":19},{"submission_id":"aoj_1615_9480949","code_snippet":"#include <bits/stdc++.h>\n// #include <atcoder/all>\n\nusing namespace std;\nusing ll = long long;\nusing pll = pair<ll, ll>;\n#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)\n#define rrep(i, s, t) for (ll i = (ll)(t) - 1; i >= (ll)(s); i--)\n#define all(x) begin(x), end(x)\n\n#define TT template <typename T>\nTT using vec = vector<T>;\nTT using vvec = vec<vec<T>>;\nTT using vvvec = vec<vvec<T>>;\nTT using minheap = priority_queue<T, vector<T>, greater<T>>;\nTT using maxheap = priority_queue<T>;\ntemplate <class T1, class T2> bool chmin(T1 &x, T2 y) {\n return x > y ? (x = y, true) : false;\n}\ntemplate <class T1, class T2> bool chmax(T1 &x, T2 y) {\n return x < y ? (x = y, true) : false;\n}\nTT int pre_id(vec<T> &A, T x) { // must sorted\n return lower_bound(all(A), x) - A.begin() - 1;\n}\nTT int nex_id(vec<T> &A, T x) { // must sorted\n return upper_bound(all(A), x) - A.begin();\n}\nstruct io_setup {\n io_setup() {\n ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n cout << fixed << setprecision(15);\n }\n} io_setup;\n\ntemplate <class T> struct mf_graph {\n struct edge {\n int st, to;\n T cap, flow;\n };\n\n struct nedge {\n int to, rev;\n T cap;\n };\n\n int n;\n vec<unordered_map<int, int>> rev;\n vec<pair<int, int>> pos;\n vec<vec<nedge>> g;\n\n mf_graph(int _n) : n(_n), g(n), rev(n) {}\n\n int add_edge(int s, int t, T cap) {\n int m = pos.size();\n pos.push_back({s, g[s].size()});\n int fi = g[s].size();\n int ti = g[t].size();\n if (s == t) ti++;\n g[s].push_back(nedge{t, ti, cap});\n g[t].push_back(nedge{s, fi, 0});\n rev[s][t] = m;\n return m;\n }\n\n T flow(int s, int t, T flow_limit = numeric_limits<T>::max()) {\n vec<int> lv(n), it(n, 0);\n\n auto bfs = [&]() {\n queue<int> que;\n fill(lv.begin(), lv.end(), -1);\n lv[s] = 0;\n que.push(s);\n while (!que.empty()) {\n int v = que.front();\n que.pop();\n\n for (auto e : g[v]) {\n if (e.cap == 0 || lv[e.to] >= 0) continue;\n lv[e.to] = lv[v] + 1;\n if (e.to == t) return;\n que.push(e.to);\n }\n }\n };\n\n auto dfs = [&](auto f, int v, T up) {\n if (v == s) return up;\n T res = 0;\n int LV = lv[v];\n for (int &i = it[v]; i < int(g[v].size()); i++) {\n nedge &e = g[v][i];\n if (LV <= lv[e.to] || g[e.to][e.rev].cap == 0) continue;\n T d = f(f, e.to, min(up - res, g[e.to][e.rev].cap));\n if (d <= 0) continue;\n g[v][i].cap += d;\n g[e.to][e.rev].cap -= d;\n res += d;\n if (res == up) return res;\n }\n lv[v] = n;\n return res;\n };\n\n T flow = 0;\n while (flow < flow_limit) {\n bfs();\n if (lv[t] == -1) break;\n fill(it.begin(), it.end(), 0);\n T f = dfs(dfs, t, flow_limit - flow);\n if (!f) break;\n flow += f;\n }\n return flow;\n }\n\n // 以下、不要なら省略\n\n int get_id(int s, int t) { return rev[s][t]; }\n\n edge get_edge(int i) {\n int m = pos.size();\n auto e = g[pos[i].first][pos[i].second];\n auto re = g[e.to][e.rev];\n return edge{pos[i].first, e.to, e.cap + re.cap, re.cap};\n }\n\n void change_edge(int i, T nc, T nf) {\n int m = pos.size();\n auto &e = g[pos[i].first][pos[i].second];\n auto &re = g[e.to][e.rev];\n e.cap = nc - nf;\n re.cap = nf;\n }\n\n vec<bool> min_cut(int s) {\n vec<bool> seen(n);\n queue<int> que;\n que.push(s);\n while (!que.empty()) {\n int p = que.front();\n que.pop();\n seen[p] = true;\n for (auto e : g[p]) {\n if (e.cap && !seen[e.to]) {\n seen[e.to] = true;\n que.push(e.to);\n }\n }\n }\n return seen;\n }\n};\n\n/*\n@brief Maxflow\n@docs doc/maxflow.md\n*/\n\nstruct mf_graph_with_lowerbound {\n int n;\n mf_graph<ll> mf;\n int S, T;\n ll sum;\n vector<ll> lows, d;\n ll total_flow;\n\n mf_graph_with_lowerbound(int n)\n : n(n), mf(n + 2), S(n), T(n + 1), sum(0), d(n, 0), total_flow(0) {}\n\n int add_edge(int from, int to, ll low, ll high) {\n lows.push_back(low);\n d[from] -= low;\n d[to] += low;\n return mf.add_edge(from, to, high - low);\n }\n\n void build() {\n rep(i, 0, n) {\n if (d[i] > 0) {\n mf.add_edge(S, i, d[i]);\n sum += d[i];\n } else\n mf.add_edge(i, T, -d[i]);\n }\n }\n\n bool is_feasable(int s, int t) {\n build();\n mf.add_edge(t, s, LLONG_MAX / 4); // INF = LLONG_MAX / 4\n total_flow += mf.flow(S, T);\n return total_flow == sum;\n }\n\n ll flow(int s, int t) {\n if (is_feasable(s, t) == false) return -1;\n mf.add_edge(S, s, LLONG_MAX / 4);\n mf.add_edge(t, T, LLONG_MAX / 4);\n return (total_flow += mf.flow(S, T)) - sum;\n }\n\n vector<ll> output() {\n vector<ll> res;\n rep(i, 0, lows.size()) { res.push_back(lows[i] + mf.get_edge(i).flow); }\n return res;\n }\n};\n\nint main() {\n int n, m;\n while (1) {\n cin >> n >> m;\n\n if (n == 0) break;\n\n vector<pll> es;\n rep(i, 0, m) {\n int u, v;\n cin >> u >> v;\n u--, v--;\n es.emplace_back(u, v);\n }\n\n int ans_m = -1;\n int ans_M = -1;\n\n auto che = [&](int mi, int Mi) {\n int s = n + m;\n int t = s + 1;\n\n mf_graph_with_lowerbound mf(t + 1);\n\n rep(i, 0, m) {\n mf.add_edge(s, i, 1, 1);\n mf.add_edge(i, m + es[i].first, 0, 1);\n mf.add_edge(i, m + es[i].second, 0, 1);\n }\n\n rep(i, 0, n) { mf.add_edge(m + i, t, mi, Mi); }\n\n if (mf.is_feasable(s, t)) {\n return true;\n } else\n return false;\n };\n\n ll w = 1e7;\n rrep(mi, 0, n + 1) {\n ll li = 0;\n ll ri = li + min<ll>(w, m);\n while (li < ri) { /// xxxxoooo\n ll mid = (li + ri) / 2;\n if (che(mi, mi + mid)) {\n ri = mid;\n } else {\n li = mid + 1;\n }\n }\n if (che(mi, mi + li) && chmin(w, li - mi)) {\n ans_m = mi;\n ans_M = mi + li;\n }\n }\n\n cout << ans_m << \" \" << ans_M << endl;\n }\n}","accuracy":1,"time_ms":4540,"memory_kb":5316,"score_of_the_acc":-1.7801,"final_rank":18},{"submission_id":"aoj_1615_9480943","code_snippet":"#include <bits/stdc++.h>\n//#include <atcoder/all>\n\nusing namespace std;\nusing ll = long long;\nusing pll = pair<ll, ll>;\n#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)\n#define rrep(i, s, t) for (ll i = (ll)(t) - 1; i >= (ll)(s); i--)\n#define all(x) begin(x), end(x)\n\n#define TT template <typename T>\nTT using vec = vector<T>;\nTT using vvec = vec<vec<T>>;\nTT using vvvec = vec<vvec<T>>;\nTT using minheap = priority_queue<T, vector<T>, greater<T>>;\nTT using maxheap = priority_queue<T>;\ntemplate <class T1, class T2> bool chmin(T1 &x, T2 y) {\n return x > y ? (x = y, true) : false;\n}\ntemplate <class T1, class T2> bool chmax(T1 &x, T2 y) {\n return x < y ? (x = y, true) : false;\n}\nTT int pre_id(vec<T> &A, T x) { // must sorted\n return lower_bound(all(A), x) - A.begin() - 1;\n}\nTT int nex_id(vec<T> &A, T x) { // must sorted\n return upper_bound(all(A), x) - A.begin();\n}\nstruct io_setup {\n io_setup() {\n ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n cout << fixed << setprecision(15);\n }\n} io_setup;\n\n\ntemplate<class T> \nstruct mf_graph {\n struct edge {\n int st, to;\n T cap, flow;\n };\n\n struct nedge {\n int to, rev;\n T cap;\n };\n\n int n;\n vec<unordered_map<int, int>> rev;\n vec<pair<int, int>> pos;\n vec<vec<nedge>> g;\n\n mf_graph(int _n) : n(_n), g(n), rev(n) {}\n\n int add_edge(int s, int t, T cap) {\n int m = pos.size();\n pos.push_back({s, g[s].size()});\n int fi = g[s].size(); int ti = g[t].size();\n if(s==t)ti++;\n g[s].push_back(nedge{t, ti, cap});\n g[t].push_back(nedge{s, fi, 0});\n rev[s][t] = m;\n return m;\n }\n\n T flow(int s, int t, T flow_limit = numeric_limits<T>::max()) {\n vec<int> lv(n), it(n, 0);\n\n auto bfs = [&]() {\n queue<int> que;\n fill(lv.begin(), lv.end(), -1);\n lv[s] = 0;\n que.push(s);\n while(!que.empty()) {\n int v = que.front();\n que.pop();\n\n for(auto e : g[v]) {\n if(e.cap == 0 || lv[e.to] >= 0) continue;\n lv[e.to] = lv[v] + 1;\n if(e.to == t) return;\n que.push(e.to);\n }\n }\n };\n\n auto dfs = [&](auto f, int v, T up) {\n if(v==s) return up;\n T res = 0;\n int LV = lv[v];\n for(int& i = it[v]; i < int(g[v].size()); i++) {\n nedge& e = g[v][i];\n if(LV <= lv[e.to] || g[e.to][e.rev].cap == 0) continue;\n T d = f(f, e.to, min(up - res, g[e.to][e.rev].cap));\n if(d <= 0) continue;\n g[v][i].cap += d;\n g[e.to][e.rev].cap -= d;\n res += d;\n if(res == up) return res;\n }\n lv[v] = n;\n return res;\n };\n\n T flow = 0;\n while(flow < flow_limit) {\n bfs();\n if(lv[t] == -1) break;\n fill(it.begin(), it.end(), 0);\n T f = dfs(dfs, t, flow_limit - flow);\n if(!f) break;\n flow += f;\n }\n return flow;\n }\n\n //以下、不要なら省略\n\n int get_id(int s, int t) {\n return rev[s][t];\n }\n\n edge get_edge(int i) {\n int m = pos.size();\n auto e = g[pos[i].first][pos[i].second];\n auto re = g[e.to][e.rev];\n return edge{pos[i].first, e.to, e.cap + re.cap, re.cap};\n }\n\n void change_edge(int i, T nc, T nf) {\n int m = pos.size();\n auto& e = g[pos[i].first][pos[i].second];\n auto& re = g[e.to][e.rev];\n e.cap = nc - nf;\n re.cap = nf;\n }\n\n vec<bool> min_cut(int s) {\n vec<bool> seen(n);\n queue<int> que;\n que.push(s);\n while(!que.empty()) {\n int p = que.front();\n que.pop();\n seen[p]=true;\n for(auto e : g[p]) {\n if(e.cap && !seen[e.to]) {\n seen[e.to] = true;\n que.push(e.to);\n }\n }\n }\n return seen;\n }\n\n};\n\n\n\n/*\n@brief Maxflow\n@docs doc/maxflow.md\n*/\n\nstruct mf_graph_with_lowerbound {\n int n;\n mf_graph<ll> mf;\n int S, T;\n ll sum;\n vector<ll> lows, d;\n ll total_flow;\n\n\n mf_graph_with_lowerbound(int n) : n(n), mf(n+ 2), S(n), T(n + 1), sum(0), d(n, 0), total_flow(0) {\n }\n\n\n int add_edge(int from, int to, ll low, ll high) {\n lows.push_back(low);\n d[from] -= low;\n d[to] += low;\n return mf.add_edge(from, to, high - low);\n }\n\n void build() {\n rep(i, 0, n) {\n if(d[i] > 0) {\n mf.add_edge(S, i, d[i]);\n sum += d[i];\n }\n else mf.add_edge(i, T, -d[i]);\n }\n }\n\n bool is_feasable(int s, int t) {\n build();\n mf.add_edge(t, s, LLONG_MAX / 4); // INF = LLONG_MAX / 4\n total_flow += mf.flow(S, T);\n return total_flow == sum;\n }\n\n ll flow(int s, int t) {\n if(is_feasable(s, t) == false) return -1;\n mf.add_edge(S, s, LLONG_MAX / 4);\n mf.add_edge(t, T, LLONG_MAX / 4);\n return (total_flow += mf.flow(S, T)) - sum;\n }\n\n vector<ll> output() {\n vector<ll> res;\n rep(i, 0, lows.size()) {\n res.push_back(lows[i] + mf.get_edge(i).flow);\n }\n return res;\n\n }\n};\n\n\nint main() {\n int n, m;\n while(1) {\n cin >> n >> m;\n\n if(n == 0) break;\n\n vector<pll> es;\n rep(i, 0, m) {\n int u, v;\n cin >> u >> v;\n u--, v--;\n es.emplace_back(u, v);\n }\n\n\n int ans_m = -1;\n int ans_M = -1;\n\n auto che = [&](int mi, int Mi) {\n int s = n + m;\n int t = s + 1;\n\n mf_graph_with_lowerbound mf(t + 1);\n \n\n rep(i, 0, m) {\n mf.add_edge(s, i, 1, 1);\n mf.add_edge(i, m + es[i].first, 0, 1);\n mf.add_edge(i, m + es[i].second, 0, 1);\n }\n\n rep(i, 0, n) {\n mf.add_edge(m + i, t, mi, Mi);\n }\n\n if(mf.is_feasable(s, t)) {\n return true;\n }\n else return false;\n\n };\n\n \n ll w = 1e7;\n rrep(mi, 0, n + 1) {\n ll li = 0;\n ll ri = m;\n while(li < ri) {///xxxxoooo\n ll mid = (li + ri) / 2;\n if(che(mi, mi + mid)) {\n ri = mid;\n }\n else {\n li = mid + 1;\n }\n }\n if(che(mi, mi + li) && chmin(w, li - mi)) {\n ans_m = mi;\n ans_M = mi + li;\n\n }\n }\n\n cout << ans_m << \" \" << ans_M << endl;\n }\n \n\n}","accuracy":1,"time_ms":5360,"memory_kb":5344,"score_of_the_acc":-1.9475,"final_rank":20},{"submission_id":"aoj_1615_9474816","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)), (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#include <unistd.h>\n\nnamespace fastio {\nstatic constexpr uint32_t SZ = 1 << 17;\nchar ibuf[SZ];\nchar obuf[SZ];\nchar out[100];\n// pointer of ibuf, obuf\n\n\nuint32_t pil = 0, pir = 0, por = 0;\n\nstruct Pre {\n char num[10000][4];\n constexpr Pre() : num() {\n for (int i = 0; i < 10000; i++) {\n int n = i;\n for (int j = 3; j >= 0; j--) {\n num[i][j] = n % 10 | '0';\n n /= 10;\n }\n }\n }\n} constexpr pre;\n\ninline void load() {\n memmove(ibuf, ibuf + pil, pir - pil);\n pir = pir - pil + fread(ibuf + pir - pil, 1, SZ - pir + pil, stdin);\n pil = 0;\n if (pir < SZ)\n ibuf[pir++] = '\\n';\n}\n\ninline void flush() {\n fwrite(obuf, 1, por, stdout);\n por = 0;\n}\n\nvoid rd(char &c) {\n do {\n if (pil + 1 > pir)\n load();\n c = ibuf[pil++];\n } while (isspace(c));\n}\n\nvoid rd(string &x) {\n x.clear();\n char c;\n do {\n if (pil + 1 > pir)\n load();\n c = ibuf[pil++];\n } while (isspace(c));\n do {\n x += c;\n if (pil == pir)\n load();\n c = ibuf[pil++];\n } while (!isspace(c));\n}\n\ntemplate <typename T> void rd_real(T &x) {\n string s;\n rd(s);\n x = stod(s);\n}\n\ntemplate <typename T> void rd_integer(T &x) {\n if (pil + 100 > pir)\n load();\n char c;\n do\n c = ibuf[pil++];\n while (c < '-');\n bool minus = 0;\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\n if (c == '-') {\n minus = 1, c = ibuf[pil++];\n }\n }\n x = 0;\n while ('0' <= c) {\n x = x * 10 + (c & 15), c = ibuf[pil++];\n }\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\n if (minus)\n x = -x;\n }\n}\n\nvoid rd(int &x) {\n rd_integer(x);\n}\nvoid rd(ll &x) {\n rd_integer(x);\n}\nvoid rd(i128 &x) {\n rd_integer(x);\n}\nvoid rd(uint &x) {\n rd_integer(x);\n}\nvoid rd(ull &x) {\n rd_integer(x);\n}\nvoid rd(u128 &x) {\n rd_integer(x);\n}\nvoid rd(double &x) {\n rd_real(x);\n}\nvoid rd(long double &x) {\n rd_real(x);\n}\n\ntemplate <class T, class U> void rd(pair<T, U> &p) {\n return rd(p.first), rd(p.second);\n}\ntemplate <size_t N = 0, typename T> void rd_tuple(T &t) {\n if constexpr (N < std::tuple_size<T>::value) {\n auto &x = std::get<N>(t);\n rd(x);\n rd_tuple<N + 1>(t);\n }\n}\ntemplate <class... T> void rd(tuple<T...> &tpl) {\n rd_tuple(tpl);\n}\n\ntemplate <size_t N = 0, typename T> void rd(array<T, N> &x) {\n for (auto &d : x)\n rd(d);\n}\ntemplate <class T> void rd(vector<T> &x) {\n for (auto &d : x)\n rd(d);\n}\n\nvoid read() {}\ntemplate <class H, class... T> void read(H &h, T &...t) {\n rd(h), read(t...);\n}\n\nvoid wt(const char c) {\n if (por == SZ)\n flush();\n obuf[por++] = c;\n}\nvoid wt(const string s) {\n for (char c : s)\n wt(c);\n}\nvoid wt(const char *s) {\n size_t len = strlen(s);\n for (size_t i = 0; i < len; i++)\n wt(s[i]);\n}\n\ntemplate <typename T> void wt_integer(T x) {\n if (por > SZ - 100)\n flush();\n if (x < 0) {\n obuf[por++] = '-', x = -x;\n }\n int outi;\n for (outi = 96; x >= 10000; outi -= 4) {\n memcpy(out + outi, pre.num[x % 10000], 4);\n x /= 10000;\n }\n if (x >= 1000) {\n memcpy(obuf + por, pre.num[x], 4);\n por += 4;\n } else if (x >= 100) {\n memcpy(obuf + por, pre.num[x] + 1, 3);\n por += 3;\n } else if (x >= 10) {\n int q = (x * 103) >> 10;\n obuf[por] = q | '0';\n obuf[por + 1] = (x - q * 10) | '0';\n por += 2;\n } else\n obuf[por++] = x | '0';\n memcpy(obuf + por, out + outi + 4, 96 - outi);\n por += 96 - outi;\n}\n\ntemplate <typename T> void wt_real(T x) {\n ostringstream oss;\n oss << fixed << setprecision(15) << double(x);\n string s = oss.str();\n wt(s);\n}\n\nvoid wt(int x) {\n wt_integer(x);\n}\nvoid wt(ll x) {\n wt_integer(x);\n}\nvoid wt(i128 x) {\n wt_integer(x);\n}\nvoid wt(uint x) {\n wt_integer(x);\n}\nvoid wt(ull x) {\n wt_integer(x);\n}\nvoid wt(u128 x) {\n wt_integer(x);\n}\nvoid wt(double x) {\n wt_real(x);\n}\nvoid wt(long double x) {\n wt_real(x);\n}\n\ntemplate <class T, class U> void wt(const pair<T, U> val) {\n wt(val.first);\n wt(' ');\n wt(val.second);\n}\ntemplate <size_t N = 0, typename T> void wt_tuple(const T t) {\n if constexpr (N < std::tuple_size<T>::value) {\n if constexpr (N > 0) {\n wt(' ');\n }\n const auto x = std::get<N>(t);\n wt(x);\n wt_tuple<N + 1>(t);\n }\n}\ntemplate <class... T> void wt(tuple<T...> tpl) {\n wt_tuple(tpl);\n}\ntemplate <class T, size_t S> void wt(const array<T, S> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i)\n wt(' ');\n wt(val[i]);\n }\n}\ntemplate <class T> void wt(const vector<T> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i)\n wt(' ');\n wt(val[i]);\n }\n}\n\nvoid print() {\n wt('\\n');\n}\ntemplate <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {\n wt(head);\n if (sizeof...(Tail))\n wt(' ');\n print(forward<Tail>(tail)...);\n}\nvoid __attribute__((destructor)) _d() {\n flush();\n}\n} // namespace fastio\n\n\nusing fastio::flush;\nusing fastio::print;\nusing fastio::read;\n\ninline void first(bool i = true) {\n print(i ? \"first\" : \"second\");\n}\ninline void Alice(bool i = true) {\n print(i ? \"Alice\" : \"Bob\");\n}\ninline void Takahashi(bool i = true) {\n print(i ? \"Takahashi\" : \"Aoki\");\n}\ninline void yes(bool i = true) {\n print(i ? \"yes\" : \"no\");\n}\ninline void Yes(bool i = true) {\n print(i ? \"Yes\" : \"No\");\n}\ninline void No() {\n print(\"No\");\n}\ninline void YES(bool i = true) {\n print(i ? \"YES\" : \"NO\");\n}\ninline void NO() {\n print(\"NO\");\n}\ninline void Yay(bool i = true) {\n print(i ? \"Yay!\" : \":(\");\n}\ninline void Possible(bool i = true) {\n print(i ? \"Possible\" : \"Impossible\");\n}\ninline void POSSIBLE(bool i = true) {\n print(i ? \"POSSIBLE\" : \"IMPOSSIBLE\");\n}\n\n/**\n * @brief Fast IO\n */\n\nstruct MaxFlow {\n struct Edge {\n int to, rev;\n ll cap;\n };\n int V;\n vector<vector<Edge>> G;\n vector<int> itr, level;\n using P = pair<int, int>;\n vector<P> es;\n\n public:\n MaxFlow() {}\n MaxFlow(int V) : V(V) {\n G.assign(V, vector<Edge>());\n }\n int add_vertex() {\n G.push_back(vector<Edge>());\n return V++;\n }\n void add_edge(int from, int to, ll cap) {\n int fid = SZ(G[from]), tid = SZ(G[to]);\n if (from == to)\n tid++;\n es.push_back({from, fid});\n G[from].push_back({to, tid, cap});\n G[to].push_back({from, fid, 0});\n }\n struct Type {\n int from, to;\n ll cap, recap;\n };\n Type get_edge(int i) {\n auto [from, pos] = es[i];\n auto e = G[from][pos];\n auto re = G[e.to][e.rev];\n return Type{from, e.to, e.cap, re.cap};\n }\n void bfs(int s) {\n level.assign(V, -1);\n queue<int> q;\n level[s] = 0;\n q.push(s);\n while (!q.empty()) {\n int v = q.front();\n q.pop();\n for (auto &e : G[v]) {\n if (e.cap > 0 && level[e.to] < 0) {\n level[e.to] = level[v] + 1;\n q.push(e.to);\n }\n }\n }\n }\n ll dfs(int v, int t, ll f) {\n if (v == t)\n return f;\n for (int &i = itr[v]; i < (int)G[v].size(); i++) {\n Edge &e = G[v][i];\n if (e.cap > 0 && level[v] < level[e.to]) {\n ll d = dfs(e.to, t, min(f, e.cap));\n if (d > 0) {\n e.cap -= d, G[e.to][e.rev].cap += d;\n return d;\n }\n }\n }\n return 0;\n }\n ll run(int s, int t) {\n ll ret = 0, f;\n while (bfs(s), level[t] >= 0) {\n itr.assign(V, 0);\n while ((f = dfs(s, t, INF)) > 0)\n ret += f;\n }\n return ret;\n }\n vector<int> cut() {\n vector<int> ret(V);\n rep(v, 0, V) if (level[v] < 0) ret[v] = 1;\n return ret;\n }\n};\n\n/**\n * @brief Maximum Flow\n */\n\ntemplate <class Cap, class Cost> struct MinCostFlow {\n struct X {\n int from, to;\n Cap lb, ub, flow;\n Cost cost;\n };\n struct Edge {\n int to, rev;\n Cap cap;\n Cost cost;\n };\n using P = pair<int, int>;\n int n, m;\n vector<X> es;\n vector<Cap> exc;\n vector<Cost> dual;\n vector<vector<Edge>> g;\n Cost MX;\n MinCostFlow(int _n) : n(_n), m(0), exc(n), dual(n), g(n), MX(0) {}\n void add_edge(int from, int to, Cap lb, Cap ub, Cost cost) {\n m++;\n chmax(MX, cost);\n chmax(MX, -cost);\n es.push_back({from, to, lb, ub, 0, cost});\n }\n void add_excess(int v, Cap c) { exc[v] += c; }\n pair<bool, Cost> run() {\n MaxFlow mf(n + 2);\n int S = n, T = n + 1;\n Cap psum = 0, nsum = 0;\n for (auto &e : es) {\n exc[e.to] += e.lb;\n exc[e.from] -= e.lb;\n mf.add_edge(e.from, e.to, e.ub - e.lb);\n }\n rep(i, 0, n) {\n if (exc[i] > 0) {\n psum += exc[i];\n mf.add_edge(S, i, exc[i]);\n }\n if (exc[i] < 0) {\n nsum += -exc[i];\n mf.add_edge(i, T, -exc[i]);\n }\n }\n\n if (psum != nsum or mf.run(S, T) != psum)\n return {false, 0};\n\n using P = pair<int, int>;\n vector<P> pos;\n rep(i, 0, m) {\n auto e = mf.get_edge(i);\n Cost cost = es[i].cost * n;\n int fid = SZ(g[e.from]), tid = SZ(g[e.to]);\n if (e.from == e.to)\n tid++;\n pos.push_back({e.from, fid});\n g[e.from].push_back({e.to, tid, (int)e.cap, cost});\n g[e.to].push_back({e.from, fid, (int)e.recap, -cost});\n }\n\n // solve\n\n Cost eps = MX * n + 1;\n while (eps > 1) {\n eps = max<Cost>(eps >> 2, 1);\n refine(eps);\n }\n\n Cost ret = 0;\n rep(i, 0, m) {\n auto [from, fid] = pos[i];\n es[i].flow = es[i].ub - g[from][fid].cap;\n ret += es[i].flow * es[i].cost;\n }\n dual.assign(n, 0);\n for (;;) {\n bool upd = 0;\n rep(i, 0, n) {\n for (auto &e : g[i])\n if (e.cap) {\n auto cost = dual[i] + e.cost / n;\n if (chmin(dual[e.to], cost)) {\n upd = 1;\n }\n }\n }\n if (!upd)\n break;\n }\n return {true, ret};\n }\n Cap get_flow(int i) const { return es[i].flow; }\n\n private:\n void refine(Cost &eps) {\n exc.assign(n, 0);\n vector<int> used(n);\n queue<int> que;\n vector<int> iter(n);\n\n auto cost = [&](int from, const Edge &e) {\n return e.cost + dual[from] - dual[e.to];\n };\n auto push = [&](int from, Edge &e, Cap cap) {\n exc[from] -= cap;\n exc[e.to] += cap;\n g[e.to][e.rev].cap += cap;\n e.cap -= cap;\n };\n auto relabel = [&](int v) {\n iter[v] = 0;\n Cost down = MX * (n + 1);\n for (auto &e : g[v])\n if (e.cap) {\n chmin(down, eps + cost(v, e));\n }\n dual[v] -= down;\n que.push(v);\n used[v] = 1;\n };\n\n rep(i, 0, n) {\n for (auto &e : g[i])\n if (e.cap and cost(i, e) < 0) {\n push(i, e, e.cap);\n }\n }\n rep(i, 0, n) if (exc[i] > 0) {\n used[i] = 1;\n que.push(i);\n }\n while (!que.empty()) {\n auto v = que.front();\n que.pop();\n used[v] = 0;\n for (int &i = iter[v]; i < SZ(g[v]); i++) {\n auto &e = g[v][i];\n if (e.cap and cost(v, e) < 0) {\n push(v, e, min(exc[v], e.cap));\n if (!used[e.to] and exc[e.to] > 0) {\n used[e.to] = 1;\n que.push(e.to);\n }\n if (exc[v] == 0)\n break;\n }\n }\n if (exc[v] > 0) {\n relabel(v);\n }\n }\n eps = 0;\n rep(i, 0, n) {\n for (auto &e : g[i])\n if (e.cap) {\n chmax(eps, -cost(i, e));\n }\n }\n }\n};\n\n/**\n * @brief Minimum Cost b-flow\n */\n\nbool f(const pair<int,int>& P1, const pair<int,int>& P2) {\n if (P1.second-P1.first != P2.second-P2.first) return P1.second-P1.first<P2.second-P2.first;\n return P1.first > P2.first;\n}\n\nint main() {\nwhile(1) {\n int N, M;\n cin >> N >> M;\n if (N == 0 && M == 0) return 0;\n vector<int> U(M), V(M);\n rep(i,0,M) cin >> U[i] >> V[i], U[i]--, V[i]--;\n vector<pair<int,int>> Cand;\n for (int L = 0, R = 0; L < N-1; L++) {\n if (L > R) R = L;\n for (; R < N; R++) {\n MinCostFlow<int,int> G(N+M+2);\n rep(i,0,N) {\n G.add_edge(N+M,i,L,R,0);\n }\n rep(i,0,M) {\n G.add_edge(U[i],i+N,0,1,0);\n G.add_edge(V[i],i+N,0,1,0);\n G.add_edge(i+N,N+M+1,0,1,0);\n }\n G.add_edge(N+M+1,N+M,0,M,-1);\n auto [ok, ret] = G.run();\n if (ok) {\n if (ret == -M) {\n break;\n }\n }\n }\n if (R == N) break;\n Cand.push_back({L,R});\n }\n sort(ALL(Cand),f);\n cout << Cand[0].first << ' ' << Cand[0].second << endl;\n}\n}","accuracy":1,"time_ms":1110,"memory_kb":5448,"score_of_the_acc":-1.2056,"final_rank":17},{"submission_id":"aoj_1615_9372689","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vll = vector<ll>;\n#define rep(i,n) for(ll i=0;i<n;i++)\n\nvoid solve(ll N,ll M){\n vector<vll> G(N,vll(N,0));\n vll E(N,0);\n rep(i,M){\n ll U,V;\n cin>>U>>V;\n U--;V--;\n G[U][V]=1;\n E[V]++; \n }\n while(1){\n ll m=1e18,M=-1e18;\n ll mid=-1,Mid=-1;\n rep(i,N){\n if(E[i]<m){\n m=E[i];\n mid=i;\n }\n if(E[i]>M){\n M=E[i];\n Mid=i;\n }\n }\n if(m==M||m+1==M)break;\n \n bool EX=0;\n queue<ll> Q;\n Q.push(mid);\n vll dep(N,-1);\n dep[mid]=0;\n while(!Q.empty()){\n ll p=Q.front();\n Q.pop();\n rep(i,N){\n if(G[p][i]==1){\n if(dep[i]!=-1)continue;\n dep[i]=dep[p]+1;\n Q.push(i);\n }\n }\n }\n rep(i,N){\n if(dep[i]!=-1&&E[i]>=m+2){\n ll x=i;\n E[i]--;\n E[mid]++;\n while(x!=mid){\n rep(j,N){\n if(G[j][x]==1&&dep[j]==dep[x]-1){\n G[x][j]=1;\n G[j][x]=0;\n x=j;\n break;\n }\n }\n }\n EX=1;\n break;\n }\n }\n if(EX)continue;\n \n Q.push(Mid);\n dep.assign(N,-1);\n dep[Mid]=0;\n while(!Q.empty()){\n ll p=Q.front();\n Q.pop();\n rep(i,N){\n if(G[i][p]==1){\n if(dep[i]!=-1)continue;\n dep[i]=dep[p]+1;\n Q.push(i);\n }\n }\n }\n rep(i,N){\n if(dep[i]!=-1&&E[i]<=M-2){\n ll x=i;\n E[i]++;\n E[Mid]--;\n while(x!=Mid){\n rep(j,N){\n if(G[x][j]==1&&dep[j]==dep[x]-1){\n G[x][j]=0;\n G[j][x]=1;\n x=j;\n break;\n }\n }\n }\n EX=1;\n break;\n }\n }\n if(EX)continue;\n\n break;\n }\n\n sort(E.begin(),E.end());\n cout<<E[0]<<\" \"<<E.back()<<endl;\n\n}\n\nint main() {\n\n ll H,W;\n while (cin >> H>>W) {\n if (H+W == 0)return 0;\n solve(H,W);\n }\n}","accuracy":1,"time_ms":90,"memory_kb":3468,"score_of_the_acc":-0.015,"final_rank":1},{"submission_id":"aoj_1615_9365911","code_snippet":"#line 2 \"cp-library/src/cp-template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nusing i32 = int;\nusing u32 = unsigned int;\nusing i64 = long long;\nusing u64 = unsigned long long;\nusing i128 = __int128_t;\ntemplate < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }\ntemplate < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }\ntemplate < class T, class U > T ceil (T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); }\ntemplate < class T, class U > T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); }\nint popcnt(i32 x) { return __builtin_popcount(x); }\nint popcnt(u32 x) { return __builtin_popcount(x); }\nint popcnt(i64 x) { return __builtin_popcountll(x); }\nint popcnt(u64 x) { return __builtin_popcountll(x); }\n\n#line 2 \"cp-library/src/utility/rep_itr.hpp\"\ntemplate < class T > struct itr_rep {\n T i, d;\n constexpr itr_rep(const T i) noexcept : i(i), d(1) {}\n constexpr itr_rep(const T i, const T d) noexcept : i(i), d(d) {}\n void operator++() noexcept { i += d; }\n constexpr int operator*() const noexcept { return i; }\n constexpr bool operator!=(const itr_rep x) const noexcept { return d > 0 ? i < x.i : i > x.i; }\n};\n\ntemplate < class T > struct rep {\n const itr_rep< T > s, t;\n constexpr rep(const T t) noexcept : s(0), t(t) {}\n constexpr rep(const T s, const T t) noexcept : s(s), t(t) {}\n constexpr rep(const T s, const T t, const T d) noexcept : s(s, d), t(t, d) {}\n constexpr auto begin() const noexcept { return s; }\n constexpr auto end () const noexcept { return t; }\n};\n\ntemplate < class T > struct revrep {\n const itr_rep < T > s, t;\n constexpr revrep(const T t) noexcept : s(t - 1, -1), t(-1, -1) {}\n constexpr revrep(const T s, const T t) noexcept : s(t - 1, -1), t(s - 1, -1) {}\n constexpr revrep(const T s, const T t, const T d) noexcept : s(t - 1, -d), t(s - 1, -d) {}\n constexpr auto begin() const noexcept { return s; }\n constexpr auto end () const noexcept { return t; }\n};\n#line 3 \"cp-library/src/utility/io.hpp\"\n\n/* 128bit integer */\nistream& operator>>(istream& is, i128& x) {\n std::string s; is >> s;\n int pm = (s[0] == '-');\n x = 0;\n for(int i : rep(pm, int(s.size()))) x = x * 10 + (s[i] - '0');\n if(pm) x *= -1;\n return is;\n}\nostream& operator<<(ostream& os, const i128& x) {\n if(x == 0) return os << '0';\n i128 y = x;\n if(y < 0) { os << '-'; y *= -1; }\n std::vector<int> ny;\n while(y > 0) { ny.push_back(y % 10); y /= 10; }\n for(int i : revrep(ny.size())) os << ny[i];\n return os;\n}\n\ntemplate < class S, class T > istream& operator>>(istream& is, std::pair< S, T >& x) { is >> x.first >> x.second; return is; }\ntemplate < class S, class T > ostream& operator<<(ostream& os, const std::pair< S, T >& x) { os << x.first << \" \" << x.second; return os; }\n\nnamespace scanner {\n struct sca {\n template < class T > operator T() {\n T s; std::cin >> s; return s;\n }\n };\n struct vec {\n int n;\n vec(int n) : n(n) {}\n template < class T > operator std::vector< T >() {\n std::vector< T > v(n);\n for(T& x : v) std::cin >> x;\n return v;\n }\n };\n struct mat {\n int h, w;\n mat(int h, int w) : h(h), w(w) {}\n template < class T > operator std::vector< std::vector< T > >() {\n std::vector m(h, std::vector< T >(w));\n for(std::vector< T >& v : m) for(T& x : v) std::cin >> x;\n return m;\n }\n };\n struct speedup {\n speedup() {\n std::cin.tie(0);\n std::ios::sync_with_stdio(0);\n }\n } speedup_instance;\n}\nscanner::sca in() { return scanner::sca(); }\nscanner::vec in(int n) { return scanner::vec(n); }\nscanner::mat in(int h, int w) { return scanner::mat(h, w); }\n\nnamespace printer {\n void precision(int d) { std::cout << std::fixed << std::setprecision(d); }\n void flush() { std::cout.flush(); }\n}\n\ntemplate < class T >\nostream& operator<<(ostream& os, const std::vector< T > a) {\n int n = a.size();\n for(int i : rep(n)) { os << a[i]; if(i != n - 1) os << ' '; }\n return os;\n}\n\nint print() { std::cout << '\\n'; return 0; }\ntemplate < class head, class... tail > int print(head&& h, tail&&... t) {\n std::cout << h; if(sizeof...(tail)) std::cout << ' ';\n return print(std::forward<tail>(t)...);\n}\ntemplate < class T > int print_n(const std::vector< T > a) {\n int n = a.size();\n for(int i : rep(n)) std::cout << a[i] << \"\\n\";\n return 0;\n}\n\n\n#line 2 \"cp-library/src/utility/key_val.hpp\"\n\ntemplate < class K, class V >\nstruct key_val {\n K key; V val;\n key_val() {}\n key_val(K key, V val) : key(key), val(val) {}\n template < std::size_t Index >\n std::tuple_element_t< Index, key_val >& get() {\n if constexpr (Index == 0) return key;\n if constexpr (Index == 1) return val;\n }\n};\n\nnamespace std {\n\ntemplate < class K, class V > struct tuple_size < key_val< K, V > > : integral_constant< size_t, 2 > {};\ntemplate < class K, class V > struct tuple_element < 0, key_val< K, V > > { using type = K; };\ntemplate < class K, class V > struct tuple_element < 1, key_val< K, V > > { using type = V; };\n\n}\n#line 2 \"cp-library/src/utility/vec_op.hpp\"\ntemplate < class T > key_val< int, T > max_of(const vector< T >& a) {\n int i = std::max_element(a.begin(), a.end()) - a.begin();\n return {i, a[i]};\n}\ntemplate < class T > key_val< int, T > min_of(const vector< T >& a) {\n int i = std::min_element(a.begin(), a.end()) - a.begin();\n return {i, a[i]};\n}\ntemplate < class S, class T > S sum_of(const vector< T >& a) {\n S sum = 0;\n for(const T x : a) sum += x;\n return sum;\n}\ntemplate < class S, class T > vector< S > freq_of(const vector< T >& a, T L, T R) {\n vector< S > res(R - L, S(0));\n for(const T x : a) res[x - L] += 1;\n return res;\n}\ntemplate < class S, class T > struct prefix_sum {\n vector< S > s;\n prefix_sum(const vector< T >& a) : s(a) {\n s.insert(s.begin(), S(0));\n for(int i : rep(a.size())) s[i + 1] += s[i];\n }\n // [L, R)\n S sum(int L, int R) { return s[R] - s[L]; }\n};\n#line 3 \"cp-library/src/utility/heap.hpp\"\n\ntemplate < class T > using heap_min = std::priority_queue< T, std::vector< T >, std::greater< T > >;\ntemplate < class T > using heap_max = std::priority_queue< T, std::vector< T >, std::less< T > >;\n\n#line 27 \"cp-library/src/cp-template.hpp\"\n\n#line 1 \"cp-library/src/algorithm/bin_search.hpp\"\ntemplate < class T, class F >\nT bin_search(T ok, T ng, F f) {\n while(abs(ng - ok) > 1) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n\ntemplate < class T, class F >\nT bin_search_real(T ok, T ng, F f, int step = 80) {\n while(step--) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n#line 2 \"cp-library/src/algorithm/argsort.hpp\"\n\ntemplate < class T > std::vector< int > argsort(const std::vector< T > &a) {\n std::vector< int > ids((int)a.size());\n std::iota(ids.begin(), ids.end(), 0);\n std::sort(ids.begin(), ids.end(), [&](int i, int j) {\n return a[i] < a[j] || (a[i] == a[j] && i < j);\n });\n return ids;\n}\n#line 1 \"macro.hpp\"\nnamespace macro {\n\nusing size_type = int;\ntemplate < class container > void sort(container& a) { std::sort(std:: begin(a), std:: end(a)); }\ntemplate < class container > void rsort(container& a) { std::sort(std::rbegin(a), std::rend(a)); }\ntemplate < class container > void reverse(container& a) { std::reverse(std::begin(a), std::end(a)); }\ntemplate < class container > void unique(container& a) {\n std::sort(std::begin(a), std::end(a));\n a.erase(std::unique(std::begin(a), std::end(a)), std::end(a));\n}\ntemplate < class container > container sorted(const container& a) { container b = a; sort(b); return std::move(b); }\ntemplate < class container > container rsorted(const container& a) { container b = a; rsort(b); return std::move(b); }\ntemplate < class container, class compare > void sort(container& a, const compare& cmp) { std::sort(std::begin(a), std::end(a), cmp); }\ntemplate < class container, class compare > container sorted(const container& a, const compare& cmp) { container b = a; sort(b, cmp); return std::move(b); }\ntemplate < class container, class value > size_type lower_bound(const container& a, const value& x) { return std::lower_bound(std::begin(a), std::end(a), x) - std::begin(a); }\ntemplate < class container, class value > size_type upper_bound(const container& a, const value& x) { return std::upper_bound(std::begin(a), std::end(a), x) - std::begin(a); }\n\nconst std::vector<std::pair<size_type, size_type>> dir4 = { {+1, 0}, {-1, 0}, { 0, +1}, { 0, -1} };\nconst std::vector<std::pair<size_type, size_type>> dir8 = { {-1, -1}, {-1, 0}, {-1, +1}, { 0, -1}, { 0, +1}, {+1, -1}, {+1, 0}, {+1, +1} };\n\n#ifdef _DEBUG\n#define debug(x) std::cout << \"[\" << __LINE__ << \"] \" << #x << \": \" << x << std::endl\n#else\n#define debug(x)\n#endif\n\ntemplate < class container > void concat(container& a, const container& b) {\n a.insert(std::end(a), std::begin(b), std::end(b));\n}\nstd::vector<size_type> iota(const size_type n) {\n std::vector<size_type> I(n);\n std::iota(std::begin(I), std::end(I), 0);\n return I;\n}\ntemplate < class container > std::vector<size_type> sort_idx(const container& a) {\n const size_type n = a.size();\n std::vector<size_type> I = iota(n);\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return a[i] < a[j] or (a[i] == a[j] and i < j); });\n return I;\n}\ntemplate < class container, class compare > std::vector<size_type> sort_idx(const container& a, const compare& cmp) {\n const size_type n = a.size();\n std::vector<size_type> I = iota(n);\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return cmp(a[i], a[j]) or (a[i] == a[j] and i < j); });\n return std::move(I);\n}\n\nstruct grid {\n using size_type = int;\n size_type H, W;\n grid(const size_type H, const size_type W) : H(H), W(W) {}\n bool contains(const size_type i, const size_type j) {\n return 0 <= i and i < H and 0 <= j and j < W;\n }\n};\n\nusing f64 = long double;\n\ntemplate < class T > vector< T >& operator++(vector< T >& a) { for(T& x : a) x++; return a; }\ntemplate < class T > vector< T >& operator--(vector< T >& a) { for(T& x : a) x--; return a; }\ntemplate < class T > vector< T > operator++(vector< T >& a, signed) { vector< T > res = a; for(T& x : a) x++; return res; }\ntemplate < class T > vector< T > operator--(vector< T >& a, signed) { vector< T > res = a; for(T& x : a) x--; return res; }\n\n} // namespace macro\n\nusing namespace macro;\n#line 3 \"A.cpp\"\n\n#line 1 \"cp-library/src/graph/max_flow.hpp\"\ntemplate < class Cap > struct mf_graph {\n public:\n explicit mf_graph(int n) : n(n), g(n) {}\n \n int add_edge(int from, int to, Cap cap) {\n assert(0 <= from and from < n);\n assert(0 <= to and to < n);\n assert(0 <= cap);\n int m = pos.size();\n pos.push_back({from, g[from].size()});\n int from_id = g[from].size();\n int to_id = g[to].size() + (from == to);\n g[from].push_back(_edge{to, to_id, cap});\n g[to].push_back(_edge{from, from_id, 0});\n return m;\n }\n\n struct edge {\n int from, to; Cap cap, flow;\n };\n\n edge get_edge(int i) {\n int m = pos.size();\n assert(0 <= i and i < m);\n _edge e = g[pos[i].first][pos[i].second];\n _edge r = g[e.to][e.rev];\n return edge{pos[i].first, e.to, e.cap + r.cap, r.cap};\n }\n\n vector<edge> edges() {\n int m = pos.size();\n vector<edge> res(m);\n for(int i : rep(m)) res[i] = get_edge(i);\n return res;\n }\n\n void change_edge(int i, Cap cap, Cap flow) {\n int m = pos.size();\n assert(0 <= i and i < m);\n assert(0 <= flow and flow <= cap);\n _edge& e = g[pos[i].first][pos[i].second];\n _edge& r = g[e.to][e.rev];\n e.cap = cap - flow;\n r.cap = flow;\n }\n\n Cap flow(int s, int t, Cap flow_limit) {\n assert(0 <= s and s < n);\n assert(0 <= t and t < n);\n assert(s != t);\n\n vector<int> level(n), iter(n);\n auto bfs = [&]() {\n fill(level.begin(), level.end(), -1);\n level[s] = 0;\n queue<int> q;\n q.push(s);\n while(not q.empty()) {\n int v = q.front(); q.pop();\n for(_edge e : g[v]) {\n if(e.cap == 0 or level[e.to] >= 0) continue;\n level[e.to] = level[v] + 1;\n if(e.to == t) return;\n q.push(e.to);\n }\n }\n };\n\n auto dfs = [&](auto self, int v, Cap up) {\n if(v == s) return up;\n Cap res = 0;\n int level_v = level[v];\n for(int& i = iter[v]; i < int(g[v].size()); i++) {\n _edge& e = g[v][i];\n if(level_v <= level[e.to] or g[e.to][e.rev].cap == 0) continue;\n Cap d = self(self, e.to, min(up - res, g[e.to][e.rev].cap));\n if(d <= 0) continue;\n g[v][i].cap += d;\n g[e.to][e.rev].cap -= d;\n res += d;\n if(res == up) return res;\n }\n level[v] = n;\n return res;\n };\n\n Cap flow = 0;\n while(flow < flow_limit) {\n bfs();\n if(level[t] == -1) break;\n fill(iter.begin(), iter.end(), 0);\n Cap f = dfs(dfs, t, flow_limit - flow);\n if(f == 0) break;\n flow += f;\n }\n return flow;\n }\n\n Cap flow(int s, int t) {\n return flow(s, t, numeric_limits<Cap>::max());\n }\n\n vector<int> min_cut(int s) {\n vector<int> visited(n, 0);\n queue<int> q;\n q.push(s);\n while(not q.empty()) {\n int p = q.front(); q.pop();\n visited[p] = 1;\n for(_edge e : g[p]) {\n if(e.cap && not visited[e.to]) {\n visited[e.to] = 1;\n q.push(e.to);\n }\n }\n }\n return visited;\n }\n\n private:\n int n;\n struct _edge {\n int to, rev; Cap cap;\n };\n vector<pair<int,int>> pos;\n vector<vector<_edge>> g;\n};\n#line 5 \"A.cpp\"\n\npair<int,int> solve(int n, int m) {\n vector<pair<int,int>> e(m);\n for(auto &[u, v] : e) u = in(), v = in(), u--, v--;\n\n auto f = [&](int L, int R) -> bool {\n mf_graph<int> g(n + m + 4);\n const int S = n + m + 0, T = n + m + 1;\n const int SS = n + m + 2, TT = n + m + 3;\n auto V = [&](int i) { return i; };\n auto E = [&](int i) { return n + i; };\n for(int i : rep(m)) {\n auto [u, v] = e[i];\n g.add_edge(V(u), E(i), 1);\n g.add_edge(V(v), E(i), 1);\n g.add_edge(E(i), T, 1);\n }\n for(int v : rep(n)) {\n g.add_edge(S, V(v), R - L);\n g.add_edge(SS, V(v), L);\n g.add_edge(S, TT, L);\n }\n const int SSTT = g.flow(SS, TT);\n const int STT = g.flow(S , TT);\n const int SST = g.flow(SS, T );\n const int ST = g.flow(S , T );\n return STT + ST == m;\n };\n\n int ansL = 0, ansR = n;\n for(int L = 0, R = 0; R <= n; R++) {\n while(L <= R and f(L, R)) {\n tie(ansL, ansR) = make_pair(L, R);\n L++;\n }\n }\n return {ansL, ansR};\n}\n\nint main() {\n while(true) {\n int n = in(), m = in();\n if(make_pair(n, m) == make_pair(0, 0)) return 0;\n auto [l, h] = solve(n, m);\n print(l, h);\n }\n}","accuracy":1,"time_ms":300,"memory_kb":4268,"score_of_the_acc":-0.4582,"final_rank":4},{"submission_id":"aoj_1615_9340556","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <set>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for(int i = 0; i < (n); i++)\n\ntemplate<class T>\nusing vi = vector<T>;\n\ntemplate<class T>\nusing vii = vector<vi<T>>;\n\ntemplate<class T>\nusing viii = vector<vii<T>>;\n\nstruct Dinic {\nprivate:\n const long long inf = 1e18;\n vector<int> dist; //sからの距離\n vector<int> iter; //どこまで調べたか\npublic:\n struct edge {\n int to, rev; long long cap;\n edge(int t = 0, int r = 0, long long c = 0LL) : to(t), rev(r), cap(c) {}\n };\n\n int n;\n vector<vector<edge>> to;\n\n Dinic(int n_ = 1) : n(n_), to(n_), dist(n_), iter(n_) {}\n\n void addedge(int u, int v, long long cap) {//u->vにcapの容量\n int su = (int)to[u].size(), sv = (int)to[v].size();\n to[u].push_back({ v, sv, cap });\n to[v].push_back({ u, su, 0 });\n }\n\n long long dfs(int v, int t, long long f) { //t: 終点, f: flow\n if (v == t) return f;\n int sv = (int)to[v].size();\n for (int& i = iter[v]; i < sv; i++) {\n edge& nv = to[v][i];\n if (dist[nv.to] <= dist[v] || nv.cap == 0) continue; //here\n long long nf = dfs(nv.to, t, min(f, nv.cap));\n if (nf > 0) {\n nv.cap -= nf;\n to[nv.to][nv.rev].cap += nf;\n return nf;\n }\n }\n return 0;\n }\n\n void bfs(int s) {\n dist.assign(n, -1);\n queue<int> q;\n q.push(s);\n dist[s] = 0;\n while (!q.empty()) {\n int v = q.front();\n q.pop();\n for (auto nv : to[v]) {\n if (nv.cap > 0 && dist[nv.to] < 0) {\n dist[nv.to] = dist[v] + 1;\n q.push(nv.to);\n }\n }\n }\n }\n\n long long maxflow(int s, int t) {//s:始点, t:終点\n long long res = 0, flow = 0;\n while (true) {\n bfs(s);\n if (dist[t] < 0) break;\n\n iter.assign(n, 0);\n while (flow = dfs(s, t, inf)) res += flow;\n };\n return res;\n }\n};\n\nint main() \n{\n vi<pair<int, int>> ans;\n int n, m;\n while (cin >> n >> m, n) {\n vi<int> u(m), v(m);\n rep(i, m) cin >> u[i] >> v[i];\n rep(i, m) u[i]--;\n rep(i, m) v[i]--;\n\n int high = n, low = 0;\n int S = n + m, T = S + 1, T2 = S + 2;\n\n auto f = [&](int h, int l) {\n Dinic dn(n + m + 3);\n rep(i, m) dn.addedge(S, i, 1);\n rep(i, m) {\n dn.addedge(i, m + u[i], 1);\n dn.addedge(i, m + v[i], 1);\n }\n rep(i, n) {\n dn.addedge(m + i, T, h);\n //dn.addedge(T, m + i, l);\n dn.addedge(m + i, T2, l);\n }\n return dn;\n };\n\n rep(l, n + 1) {\n for(int h = l; h <= min(n, l + high - low); h++) {\n Dinic dn = f(h, l);\n \n int flow = dn.maxflow(S, T);\n if (flow < m) continue;\n\n int flow_l = dn.maxflow(T, T2);\n if (flow_l < l * n) continue;\n\n if (h - l <= high - low) {\n high = h;\n low = l;\n break;\n }\n }\n }\n ans.push_back({ low, high });\n }\n for (auto elem : ans) cout << elem.first << \" \" << elem.second << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":1810,"memory_kb":4000,"score_of_the_acc":-0.6051,"final_rank":7},{"submission_id":"aoj_1615_9340542","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <set>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for(int i = 0; i < (n); i++)\n\ntemplate<class T>\nusing vi = vector<T>;\n\ntemplate<class T>\nusing vii = vector<vi<T>>;\n\ntemplate<class T>\nusing viii = vector<vii<T>>;\n\nstruct Dinic {\nprivate:\n const long long inf = 1e18;\n vector<int> dist; //sからの距離\n vector<int> iter; //どこまで調べたか\npublic:\n struct edge {\n int to, rev; long long cap;\n edge(int t = 0, int r = 0, long long c = 0LL) : to(t), rev(r), cap(c) {}\n };\n\n int n;\n vector<vector<edge>> to;\n\n Dinic(int n_ = 1) : n(n_), to(n_), dist(n_), iter(n_) {}\n\n void addedge(int u, int v, long long cap) {//u->vにcapの容量\n int su = (int)to[u].size(), sv = (int)to[v].size();\n to[u].push_back({ v, sv, cap });\n to[v].push_back({ u, su, 0 });\n }\n\n long long dfs(int v, int t, long long f) { //t: 終点, f: flow\n if (v == t) return f;\n int sv = (int)to[v].size();\n for (int& i = iter[v]; i < sv; i++) {\n edge& nv = to[v][i];\n if (dist[nv.to] <= dist[v] || nv.cap == 0) continue; //here\n long long nf = dfs(nv.to, t, min(f, nv.cap));\n if (nf > 0) {\n nv.cap -= nf;\n to[nv.to][nv.rev].cap += nf;\n return nf;\n }\n }\n return 0;\n }\n\n void bfs(int s) {\n dist.assign(n, -1);\n queue<int> q;\n q.push(s);\n dist[s] = 0;\n while (!q.empty()) {\n int v = q.front();\n q.pop();\n for (auto nv : to[v]) {\n if (nv.cap > 0 && dist[nv.to] < 0) {\n dist[nv.to] = dist[v] + 1;\n q.push(nv.to);\n }\n }\n }\n }\n\n long long maxflow(int s, int t) {//s:始点, t:終点\n long long res = 0, flow = 0;\n while (true) {\n bfs(s);\n if (dist[t] < 0) break;\n\n iter.assign(n, 0);\n while (flow = dfs(s, t, inf)) res += flow;\n };\n return res;\n }\n};\n\nint main() \n{\n vi<pair<int, int>> ans;\n int n, m;\n while (cin >> n >> m, n) {\n vi<int> u(m), v(m);\n rep(i, m) cin >> u[i] >> v[i];\n rep(i, m) u[i]--;\n rep(i, m) v[i]--;\n\n int high = n, low = 0;\n int S = n + m, T = S + 1, T2 = S + 2;\n\n auto f = [&](int h, int l) {\n Dinic dn(n + m + 3);\n rep(i, m) dn.addedge(S, i, 1);\n rep(i, m) {\n dn.addedge(i, m + u[i], 1);\n dn.addedge(i, m + v[i], 1);\n }\n rep(i, n) {\n dn.addedge(m + i, T, h);\n //dn.addedge(T, m + i, l);\n dn.addedge(m + i, T2, l);\n }\n return dn;\n };\n\n rep(l, n + 1) {\n for(int h = l; h <= min(n, l + high - low); h++) {\n Dinic dn = f(h, l);\n \n int flow = dn.maxflow(S, T);\n if (flow < m) continue;\n\n int flow_l = dn.maxflow(T, T2);\n if (flow_l < l * n) continue;\n\n if (h - l <= high - low) {\n high = h;\n low = l;\n break;\n }\n }\n }\n ans.push_back({ low, high });\n }\n for (auto elem : ans) cout << elem.first << \" \" << elem.second << endl;\n\treturn 0;\n}\n\n\n//\n//struct edge {\n// int to, cap, rev;\n//};\n//\n//int main()\n//{\n// vi<pair<int, int>> ans;\n// int n, m;\n// while (cin >> n >> m, n) {\n// vii<edge> to(n);\n// vi<int> deg(n);\n// rep(i, m) {\n// int u, v;\n// cin >> u >> v;\n// u--, v--;\n// int su = (int)to[u].size();\n// int sv = (int)to[v].size();\n// to[u].push_back({ v, 0, sv });\n// to[v].push_back({ u, 1, su });\n// deg[u]++;\n// }\n//\n// map<int, set<int>> mp;\n// rep(i, n) mp[deg[i]].insert(i);\n//\n// vi<bool> visited(n);\n// auto dfs = [&](auto dfs, int s, int v, int mn = 0)->bool {\n// visited[v] = true;\n// if ((!mn && deg[s] + 2 <= deg[v]) \n// || (mn && deg[v] + 2 <= deg[s])) {\n// mp[deg[v]].erase(v);\n// mp[deg[s]].erase(s);\n// if ((int)mp[deg[v]].size() == 0) mp.erase(deg[v]);\n// if ((int)mp[deg[s]].size() == 0) mp.erase(deg[s]);\n//\n// if (!mn) {\n// deg[v]--;\n// deg[s]++;\n// }\n// else {\n// deg[v]++;\n// deg[s]--;\n// }\n//\n// mp[deg[v]].insert(v);\n// mp[deg[s]].insert(s);\n// return true;\n// }\n// for (auto& elem : to[v]) {\n// if (elem.cap == mn || visited[elem.to]) continue;\n// if (dfs(dfs, s, elem.to, mn)) {\n// elem.cap = mn;\n// to[elem.to][elem.rev].cap = 1 - mn;\n// return true;\n// }\n// }\n// return false;\n// };\n//\n// bool ok = true;\n// while (ok) {\n// ok = false;\n// for (int v : mp.begin()->second) {\n// visited.assign(n, false);\n// ok = dfs(dfs, v, v);\n// if (ok) break;\n// }\n//\n// if (ok) continue;\n//\n// for (int v : mp.rbegin()->second) {\n// visited.assign(n, false);\n// ok = dfs(dfs, v, v, 1);\n// if (ok) break;\n// }\n// }\n// ans.push_back({ mp.begin()->first, mp.rbegin()->first });\n// }\n//\n// for (auto elem : ans) cout << elem.first << \" \" << elem.second << endl;\n// return 0;\n//}","accuracy":1,"time_ms":1800,"memory_kb":4112,"score_of_the_acc":-0.6598,"final_rank":12},{"submission_id":"aoj_1615_9340540","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <set>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for(int i = 0; i < (n); i++)\n\ntemplate<class T>\nusing vi = vector<T>;\n\ntemplate<class T>\nusing vii = vector<vi<T>>;\n\ntemplate<class T>\nusing viii = vector<vii<T>>;\n\nstruct Dinic {\nprivate:\n const long long inf = 1e18;\n vector<int> dist; //sからの距離\n vector<int> iter; //どこまで調べたか\npublic:\n struct edge {\n int to, rev; long long cap;\n edge(int t = 0, int r = 0, long long c = 0LL) : to(t), rev(r), cap(c) {}\n };\n\n int n;\n vector<vector<edge>> to;\n\n Dinic(int n_ = 1) : n(n_), to(n_), dist(n_), iter(n_) {}\n\n void addedge(int u, int v, long long cap) {//u->vにcapの容量\n int su = (int)to[u].size(), sv = (int)to[v].size();\n to[u].push_back({ v, sv, cap });\n to[v].push_back({ u, su, 0 });\n }\n\n long long dfs(int v, int t, long long f) { //t: 終点, f: flow\n if (v == t) return f;\n int sv = (int)to[v].size();\n for (int& i = iter[v]; i < sv; i++) {\n edge& nv = to[v][i];\n if (dist[nv.to] <= dist[v] || nv.cap == 0) continue; //here\n long long nf = dfs(nv.to, t, min(f, nv.cap));\n if (nf > 0) {\n nv.cap -= nf;\n to[nv.to][nv.rev].cap += nf;\n return nf;\n }\n }\n return 0;\n }\n\n void bfs(int s) {\n dist.assign(n, -1);\n queue<int> q;\n q.push(s);\n dist[s] = 0;\n while (!q.empty()) {\n int v = q.front();\n q.pop();\n for (auto nv : to[v]) {\n if (nv.cap > 0 && dist[nv.to] < 0) {\n dist[nv.to] = dist[v] + 1;\n q.push(nv.to);\n }\n }\n }\n }\n\n long long maxflow(int s, int t) {//s:始点, t:終点\n long long res = 0, flow = 0;\n while (true) {\n bfs(s);\n if (dist[t] < 0) break;\n\n iter.assign(n, 0);\n while (flow = dfs(s, t, inf)) res += flow;\n };\n return res;\n }\n};\n\nint main() \n{\n vi<pair<int, int>> ans;\n int n, m;\n while (cin >> n >> m, n) {\n vi<int> u(m), v(m);\n rep(i, m) cin >> u[i] >> v[i];\n rep(i, m) u[i]--;\n rep(i, m) v[i]--;\n\n int high = m + 1, low = 0;\n int S = n + m, T = S + 1, T2 = S + 2;\n\n auto f = [&](int h, int l) {\n Dinic dn(n + m + 3);\n rep(i, m) dn.addedge(S, i, 1);\n rep(i, m) {\n dn.addedge(i, m + u[i], 1);\n dn.addedge(i, m + v[i], 1);\n }\n rep(i, n) {\n dn.addedge(m + i, T, h);\n //dn.addedge(T, m + i, l);\n dn.addedge(m + i, T2, l);\n }\n return dn;\n };\n\n rep(l, n + 1) {\n for(int h = l; h <= min(n, l + high - low); h++) {\n Dinic dn = f(h, l);\n \n int flow = dn.maxflow(S, T);\n if (flow < m) continue;\n\n int flow_l = dn.maxflow(T, T2);\n if (flow_l < l * n) continue;\n\n if (h - l <= high - low) {\n high = h;\n low = l;\n break;\n }\n }\n }\n ans.push_back({ low, high });\n }\n for (auto elem : ans) cout << elem.first << \" \" << elem.second << endl;\n\treturn 0;\n}\n\n\n//\n//struct edge {\n// int to, cap, rev;\n//};\n//\n//int main()\n//{\n// vi<pair<int, int>> ans;\n// int n, m;\n// while (cin >> n >> m, n) {\n// vii<edge> to(n);\n// vi<int> deg(n);\n// rep(i, m) {\n// int u, v;\n// cin >> u >> v;\n// u--, v--;\n// int su = (int)to[u].size();\n// int sv = (int)to[v].size();\n// to[u].push_back({ v, 0, sv });\n// to[v].push_back({ u, 1, su });\n// deg[u]++;\n// }\n//\n// map<int, set<int>> mp;\n// rep(i, n) mp[deg[i]].insert(i);\n//\n// vi<bool> visited(n);\n// auto dfs = [&](auto dfs, int s, int v, int mn = 0)->bool {\n// visited[v] = true;\n// if ((!mn && deg[s] + 2 <= deg[v]) \n// || (mn && deg[v] + 2 <= deg[s])) {\n// mp[deg[v]].erase(v);\n// mp[deg[s]].erase(s);\n// if ((int)mp[deg[v]].size() == 0) mp.erase(deg[v]);\n// if ((int)mp[deg[s]].size() == 0) mp.erase(deg[s]);\n//\n// if (!mn) {\n// deg[v]--;\n// deg[s]++;\n// }\n// else {\n// deg[v]++;\n// deg[s]--;\n// }\n//\n// mp[deg[v]].insert(v);\n// mp[deg[s]].insert(s);\n// return true;\n// }\n// for (auto& elem : to[v]) {\n// if (elem.cap == mn || visited[elem.to]) continue;\n// if (dfs(dfs, s, elem.to, mn)) {\n// elem.cap = mn;\n// to[elem.to][elem.rev].cap = 1 - mn;\n// return true;\n// }\n// }\n// return false;\n// };\n//\n// bool ok = true;\n// while (ok) {\n// ok = false;\n// for (int v : mp.begin()->second) {\n// visited.assign(n, false);\n// ok = dfs(dfs, v, v);\n// if (ok) break;\n// }\n//\n// if (ok) continue;\n//\n// for (int v : mp.rbegin()->second) {\n// visited.assign(n, false);\n// ok = dfs(dfs, v, v, 1);\n// if (ok) break;\n// }\n// }\n// ans.push_back({ mp.begin()->first, mp.rbegin()->first });\n// }\n//\n// for (auto elem : ans) cout << elem.first << \" \" << elem.second << endl;\n// return 0;\n//}","accuracy":1,"time_ms":1810,"memory_kb":4112,"score_of_the_acc":-0.6617,"final_rank":13},{"submission_id":"aoj_1615_9340539","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <set>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for(int i = 0; i < (n); i++)\n\ntemplate<class T>\nusing vi = vector<T>;\n\ntemplate<class T>\nusing vii = vector<vi<T>>;\n\ntemplate<class T>\nusing viii = vector<vii<T>>;\n\nstruct Dinic {\nprivate:\n const long long inf = 1e18;\n vector<int> dist; //sからの距離\n vector<int> iter; //どこまで調べたか\npublic:\n struct edge {\n int to, rev; long long cap;\n edge(int t = 0, int r = 0, long long c = 0LL) : to(t), rev(r), cap(c) {}\n };\n\n int n;\n vector<vector<edge>> to;\n\n Dinic(int n_ = 1) : n(n_), to(n_), dist(n_), iter(n_) {}\n\n void addedge(int u, int v, long long cap) {//u->vにcapの容量\n int su = (int)to[u].size(), sv = (int)to[v].size();\n to[u].push_back({ v, sv, cap });\n to[v].push_back({ u, su, 0 });\n }\n\n long long dfs(int v, int t, long long f) { //t: 終点, f: flow\n if (v == t) return f;\n int sv = (int)to[v].size();\n for (int& i = iter[v]; i < sv; i++) {\n edge& nv = to[v][i];\n if (dist[nv.to] <= dist[v] || nv.cap == 0) continue; //here\n long long nf = dfs(nv.to, t, min(f, nv.cap));\n if (nf > 0) {\n nv.cap -= nf;\n to[nv.to][nv.rev].cap += nf;\n return nf;\n }\n }\n return 0;\n }\n\n void bfs(int s) {\n dist.assign(n, -1);\n queue<int> q;\n q.push(s);\n dist[s] = 0;\n while (!q.empty()) {\n int v = q.front();\n q.pop();\n for (auto nv : to[v]) {\n if (nv.cap > 0 && dist[nv.to] < 0) {\n dist[nv.to] = dist[v] + 1;\n q.push(nv.to);\n }\n }\n }\n }\n\n long long maxflow(int s, int t) {//s:始点, t:終点\n long long res = 0, flow = 0;\n while (true) {\n bfs(s);\n if (dist[t] < 0) break;\n\n iter.assign(n, 0);\n while (flow = dfs(s, t, inf)) res += flow;\n };\n return res;\n }\n};\n\nint main() \n{\n vi<pair<int, int>> ans;\n int n, m;\n while (cin >> n >> m, n) {\n vi<int> u(m), v(m);\n rep(i, m) cin >> u[i] >> v[i];\n rep(i, m) u[i]--;\n rep(i, m) v[i]--;\n\n int high = m + 1, low = 0;\n int S = n + m, T = S + 1, T2 = S + 2;\n\n auto f = [&](int h, int l) {\n Dinic dn(n + m + 3);\n rep(i, m) dn.addedge(S, i, 1);\n rep(i, m) {\n dn.addedge(i, m + u[i], 1);\n dn.addedge(i, m + v[i], 1);\n }\n rep(i, n) {\n dn.addedge(m + i, T, h);\n //dn.addedge(T, m + i, l);\n dn.addedge(m + i, T2, l);\n }\n return dn;\n };\n\n rep(l, n + 1) {\n for(int h = (high == m + 1 ? l : max(high, l)); h <= min(n, l + high - low); h++) {\n Dinic dn = f(h, l);\n \n int flow = dn.maxflow(S, T);\n if (flow < m) continue;\n\n int flow_l = dn.maxflow(T, T2);\n if (flow_l < l * n) continue;\n\n if (h - l <= high - low) {\n high = h;\n low = l;\n break;\n }\n }\n }\n ans.push_back({ low, high });\n }\n for (auto elem : ans) cout << elem.first << \" \" << elem.second << endl;\n\treturn 0;\n}\n\n\n//\n//struct edge {\n// int to, cap, rev;\n//};\n//\n//int main()\n//{\n// vi<pair<int, int>> ans;\n// int n, m;\n// while (cin >> n >> m, n) {\n// vii<edge> to(n);\n// vi<int> deg(n);\n// rep(i, m) {\n// int u, v;\n// cin >> u >> v;\n// u--, v--;\n// int su = (int)to[u].size();\n// int sv = (int)to[v].size();\n// to[u].push_back({ v, 0, sv });\n// to[v].push_back({ u, 1, su });\n// deg[u]++;\n// }\n//\n// map<int, set<int>> mp;\n// rep(i, n) mp[deg[i]].insert(i);\n//\n// vi<bool> visited(n);\n// auto dfs = [&](auto dfs, int s, int v, int mn = 0)->bool {\n// visited[v] = true;\n// if ((!mn && deg[s] + 2 <= deg[v]) \n// || (mn && deg[v] + 2 <= deg[s])) {\n// mp[deg[v]].erase(v);\n// mp[deg[s]].erase(s);\n// if ((int)mp[deg[v]].size() == 0) mp.erase(deg[v]);\n// if ((int)mp[deg[s]].size() == 0) mp.erase(deg[s]);\n//\n// if (!mn) {\n// deg[v]--;\n// deg[s]++;\n// }\n// else {\n// deg[v]++;\n// deg[s]--;\n// }\n//\n// mp[deg[v]].insert(v);\n// mp[deg[s]].insert(s);\n// return true;\n// }\n// for (auto& elem : to[v]) {\n// if (elem.cap == mn || visited[elem.to]) continue;\n// if (dfs(dfs, s, elem.to, mn)) {\n// elem.cap = mn;\n// to[elem.to][elem.rev].cap = 1 - mn;\n// return true;\n// }\n// }\n// return false;\n// };\n//\n// bool ok = true;\n// while (ok) {\n// ok = false;\n// for (int v : mp.begin()->second) {\n// visited.assign(n, false);\n// ok = dfs(dfs, v, v);\n// if (ok) break;\n// }\n//\n// if (ok) continue;\n//\n// for (int v : mp.rbegin()->second) {\n// visited.assign(n, false);\n// ok = dfs(dfs, v, v, 1);\n// if (ok) break;\n// }\n// }\n// ans.push_back({ mp.begin()->first, mp.rbegin()->first });\n// }\n//\n// for (auto elem : ans) cout << elem.first << \" \" << elem.second << endl;\n// return 0;\n//}","accuracy":1,"time_ms":1260,"memory_kb":4108,"score_of_the_acc":-0.5569,"final_rank":6},{"submission_id":"aoj_1615_9340285","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <set>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for(int i = 0; i < (n); i++)\n\ntemplate<class T>\nusing vi = vector<T>;\n\ntemplate<class T>\nusing vii = vector<vi<T>>;\n\ntemplate<class T>\nusing viii = vector<vii<T>>;\n\nstruct Dinic {\nprivate:\n const long long inf = 1e18;\n vector<int> dist; //sからの距離\n vector<int> iter; //どこまで調べたか\npublic:\n struct edge {\n int to, rev; long long cap;\n edge(int t = 0, int r = 0, long long c = 0LL) : to(t), rev(r), cap(c) {}\n };\n\n int n;\n vector<vector<edge>> to;\n\n Dinic(int n_ = 1) : n(n_), to(n_), dist(n_), iter(n_) {}\n\n void addedge(int u, int v, long long cap) {//u->vにcapの容量\n int su = (int)to[u].size(), sv = (int)to[v].size();\n to[u].push_back({ v, sv, cap });\n to[v].push_back({ u, su, 0 });\n }\n\n long long dfs(int v, int t, long long f) { //t: 終点, f: flow\n if (v == t) return f;\n int sv = (int)to[v].size();\n for (int& i = iter[v]; i < sv; i++) {\n edge& nv = to[v][i];\n if (dist[nv.to] <= dist[v] || nv.cap == 0) continue; //here\n long long nf = dfs(nv.to, t, min(f, nv.cap));\n if (nf > 0) {\n nv.cap -= nf;\n to[nv.to][nv.rev].cap += nf;\n return nf;\n }\n }\n return 0;\n }\n\n void bfs(int s) {\n dist.assign(n, -1);\n queue<int> q;\n q.push(s);\n dist[s] = 0;\n while (!q.empty()) {\n int v = q.front();\n q.pop();\n for (auto nv : to[v]) {\n if (nv.cap > 0 && dist[nv.to] < 0) {\n dist[nv.to] = dist[v] + 1;\n q.push(nv.to);\n }\n }\n }\n }\n\n long long maxflow(int s, int t) {//s:始点, t:終点\n long long res = 0, flow = 0;\n while (true) {\n bfs(s);\n if (dist[t] < 0) break;\n\n iter.assign(n, 0);\n while (flow = dfs(s, t, inf)) res += flow;\n };\n return res;\n }\n};\n\nint main() \n{\n vi<pair<int, int>> ans;\n int n, m;\n while (cin >> n >> m, n) {\n vi<int> u(m), v(m);\n rep(i, m) cin >> u[i] >> v[i];\n rep(i, m) u[i]--;\n rep(i, m) v[i]--;\n\n int high = m, low = 0;\n int S = n + m, T = S + 1, T2 = S + 2;\n\n auto f = [&](int h, int l) {\n Dinic dn(n + m + 3);\n rep(i, m) dn.addedge(S, i, 1);\n rep(i, m) {\n dn.addedge(i, m + u[i], 1);\n dn.addedge(i, m + v[i], 1);\n }\n rep(i, n) {\n dn.addedge(m + i, T, h);\n //dn.addedge(T, m + i, l);\n dn.addedge(m + i, T2, l);\n }\n return dn;\n };\n\n rep(l, n + 1) {\n for(int h = l; h <= min(n, l + high - low); h++) {\n Dinic dn = f(h, l);\n \n int flow = dn.maxflow(S, T);\n if (flow < m) continue;\n\n int flow_l = dn.maxflow(T, T2);\n if (flow_l < l * n) continue;\n\n if (h - l <= high - low) {\n high = h;\n low = l;\n break;\n }\n }\n }\n ans.push_back({ low, high });\n }\n for (auto elem : ans) cout << elem.first << \" \" << elem.second << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":1790,"memory_kb":4096,"score_of_the_acc":-0.6499,"final_rank":10},{"submission_id":"aoj_1615_9309817","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <map>\n#include <queue>\n#include <set>\nusing namespace std;\ntypedef long long ll;\n#define rep(i, n) for(int i = 0; i < (n); i++)\n\ntemplate<class T>\nusing vi = vector<T>;\n\ntemplate<class T>\nusing vii = vector<vi<T>>;\n\ntemplate<class T>\nusing viii = vector<vii<T>>;\n\nstruct edge {\n int to, cap, rev;\n};\n\nint main()\n{\n vi<pair<int, int>> ans;\n int n, m;\n while (cin >> n >> m, n) {\n vii<edge> to(n);\n vi<int> deg(n);\n rep(i, m) {\n int u, v;\n cin >> u >> v;\n u--, v--;\n int su = (int)to[u].size();\n int sv = (int)to[v].size();\n to[u].push_back({ v, 0, sv });\n to[v].push_back({ u, 1, su });\n deg[u]++;\n }\n\n map<int, set<int>> mp;\n rep(i, n) mp[deg[i]].insert(i);\n\n vi<bool> visited(n);\n auto dfs = [&](auto dfs, int s, int v, int mn = 0)->bool {\n visited[v] = true;\n if ((!mn && deg[s] + 2 <= deg[v]) \n || (mn && deg[v] + 2 <= deg[s])) {\n mp[deg[v]].erase(v);\n mp[deg[s]].erase(s);\n if ((int)mp[deg[v]].size() == 0) mp.erase(deg[v]);\n if ((int)mp[deg[s]].size() == 0) mp.erase(deg[s]);\n\n if (!mn) {\n deg[v]--;\n deg[s]++;\n }\n else {\n deg[v]++;\n deg[s]--;\n }\n\n mp[deg[v]].insert(v);\n mp[deg[s]].insert(s);\n return true;\n }\n for (auto& elem : to[v]) {\n if (elem.cap == mn || visited[elem.to]) continue;\n if (dfs(dfs, s, elem.to, mn)) {\n elem.cap = mn;\n to[elem.to][elem.rev].cap = 1 - mn;\n return true;\n }\n }\n return false;\n };\n\n bool ok = true;\n while (ok) {\n ok = false;\n for (int v : mp.begin()->second) {\n visited.assign(n, false);\n ok = dfs(dfs, v, v);\n if (ok) break;\n }\n\n if (ok) continue;\n\n for (int v : mp.rbegin()->second) {\n visited.assign(n, false);\n ok = dfs(dfs, v, v, 1);\n if (ok) break;\n }\n }\n ans.push_back({ mp.begin()->first, mp.rbegin()->first });\n }\n\n for (auto elem : ans) cout << elem.first << \" \" << elem.second << endl;\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3580,"score_of_the_acc":-0.0566,"final_rank":2}],"string":"[\n {\n \"submission_id\": \"aoj_1615_10945981\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define FOR(i,k,n) for(int i = (int)(k); i < (int)(n); i++)\\n#define REP(i,n) FOR(i,0,n)\\n#define ALL(a) a.begin(), a.end()\\n#define MS(m,v) memset(m,v,sizeof(m))\\ntypedef long long ll;\\ntypedef long double ld;\\ntypedef vector<int> vi;\\ntypedef vector<string> vs;\\ntypedef pair<int, int> pii;\\nconst int MOD = 1e9 + 7;\\ntemplate<class T> T &chmin(T &a, const T &b) { return a = min(a, b); }\\ntemplate<class T> T &chmax(T &a, const T &b) { return a = max(a, b); }\\ntemplate<class T>\\nistream& operator >> (istream& is, vector<T>& v)\\n{\\n\\tfor (auto &i : v) is >> i;\\n\\treturn is;\\n}\\ntemplate<class T>\\nostream& operator<<(ostream& os, vector<T>& v)\\n{\\n\\tconst string delimiter = \\\"\\\\n\\\";\\n\\tREP(i, v.size())\\n\\t{\\n\\t\\tos << v[i];\\n\\t\\tif (i != v.size() - 1) os << delimiter;\\n\\t}\\n\\treturn os;\\n}\\n/*--------------------template--------------------*/\\n\\nconst int INF = 1e6;\\n\\ntypedef int Weight;\\ntypedef int Flow;\\nstruct Edge {\\n\\tint src, dest, rev;\\n\\tFlow cap;\\n\\tWeight cost;\\n\\tbool operator < (const Edge &rhs) const\\n\\t{\\n\\t\\treturn cost > rhs.cost;\\n\\t}\\n\\tEdge(int s, int d) : src(s), dest(d) { ; }\\n\\tEdge(int s, int d, int c) : src(s), dest(d), cost(c) { ; }\\n\\tEdge(int s, int d, int r, Flow cp, Weight cst) : src(s), dest(d), rev(r), cap(cp), cost(cst) { ; }\\n};\\ntypedef vector<Edge> Edges;\\ntypedef vector<Edges> Graph;\\ntypedef vector<Weight> Array;\\ntypedef vector<Array> Matrix;\\nvoid add_edge(Graph &g, int src, int dest, Flow cap)\\n{\\n\\tg[src].push_back(Edge{ src, dest, (int)g[dest].size(), cap, 0 });\\n\\tg[dest].push_back(Edge{ dest, src, (int)g[src].size() - 1, 0, 0 });\\n}\\n\\nvoid add_edge(Graph &g, int from, int to, Flow cap, Weight cost)\\n{\\n\\tg[from].push_back(Edge(from, to, (int)g[to].size(), cap, cost));\\n\\tg[to].push_back(Edge(to, from, (int)g[from].size() - 1, 0, -cost));\\n}\\n\\nFlow dfs(Graph &g, vector<bool> &used, int v, int t, Flow f)\\n{\\n\\tif (v == t) return f;\\n\\tused[v] = true;\\n\\tfor (Edge& e : g[v])\\n\\t{\\n\\t\\tif (!used[e.dest] && e.cap > 0)\\n\\t\\t{\\n\\t\\t\\tFlow d = dfs(g, used, e.dest, t, min(f, e.cap));\\n\\t\\t\\tif (d > 0)\\n\\t\\t\\t{\\n\\t\\t\\t\\te.cap -= d;\\n\\t\\t\\t\\tg[e.dest][e.rev].cap += d;\\n\\t\\t\\t\\treturn d;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\\n\\nFlow ford_fulkerson(Graph &g, int s, int t)\\n{\\n\\tFlow flow = 0;\\n\\tfor (;;)\\n\\t{\\n\\t\\tvector<bool> used(g.size(), false);\\n\\t\\tFlow f = dfs(g, used, s, t, INF);\\n\\t\\tif (f == 0) return flow;\\n\\t\\tflow += f;\\n\\t}\\n}\\n\\n\\nint main()\\n{\\n\\tcin.sync_with_stdio(false); cout << fixed << setprecision(10);\\n\\tint n, m;\\n\\twhile (cin >> n >> m, n)\\n\\t{\\n\\t\\tGraph g(n + m + 2);\\n\\t\\tint src = n + m, sink = n + m + 1;\\n\\t\\tREP(i, m) add_edge(g, src, i, 1);\\n\\t\\tREP(i, m)\\n\\t\\t{\\n\\t\\t\\tint a, b; cin >> a >> b;\\n\\t\\t\\ta--; b--;\\n\\t\\t\\tadd_edge(g, i, m + a, 1);\\n\\t\\t\\tadd_edge(g, i, m + b, 1);\\n\\t\\t}\\n\\t\\tint tmpcap = -1;\\n\\t\\tint mn = -1, mx = -1;\\n\\t\\twhile(1)\\n\\t\\t{\\n\\t\\t\\ttmpcap++;\\n\\t\\t\\tGraph h = g;\\n\\t\\t\\tREP(i, n) add_edge(h, m + i, sink, tmpcap);\\n\\t\\t\\tint f = ford_fulkerson(h, src, sink);\\n\\t\\t\\tif (tmpcap * n == f)\\n\\t\\t\\t{\\n\\t\\t\\t\\tmn = tmpcap;\\n\\t\\t\\t}\\n\\t\\t\\tif (m == f)\\n\\t\\t\\t{\\n\\t\\t\\t\\tmx = tmpcap;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout << mn << \\\" \\\" << mx << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 650,\n \"memory_kb\": 4832,\n \"score_of_the_acc\": -0.8085,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1615_10684468\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n// 数値型\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing ld = long double;\\nusing P = pair<int,int>;\\nusing Pll = pair<ll, ll>;\\nusing Pli = pair<ll, int>;\\nusing Pil = pair<int, ll>;\\n\\n// vector関連\\nusing vi = vector<int>;\\nusing vvi = vector<vi>;\\nusing vvvi = vector<vvi>;\\nusing vll = vector<ll>;\\nusing vvll = vector<vll>;\\nusing vvvll = vector<vvll>;\\ntemplate<typename T>\\nusing vc = vector<T>;\\ntemplate<typename T>\\nusing vvc = vector<vc<T>>;\\ntemplate<typename T>\\nusing vvvc = vector<vvc<T>>;\\ntemplate<typename T>\\nusing vvvvc = vector<vvvc<T>>;\\n\\n// priority_queue\\ntemplate<typename T>\\nusing pq = priority_queue<T>;\\ntemplate<typename T>\\nusing pqg = priority_queue<T, vc<T>, greater<T>>;\\n\\n#define rep(i, n) for(int i = 0; i < (int)(n); i++)\\n#define FOR(i, a, b) for(int i = a; i < (int)(b); i++)\\n#define all(a) (a).begin(),(a).end()\\n#define rall(a) (a).rbegin(),(a).rend()\\n#define MIN(vec) *min_element(vec)\\n#define MAX(vec) *max_element(vec)\\n#define next_perm(vec) (vec).begin(), (vec).end()\\n#define UNIQUE(vec) vec.erase(unique(vec.begin(), vec.end()), vec.end())\\n#define el \\\"\\\\n\\\"\\n#define Yes cout << \\\"Yes\\\" << el\\n#define No cout << \\\"No\\\" << el\\n#define YES cout << \\\"YES\\\" << el\\n#define NO cout << \\\"NO\\\" << el\\n#define EPS 1e-8\\n#define Equal(a, b) (fabs((a)-(b)) < EPS) \\n#define dbg(x) cerr << #x << \\\"=\\\" << x << el \\n\\n// 定数\\nconst string abc = \\\"abcdefghijklmnopqrstuvwxyz\\\";\\nconst string ABC = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\nconstexpr int INF = 1001001001;\\nconstexpr ll LINF = 1001001001001001001ll;\\nconstexpr int DX[] = {1, 0, -1, 0};\\nconstexpr int DY[] = {0, 1, 0, -1};\\nconstexpr int DX8[] = {1, 0, -1, 0, 1, 1, -1, -1};\\nconstexpr int DY8[] = {0, 1, 0, -1, 1, -1, 1, -1};\\n\\ntemplate<typename T1, typename T2>\\nostream &operator<< (ostream &os, pair<T1, T2> p) {\\n os << \\\"{\\\" << p.first << \\\",\\\" << p.second << \\\"}\\\";\\n return os;\\n}\\ntemplate<typename T>\\nostream &operator<< (ostream &os, vc<T> &vec) {\\n int sz = vec.size();\\n rep(i, sz){\\n os << vec[i] << (i==sz-1?\\\"\\\":\\\" \\\");\\n }\\n return os;\\n}\\n\\ntemplate<typename T1, typename T2>\\nistream &operator>> (istream &is, pair<T1, T2> &p) {\\n is >> p.first >> p.second;\\n return is;\\n}\\ntemplate<typename T>\\nistream &operator>> (istream &is, vc<T> &vec) {\\n int sz = vec.size();\\n rep(i, sz) { is >> vec[i]; }\\n return is;\\n}\\n/// @brief aとｂの最大値をaに格納。更新があったかbool値を返す\\n/// @tparam T1 \\n/// @tparam T2 \\n/// @param a \\n/// @param b \\n/// @return bool\\ntemplate<typename T1, typename T2>\\ninline bool chmax(T1 &a, T2 b){\\n bool ret = a<b;\\n if(ret) a = b;\\n return ret;\\n}\\n\\n/// @brief aとｂの最小値をaに格納。更新があったかbool値を返す\\n/// @tparam T1 \\n/// @tparam T2 \\n/// @param a \\n/// @param b \\n/// @return bool\\ntemplate<typename T1, typename T2>\\ninline bool chmin(T1 &a, T2 b){\\n bool ret = a>b;\\n if(ret) {a = b;}\\n return ret;\\n}\\n\\ninline void YesNo(bool flag){\\n if(flag) {Yes;}\\n else {No;}\\n return;\\n}\\n\\ninline void YESNO(bool flag){\\n if(flag) {YES;}\\n else {NO;}\\n return;\\n}\\n\\ninline bool outof(ll x, ll xlim){\\n return (x<0 || x>=xlim);\\n}\\n\\ntemplate<typename T>\\ninline T sqnorm(T x, T y){\\n return x*x+y*y;\\n}\\n\\n/// @brief char->int\\n/// @param c \\n/// @return int\\ninline int ctoi(char c){\\n return c-'0';\\n}\\n\\n/// @brief xを素因数分解\\n/// @param x \\n/// @return vector<Pli>, 素因数の昇順に {p, cnt}\\nvector<Pli> prime_fact(ll x){\\n vector<Pli> ret;\\n for(ll i=2; i*i<=x; i++){\\n if(x%i == 0){\\n ret.emplace_back(i, 0);\\n while(x%i == 0){\\n ret.back().second++;\\n x /= i;\\n }\\n }\\n }\\n if(x != 1) ret.emplace_back(x, 1);\\n return ret;\\n}\\n\\n/// @brief xの約数列挙\\n/// @param x \\n/// @return vll, 約数の昇順\\nvll divisor_enum(ll x){\\n vector<ll> ret;\\n for(ll i=1; i*i<=x; i++){\\n if(x%i == 0){\\n ret.push_back(x/i);\\n ret.push_back(i);\\n }\\n }\\n sort(all(ret));\\n UNIQUE(ret);\\n return ret;\\n}\\n\\n/// @brief 繰り返し二乗法。\\n/// @tparam T \\n/// @param x \\n/// @param k \\n/// @param op \\n/// @param e \\n/// @return \\ntemplate<typename T>\\nT pow_t(T x, ll k, T (*op)(T, T), T (*e)()){\\n T ret = e();\\n while(k){\\n if(k&1) ret *= x;\\n x *= x;\\n k >>= 1;\\n }\\n return ret;\\n}\\n\\nll powll(ll x, ll k){\\n return pow_t<ll>(x, k, [](ll a, ll b) -> ll{return a*b;}, []() -> ll{return 1;});\\n}\\n\\ninline int pop_cnt(ll x) { return __builtin_popcountll(x); }\\ninline int top_bit(ll x) { return (x==0?-1:63-__builtin_clzll(x));}\\n\\ntemplate< typename flow_t >\\nstruct Dinic {\\n const flow_t INF;\\n\\n struct edge {\\n int to;\\n flow_t cap;\\n int rev;\\n bool isrev;\\n int idx;\\n };\\n\\n vector< vector< edge > > graph;\\n vector< int > min_cost, iter;\\n\\n Dinic(int V) : INF(numeric_limits< flow_t >::max()), graph(V) {}\\n\\n void add_edge(int from, int to, flow_t cap, int idx = -1) {\\n graph[from].emplace_back((edge) {to, cap, (int) graph[to].size(), false, idx});\\n graph[to].emplace_back((edge) {from, 0, (int) graph[from].size() - 1, true, idx});\\n }\\n\\n bool bfs(int s, int t) {\\n min_cost.assign(graph.size(), -1);\\n queue< int > que;\\n min_cost[s] = 0;\\n que.push(s);\\n while(!que.empty() && min_cost[t] == -1) {\\n int p = que.front();\\n que.pop();\\n for(auto &e : graph[p]) {\\n if(e.cap > 0 && min_cost[e.to] == -1) {\\n min_cost[e.to] = min_cost[p] + 1;\\n que.push(e.to);\\n }\\n }\\n }\\n return min_cost[t] != -1;\\n }\\n\\n flow_t dfs(int idx, const int t, flow_t flow) {\\n if(idx == t) return flow;\\n for(int &i = iter[idx]; i < graph[idx].size(); i++) {\\n edge &e = graph[idx][i];\\n if(e.cap > 0 && min_cost[idx] < min_cost[e.to]) {\\n flow_t d = dfs(e.to, t, min(flow, e.cap));\\n if(d > 0) {\\n e.cap -= d;\\n graph[e.to][e.rev].cap += d;\\n return d;\\n }\\n }\\n }\\n return 0;\\n }\\n\\n flow_t max_flow(int s, int t) {\\n flow_t flow = 0;\\n while(bfs(s, t)) {\\n iter.assign(graph.size(), 0);\\n flow_t f = 0;\\n while((f = dfs(s, t, INF)) > 0) flow += f;\\n }\\n return flow;\\n }\\n\\n void output() {\\n for(int i = 0; i < graph.size(); i++) {\\n for(auto &e : graph[i]) {\\n if(e.isrev) continue;\\n auto &rev_e = graph[e.to][e.rev];\\n cout << i << \\\"->\\\" << e.to << \\\" (flow: \\\" << rev_e.cap << \\\"/\\\" << e.cap + rev_e.cap << \\\")\\\" << endl;\\n }\\n }\\n }\\n};\\n\\n\\ntemplate< typename flow_t, template< typename > class F >\\nstruct MaxFlowLowerBound {\\n F< flow_t > flow;\\n vector< flow_t > in, up;\\n typename F< flow_t >::edge *latte, *malta;\\n int X, Y, V;\\n flow_t sum;\\n\\n MaxFlowLowerBound(int V) : V(V), flow(V + 2), X(V), Y(V + 1), sum(0), in(V) {}\\n\\n void add_edge(int from, int to, flow_t low, flow_t high) {\\n assert(from != to);\\n flow.add_edge(from, to, high - low, up.size());\\n in[from] -= low;\\n in[to] += low;\\n up.emplace_back(high);\\n }\\n\\n void build() {\\n for(int i = 0; i < V; i++) {\\n if(in[i] > 0) {\\n flow.add_edge(X, i, in[i]);\\n sum += in[i];\\n } else if(in[i] < 0) {\\n flow.add_edge(i, Y, -in[i]);\\n }\\n }\\n }\\n\\n bool can_flow(int s, int t) {\\n assert(s != t);\\n flow.add_edge(t, s, flow.INF);\\n latte = &flow.graph[t].back();\\n malta = &flow.graph[s].back();\\n return can_flow();\\n }\\n\\n bool can_flow() {\\n build();\\n auto ret = flow.max_flow(X, Y);\\n return ret >= sum;\\n }\\n\\n flow_t max_flow(int s, int t) {\\n if(can_flow(s, t)) {\\n return flow.max_flow(s, t);\\n } else {\\n return -1;\\n }\\n }\\n\\n flow_t min_flow(int s, int t) {\\n if(can_flow(s, t)) {\\n auto ret = flow.INF - latte->cap;\\n latte->cap = malta->cap = 0;\\n return ret - flow.max_flow(t, s);\\n } else {\\n return -1;\\n }\\n }\\n\\n void output(int M) {\\n vector< flow_t > ans(M);\\n for(int i = 0; i < flow.graph.size(); i++) {\\n for(auto &e : flow.graph[i]) {\\n if(!e.isrev && ~e.idx) ans[e.idx] = up[e.idx] - e.cap;\\n }\\n }\\n for(auto &p : ans) cout << p << endl;\\n }\\n};\\n\\n\\n\\n\\nvoid main2();\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n main2();\\n}\\n\\nbool solve(){\\n int n, m;\\n cin >> n >> m;\\n if(n == 0) return false;\\n vc<P> es(m);\\n rep(i, m){\\n int u, v;\\n cin >> u >> v;\\n u--;v--;\\n es[i] = {u, v};\\n }\\n int ma = 0;\\n P ans = {INF, 2*INF};\\n rep(mi, n+1){\\n bool ng = false;\\n chmax(ma, mi);\\n while(true){\\n vi vvv(1, 2+n+m);\\n MaxFlowLowerBound<int, Dinic> mf(n+m+2);\\n rep(i, m){\\n auto [u, v] = es[i];\\n mf.add_edge(n+m, i, 1, 1);\\n mf.add_edge(i, m+u, 0, 1);\\n mf.add_edge(i, m+v, 0, 1);\\n }\\n rep(i, n){\\n mf.add_edge(m+i, n+m+1, mi, ma);\\n }\\n auto flow = mf.max_flow(n+m, n+m+1);\\n if(flow >= m) break;\\n if(ma == n){\\n ng = true;\\n break;\\n }\\n ma++;\\n }\\n if(ng) break;\\n if(ans.second - ans.first > ma - mi){\\n ans.first = mi;\\n ans.second = ma;\\n }\\n }\\n cout << ans.first << \\\" \\\" << ans.second << el;\\n \\n \\n return true;\\n}\\n\\nvoid main2(){\\n while(solve()){\\n ;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 220,\n \"memory_kb\": 4608,\n \"score_of_the_acc\": -0.615,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1615_10682955\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing uint = unsigned int;\\n#define rep(i, n) for (int i = 0; i < n; i++)\\n#define all(v) v.begin(), v.end()\\ntemplate <class T, class U>\\ninline bool chmax(T &a, U b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <class T, class U>\\ninline bool chmin(T &a, U b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <class T>\\ninline void compress(vector<T> &a) {\\n sort(a.begin(), a.end());\\n a.erase(unique(a.begin(), a.end()), a.end());\\n}\\ntemplate <class T>\\nT rand(T l, T r) {\\n static mt19937 mt(random_device{}());\\n // [l, r)\\n if constexpr (is_integral_v<T>) {\\n return uniform_int_distribution<T>(l, r - 1)(mt);\\n } else if constexpr (is_floating_point_v<T>) {\\n return uniform_real_distribution<T>(l, r)(mt);\\n }\\n}\\nconstexpr int INF = 1001001001;\\nconstexpr ll llINF = 3000000000000000010;\\nstruct HLD {\\n vector<vector<int>> g;\\n vector<int> sz, in, out, par, head, dep, ord;\\n HLD(vector<vector<int>> &g_, int root = 0)\\n : g(g_), sz((int)g_.size()), in((int)g_.size()), out((int)g_.size()), par((int)g_.size()), head((int)g_.size(), root), dep((int)g_.size()) {\\n dfs_sz(root, -1);\\n dfs_hld(root, -1);\\n }\\n void dfs_sz(int v, int p) {\\n par[v] = p;\\n sz[v] = 1;\\n if (g[v].size() && g[v][0] == p) swap(g[v][0], g[v].back());\\n for (auto &i : g[v]) {\\n if (i != p) {\\n dep[i] = dep[v] + 1;\\n dfs_sz(i, v);\\n sz[v] += sz[i];\\n if (sz[g[v][0]] < sz[i]) swap(g[v][0], i);\\n }\\n }\\n }\\n void dfs_hld(int v, int p) {\\n in[v] = ord.size();\\n ord.push_back(v);\\n for (auto i : g[v]) {\\n if (i != p) {\\n if (i == g[v][0]) {\\n // Heavy\\n head[i] = head[v];\\n } else {\\n // Light\\n head[i] = i;\\n }\\n dfs_hld(i, v);\\n }\\n }\\n out[v] = ord.size();\\n }\\n int lca(int u, int v) {\\n while (1) {\\n if (in[u] > in[v]) swap(u, v);\\n if (head[u] == head[v]) return u;\\n v = par[head[v]];\\n }\\n }\\n int dist(int u, int v) { return dep[u] + dep[v] - 2 * dep[lca(u, v)]; }\\n int la(int v, int d) {\\n while (v != -1) {\\n int u = head[v];\\n if (in[v] - d >= in[u]) return ord[in[v] - d];\\n d -= in[v] - in[u] + 1, v = par[u];\\n }\\n return -1;\\n }\\n int jump(int from, int to, int d) {\\n int l = lca(from, to);\\n if (d <= dep[from] - dep[l]) return la(from, d);\\n d -= dep[from] - dep[l];\\n if (d <= dep[to] - dep[l]) return la(to, dep[to] - dep[l] - d);\\n return -1;\\n }\\n};\\ntemplate <typename T, typename U>\\ninline istream &operator>>(istream &is, pair<T, U> &rhs) {\\n return is >> rhs.first >> rhs.second;\\n}\\ntemplate <typename T>\\ninline istream &operator>>(istream &is, vector<T> &v) {\\n for (auto &e : v) is >> e;\\n return is;\\n}\\ntemplate <typename T, typename U>\\ninline ostream &operator<<(ostream &os, const pair<T, U> &rhs) {\\n return os << rhs.first << \\\" \\\" << rhs.second;\\n}\\ntemplate <typename T>\\ninline ostream &operator<<(ostream &os, const vector<T> &v) {\\n for (auto itr = v.begin(), end_itr = v.end(); itr != end_itr;) {\\n os << *itr;\\n if (++itr != end_itr) os << \\\" \\\";\\n }\\n return os;\\n}\\n\\nstruct FunctionMo {\\n int n;\\n vector<pair<int, int>> xy;\\n\\n explicit FunctionMo(int n) : n(n) {}\\n\\n void add(int x, int y) { xy.emplace_back(x, y); }\\n\\n template <typename AX, typename SX, typename AY, typename SY, typename O>\\n void build(const AX &add_x, const SX &sub_x, const AY &add_y, const SY &sub_y, const O &out) {\\n int q = (int)xy.size();\\n int bs = max<int>(1, sqrt(n));\\n vector<int> ord(q);\\n iota(begin(ord), end(ord), 0);\\n sort(begin(ord), end(ord), [&](int a, int b) {\\n int ablock = xy[a].first / bs, bblock = xy[b].first / bs;\\n if (ablock != bblock) return ablock < bblock;\\n return (ablock & 1) ? xy[a].second > xy[b].second : xy[a].second < xy[b].second;\\n });\\n int x = 0, y = 0;\\n for (auto idx : ord) {\\n while (x > xy[idx].first) add_x(x++, y);\\n while (y < xy[idx].second) add_y(x, y++);\\n while (x < xy[idx].first) sub_x(x--, y);\\n while (y > xy[idx].second) sub_y(x, y--);\\n out(idx);\\n }\\n }\\n\\n template <typename A, typename E, typename O>\\n void build(const A &add, const E &erase, const O &out) {\\n build(add, add, erase, erase, out);\\n }\\n};\\nstruct UnionFind {\\n vector<int> par, siz;\\n UnionFind(int x) {\\n par.resize(x);\\n siz.resize(x);\\n for (int i = 0; i < x; i++) {\\n par[i] = i;\\n siz[i] = 1;\\n }\\n }\\n int find(int x) {\\n if (par[x] == x) return x;\\n return par[x] = find(par[x]);\\n }\\n bool unite(int x, int y) {\\n x = find(x), y = find(y);\\n if (x == y) return false;\\n if (siz[x] < siz[y]) swap(x, y);\\n par[y] = x;\\n siz[x] += siz[y];\\n\\n return true;\\n }\\n bool same(int x, int y) { return find(x) == find(y); }\\n int size(int x) { return siz[find(x)]; }\\n};\\ntemplate <class T>\\nstruct BIT {\\n // 1-indexed\\n int n, beki = 1;\\n vector<T> bit;\\n BIT(int x) {\\n bit.resize(x + 1, 0);\\n n = x;\\n while (beki * 2 <= n) beki *= 2;\\n }\\n T sum(int i) {\\n T res = 0;\\n while (i > 0) {\\n res += bit[i];\\n i -= i & -i;\\n }\\n return res;\\n }\\n T sum(int l, int r) {\\n //[l,r]\\n return sum(r) - (l == 0 ? 0 : sum(l - 1));\\n }\\n void add(int i, T x) {\\n while (i <= n) {\\n bit[i] += x;\\n i += i & -i;\\n }\\n }\\n int lowerbound(T w) {\\n if (w <= 0) return 0;\\n int x = 0;\\n for (int k = beki; k > 0; k >>= 1) {\\n if (x + k <= n && bit[x + k] < w) {\\n w -= bit[x + k];\\n x += k;\\n }\\n }\\n return x + 1;\\n }\\n};\\ntemplate <typename T, typename Compare = less<T>>\\nvector<pair<int, T>> monotone_minima(int H, int W, const function<T(int, int)> &f, const Compare &comp = Compare()) {\\n vector<pair<int, T>> dp(H);\\n function<void(int, int, int, int)> dfs = [&](int top, int bottom, int left, int right) {\\n if (top > bottom) return;\\n int line = (top + bottom) / 2;\\n T ma;\\n int mi = -1;\\n for (int i = left; i <= right; i++) {\\n T cst = f(line, i);\\n if (mi == -1 || comp(cst, ma)) {\\n ma = cst;\\n mi = i;\\n }\\n }\\n dp[line] = make_pair(mi, ma);\\n dfs(top, line - 1, left, mi);\\n dfs(line + 1, bottom, mi, right);\\n };\\n dfs(0, H - 1, 0, W - 1);\\n return dp;\\n}\\n#include <algorithm>\\n\\n#include <vector>\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\ntemplate <class T> struct simple_queue {\\n std::vector<T> payload;\\n int pos = 0;\\n void reserve(int n) { payload.reserve(n); }\\n int size() const { return int(payload.size()) - pos; }\\n bool empty() const { return pos == int(payload.size()); }\\n void push(const T& t) { payload.push_back(t); }\\n T& front() { return payload[pos]; }\\n void clear() {\\n payload.clear();\\n pos = 0;\\n }\\n void pop() { pos++; }\\n};\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n#include <cassert>\\n#include <limits>\\n#include <queue>\\n#include <vector>\\n\\nnamespace atcoder {\\n\\ntemplate <class Cap> struct mf_graph {\\n public:\\n mf_graph() : _n(0) {}\\n mf_graph(int n) : _n(n), g(n) {}\\n\\n int add_edge(int from, int to, Cap cap) {\\n assert(0 <= from && from < _n);\\n assert(0 <= to && to < _n);\\n assert(0 <= cap);\\n int m = int(pos.size());\\n pos.push_back({from, int(g[from].size())});\\n int from_id = int(g[from].size());\\n int to_id = int(g[to].size());\\n if (from == to) to_id++;\\n g[from].push_back(_edge{to, to_id, cap});\\n g[to].push_back(_edge{from, from_id, 0});\\n return m;\\n }\\n\\n struct edge {\\n int from, to;\\n Cap cap, flow;\\n };\\n\\n edge get_edge(int i) {\\n int m = int(pos.size());\\n assert(0 <= i && i < m);\\n auto _e = g[pos[i].first][pos[i].second];\\n auto _re = g[_e.to][_e.rev];\\n return edge{pos[i].first, _e.to, _e.cap + _re.cap, _re.cap};\\n }\\n std::vector<edge> edges() {\\n int m = int(pos.size());\\n std::vector<edge> result;\\n for (int i = 0; i < m; i++) {\\n result.push_back(get_edge(i));\\n }\\n return result;\\n }\\n void change_edge(int i, Cap new_cap, Cap new_flow) {\\n int m = int(pos.size());\\n assert(0 <= i && i < m);\\n assert(0 <= new_flow && new_flow <= new_cap);\\n auto& _e = g[pos[i].first][pos[i].second];\\n auto& _re = g[_e.to][_e.rev];\\n _e.cap = new_cap - new_flow;\\n _re.cap = new_flow;\\n }\\n\\n Cap flow(int s, int t) {\\n return flow(s, t, std::numeric_limits<Cap>::max());\\n }\\n Cap flow(int s, int t, Cap flow_limit) {\\n assert(0 <= s && s < _n);\\n assert(0 <= t && t < _n);\\n assert(s != t);\\n\\n std::vector<int> level(_n), iter(_n);\\n internal::simple_queue<int> que;\\n\\n auto bfs = [&]() {\\n std::fill(level.begin(), level.end(), -1);\\n level[s] = 0;\\n que.clear();\\n que.push(s);\\n while (!que.empty()) {\\n int v = que.front();\\n que.pop();\\n for (auto e : g[v]) {\\n if (e.cap == 0 || level[e.to] >= 0) continue;\\n level[e.to] = level[v] + 1;\\n if (e.to == t) return;\\n que.push(e.to);\\n }\\n }\\n };\\n auto dfs = [&](auto self, int v, Cap up) {\\n if (v == s) return up;\\n Cap res = 0;\\n int level_v = level[v];\\n for (int& i = iter[v]; i < int(g[v].size()); i++) {\\n _edge& e = g[v][i];\\n if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0) continue;\\n Cap d =\\n self(self, e.to, std::min(up - res, g[e.to][e.rev].cap));\\n if (d <= 0) continue;\\n g[v][i].cap += d;\\n g[e.to][e.rev].cap -= d;\\n res += d;\\n if (res == up) break;\\n }\\n return res;\\n };\\n\\n Cap flow = 0;\\n while (flow < flow_limit) {\\n bfs();\\n if (level[t] == -1) break;\\n std::fill(iter.begin(), iter.end(), 0);\\n while (flow < flow_limit) {\\n Cap f = dfs(dfs, t, flow_limit - flow);\\n if (!f) break;\\n flow += f;\\n }\\n }\\n return flow;\\n }\\n\\n std::vector<bool> min_cut(int s) {\\n std::vector<bool> visited(_n);\\n internal::simple_queue<int> que;\\n que.push(s);\\n while (!que.empty()) {\\n int p = que.front();\\n que.pop();\\n visited[p] = true;\\n for (auto e : g[p]) {\\n if (e.cap && !visited[e.to]) {\\n visited[e.to] = true;\\n que.push(e.to);\\n }\\n }\\n }\\n return visited;\\n }\\n\\n private:\\n int _n;\\n struct _edge {\\n int to, rev;\\n Cap cap;\\n };\\n std::vector<std::pair<int, int>> pos;\\n std::vector<std::vector<_edge>> g;\\n};\\n\\n} // namespace atcoder\\n\\nvoid solve() {\\n int n, m;\\n cin >> n >> m;\\n if (n == 0) exit(0);\\n vector<int> u(m), v(m);\\n rep(i, m) {\\n cin >> u[i] >> v[i];\\n u[i]--, v[i]--;\\n }\\n atcoder::mf_graph<int> g_tmp(n + m + 4);\\n int S = n + m, T = S + 1, e1 = T + 1, e2 = e1 + 1;\\n rep(i, m) g_tmp.add_edge(S, n + i, 1);\\n rep(i, m) {\\n g_tmp.add_edge(n + i, u[i], 1);\\n g_tmp.add_edge(n + i, v[i], 1);\\n }\\n // g_tmp.add_edge(e1, S, INF);\\n // g_tmp.add_edge(T, e2, INF);\\n int d = INF, ansl = -1, ansu = -1;\\n for (int lb = m / n; lb >= 0; lb--) {\\n int ok = n+1 , ng = lb - 1;\\n while (ok - ng > 1) {\\n int ub = (ok + ng) / 2;\\n auto g = g_tmp;\\n int cp=m;\\n rep(i, n) {\\n // i->T,[lb,ub]\\n g.add_edge(i, T, lb);\\n g.add_edge(i, e2, ub-lb);\\n cp-=lb;\\n }\\n g.add_edge(e2,T,cp);\\n if (g.flow(S, T) == m)\\n ok = ub;\\n else\\n ng = ub;\\n }\\n if (ok == n + 1) continue;\\n // cout << lb << \\\" \\\" << ok << endl;\\n if (chmin(d, ok - lb)) {\\n ansl = lb;\\n ansu = ok;\\n }\\n }\\n cout << ansl << \\\" \\\" << ansu << endl;\\n}\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int t = 1;\\n // cin >> t;\\n while (t) solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 4760,\n \"score_of_the_acc\": -0.675,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1615_10673158\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define FAST_IO \\n\\n#define OVERRIDE(a,b,c,d,...) d\\n#define REP2(i,n) for (i32 i = 0; i < (i32)(n); ++i)\\n#define REP3(i,m,n) for (i32 i = (i32)(m); i < (i32)(n); ++i)\\n#define REP(...) OVERRIDE(__VA_ARGS__, REP3, REP2)(__VA_ARGS__)\\n#define PER2(i,n) for (i32 i = (i32)(n)-1; i >= 0; --i)\\n#define PER3(i,m,n) for (i32 i = (i32)(n)-1; i >= (i32)(m); --i)\\n#define PER(...) OVERRIDE(__VA_ARGS__, PER3, PER2)(__VA_ARGS__)\\n#define ALL(x) begin(x), end(x)\\n#define LEN(x) (i32)(x.size())\\nusing namespace std;\\nusing u32 = unsigned int;\\nusing u64 = unsigned long long;\\nusing i32 = signed int;\\nusing i64 = signed long long;\\nusing f64 = double;\\nusing f80 = long double;\\nusing pi = pair<i32, i32>;\\nusing pl = pair<i64, i64>;\\ntemplate <typename T>\\nusing V = vector<T>;\\ntemplate <typename T>\\nusing VV = V<V<T>>;\\ntemplate <typename T>\\nusing VVV = V<V<V<T>>>;\\ntemplate <typename T>\\nusing VVVV = V<V<V<V<T>>>>;\\ntemplate <typename T>\\nusing PQR = priority_queue<T, V<T>, greater<T>>;\\ntemplate <typename T>\\nbool chmin(T &x, const T &y) {\\n if (x > y) {\\n x = y;\\n return true;\\n }\\n return false;\\n}\\ntemplate <typename T>\\nbool chmax(T &x, const T &y) {\\n if (x < y) {\\n x = y;\\n return true;\\n }\\n return false;\\n}\\ntemplate <typename T>\\ni32 lob(const V<T> &arr, const T &v) {\\n return (i32)(lower_bound(ALL(arr), v) - arr.begin());\\n}\\ntemplate <typename T>\\ni32 upb(const V<T> &arr, const T &v) {\\n return (i32)(upper_bound(ALL(arr), v) - arr.begin());\\n}\\ntemplate <typename T>\\nV<i32> argsort(const V<T> &arr) {\\n V<i32> ret(arr.size());\\n iota(ALL(ret), 0);\\n sort(ALL(ret), [&](i32 i, i32 j) -> bool {\\n if (arr[i] == arr[j]) {\\n return i < j;\\n } else {\\n return arr[i] < arr[j];\\n }\\n });\\n return ret;\\n}\\n[[maybe_unused]] constexpr i32 INF = 1000000100;\\n[[maybe_unused]] constexpr i64 INF64 = 3000000000000000100;\\nstruct SetUpIO {\\n SetUpIO() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n }\\n} set_up_io;\\nvoid scan(char &x) { cin >> x; }\\nvoid scan(u32 &x) { cin >> x; }\\nvoid scan(u64 &x) { cin >> x; }\\nvoid scan(i32 &x) { cin >> x; }\\nvoid scan(i64 &x) { cin >> x; }\\nvoid scan(string &x) { cin >> x; }\\ntemplate <typename T>\\nvoid scan(V<T> &x) {\\n for (T &ele : x) {\\n scan(ele);\\n }\\n}\\nvoid read() {}\\ntemplate <typename Head, typename... Tail>\\nvoid read(Head &head, Tail &...tail) {\\n scan(head);\\n read(tail...);\\n}\\n#define CHAR(...) char __VA_ARGS__; read(__VA_ARGS__);\\n#define U32(...) u32 __VA_ARGS__; read(__VA_ARGS__);\\n#define U64(...) u64 __VA_ARGS__; read(__VA_ARGS__);\\n#define I32(...) i32 __VA_ARGS__; read(__VA_ARGS__);\\n#define I64(...) i64 __VA_ARGS__; read(__VA_ARGS__);\\n#define STR(...) string __VA_ARGS__; read(__VA_ARGS__);\\n#define VEC(type,name,size) V<type> name(size); read(name);\\n#define VVEC(type,name,size1,size2) VV<type> name(size1, V<type>(size2)); read(name);\\n#define DBG(...) (void)0\\n\\n#define ATCODER_MAXFLOW_HPP 1\\n\\n#define ATCODER_INTERNAL_QUEUE_HPP 1\\nnamespace atcoder {\\nnamespace internal {\\ntemplate <class T> struct simple_queue {\\n std::vector<T> payload;\\n int pos = 0;\\n void reserve(int n) { payload.reserve(n); }\\n int size() const { return int(payload.size()) - pos; }\\n bool empty() const { return pos == int(payload.size()); }\\n void push(const T& t) { payload.push_back(t); }\\n T& front() { return payload[pos]; }\\n void clear() {\\n payload.clear();\\n pos = 0;\\n }\\n void pop() { pos++; }\\n};\\n}\\n}\\n\\nnamespace atcoder {\\ntemplate <class Cap> struct mf_graph {\\n public:\\n mf_graph() : _n(0) {}\\n explicit mf_graph(int n) : _n(n), g(n) {}\\n int add_edge(int from, int to, Cap cap) {\\n assert(0 <= from && from < _n);\\n assert(0 <= to && to < _n);\\n assert(0 <= cap);\\n int m = int(pos.size());\\n pos.push_back({from, int(g[from].size())});\\n int from_id = int(g[from].size());\\n int to_id = int(g[to].size());\\n if (from == to) to_id++;\\n g[from].push_back(_edge{to, to_id, cap});\\n g[to].push_back(_edge{from, from_id, 0});\\n return m;\\n }\\n struct edge {\\n int from, to;\\n Cap cap, flow;\\n };\\n edge get_edge(int i) {\\n int m = int(pos.size());\\n assert(0 <= i && i < m);\\n auto _e = g[pos[i].first][pos[i].second];\\n auto _re = g[_e.to][_e.rev];\\n return edge{pos[i].first, _e.to, _e.cap + _re.cap, _re.cap};\\n }\\n std::vector<edge> edges() {\\n int m = int(pos.size());\\n std::vector<edge> result;\\n for (int i = 0; i < m; i++) {\\n result.push_back(get_edge(i));\\n }\\n return result;\\n }\\n void change_edge(int i, Cap new_cap, Cap new_flow) {\\n int m = int(pos.size());\\n assert(0 <= i && i < m);\\n assert(0 <= new_flow && new_flow <= new_cap);\\n auto& _e = g[pos[i].first][pos[i].second];\\n auto& _re = g[_e.to][_e.rev];\\n _e.cap = new_cap - new_flow;\\n _re.cap = new_flow;\\n }\\n Cap flow(int s, int t) {\\n return flow(s, t, std::numeric_limits<Cap>::max());\\n }\\n Cap flow(int s, int t, Cap flow_limit) {\\n assert(0 <= s && s < _n);\\n assert(0 <= t && t < _n);\\n assert(s != t);\\n std::vector<int> level(_n), iter(_n);\\n internal::simple_queue<int> que;\\n auto bfs = [&]() {\\n std::fill(level.begin(), level.end(), -1);\\n level[s] = 0;\\n que.clear();\\n que.push(s);\\n while (!que.empty()) {\\n int v = que.front();\\n que.pop();\\n for (auto e : g[v]) {\\n if (e.cap == 0 || level[e.to] >= 0) continue;\\n level[e.to] = level[v] + 1;\\n if (e.to == t) return;\\n que.push(e.to);\\n }\\n }\\n };\\n auto dfs = [&](auto self, int v, Cap up) {\\n if (v == s) return up;\\n Cap res = 0;\\n int level_v = level[v];\\n for (int& i = iter[v]; i < int(g[v].size()); i++) {\\n _edge& e = g[v][i];\\n if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0) continue;\\n Cap d =\\n self(self, e.to, std::min(up - res, g[e.to][e.rev].cap));\\n if (d <= 0) continue;\\n g[v][i].cap += d;\\n g[e.to][e.rev].cap -= d;\\n res += d;\\n if (res == up) return res;\\n }\\n level[v] = _n;\\n return res;\\n };\\n Cap flow = 0;\\n while (flow < flow_limit) {\\n bfs();\\n if (level[t] == -1) break;\\n std::fill(iter.begin(), iter.end(), 0);\\n Cap f = dfs(dfs, t, flow_limit - flow);\\n if (!f) break;\\n flow += f;\\n }\\n return flow;\\n }\\n std::vector<bool> min_cut(int s) {\\n std::vector<bool> visited(_n);\\n internal::simple_queue<int> que;\\n que.push(s);\\n while (!que.empty()) {\\n int p = que.front();\\n que.pop();\\n visited[p] = true;\\n for (auto e : g[p]) {\\n if (e.cap && !visited[e.to]) {\\n visited[e.to] = true;\\n que.push(e.to);\\n }\\n }\\n }\\n return visited;\\n }\\n private:\\n int _n;\\n struct _edge {\\n int to, rev;\\n Cap cap;\\n };\\n std::vector<std::pair<int, int>> pos;\\n std::vector<std::vector<_edge>> g;\\n};\\n}\\nvoid solve(i32 n, i32 m) {\\n V<i32> u(m), v(m);\\n REP(i, m) {\\n read(u[i], v[i]);\\n --u[i];\\n --v[i];\\n }\\n pi ans(0, n - 1);\\n auto judge = [&](i32 l, i32 r) -> bool {\\n atcoder::mf_graph<i32> g(n + m + 3);\\n i32 s = n + m, t = n + m + 1, p = n + m + 2;\\n REP(i, m) {\\n g.add_edge(u[i], n + i, 1);\\n g.add_edge(v[i], n + i, 1);\\n }\\n REP(i, n) { g.add_edge(p, i, r - l); }\\n g.add_edge(s, p, m - n * l);\\n REP(i, n) { g.add_edge(s, i, l); }\\n REP(i, m) { g.add_edge(n + i, t, 1); }\\n return g.flow(s, t) == m;\\n };\\n REP(l, n) {\\n if (m < n * l) {\\n break;\\n }\\n i32 ok = n, ng = l - 1;\\n while (ok - ng > 1) {\\n i32 mid = (ok + ng) / 2;\\n if (judge(l, mid)) {\\n ok = mid;\\n } else {\\n ng = mid;\\n }\\n }\\n if (ok != n) {\\n if (ok - l < ans.second - ans.first) {\\n ans.first = l;\\n ans.second = ok;\\n } else if (ok - l == ans.second - ans.first && l >= ans.first) {\\n ans.first = l;\\n ans.second = ok;\\n }\\n }\\n }\\n cout << ans.first << ' ' << ans.second << endl;\\n}\\nint main() {\\n while (1) {\\n I32(n, m);\\n if (n == 0) {\\n break;\\n }\\n solve(n, m);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 250,\n \"memory_kb\": 4200,\n \"score_of_the_acc\": -0.4146,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1615_10578667\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nnamespace atcoder {\\n\\n// Implement (union by size) + (path compression)\\n// Reference:\\n// Zvi Galil and Giuseppe F. Italiano,\\n// Data structures and algorithms for disjoint set union problems\\nstruct dsu {\\n public:\\n dsu() : _n(0) {}\\n explicit dsu(int n) : _n(n), parent_or_size(n, -1) {}\\n\\n int merge(int a, int b) {\\n assert(0 <= a && a < _n);\\n assert(0 <= b && b < _n);\\n int x = leader(a), y = leader(b);\\n if (x == y) return x;\\n if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);\\n parent_or_size[x] += parent_or_size[y];\\n parent_or_size[y] = x;\\n return x;\\n }\\n\\n bool same(int a, int b) {\\n assert(0 <= a && a < _n);\\n assert(0 <= b && b < _n);\\n return leader(a) == leader(b);\\n }\\n\\n int leader(int a) {\\n assert(0 <= a && a < _n);\\n if (parent_or_size[a] < 0) return a;\\n return parent_or_size[a] = leader(parent_or_size[a]);\\n }\\n\\n int size(int a) {\\n assert(0 <= a && a < _n);\\n return -parent_or_size[leader(a)];\\n }\\n\\n std::vector<std::vector<int>> groups() {\\n std::vector<int> leader_buf(_n), group_size(_n);\\n for (int i = 0; i < _n; i++) {\\n leader_buf[i] = leader(i);\\n group_size[leader_buf[i]]++;\\n }\\n std::vector<std::vector<int>> result(_n);\\n for (int i = 0; i < _n; i++) {\\n result[i].reserve(group_size[i]);\\n }\\n for (int i = 0; i < _n; i++) {\\n result[leader_buf[i]].push_back(i);\\n }\\n result.erase(\\n std::remove_if(result.begin(), result.end(),\\n [&](const std::vector<int>& v) { return v.empty(); }),\\n result.end());\\n return result;\\n }\\n\\n private:\\n int _n;\\n // root node: -1 * component size\\n // otherwise: parent\\n std::vector<int> parent_or_size;\\n};\\n\\n} // namespace atcoder\\n/* BOOST MULTIPRECISION\\n#include<boost/multiprecision/cpp_int.hpp>\\nusing namespace boost::multiprecision;\\n//*/\\n\\ntypedef long long ll;\\n\\n#define rep(i, s, n) for (int i = (int)(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) begin(v),end(v)\\n\\ntemplate <typename T> bool chmin(T &a, const T &b) {\\n\\tif (a <= b) return false;\\n\\ta = b;\\n\\treturn true;\\n}\\n\\ntemplate <typename T> bool chmax(T &a, const T &b) {\\n\\tif (a >= b) return false;\\n\\ta = b;\\n\\treturn true;\\n}\\n\\ntemplate <typename T> T max(vector<T> &a){\\n\\tassert(!a.empty());\\n\\tT ret = a[0];\\n\\tfor (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);\\n\\treturn ret;\\n}\\n\\ntemplate <typename T> T min(vector<T> &a){\\n\\tassert(!a.empty());\\n\\tT ret = a[0];\\n\\tfor (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);\\n\\treturn ret;\\n}\\n\\ntemplate <typename T> T sum(vector<T> &a){\\n\\tT ret = 0;\\n\\tfor (int i=0; i<(int)a.size(); i++) ret += a[i];\\n\\treturn ret;\\n}\\n\\n// importbisect\\ntemplate <typename T>\\nint bisect_left(vector<T> &X, T v){\\n\\treturn lower_bound(X.begin(), X.end(), v) - X.begin();\\n}\\n\\ntemplate <typename T>\\nint bisect_right(vector<T> &X, T v){\\n\\treturn upper_bound(X.begin(), X.end(), v) - X.begin();\\n}\\n// ----\\n\\n// defcomp\\ntemplate <typename T>\\nvector<T> compress(vector<T> &X) {\\n\\tvector<T> vals = X;\\n\\tsort(vals.begin(), vals.end());\\n\\tvals.erase(unique(vals.begin(), vals.end()), vals.end());\\n\\treturn vals;\\n}\\n// -----\\nstruct edge {\\n\\tint to, cap, rev;\\n};\\n\\n\\nvoid solve(int n, int m) {\\n\\tvector<int> u(m), v(m);\\n\\trep(i,0,m) {\\n\\t\\tcin >> u[i] >> v[i];\\n\\t\\tu[i]--; v[i]--;\\n\\t}\\n\\n\\tvector<vector<edge>> mf(n+m+2, vector<edge>(0));\\n\\tauto add_edge = [&](int i, int j, int cap) -> void {\\n\\t\\tmf[i].push_back(\\n\\t\\t\\tedge{j, cap, (int)mf[j].size()}\\n\\t\\t);\\n\\t\\tmf[j].push_back(\\n\\t\\t\\tedge{i, 0, (int)mf[i].size()-1}\\n\\t\\t);\\n\\t};\\n\\n\\tvector<bool> seen(n+m+2);\\n\\tvector<pair<int,int>> road;\\n\\tauto dfs = [&](auto self, int i, int j, int dat) -> int {\\n\\t\\tif (i == j) return dat;\\n\\t\\tseen[i] = 1;\\n\\n\\t\\trep(x,0,(int)mf[i].size()) {\\n\\t\\t\\tauto e = mf[i][x];\\n\\t\\t\\tif (e.cap == 0) continue;\\n\\t\\t\\tif (seen[e.to]) continue;\\n\\t\\t\\tint r = self(self, e.to, j, min(e.cap, dat));\\n\\t\\t\\tif (r > 0) {\\n\\t\\t\\t\\troad.push_back(pair(i, x));\\n\\t\\t\\t\\treturn r;\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\treturn 0;\\n\\t};\\n\\n\\tauto flow = [&](int i, int j) -> int {\\n\\t\\tint f = 0;\\n\\t\\twhile (true) {\\n\\t\\t\\tfill(all(seen), false);\\n\\t\\t\\tvector<pair<int,int>>().swap(road);\\n\\t\\t\\tint g = dfs(dfs, i, j, (int)1e9);\\n\\t\\t\\tf += g;\\n\\t\\t\\tif (g == 0) break;\\n\\t\\t\\tfor (auto [r,x]: road) {\\n\\t\\t\\t\\tmf[r][x].cap -= g;\\n\\t\\t\\t\\tmf[mf[r][x].to][mf[r][x].rev].cap += g;\\n\\t\\t\\t\\t//assert(mf[mf[r][x].to][mf[r][x].rev].rev==x);\\n\\t\\t\\t}\\n\\t\\t};\\n\\t\\treturn f;\\n\\t};\\n\\n\\tint ans = (int)1e9;\\n\\tint ansmin = -1;\\n\\tint ansmax = -1;\\n\\n\\n\\trep(mins,0,n+1) {\\n\\t\\trep(i,0,n+m+2) {\\n\\t\\t\\tvector<edge>().swap(mf[i]);\\n\\t\\t}\\n\\n\\t\\tvector<int> jun(n);\\n\\t\\tvector<int> rev(n);\\n\\n\\t\\trep(i,0,m){\\n\\t\\t\\tadd_edge(i,m+u[i],1);\\n\\t\\t\\tadd_edge(i,m+v[i],1);\\n\\t\\t\\tadd_edge(n+m,i,1);\\n\\t\\t}\\n\\n\\t\\trep(i,0,n){\\n\\t\\t\\tadd_edge(i+m,n+m+1,mins);\\n\\t\\t\\tjun[i] = (int)mf[i+m].size()-1;\\n\\t\\t\\trev[i] = (int)mf[n+m+1].size()-1;\\n\\t\\t}\\n\\n\\t\\tint f = flow(n+m,n+m+1);\\n\\n\\t\\tbool mode = 1;\\n\\t\\trep(i,0,n) {\\n\\t\\t\\tif (mf[i+m][jun[i]].cap != 0) {\\n\\t\\t\\t\\tmode = 0;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\tassert(mf[n+m+1][rev[i]].cap == mins);\\n\\t\\t\\tmf[n+m+1][rev[i]].cap = 0;\\n\\t\\t}\\n\\t\\tif (!mode) break;\\n\\n\\t\\tint maxs = mins;\\n\\t\\twhile (f != m) {\\n\\t\\t\\trep(i,0,n){\\n\\t\\t\\t\\tmf[i+m][jun[i]].cap += 1;\\n\\t\\t\\t\\t//cout << mf[i+m][jun[i]].cap << endl;\\n\\t\\t\\t}\\n\\t\\t\\tmaxs++;\\n\\t\\t\\tf += flow(n+m,n+m+1);\\n\\t\\t\\t\\n\\t\\t\\t//cout << mins << ' ' << maxs << ' ' << f << endl;\\n\\t\\t}\\n\\t\\t\\n\\t\\tif (ans >= maxs-mins){\\n\\t\\t\\tansmin = mins;\\n\\t\\t\\tansmax = maxs;\\n\\t\\t\\tans = maxs-mins;\\n\\t\\t}\\n\\t}\\n\\n\\tcout << ansmin << ' ' << ansmax << endl;\\n}\\n\\nint main(){\\n\\tios_base::sync_with_stdio(false);\\n\\tcin.tie(NULL);\\n\\twhile(true) {\\n\\t\\tint n, m;\\n\\t\\tcin >> n >> m;\\n\\t\\tif (n == 0) break;\\n\\t\\tsolve(n, m);\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1990,\n \"memory_kb\": 4224,\n \"score_of_the_acc\": -0.7519,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1615_10312283\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\n\\nstruct Flow{\\n\\tstruct edge {long long to, cap, rev; };\\n\\tvector<vector<edge>> G;\\n vector<int> level;\\n vector<int> iter;\\n\\tint MAX_V;\\n \\n\\tFlow(int v){\\n\\t\\tG.resize(v);\\n\\t\\titer.resize(v);\\n level.resize(v , -1);\\n\\t\\tMAX_V = v;\\n\\t}\\n \\n\\tvoid add_edge(int from, int to, long long cap){\\n\\t\\tG[from].push_back(edge{to, cap, (long long)G[to].size()});\\n\\t\\tG[to].push_back(edge{from, 0, (long long)G[from].size()-1});\\n\\t};\\n \\n void bfs(int s){\\n for(int i = 0; i < MAX_V; i++)level[i] = -1;\\n queue<int> que;\\n que.push(s);\\n level[s] = 0;\\n while(!que.empty()){\\n int v = que.front(); que.pop();\\n for(int i = 0; i < (int)(G[v].size()); i++){\\n edge &e = G[v][i];\\n if(e.cap > 0 && level[e.to] < 0){\\n level[e.to] = level[v] + 1;\\n que.push(e.to);\\n }\\n }\\n }\\n }\\n \\n\\tlong long dfs(int v, int t, long long f){\\n\\t\\tif(v == t)return f;\\n\\t\\tfor(int &i = iter[v]; i < (int)(G[v].size()); i++){\\n\\t\\t\\tedge &e = G[v][i];\\n\\t\\t\\tif(e.cap > 0 && level[v] < level[e.to]){\\n\\t\\t\\t\\tlong long d = dfs(e.to, t, min(f, e.cap));\\n\\t\\t\\t\\tif(d > 0){\\n\\t\\t\\t\\t\\te.cap -= d;\\n\\t\\t\\t\\t\\tG[e.to][e.rev].cap += d;\\n\\t\\t\\t\\t\\treturn d;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn 0;\\n\\t}\\n \\n\\tlong long max_flow(int s, int t){\\n\\t\\tlong long flow = 0;\\n\\t\\twhile(1){\\n\\t\\t\\tbfs(s);\\n\\t\\t\\tif(level[t] < 0)return flow;\\n for(int i = 0; i < MAX_V; i++)iter[i] = 0;\\n\\t\\t\\tlong long f;\\n while((f = dfs(s , t , 1LL<<60)) > 0)flow += f;\\n\\t\\t}\\n\\t\\treturn 0;\\n\\t}\\n};\\n\\n\\n\\nint main(){\\n\\twhile(1){\\n\\t\\tint N,M; cin >> N >> M;\\n\\t\\tif(N == 0)break;\\n\\t\\tvector<int> v(M) , u(M);\\n\\t\\tfor(int i = 0; i < M; i++){\\n\\t\\t\\tcin >> v[i] >> u[i];\\n\\t\\t\\t--v[i];\\n\\t\\t\\t--u[i];\\n\\t\\t}\\n\\t\\tauto ok = [&](int low , int high)->bool{\\n\\t\\t\\tFlow f(N+M+4);\\n\\t\\t\\tint S = N+M+3;\\n\\t\\t\\tint T = S-1;\\n\\t\\t\\tint S2 = T-1;\\n\\t\\t\\tint T2 = S2-1;\\n\\t\\t\\tfor(int i = 0; i < M; i++){\\n\\t\\t\\t\\tf.add_edge(S , i , 1);\\n\\t\\t\\t\\tf.add_edge(i , M+v[i] , 1);\\n\\t\\t\\t\\tf.add_edge(i , M+u[i] , 1);\\n\\t\\t\\t}\\n\\t\\t\\tfor(int i = 0; i < N; i++){\\n\\t\\t\\t\\tf.add_edge(M+i , T , high - low);\\n\\t\\t\\t\\tf.add_edge(S2 , T , low);\\n\\t\\t\\t\\tf.add_edge(M+i , T2 , low);\\n\\t\\t\\t}\\n\\t\\t\\tll FLOW = 0;\\n\\t\\t\\tFLOW += f.max_flow(S2 , T2);\\n\\t\\t\\tFLOW += f.max_flow(S2 , T);\\n\\t\\t\\tFLOW += f.max_flow(S , T2);\\n\\t\\t\\tFLOW += f.max_flow(S , T);\\n\\t\\t\\tif(FLOW < M)return 0;\\n\\t\\t\\tfor(auto e:f.G[S2]){\\n\\t\\t\\t\\tif(e.cap > 0)return 0;\\n\\t\\t\\t}\\n\\t\\t\\tfor(auto e:f.G[T2]){\\n\\t\\t\\t\\tif(e.cap < low)return 0;\\n\\t\\t\\t}\\n\\t\\t\\treturn 1;\\n\\t\\t};\\n\\t\\tint LO = -1 , HI = M;\\n\\t\\tint hi = 1;\\n\\t\\tfor(int lo = 0; lo < N; lo++){\\n\\t\\t\\thi = max(hi , lo);\\n\\t\\t\\twhile(hi <= N && !ok(lo, hi))hi++;\\n\\t\\t\\tif(hi == N+1)break;\\n\\t\\t\\tif(HI - LO >= hi - lo){\\n\\t\\t\\t\\tHI = hi;\\n\\t\\t\\t\\tLO = lo;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t/*\\n\\t\\tfor(int i = 0; i < N; i++){\\n\\t\\t\\tfor(int j = i; j < N; j++){\\n\\t\\t\\t\\tcout << i << ' ' << j << ' ' << ok(i,j) << endl;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\t*/\\n\\t\\tcout << LO << ' ' << HI << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 230,\n \"memory_kb\": 4608,\n \"score_of_the_acc\": -0.6169,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1615_9632804\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define ll long long\\n#define pii pair<int, int>\\n#define pll pair<ll, ll>\\n#define vi vector<int>\\n#define vl vector<ll>\\n#define ov4(a, b, c, d, name, ...) name\\n#define rep3(i, a, b, c) for(ll i = (a); i < (b); i += (c))\\n#define rep2(i, a, b) rep3(i, a, b, 1)\\n#define rep1(i, n) rep2(i, 0, n)\\n#define rep0(n) rep1(aaaaa, n)\\n#define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)\\n#define per(i, a, b) for(ll i = (a) - 1; i >= (b); i--)\\n#define fore(e, v) for(auto &&e : v)\\n#define all(a) begin(a), end(a)\\n#define si(a) (int)(size(a))\\n#define lb(v, x) (lower_bound(all(v), x) - begin(v))\\n#define eb emplace_back\\n\\ntemplate <typename T, typename S> bool chmin(T &a, const S &b) { return a > b ? a = b, 1 : 0; }\\ntemplate <typename T, typename S> bool chmax(T &a, const S &b) { return a < b ? a = b, 1 : 0; }\\n\\nconst int INF = 1e9 + 100;\\nconst ll INFL = 3e18 + 100;\\n\\n#define i128 __int128_t\\n\\nstruct _ {\\n _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); }\\n} __;\\ntemplate <typename T> struct Dinic {\\n const T INF;\\n\\n struct edge {\\n int to;\\n T cap;\\n int rev;\\n bool isrev;\\n int idx;\\n };\\n\\n vector<vector<edge>> g;\\n vector<int> c, iter;\\n Dinic(int V) : INF(numeric_limits<T>::max()), g(V) {}\\n void add_edge(int from, int to, T cap, int idx = -1) {\\n g[from].emplace_back((edge){to, cap, si(g[to]), false, idx});\\n g[to].emplace_back((edge){from, 0, si(g[from]) - 1, true, idx});\\n }\\n\\n bool bfs(int s, int t) {\\n c.assign(si(g), -1);\\n queue<int> q;\\n c[s] = 0;\\n q.push(s);\\n while(!q.empty() && c[t] == -1) {\\n int x = q.front();\\n q.pop();\\n fore(e, g[x]) {\\n if(e.cap > 0 && c[e.to] == -1) {\\n c[e.to] = c[x] + 1;\\n q.push(e.to);\\n }\\n }\\n }\\n return c[t] != -1;\\n }\\n\\n T dfs(int x, int t, T flow) {\\n if(x == t) return flow;\\n for(int &i = iter[x]; i < si(g[x]); i++) {\\n edge &e = g[x][i];\\n if(e.cap > 0 && c[x] < c[e.to]) {\\n T d = dfs(e.to, t, min(flow, e.cap));\\n if(d > 0) {\\n e.cap -= d;\\n g[e.to][e.rev].cap += d;\\n return d;\\n }\\n }\\n }\\n return 0;\\n }\\n\\n T max_flow(int s, int t) {\\n T flow = 0;\\n while(bfs(s, t)) {\\n iter.assign(si(g), 0);\\n T f = 0;\\n while((f = dfs(s, t, INF)) > 0) flow += f;\\n }\\n return flow;\\n }\\n\\n // void output() {\\n // for(int i = 0; i < g.size(); i++) {\\n // for(auto &e : g[i]) {\\n // if(e.isrev) continue;\\n // auto &rev_e = g[e.to][e.rev];\\n // cout << i << \\\"->\\\" << e.to << \\\" (flow: \\\" << rev_e.cap << \\\"/\\\" << e.cap + rev_e.cap << \\\")\\\" << endl;\\n // }\\n // }\\n // }\\n};\\n\\ntemplate <typename T> struct lrFlow {\\n Dinic<T> flow;\\n vector<T> in, up;\\n int X, Y, n;\\n T sum;\\n typename Dinic<T>::edge *p, *q;\\n\\n lrFlow(int n) : n(n), X(n), Y(n + 1), sum(0), in(n), flow(n + 2) {}\\n\\n void add_edge(int from, int to, T low, T high) {\\n flow.add_edge(from, to, high - low, si(up));\\n in[from] -= low, in[to] += low;\\n up.eb(high);\\n }\\n\\n void build() {\\n rep(i, n) {\\n if(in[i] > 0) {\\n flow.add_edge(X, i, in[i]);\\n sum += in[i];\\n } else if(in[i] < 0) {\\n flow.add_edge(i, Y, -in[i]);\\n }\\n }\\n }\\n\\n bool can_flow(int s, int t) {\\n flow.add_edge(t, s, flow.INF);\\n p = &flow.g[t].back();\\n q = &flow.g[s].back();\\n return can_flow();\\n }\\n\\n bool can_flow() {\\n build();\\n auto ret = flow.max_flow(X, Y);\\n return ret >= sum;\\n }\\n\\n T max_flow(int s, int t) {\\n if(can_flow(s, t)) {\\n return flow.max_flow(s, t);\\n } else {\\n return -1;\\n }\\n }\\n\\n T min_flow(int s, int t) {\\n if(can_flow(s, t)) {\\n auto ret = flow.INF - p->cap;\\n p->cap = q->cap = 0;\\n return ret - flow.max_flow(t, s);\\n } else {\\n return -1;\\n }\\n }\\n\\n // void output(int M) {\\n // vector<flow_t> ans(M);\\n // for(int i = 0; i < flow.graph.size(); i++) {\\n // for(auto &e : flow.graph[i]) {\\n // if(!e.isrev && ~e.idx) ans[e.idx] = up[e.idx] - e.cap;\\n // }\\n // }\\n // for(auto &p : ans) cout << p << endl;\\n // }\\n};\\n\\nint main() {\\n int n, m;\\n while(cin >> n >> m, n) {\\n vi u(m), v(m);\\n rep(i, m) {\\n cin >> u[i] >> v[i];\\n --u[i], --v[i];\\n }\\n auto check = [&](int l, int r) {\\n lrFlow<int> flow(n + m + 2);\\n int s = n + m, t = n + m + 1;\\n rep(i, m) {\\n flow.add_edge(s, i, 1, 1);\\n flow.add_edge(i, m + u[i], 0, 1);\\n flow.add_edge(i, m + v[i], 0, 1);\\n }\\n rep(i, n) { flow.add_edge(m + i, t, l, r); }\\n auto res = flow.max_flow(s, t) == m;\\n return res;\\n };\\n int p = 0, q = n;\\n int l = 0;\\n rep(r, n + 1) {\\n while(l <= r and check(l, r)) {\\n p = l, q = r;\\n ++l;\\n }\\n }\\n cout << p << \\\" \\\" << q << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 350,\n \"memory_kb\": 4412,\n \"score_of_the_acc\": -0.5403,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1615_9566917\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n// #include<atcoder/all>\\n// #include<boost/multiprecision/cpp_int.hpp>\\n\\nusing namespace std;\\n// using namespace atcoder;\\n// using bint = boost::multiprecision::cpp_int;\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing ld = long double;\\nusing P = pair<ll,ll>;\\nusing vi = vector<ll>;\\nusing vvi = vector<vi>;\\nusing vvvi = vector<vvi>;\\nusing ve = vector<vector<int>>;\\nusing vb = vector<bool>;\\nusing vvb = vector<vb>;\\n#define rep(i,n) for(ll i = 0;i < (ll)n;i++)\\n#define ALL(x) (x).begin(),(x).end()\\n#define sz(c) ((ll)(c).size())\\n#define LB(A,x) (int)(lower_bound(A.begin(),A.end(),x)-A.begin())\\n#define UB(A,x) (int)(upper_bound(A.begin(),A.end(),x)-A.begin())\\n// #define MOD 1000000007\\n#define MOD 998244353\\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\\ntemplate<typename T>ostream&operator<<(ostream&os,vector<T>&v){for(int i = 0;i < v.size();i++)os<<v[i]<<(i+1!=v.size()?\\\" \\\":\\\"\\\");return os;}\\ntemplate<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}\\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;}\\ntemplate<typename T> inline bool chmax(T &a,T b){if(a < b){a = b;return true;}return false;}\\ntemplate<typename T> inline bool chmin(T &a,T b){if(a > b){a = b;return true;}return false;}\\nld dist(ld x1,ld y1,ld x2, ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}\\n\\n\\n// https://ei1333.github.io/luzhiled/snippets/graph/dinic.html\\ntemplate<typename flow_t>\\nstruct Dinic{\\n /*\\n 復元をするときはfromの頂点から出る辺からのcapを出力．\\n is_e == trueの時その辺は元のグラフにあった\\\"本当の\\\"辺．\\n \\\"本当の\\\"辺eについてfr -> toにv[e.to][e.ref].capだけフローが流れている．\\n 二部マッチングの復元の場合，仮想の始点（終点）から（へ）の辺に注意．\\n */\\n struct edge{\\n int to;\\n flow_t cap;\\n int ref;//逆辺の番号\\n bool is_e;//本物の辺かどうか\\n int idx;//入力で与えられる辺としてのindex\\n };\\n vector<vector<edge>> v;\\n vector<int> mn_cost,iter;\\n const flow_t inf;\\n Dinic(int n):inf(numeric_limits<flow_t>::max()),v(n){}\\n void add_edge(int fr,int to,flow_t cap,int idx = -1){\\n v[fr].emplace_back((edge){to,cap,(int)v[to].size(),true,idx});\\n v[to].emplace_back((edge){fr,0,(int)v[fr].size()-1,false,idx});\\n }\\n bool bfs(int s,int t){\\n mn_cost.assign(v.size(),-1);\\n queue<int> que;\\n mn_cost[s] = 0;\\n que.push(s);\\n while(!que.empty() && mn_cost[t] == -1){\\n int ov = que.front();que.pop();\\n for(auto &e : v[ov]){\\n if(e.cap > 0 && mn_cost[e.to] == -1){\\n mn_cost[e.to] = mn_cost[ov] + 1;\\n que.push(e.to);\\n }\\n }\\n }\\n return mn_cost[t] != -1;\\n }\\n flow_t dfs(int ov,const int t,flow_t flow){\\n if(ov == t)return flow;\\n for(int &i = iter[ov];i < v[ov].size();i++){\\n edge &e = v[ov][i];\\n if(e.cap > 0 && mn_cost[ov] < mn_cost[e.to]){\\n flow_t d = dfs(e.to,t,min(flow,e.cap));\\n if(d > 0){\\n e.cap -= d;\\n v[e.to][e.ref].cap += d;\\n return d;\\n }\\n }\\n }\\n return 0;\\n }\\n // O(m n^2)(n:頂点数 m:辺数)\\n flow_t max_flow(int s,int t){\\n flow_t flow = 0;\\n while(bfs(s,t)){\\n iter.assign(v.size(),0);\\n flow_t f = 0;\\n while((f = dfs(s,t,inf)) > 0)flow += f;\\n }\\n return flow;\\n }\\n void output(){\\n for(int i = 0;i < v.size();i++){\\n for(auto &e : v[i]) {\\n if(!e.is_e) continue;\\n auto &rev_e = v[e.to][e.ref];\\n cout << i << \\\"->\\\" << e.to << \\\" (flow: \\\" << rev_e.cap << \\\"/\\\" << e.cap + rev_e.cap << \\\")\\\" << \\\"\\\\n\\\";\\n }\\n }\\n }\\n};\\n\\nint main(){\\n \\n ios_base::sync_with_stdio(0), cin.tie(0);\\n while(1){\\n int n,m;cin >> n >> m;\\n if(!n)break;\\n P res = {0,n+100};\\n vector<P> v(m);cin >> v;\\n for(auto &[a,b] : v)a--,b--;\\n int r = 1;\\n rep(l,n){\\n if(r < l)r = l;\\n while(1){\\n if(r >= n)break;\\n Dinic<ll> dn(4 + n + m);\\n ll sm = 0;\\n const int s = n+m,t = n+m+1,S = n+m+2,T = n+m+3;\\n rep(i,m){\\n auto [a,b] = v[i];\\n dn.add_edge(a,n+i,1);\\n dn.add_edge(b,n+i,1);\\n dn.add_edge(n+i,t,1);\\n }\\n rep(i,n){\\n if(l != r)dn.add_edge(s,i,r-l);\\n if(l){\\n dn.add_edge(S,i,l);\\n dn.add_edge(s,T,l);\\n sm += l;\\n }\\n }\\n ll a = dn.max_flow(S,T);\\n ll b = dn.max_flow(s,T);\\n ll c = dn.max_flow(S,t);\\n ll d = dn.max_flow(s,t);\\n // cout << b + d << \\\" a\\\\n\\\";\\n // cout << a << \\\" \\\" << b << \\\" \\\" << c << \\\" \\\" << d << \\\" : \\\" << sm << \\\" a\\\\n\\\";\\n if(sm == a + c && sm == a + b && m == b + d){\\n auto [L,R] = res;\\n if(r-l < R-L)res = {l,r};\\n break;\\n }\\n r++;\\n }\\n }\\n cout << res << \\\"\\\\n\\\";\\n }\\n \\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 310,\n \"memory_kb\": 4656,\n \"score_of_the_acc\": -0.6561,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1615_9480955\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n// #include <atcoder/all>\\n\\nusing namespace std;\\nusing ll = long long;\\nusing pll = pair<ll, ll>;\\n#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)\\n#define rrep(i, s, t) for (ll i = (ll)(t) - 1; i >= (ll)(s); i--)\\n#define all(x) begin(x), end(x)\\n\\n#define TT template <typename T>\\nTT using vec = vector<T>;\\nTT using vvec = vec<vec<T>>;\\nTT using vvvec = vec<vvec<T>>;\\nTT using minheap = priority_queue<T, vector<T>, greater<T>>;\\nTT using maxheap = priority_queue<T>;\\ntemplate <class T1, class T2> bool chmin(T1 &x, T2 y) {\\n return x > y ? (x = y, true) : false;\\n}\\ntemplate <class T1, class T2> bool chmax(T1 &x, T2 y) {\\n return x < y ? (x = y, true) : false;\\n}\\nTT int pre_id(vec<T> &A, T x) { // must sorted\\n return lower_bound(all(A), x) - A.begin() - 1;\\n}\\nTT int nex_id(vec<T> &A, T x) { // must sorted\\n return upper_bound(all(A), x) - A.begin();\\n}\\nstruct io_setup {\\n io_setup() {\\n ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n }\\n} io_setup;\\n\\ntemplate <class T> struct mf_graph {\\n struct edge {\\n int st, to;\\n T cap, flow;\\n };\\n\\n struct nedge {\\n int to, rev;\\n T cap;\\n };\\n\\n int n;\\n vec<unordered_map<int, int>> rev;\\n vec<pair<int, int>> pos;\\n vec<vec<nedge>> g;\\n\\n mf_graph(int _n) : n(_n), g(n), rev(n) {}\\n\\n int add_edge(int s, int t, T cap) {\\n int m = pos.size();\\n pos.push_back({s, g[s].size()});\\n int fi = g[s].size();\\n int ti = g[t].size();\\n if (s == t) ti++;\\n g[s].push_back(nedge{t, ti, cap});\\n g[t].push_back(nedge{s, fi, 0});\\n rev[s][t] = m;\\n return m;\\n }\\n\\n T flow(int s, int t, T flow_limit = numeric_limits<T>::max()) {\\n vec<int> lv(n), it(n, 0);\\n\\n auto bfs = [&]() {\\n queue<int> que;\\n fill(lv.begin(), lv.end(), -1);\\n lv[s] = 0;\\n que.push(s);\\n while (!que.empty()) {\\n int v = que.front();\\n que.pop();\\n\\n for (auto e : g[v]) {\\n if (e.cap == 0 || lv[e.to] >= 0) continue;\\n lv[e.to] = lv[v] + 1;\\n if (e.to == t) return;\\n que.push(e.to);\\n }\\n }\\n };\\n\\n auto dfs = [&](auto f, int v, T up) {\\n if (v == s) return up;\\n T res = 0;\\n int LV = lv[v];\\n for (int &i = it[v]; i < int(g[v].size()); i++) {\\n nedge &e = g[v][i];\\n if (LV <= lv[e.to] || g[e.to][e.rev].cap == 0) continue;\\n T d = f(f, e.to, min(up - res, g[e.to][e.rev].cap));\\n if (d <= 0) continue;\\n g[v][i].cap += d;\\n g[e.to][e.rev].cap -= d;\\n res += d;\\n if (res == up) return res;\\n }\\n lv[v] = n;\\n return res;\\n };\\n\\n T flow = 0;\\n while (flow < flow_limit) {\\n bfs();\\n if (lv[t] == -1) break;\\n fill(it.begin(), it.end(), 0);\\n T f = dfs(dfs, t, flow_limit - flow);\\n if (!f) break;\\n flow += f;\\n }\\n return flow;\\n }\\n\\n // 以下、不要なら省略\\n\\n int get_id(int s, int t) { return rev[s][t]; }\\n\\n edge get_edge(int i) {\\n int m = pos.size();\\n auto e = g[pos[i].first][pos[i].second];\\n auto re = g[e.to][e.rev];\\n return edge{pos[i].first, e.to, e.cap + re.cap, re.cap};\\n }\\n\\n void change_edge(int i, T nc, T nf) {\\n int m = pos.size();\\n auto &e = g[pos[i].first][pos[i].second];\\n auto &re = g[e.to][e.rev];\\n e.cap = nc - nf;\\n re.cap = nf;\\n }\\n\\n vec<bool> min_cut(int s) {\\n vec<bool> seen(n);\\n queue<int> que;\\n que.push(s);\\n while (!que.empty()) {\\n int p = que.front();\\n que.pop();\\n seen[p] = true;\\n for (auto e : g[p]) {\\n if (e.cap && !seen[e.to]) {\\n seen[e.to] = true;\\n que.push(e.to);\\n }\\n }\\n }\\n return seen;\\n }\\n};\\n\\n/*\\n@brief Maxflow\\n@docs doc/maxflow.md\\n*/\\n\\nstruct mf_graph_with_lowerbound {\\n int n;\\n mf_graph<ll> mf;\\n int S, T;\\n ll sum;\\n vector<ll> lows, d;\\n ll total_flow;\\n\\n mf_graph_with_lowerbound(int n)\\n : n(n), mf(n + 2), S(n), T(n + 1), sum(0), d(n, 0), total_flow(0) {}\\n\\n int add_edge(int from, int to, ll low, ll high) {\\n lows.push_back(low);\\n d[from] -= low;\\n d[to] += low;\\n return mf.add_edge(from, to, high - low);\\n }\\n\\n void build() {\\n rep(i, 0, n) {\\n if (d[i] > 0) {\\n mf.add_edge(S, i, d[i]);\\n sum += d[i];\\n } else if(d[i] < 0) {\\n mf.add_edge(i, T, -d[i]);\\n }\\n }\\n }\\n\\n bool is_feasable(int s, int t) {\\n build();\\n mf.add_edge(t, s, LLONG_MAX / 4); // INF = LLONG_MAX / 4\\n total_flow += mf.flow(S, T);\\n return total_flow == sum;\\n }\\n\\n ll flow(int s, int t) {\\n if (is_feasable(s, t) == false) return -1;\\n mf.add_edge(S, s, LLONG_MAX / 4);\\n mf.add_edge(t, T, LLONG_MAX / 4);\\n return (total_flow += mf.flow(S, T)) - sum;\\n }\\n\\n vector<ll> output() {\\n vector<ll> res;\\n rep(i, 0, lows.size()) { res.push_back(lows[i] + mf.get_edge(i).flow); }\\n return res;\\n }\\n};\\n\\nint main() {\\n int n, m;\\n while (1) {\\n cin >> n >> m;\\n\\n if (n == 0) break;\\n\\n vector<pll> es;\\n rep(i, 0, m) {\\n int u, v;\\n cin >> u >> v;\\n u--, v--;\\n es.emplace_back(u, v);\\n }\\n\\n int ans_m = -1;\\n int ans_M = -1;\\n\\n auto che = [&](int mi, int Mi) {\\n int s = n + m;\\n int t = s + 1;\\n\\n mf_graph_with_lowerbound mf(t + 1);\\n\\n rep(i, 0, m) {\\n mf.add_edge(s, i, 1, 1);\\n mf.add_edge(i, m + es[i].first, 0, 1);\\n mf.add_edge(i, m + es[i].second, 0, 1);\\n }\\n\\n rep(i, 0, n) { mf.add_edge(m + i, t, mi, Mi); }\\n\\n if (mf.is_feasable(s, t)) {\\n return true;\\n } else\\n return false;\\n };\\n\\n ll w = 1e7;\\n rrep(mi, 0, n + 1) {\\n ll li = 0;\\n ll ri = li + min<ll>(w, m);\\n while (li < ri) { /// xxxxoooo\\n ll mid = (li + ri) / 2;\\n if (che(mi, mi + mid)) {\\n ri = mid;\\n } else {\\n li = mid + 1;\\n }\\n }\\n if (che(mi, mi + li) && chmin(w, li - mi)) {\\n ans_m = mi;\\n ans_M = mi + li;\\n }\\n }\\n\\n cout << ans_m << \\\" \\\" << ans_M << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4540,\n \"memory_kb\": 5392,\n \"score_of_the_acc\": -1.8184,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1615_9480949\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n// #include <atcoder/all>\\n\\nusing namespace std;\\nusing ll = long long;\\nusing pll = pair<ll, ll>;\\n#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)\\n#define rrep(i, s, t) for (ll i = (ll)(t) - 1; i >= (ll)(s); i--)\\n#define all(x) begin(x), end(x)\\n\\n#define TT template <typename T>\\nTT using vec = vector<T>;\\nTT using vvec = vec<vec<T>>;\\nTT using vvvec = vec<vvec<T>>;\\nTT using minheap = priority_queue<T, vector<T>, greater<T>>;\\nTT using maxheap = priority_queue<T>;\\ntemplate <class T1, class T2> bool chmin(T1 &x, T2 y) {\\n return x > y ? (x = y, true) : false;\\n}\\ntemplate <class T1, class T2> bool chmax(T1 &x, T2 y) {\\n return x < y ? (x = y, true) : false;\\n}\\nTT int pre_id(vec<T> &A, T x) { // must sorted\\n return lower_bound(all(A), x) - A.begin() - 1;\\n}\\nTT int nex_id(vec<T> &A, T x) { // must sorted\\n return upper_bound(all(A), x) - A.begin();\\n}\\nstruct io_setup {\\n io_setup() {\\n ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n }\\n} io_setup;\\n\\ntemplate <class T> struct mf_graph {\\n struct edge {\\n int st, to;\\n T cap, flow;\\n };\\n\\n struct nedge {\\n int to, rev;\\n T cap;\\n };\\n\\n int n;\\n vec<unordered_map<int, int>> rev;\\n vec<pair<int, int>> pos;\\n vec<vec<nedge>> g;\\n\\n mf_graph(int _n) : n(_n), g(n), rev(n) {}\\n\\n int add_edge(int s, int t, T cap) {\\n int m = pos.size();\\n pos.push_back({s, g[s].size()});\\n int fi = g[s].size();\\n int ti = g[t].size();\\n if (s == t) ti++;\\n g[s].push_back(nedge{t, ti, cap});\\n g[t].push_back(nedge{s, fi, 0});\\n rev[s][t] = m;\\n return m;\\n }\\n\\n T flow(int s, int t, T flow_limit = numeric_limits<T>::max()) {\\n vec<int> lv(n), it(n, 0);\\n\\n auto bfs = [&]() {\\n queue<int> que;\\n fill(lv.begin(), lv.end(), -1);\\n lv[s] = 0;\\n que.push(s);\\n while (!que.empty()) {\\n int v = que.front();\\n que.pop();\\n\\n for (auto e : g[v]) {\\n if (e.cap == 0 || lv[e.to] >= 0) continue;\\n lv[e.to] = lv[v] + 1;\\n if (e.to == t) return;\\n que.push(e.to);\\n }\\n }\\n };\\n\\n auto dfs = [&](auto f, int v, T up) {\\n if (v == s) return up;\\n T res = 0;\\n int LV = lv[v];\\n for (int &i = it[v]; i < int(g[v].size()); i++) {\\n nedge &e = g[v][i];\\n if (LV <= lv[e.to] || g[e.to][e.rev].cap == 0) continue;\\n T d = f(f, e.to, min(up - res, g[e.to][e.rev].cap));\\n if (d <= 0) continue;\\n g[v][i].cap += d;\\n g[e.to][e.rev].cap -= d;\\n res += d;\\n if (res == up) return res;\\n }\\n lv[v] = n;\\n return res;\\n };\\n\\n T flow = 0;\\n while (flow < flow_limit) {\\n bfs();\\n if (lv[t] == -1) break;\\n fill(it.begin(), it.end(), 0);\\n T f = dfs(dfs, t, flow_limit - flow);\\n if (!f) break;\\n flow += f;\\n }\\n return flow;\\n }\\n\\n // 以下、不要なら省略\\n\\n int get_id(int s, int t) { return rev[s][t]; }\\n\\n edge get_edge(int i) {\\n int m = pos.size();\\n auto e = g[pos[i].first][pos[i].second];\\n auto re = g[e.to][e.rev];\\n return edge{pos[i].first, e.to, e.cap + re.cap, re.cap};\\n }\\n\\n void change_edge(int i, T nc, T nf) {\\n int m = pos.size();\\n auto &e = g[pos[i].first][pos[i].second];\\n auto &re = g[e.to][e.rev];\\n e.cap = nc - nf;\\n re.cap = nf;\\n }\\n\\n vec<bool> min_cut(int s) {\\n vec<bool> seen(n);\\n queue<int> que;\\n que.push(s);\\n while (!que.empty()) {\\n int p = que.front();\\n que.pop();\\n seen[p] = true;\\n for (auto e : g[p]) {\\n if (e.cap && !seen[e.to]) {\\n seen[e.to] = true;\\n que.push(e.to);\\n }\\n }\\n }\\n return seen;\\n }\\n};\\n\\n/*\\n@brief Maxflow\\n@docs doc/maxflow.md\\n*/\\n\\nstruct mf_graph_with_lowerbound {\\n int n;\\n mf_graph<ll> mf;\\n int S, T;\\n ll sum;\\n vector<ll> lows, d;\\n ll total_flow;\\n\\n mf_graph_with_lowerbound(int n)\\n : n(n), mf(n + 2), S(n), T(n + 1), sum(0), d(n, 0), total_flow(0) {}\\n\\n int add_edge(int from, int to, ll low, ll high) {\\n lows.push_back(low);\\n d[from] -= low;\\n d[to] += low;\\n return mf.add_edge(from, to, high - low);\\n }\\n\\n void build() {\\n rep(i, 0, n) {\\n if (d[i] > 0) {\\n mf.add_edge(S, i, d[i]);\\n sum += d[i];\\n } else\\n mf.add_edge(i, T, -d[i]);\\n }\\n }\\n\\n bool is_feasable(int s, int t) {\\n build();\\n mf.add_edge(t, s, LLONG_MAX / 4); // INF = LLONG_MAX / 4\\n total_flow += mf.flow(S, T);\\n return total_flow == sum;\\n }\\n\\n ll flow(int s, int t) {\\n if (is_feasable(s, t) == false) return -1;\\n mf.add_edge(S, s, LLONG_MAX / 4);\\n mf.add_edge(t, T, LLONG_MAX / 4);\\n return (total_flow += mf.flow(S, T)) - sum;\\n }\\n\\n vector<ll> output() {\\n vector<ll> res;\\n rep(i, 0, lows.size()) { res.push_back(lows[i] + mf.get_edge(i).flow); }\\n return res;\\n }\\n};\\n\\nint main() {\\n int n, m;\\n while (1) {\\n cin >> n >> m;\\n\\n if (n == 0) break;\\n\\n vector<pll> es;\\n rep(i, 0, m) {\\n int u, v;\\n cin >> u >> v;\\n u--, v--;\\n es.emplace_back(u, v);\\n }\\n\\n int ans_m = -1;\\n int ans_M = -1;\\n\\n auto che = [&](int mi, int Mi) {\\n int s = n + m;\\n int t = s + 1;\\n\\n mf_graph_with_lowerbound mf(t + 1);\\n\\n rep(i, 0, m) {\\n mf.add_edge(s, i, 1, 1);\\n mf.add_edge(i, m + es[i].first, 0, 1);\\n mf.add_edge(i, m + es[i].second, 0, 1);\\n }\\n\\n rep(i, 0, n) { mf.add_edge(m + i, t, mi, Mi); }\\n\\n if (mf.is_feasable(s, t)) {\\n return true;\\n } else\\n return false;\\n };\\n\\n ll w = 1e7;\\n rrep(mi, 0, n + 1) {\\n ll li = 0;\\n ll ri = li + min<ll>(w, m);\\n while (li < ri) { /// xxxxoooo\\n ll mid = (li + ri) / 2;\\n if (che(mi, mi + mid)) {\\n ri = mid;\\n } else {\\n li = mid + 1;\\n }\\n }\\n if (che(mi, mi + li) && chmin(w, li - mi)) {\\n ans_m = mi;\\n ans_M = mi + li;\\n }\\n }\\n\\n cout << ans_m << \\\" \\\" << ans_M << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4540,\n \"memory_kb\": 5316,\n \"score_of_the_acc\": -1.7801,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1615_9480943\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n//#include <atcoder/all>\\n\\nusing namespace std;\\nusing ll = long long;\\nusing pll = pair<ll, ll>;\\n#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)\\n#define rrep(i, s, t) for (ll i = (ll)(t) - 1; i >= (ll)(s); i--)\\n#define all(x) begin(x), end(x)\\n\\n#define TT template <typename T>\\nTT using vec = vector<T>;\\nTT using vvec = vec<vec<T>>;\\nTT using vvvec = vec<vvec<T>>;\\nTT using minheap = priority_queue<T, vector<T>, greater<T>>;\\nTT using maxheap = priority_queue<T>;\\ntemplate <class T1, class T2> bool chmin(T1 &x, T2 y) {\\n return x > y ? (x = y, true) : false;\\n}\\ntemplate <class T1, class T2> bool chmax(T1 &x, T2 y) {\\n return x < y ? (x = y, true) : false;\\n}\\nTT int pre_id(vec<T> &A, T x) { // must sorted\\n return lower_bound(all(A), x) - A.begin() - 1;\\n}\\nTT int nex_id(vec<T> &A, T x) { // must sorted\\n return upper_bound(all(A), x) - A.begin();\\n}\\nstruct io_setup {\\n io_setup() {\\n ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n }\\n} io_setup;\\n\\n\\ntemplate<class T> \\nstruct mf_graph {\\n struct edge {\\n int st, to;\\n T cap, flow;\\n };\\n\\n struct nedge {\\n int to, rev;\\n T cap;\\n };\\n\\n int n;\\n vec<unordered_map<int, int>> rev;\\n vec<pair<int, int>> pos;\\n vec<vec<nedge>> g;\\n\\n mf_graph(int _n) : n(_n), g(n), rev(n) {}\\n\\n int add_edge(int s, int t, T cap) {\\n int m = pos.size();\\n pos.push_back({s, g[s].size()});\\n int fi = g[s].size(); int ti = g[t].size();\\n if(s==t)ti++;\\n g[s].push_back(nedge{t, ti, cap});\\n g[t].push_back(nedge{s, fi, 0});\\n rev[s][t] = m;\\n return m;\\n }\\n\\n T flow(int s, int t, T flow_limit = numeric_limits<T>::max()) {\\n vec<int> lv(n), it(n, 0);\\n\\n auto bfs = [&]() {\\n queue<int> que;\\n fill(lv.begin(), lv.end(), -1);\\n lv[s] = 0;\\n que.push(s);\\n while(!que.empty()) {\\n int v = que.front();\\n que.pop();\\n\\n for(auto e : g[v]) {\\n if(e.cap == 0 || lv[e.to] >= 0) continue;\\n lv[e.to] = lv[v] + 1;\\n if(e.to == t) return;\\n que.push(e.to);\\n }\\n }\\n };\\n\\n auto dfs = [&](auto f, int v, T up) {\\n if(v==s) return up;\\n T res = 0;\\n int LV = lv[v];\\n for(int& i = it[v]; i < int(g[v].size()); i++) {\\n nedge& e = g[v][i];\\n if(LV <= lv[e.to] || g[e.to][e.rev].cap == 0) continue;\\n T d = f(f, e.to, min(up - res, g[e.to][e.rev].cap));\\n if(d <= 0) continue;\\n g[v][i].cap += d;\\n g[e.to][e.rev].cap -= d;\\n res += d;\\n if(res == up) return res;\\n }\\n lv[v] = n;\\n return res;\\n };\\n\\n T flow = 0;\\n while(flow < flow_limit) {\\n bfs();\\n if(lv[t] == -1) break;\\n fill(it.begin(), it.end(), 0);\\n T f = dfs(dfs, t, flow_limit - flow);\\n if(!f) break;\\n flow += f;\\n }\\n return flow;\\n }\\n\\n //以下、不要なら省略\\n\\n int get_id(int s, int t) {\\n return rev[s][t];\\n }\\n\\n edge get_edge(int i) {\\n int m = pos.size();\\n auto e = g[pos[i].first][pos[i].second];\\n auto re = g[e.to][e.rev];\\n return edge{pos[i].first, e.to, e.cap + re.cap, re.cap};\\n }\\n\\n void change_edge(int i, T nc, T nf) {\\n int m = pos.size();\\n auto& e = g[pos[i].first][pos[i].second];\\n auto& re = g[e.to][e.rev];\\n e.cap = nc - nf;\\n re.cap = nf;\\n }\\n\\n vec<bool> min_cut(int s) {\\n vec<bool> seen(n);\\n queue<int> que;\\n que.push(s);\\n while(!que.empty()) {\\n int p = que.front();\\n que.pop();\\n seen[p]=true;\\n for(auto e : g[p]) {\\n if(e.cap && !seen[e.to]) {\\n seen[e.to] = true;\\n que.push(e.to);\\n }\\n }\\n }\\n return seen;\\n }\\n\\n};\\n\\n\\n\\n/*\\n@brief Maxflow\\n@docs doc/maxflow.md\\n*/\\n\\nstruct mf_graph_with_lowerbound {\\n int n;\\n mf_graph<ll> mf;\\n int S, T;\\n ll sum;\\n vector<ll> lows, d;\\n ll total_flow;\\n\\n\\n mf_graph_with_lowerbound(int n) : n(n), mf(n+ 2), S(n), T(n + 1), sum(0), d(n, 0), total_flow(0) {\\n }\\n\\n\\n int add_edge(int from, int to, ll low, ll high) {\\n lows.push_back(low);\\n d[from] -= low;\\n d[to] += low;\\n return mf.add_edge(from, to, high - low);\\n }\\n\\n void build() {\\n rep(i, 0, n) {\\n if(d[i] > 0) {\\n mf.add_edge(S, i, d[i]);\\n sum += d[i];\\n }\\n else mf.add_edge(i, T, -d[i]);\\n }\\n }\\n\\n bool is_feasable(int s, int t) {\\n build();\\n mf.add_edge(t, s, LLONG_MAX / 4); // INF = LLONG_MAX / 4\\n total_flow += mf.flow(S, T);\\n return total_flow == sum;\\n }\\n\\n ll flow(int s, int t) {\\n if(is_feasable(s, t) == false) return -1;\\n mf.add_edge(S, s, LLONG_MAX / 4);\\n mf.add_edge(t, T, LLONG_MAX / 4);\\n return (total_flow += mf.flow(S, T)) - sum;\\n }\\n\\n vector<ll> output() {\\n vector<ll> res;\\n rep(i, 0, lows.size()) {\\n res.push_back(lows[i] + mf.get_edge(i).flow);\\n }\\n return res;\\n\\n }\\n};\\n\\n\\nint main() {\\n int n, m;\\n while(1) {\\n cin >> n >> m;\\n\\n if(n == 0) break;\\n\\n vector<pll> es;\\n rep(i, 0, m) {\\n int u, v;\\n cin >> u >> v;\\n u--, v--;\\n es.emplace_back(u, v);\\n }\\n\\n\\n int ans_m = -1;\\n int ans_M = -1;\\n\\n auto che = [&](int mi, int Mi) {\\n int s = n + m;\\n int t = s + 1;\\n\\n mf_graph_with_lowerbound mf(t + 1);\\n \\n\\n rep(i, 0, m) {\\n mf.add_edge(s, i, 1, 1);\\n mf.add_edge(i, m + es[i].first, 0, 1);\\n mf.add_edge(i, m + es[i].second, 0, 1);\\n }\\n\\n rep(i, 0, n) {\\n mf.add_edge(m + i, t, mi, Mi);\\n }\\n\\n if(mf.is_feasable(s, t)) {\\n return true;\\n }\\n else return false;\\n\\n };\\n\\n \\n ll w = 1e7;\\n rrep(mi, 0, n + 1) {\\n ll li = 0;\\n ll ri = m;\\n while(li < ri) {///xxxxoooo\\n ll mid = (li + ri) / 2;\\n if(che(mi, mi + mid)) {\\n ri = mid;\\n }\\n else {\\n li = mid + 1;\\n }\\n }\\n if(che(mi, mi + li) && chmin(w, li - mi)) {\\n ans_m = mi;\\n ans_M = mi + li;\\n\\n }\\n }\\n\\n cout << ans_m << \\\" \\\" << ans_M << endl;\\n }\\n \\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5360,\n \"memory_kb\": 5344,\n \"score_of_the_acc\": -1.9475,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1615_9474816\",\n \"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)), (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#include <unistd.h>\\n\\nnamespace fastio {\\nstatic constexpr uint32_t SZ = 1 << 17;\\nchar ibuf[SZ];\\nchar obuf[SZ];\\nchar out[100];\\n// pointer of ibuf, obuf\\n\\n\\nuint32_t pil = 0, pir = 0, por = 0;\\n\\nstruct Pre {\\n char num[10000][4];\\n constexpr Pre() : num() {\\n for (int i = 0; i < 10000; i++) {\\n int n = i;\\n for (int j = 3; j >= 0; j--) {\\n num[i][j] = n % 10 | '0';\\n n /= 10;\\n }\\n }\\n }\\n} constexpr pre;\\n\\ninline void load() {\\n memmove(ibuf, ibuf + pil, pir - pil);\\n pir = pir - pil + fread(ibuf + pir - pil, 1, SZ - pir + pil, stdin);\\n pil = 0;\\n if (pir < SZ)\\n ibuf[pir++] = '\\\\n';\\n}\\n\\ninline void flush() {\\n fwrite(obuf, 1, por, stdout);\\n por = 0;\\n}\\n\\nvoid rd(char &c) {\\n do {\\n if (pil + 1 > pir)\\n load();\\n c = ibuf[pil++];\\n } while (isspace(c));\\n}\\n\\nvoid rd(string &x) {\\n x.clear();\\n char c;\\n do {\\n if (pil + 1 > pir)\\n load();\\n c = ibuf[pil++];\\n } while (isspace(c));\\n do {\\n x += c;\\n if (pil == pir)\\n load();\\n c = ibuf[pil++];\\n } while (!isspace(c));\\n}\\n\\ntemplate <typename T> void rd_real(T &x) {\\n string s;\\n rd(s);\\n x = stod(s);\\n}\\n\\ntemplate <typename T> void rd_integer(T &x) {\\n if (pil + 100 > pir)\\n load();\\n char c;\\n do\\n c = ibuf[pil++];\\n while (c < '-');\\n bool minus = 0;\\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\\n if (c == '-') {\\n minus = 1, c = ibuf[pil++];\\n }\\n }\\n x = 0;\\n while ('0' <= c) {\\n x = x * 10 + (c & 15), c = ibuf[pil++];\\n }\\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\\n if (minus)\\n x = -x;\\n }\\n}\\n\\nvoid rd(int &x) {\\n rd_integer(x);\\n}\\nvoid rd(ll &x) {\\n rd_integer(x);\\n}\\nvoid rd(i128 &x) {\\n rd_integer(x);\\n}\\nvoid rd(uint &x) {\\n rd_integer(x);\\n}\\nvoid rd(ull &x) {\\n rd_integer(x);\\n}\\nvoid rd(u128 &x) {\\n rd_integer(x);\\n}\\nvoid rd(double &x) {\\n rd_real(x);\\n}\\nvoid rd(long double &x) {\\n rd_real(x);\\n}\\n\\ntemplate <class T, class U> void rd(pair<T, U> &p) {\\n return rd(p.first), rd(p.second);\\n}\\ntemplate <size_t N = 0, typename T> void rd_tuple(T &t) {\\n if constexpr (N < std::tuple_size<T>::value) {\\n auto &x = std::get<N>(t);\\n rd(x);\\n rd_tuple<N + 1>(t);\\n }\\n}\\ntemplate <class... T> void rd(tuple<T...> &tpl) {\\n rd_tuple(tpl);\\n}\\n\\ntemplate <size_t N = 0, typename T> void rd(array<T, N> &x) {\\n for (auto &d : x)\\n rd(d);\\n}\\ntemplate <class T> void rd(vector<T> &x) {\\n for (auto &d : x)\\n rd(d);\\n}\\n\\nvoid read() {}\\ntemplate <class H, class... T> void read(H &h, T &...t) {\\n rd(h), read(t...);\\n}\\n\\nvoid wt(const char c) {\\n if (por == SZ)\\n flush();\\n obuf[por++] = c;\\n}\\nvoid wt(const string s) {\\n for (char c : s)\\n wt(c);\\n}\\nvoid wt(const char *s) {\\n size_t len = strlen(s);\\n for (size_t i = 0; i < len; i++)\\n wt(s[i]);\\n}\\n\\ntemplate <typename T> void wt_integer(T x) {\\n if (por > SZ - 100)\\n flush();\\n if (x < 0) {\\n obuf[por++] = '-', x = -x;\\n }\\n int outi;\\n for (outi = 96; x >= 10000; outi -= 4) {\\n memcpy(out + outi, pre.num[x % 10000], 4);\\n x /= 10000;\\n }\\n if (x >= 1000) {\\n memcpy(obuf + por, pre.num[x], 4);\\n por += 4;\\n } else if (x >= 100) {\\n memcpy(obuf + por, pre.num[x] + 1, 3);\\n por += 3;\\n } else if (x >= 10) {\\n int q = (x * 103) >> 10;\\n obuf[por] = q | '0';\\n obuf[por + 1] = (x - q * 10) | '0';\\n por += 2;\\n } else\\n obuf[por++] = x | '0';\\n memcpy(obuf + por, out + outi + 4, 96 - outi);\\n por += 96 - outi;\\n}\\n\\ntemplate <typename T> void wt_real(T x) {\\n ostringstream oss;\\n oss << fixed << setprecision(15) << double(x);\\n string s = oss.str();\\n wt(s);\\n}\\n\\nvoid wt(int x) {\\n wt_integer(x);\\n}\\nvoid wt(ll x) {\\n wt_integer(x);\\n}\\nvoid wt(i128 x) {\\n wt_integer(x);\\n}\\nvoid wt(uint x) {\\n wt_integer(x);\\n}\\nvoid wt(ull x) {\\n wt_integer(x);\\n}\\nvoid wt(u128 x) {\\n wt_integer(x);\\n}\\nvoid wt(double x) {\\n wt_real(x);\\n}\\nvoid wt(long double x) {\\n wt_real(x);\\n}\\n\\ntemplate <class T, class U> void wt(const pair<T, U> val) {\\n wt(val.first);\\n wt(' ');\\n wt(val.second);\\n}\\ntemplate <size_t N = 0, typename T> void wt_tuple(const T t) {\\n if constexpr (N < std::tuple_size<T>::value) {\\n if constexpr (N > 0) {\\n wt(' ');\\n }\\n const auto x = std::get<N>(t);\\n wt(x);\\n wt_tuple<N + 1>(t);\\n }\\n}\\ntemplate <class... T> void wt(tuple<T...> tpl) {\\n wt_tuple(tpl);\\n}\\ntemplate <class T, size_t S> void wt(const array<T, S> val) {\\n auto n = val.size();\\n for (size_t i = 0; i < n; i++) {\\n if (i)\\n wt(' ');\\n wt(val[i]);\\n }\\n}\\ntemplate <class T> void wt(const vector<T> val) {\\n auto n = val.size();\\n for (size_t i = 0; i < n; i++) {\\n if (i)\\n wt(' ');\\n wt(val[i]);\\n }\\n}\\n\\nvoid print() {\\n wt('\\\\n');\\n}\\ntemplate <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {\\n wt(head);\\n if (sizeof...(Tail))\\n wt(' ');\\n print(forward<Tail>(tail)...);\\n}\\nvoid __attribute__((destructor)) _d() {\\n flush();\\n}\\n} // namespace fastio\\n\\n\\nusing fastio::flush;\\nusing fastio::print;\\nusing fastio::read;\\n\\ninline void first(bool i = true) {\\n print(i ? \\\"first\\\" : \\\"second\\\");\\n}\\ninline void Alice(bool i = true) {\\n print(i ? \\\"Alice\\\" : \\\"Bob\\\");\\n}\\ninline void Takahashi(bool i = true) {\\n print(i ? \\\"Takahashi\\\" : \\\"Aoki\\\");\\n}\\ninline void yes(bool i = true) {\\n print(i ? \\\"yes\\\" : \\\"no\\\");\\n}\\ninline void Yes(bool i = true) {\\n print(i ? \\\"Yes\\\" : \\\"No\\\");\\n}\\ninline void No() {\\n print(\\\"No\\\");\\n}\\ninline void YES(bool i = true) {\\n print(i ? \\\"YES\\\" : \\\"NO\\\");\\n}\\ninline void NO() {\\n print(\\\"NO\\\");\\n}\\ninline void Yay(bool i = true) {\\n print(i ? \\\"Yay!\\\" : \\\":(\\\");\\n}\\ninline void Possible(bool i = true) {\\n print(i ? \\\"Possible\\\" : \\\"Impossible\\\");\\n}\\ninline void POSSIBLE(bool i = true) {\\n print(i ? \\\"POSSIBLE\\\" : \\\"IMPOSSIBLE\\\");\\n}\\n\\n/**\\n * @brief Fast IO\\n */\\n\\nstruct MaxFlow {\\n struct Edge {\\n int to, rev;\\n ll cap;\\n };\\n int V;\\n vector<vector<Edge>> G;\\n vector<int> itr, level;\\n using P = pair<int, int>;\\n vector<P> es;\\n\\n public:\\n MaxFlow() {}\\n MaxFlow(int V) : V(V) {\\n G.assign(V, vector<Edge>());\\n }\\n int add_vertex() {\\n G.push_back(vector<Edge>());\\n return V++;\\n }\\n void add_edge(int from, int to, ll cap) {\\n int fid = SZ(G[from]), tid = SZ(G[to]);\\n if (from == to)\\n tid++;\\n es.push_back({from, fid});\\n G[from].push_back({to, tid, cap});\\n G[to].push_back({from, fid, 0});\\n }\\n struct Type {\\n int from, to;\\n ll cap, recap;\\n };\\n Type get_edge(int i) {\\n auto [from, pos] = es[i];\\n auto e = G[from][pos];\\n auto re = G[e.to][e.rev];\\n return Type{from, e.to, e.cap, re.cap};\\n }\\n void bfs(int s) {\\n level.assign(V, -1);\\n queue<int> q;\\n level[s] = 0;\\n q.push(s);\\n while (!q.empty()) {\\n int v = q.front();\\n q.pop();\\n for (auto &e : G[v]) {\\n if (e.cap > 0 && level[e.to] < 0) {\\n level[e.to] = level[v] + 1;\\n q.push(e.to);\\n }\\n }\\n }\\n }\\n ll dfs(int v, int t, ll f) {\\n if (v == t)\\n return f;\\n for (int &i = itr[v]; i < (int)G[v].size(); i++) {\\n Edge &e = G[v][i];\\n if (e.cap > 0 && level[v] < level[e.to]) {\\n ll d = dfs(e.to, t, min(f, e.cap));\\n if (d > 0) {\\n e.cap -= d, G[e.to][e.rev].cap += d;\\n return d;\\n }\\n }\\n }\\n return 0;\\n }\\n ll run(int s, int t) {\\n ll ret = 0, f;\\n while (bfs(s), level[t] >= 0) {\\n itr.assign(V, 0);\\n while ((f = dfs(s, t, INF)) > 0)\\n ret += f;\\n }\\n return ret;\\n }\\n vector<int> cut() {\\n vector<int> ret(V);\\n rep(v, 0, V) if (level[v] < 0) ret[v] = 1;\\n return ret;\\n }\\n};\\n\\n/**\\n * @brief Maximum Flow\\n */\\n\\ntemplate <class Cap, class Cost> struct MinCostFlow {\\n struct X {\\n int from, to;\\n Cap lb, ub, flow;\\n Cost cost;\\n };\\n struct Edge {\\n int to, rev;\\n Cap cap;\\n Cost cost;\\n };\\n using P = pair<int, int>;\\n int n, m;\\n vector<X> es;\\n vector<Cap> exc;\\n vector<Cost> dual;\\n vector<vector<Edge>> g;\\n Cost MX;\\n MinCostFlow(int _n) : n(_n), m(0), exc(n), dual(n), g(n), MX(0) {}\\n void add_edge(int from, int to, Cap lb, Cap ub, Cost cost) {\\n m++;\\n chmax(MX, cost);\\n chmax(MX, -cost);\\n es.push_back({from, to, lb, ub, 0, cost});\\n }\\n void add_excess(int v, Cap c) { exc[v] += c; }\\n pair<bool, Cost> run() {\\n MaxFlow mf(n + 2);\\n int S = n, T = n + 1;\\n Cap psum = 0, nsum = 0;\\n for (auto &e : es) {\\n exc[e.to] += e.lb;\\n exc[e.from] -= e.lb;\\n mf.add_edge(e.from, e.to, e.ub - e.lb);\\n }\\n rep(i, 0, n) {\\n if (exc[i] > 0) {\\n psum += exc[i];\\n mf.add_edge(S, i, exc[i]);\\n }\\n if (exc[i] < 0) {\\n nsum += -exc[i];\\n mf.add_edge(i, T, -exc[i]);\\n }\\n }\\n\\n if (psum != nsum or mf.run(S, T) != psum)\\n return {false, 0};\\n\\n using P = pair<int, int>;\\n vector<P> pos;\\n rep(i, 0, m) {\\n auto e = mf.get_edge(i);\\n Cost cost = es[i].cost * n;\\n int fid = SZ(g[e.from]), tid = SZ(g[e.to]);\\n if (e.from == e.to)\\n tid++;\\n pos.push_back({e.from, fid});\\n g[e.from].push_back({e.to, tid, (int)e.cap, cost});\\n g[e.to].push_back({e.from, fid, (int)e.recap, -cost});\\n }\\n\\n // solve\\n\\n Cost eps = MX * n + 1;\\n while (eps > 1) {\\n eps = max<Cost>(eps >> 2, 1);\\n refine(eps);\\n }\\n\\n Cost ret = 0;\\n rep(i, 0, m) {\\n auto [from, fid] = pos[i];\\n es[i].flow = es[i].ub - g[from][fid].cap;\\n ret += es[i].flow * es[i].cost;\\n }\\n dual.assign(n, 0);\\n for (;;) {\\n bool upd = 0;\\n rep(i, 0, n) {\\n for (auto &e : g[i])\\n if (e.cap) {\\n auto cost = dual[i] + e.cost / n;\\n if (chmin(dual[e.to], cost)) {\\n upd = 1;\\n }\\n }\\n }\\n if (!upd)\\n break;\\n }\\n return {true, ret};\\n }\\n Cap get_flow(int i) const { return es[i].flow; }\\n\\n private:\\n void refine(Cost &eps) {\\n exc.assign(n, 0);\\n vector<int> used(n);\\n queue<int> que;\\n vector<int> iter(n);\\n\\n auto cost = [&](int from, const Edge &e) {\\n return e.cost + dual[from] - dual[e.to];\\n };\\n auto push = [&](int from, Edge &e, Cap cap) {\\n exc[from] -= cap;\\n exc[e.to] += cap;\\n g[e.to][e.rev].cap += cap;\\n e.cap -= cap;\\n };\\n auto relabel = [&](int v) {\\n iter[v] = 0;\\n Cost down = MX * (n + 1);\\n for (auto &e : g[v])\\n if (e.cap) {\\n chmin(down, eps + cost(v, e));\\n }\\n dual[v] -= down;\\n que.push(v);\\n used[v] = 1;\\n };\\n\\n rep(i, 0, n) {\\n for (auto &e : g[i])\\n if (e.cap and cost(i, e) < 0) {\\n push(i, e, e.cap);\\n }\\n }\\n rep(i, 0, n) if (exc[i] > 0) {\\n used[i] = 1;\\n que.push(i);\\n }\\n while (!que.empty()) {\\n auto v = que.front();\\n que.pop();\\n used[v] = 0;\\n for (int &i = iter[v]; i < SZ(g[v]); i++) {\\n auto &e = g[v][i];\\n if (e.cap and cost(v, e) < 0) {\\n push(v, e, min(exc[v], e.cap));\\n if (!used[e.to] and exc[e.to] > 0) {\\n used[e.to] = 1;\\n que.push(e.to);\\n }\\n if (exc[v] == 0)\\n break;\\n }\\n }\\n if (exc[v] > 0) {\\n relabel(v);\\n }\\n }\\n eps = 0;\\n rep(i, 0, n) {\\n for (auto &e : g[i])\\n if (e.cap) {\\n chmax(eps, -cost(i, e));\\n }\\n }\\n }\\n};\\n\\n/**\\n * @brief Minimum Cost b-flow\\n */\\n\\nbool f(const pair<int,int>& P1, const pair<int,int>& P2) {\\n if (P1.second-P1.first != P2.second-P2.first) return P1.second-P1.first<P2.second-P2.first;\\n return P1.first > P2.first;\\n}\\n\\nint main() {\\nwhile(1) {\\n int N, M;\\n cin >> N >> M;\\n if (N == 0 && M == 0) return 0;\\n vector<int> U(M), V(M);\\n rep(i,0,M) cin >> U[i] >> V[i], U[i]--, V[i]--;\\n vector<pair<int,int>> Cand;\\n for (int L = 0, R = 0; L < N-1; L++) {\\n if (L > R) R = L;\\n for (; R < N; R++) {\\n MinCostFlow<int,int> G(N+M+2);\\n rep(i,0,N) {\\n G.add_edge(N+M,i,L,R,0);\\n }\\n rep(i,0,M) {\\n G.add_edge(U[i],i+N,0,1,0);\\n G.add_edge(V[i],i+N,0,1,0);\\n G.add_edge(i+N,N+M+1,0,1,0);\\n }\\n G.add_edge(N+M+1,N+M,0,M,-1);\\n auto [ok, ret] = G.run();\\n if (ok) {\\n if (ret == -M) {\\n break;\\n }\\n }\\n }\\n if (R == N) break;\\n Cand.push_back({L,R});\\n }\\n sort(ALL(Cand),f);\\n cout << Cand[0].first << ' ' << Cand[0].second << endl;\\n}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1110,\n \"memory_kb\": 5448,\n \"score_of_the_acc\": -1.2056,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1615_9372689\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing vll = vector<ll>;\\n#define rep(i,n) for(ll i=0;i<n;i++)\\n\\nvoid solve(ll N,ll M){\\n vector<vll> G(N,vll(N,0));\\n vll E(N,0);\\n rep(i,M){\\n ll U,V;\\n cin>>U>>V;\\n U--;V--;\\n G[U][V]=1;\\n E[V]++; \\n }\\n while(1){\\n ll m=1e18,M=-1e18;\\n ll mid=-1,Mid=-1;\\n rep(i,N){\\n if(E[i]<m){\\n m=E[i];\\n mid=i;\\n }\\n if(E[i]>M){\\n M=E[i];\\n Mid=i;\\n }\\n }\\n if(m==M||m+1==M)break;\\n \\n bool EX=0;\\n queue<ll> Q;\\n Q.push(mid);\\n vll dep(N,-1);\\n dep[mid]=0;\\n while(!Q.empty()){\\n ll p=Q.front();\\n Q.pop();\\n rep(i,N){\\n if(G[p][i]==1){\\n if(dep[i]!=-1)continue;\\n dep[i]=dep[p]+1;\\n Q.push(i);\\n }\\n }\\n }\\n rep(i,N){\\n if(dep[i]!=-1&&E[i]>=m+2){\\n ll x=i;\\n E[i]--;\\n E[mid]++;\\n while(x!=mid){\\n rep(j,N){\\n if(G[j][x]==1&&dep[j]==dep[x]-1){\\n G[x][j]=1;\\n G[j][x]=0;\\n x=j;\\n break;\\n }\\n }\\n }\\n EX=1;\\n break;\\n }\\n }\\n if(EX)continue;\\n \\n Q.push(Mid);\\n dep.assign(N,-1);\\n dep[Mid]=0;\\n while(!Q.empty()){\\n ll p=Q.front();\\n Q.pop();\\n rep(i,N){\\n if(G[i][p]==1){\\n if(dep[i]!=-1)continue;\\n dep[i]=dep[p]+1;\\n Q.push(i);\\n }\\n }\\n }\\n rep(i,N){\\n if(dep[i]!=-1&&E[i]<=M-2){\\n ll x=i;\\n E[i]++;\\n E[Mid]--;\\n while(x!=Mid){\\n rep(j,N){\\n if(G[x][j]==1&&dep[j]==dep[x]-1){\\n G[x][j]=0;\\n G[j][x]=1;\\n x=j;\\n break;\\n }\\n }\\n }\\n EX=1;\\n break;\\n }\\n }\\n if(EX)continue;\\n\\n break;\\n }\\n\\n sort(E.begin(),E.end());\\n cout<<E[0]<<\\\" \\\"<<E.back()<<endl;\\n\\n}\\n\\nint main() {\\n\\n ll H,W;\\n while (cin >> H>>W) {\\n if (H+W == 0)return 0;\\n solve(H,W);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 3468,\n \"score_of_the_acc\": -0.015,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1615_9365911\",\n \"code_snippet\": \"#line 2 \\\"cp-library/src/cp-template.hpp\\\"\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nusing i32 = int;\\nusing u32 = unsigned int;\\nusing i64 = long long;\\nusing u64 = unsigned long long;\\nusing i128 = __int128_t;\\ntemplate < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }\\ntemplate < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }\\ntemplate < class T, class U > T ceil (T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); }\\ntemplate < class T, class U > T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); }\\nint popcnt(i32 x) { return __builtin_popcount(x); }\\nint popcnt(u32 x) { return __builtin_popcount(x); }\\nint popcnt(i64 x) { return __builtin_popcountll(x); }\\nint popcnt(u64 x) { return __builtin_popcountll(x); }\\n\\n#line 2 \\\"cp-library/src/utility/rep_itr.hpp\\\"\\ntemplate < class T > struct itr_rep {\\n T i, d;\\n constexpr itr_rep(const T i) noexcept : i(i), d(1) {}\\n constexpr itr_rep(const T i, const T d) noexcept : i(i), d(d) {}\\n void operator++() noexcept { i += d; }\\n constexpr int operator*() const noexcept { return i; }\\n constexpr bool operator!=(const itr_rep x) const noexcept { return d > 0 ? i < x.i : i > x.i; }\\n};\\n\\ntemplate < class T > struct rep {\\n const itr_rep< T > s, t;\\n constexpr rep(const T t) noexcept : s(0), t(t) {}\\n constexpr rep(const T s, const T t) noexcept : s(s), t(t) {}\\n constexpr rep(const T s, const T t, const T d) noexcept : s(s, d), t(t, d) {}\\n constexpr auto begin() const noexcept { return s; }\\n constexpr auto end () const noexcept { return t; }\\n};\\n\\ntemplate < class T > struct revrep {\\n const itr_rep < T > s, t;\\n constexpr revrep(const T t) noexcept : s(t - 1, -1), t(-1, -1) {}\\n constexpr revrep(const T s, const T t) noexcept : s(t - 1, -1), t(s - 1, -1) {}\\n constexpr revrep(const T s, const T t, const T d) noexcept : s(t - 1, -d), t(s - 1, -d) {}\\n constexpr auto begin() const noexcept { return s; }\\n constexpr auto end () const noexcept { return t; }\\n};\\n#line 3 \\\"cp-library/src/utility/io.hpp\\\"\\n\\n/* 128bit integer */\\nistream& operator>>(istream& is, i128& x) {\\n std::string s; is >> s;\\n int pm = (s[0] == '-');\\n x = 0;\\n for(int i : rep(pm, int(s.size()))) x = x * 10 + (s[i] - '0');\\n if(pm) x *= -1;\\n return is;\\n}\\nostream& operator<<(ostream& os, const i128& x) {\\n if(x == 0) return os << '0';\\n i128 y = x;\\n if(y < 0) { os << '-'; y *= -1; }\\n std::vector<int> ny;\\n while(y > 0) { ny.push_back(y % 10); y /= 10; }\\n for(int i : revrep(ny.size())) os << ny[i];\\n return os;\\n}\\n\\ntemplate < class S, class T > istream& operator>>(istream& is, std::pair< S, T >& x) { is >> x.first >> x.second; return is; }\\ntemplate < class S, class T > ostream& operator<<(ostream& os, const std::pair< S, T >& x) { os << x.first << \\\" \\\" << x.second; return os; }\\n\\nnamespace scanner {\\n struct sca {\\n template < class T > operator T() {\\n T s; std::cin >> s; return s;\\n }\\n };\\n struct vec {\\n int n;\\n vec(int n) : n(n) {}\\n template < class T > operator std::vector< T >() {\\n std::vector< T > v(n);\\n for(T& x : v) std::cin >> x;\\n return v;\\n }\\n };\\n struct mat {\\n int h, w;\\n mat(int h, int w) : h(h), w(w) {}\\n template < class T > operator std::vector< std::vector< T > >() {\\n std::vector m(h, std::vector< T >(w));\\n for(std::vector< T >& v : m) for(T& x : v) std::cin >> x;\\n return m;\\n }\\n };\\n struct speedup {\\n speedup() {\\n std::cin.tie(0);\\n std::ios::sync_with_stdio(0);\\n }\\n } speedup_instance;\\n}\\nscanner::sca in() { return scanner::sca(); }\\nscanner::vec in(int n) { return scanner::vec(n); }\\nscanner::mat in(int h, int w) { return scanner::mat(h, w); }\\n\\nnamespace printer {\\n void precision(int d) { std::cout << std::fixed << std::setprecision(d); }\\n void flush() { std::cout.flush(); }\\n}\\n\\ntemplate < class T >\\nostream& operator<<(ostream& os, const std::vector< T > a) {\\n int n = a.size();\\n for(int i : rep(n)) { os << a[i]; if(i != n - 1) os << ' '; }\\n return os;\\n}\\n\\nint print() { std::cout << '\\\\n'; return 0; }\\ntemplate < class head, class... tail > int print(head&& h, tail&&... t) {\\n std::cout << h; if(sizeof...(tail)) std::cout << ' ';\\n return print(std::forward<tail>(t)...);\\n}\\ntemplate < class T > int print_n(const std::vector< T > a) {\\n int n = a.size();\\n for(int i : rep(n)) std::cout << a[i] << \\\"\\\\n\\\";\\n return 0;\\n}\\n\\n\\n#line 2 \\\"cp-library/src/utility/key_val.hpp\\\"\\n\\ntemplate < class K, class V >\\nstruct key_val {\\n K key; V val;\\n key_val() {}\\n key_val(K key, V val) : key(key), val(val) {}\\n template < std::size_t Index >\\n std::tuple_element_t< Index, key_val >& get() {\\n if constexpr (Index == 0) return key;\\n if constexpr (Index == 1) return val;\\n }\\n};\\n\\nnamespace std {\\n\\ntemplate < class K, class V > struct tuple_size < key_val< K, V > > : integral_constant< size_t, 2 > {};\\ntemplate < class K, class V > struct tuple_element < 0, key_val< K, V > > { using type = K; };\\ntemplate < class K, class V > struct tuple_element < 1, key_val< K, V > > { using type = V; };\\n\\n}\\n#line 2 \\\"cp-library/src/utility/vec_op.hpp\\\"\\ntemplate < class T > key_val< int, T > max_of(const vector< T >& a) {\\n int i = std::max_element(a.begin(), a.end()) - a.begin();\\n return {i, a[i]};\\n}\\ntemplate < class T > key_val< int, T > min_of(const vector< T >& a) {\\n int i = std::min_element(a.begin(), a.end()) - a.begin();\\n return {i, a[i]};\\n}\\ntemplate < class S, class T > S sum_of(const vector< T >& a) {\\n S sum = 0;\\n for(const T x : a) sum += x;\\n return sum;\\n}\\ntemplate < class S, class T > vector< S > freq_of(const vector< T >& a, T L, T R) {\\n vector< S > res(R - L, S(0));\\n for(const T x : a) res[x - L] += 1;\\n return res;\\n}\\ntemplate < class S, class T > struct prefix_sum {\\n vector< S > s;\\n prefix_sum(const vector< T >& a) : s(a) {\\n s.insert(s.begin(), S(0));\\n for(int i : rep(a.size())) s[i + 1] += s[i];\\n }\\n // [L, R)\\n S sum(int L, int R) { return s[R] - s[L]; }\\n};\\n#line 3 \\\"cp-library/src/utility/heap.hpp\\\"\\n\\ntemplate < class T > using heap_min = std::priority_queue< T, std::vector< T >, std::greater< T > >;\\ntemplate < class T > using heap_max = std::priority_queue< T, std::vector< T >, std::less< T > >;\\n\\n#line 27 \\\"cp-library/src/cp-template.hpp\\\"\\n\\n#line 1 \\\"cp-library/src/algorithm/bin_search.hpp\\\"\\ntemplate < class T, class F >\\nT bin_search(T ok, T ng, F f) {\\n while(abs(ng - ok) > 1) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n\\ntemplate < class T, class F >\\nT bin_search_real(T ok, T ng, F f, int step = 80) {\\n while(step--) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n#line 2 \\\"cp-library/src/algorithm/argsort.hpp\\\"\\n\\ntemplate < class T > std::vector< int > argsort(const std::vector< T > &a) {\\n std::vector< int > ids((int)a.size());\\n std::iota(ids.begin(), ids.end(), 0);\\n std::sort(ids.begin(), ids.end(), [&](int i, int j) {\\n return a[i] < a[j] || (a[i] == a[j] && i < j);\\n });\\n return ids;\\n}\\n#line 1 \\\"macro.hpp\\\"\\nnamespace macro {\\n\\nusing size_type = int;\\ntemplate < class container > void sort(container& a) { std::sort(std:: begin(a), std:: end(a)); }\\ntemplate < class container > void rsort(container& a) { std::sort(std::rbegin(a), std::rend(a)); }\\ntemplate < class container > void reverse(container& a) { std::reverse(std::begin(a), std::end(a)); }\\ntemplate < class container > void unique(container& a) {\\n std::sort(std::begin(a), std::end(a));\\n a.erase(std::unique(std::begin(a), std::end(a)), std::end(a));\\n}\\ntemplate < class container > container sorted(const container& a) { container b = a; sort(b); return std::move(b); }\\ntemplate < class container > container rsorted(const container& a) { container b = a; rsort(b); return std::move(b); }\\ntemplate < class container, class compare > void sort(container& a, const compare& cmp) { std::sort(std::begin(a), std::end(a), cmp); }\\ntemplate < class container, class compare > container sorted(const container& a, const compare& cmp) { container b = a; sort(b, cmp); return std::move(b); }\\ntemplate < class container, class value > size_type lower_bound(const container& a, const value& x) { return std::lower_bound(std::begin(a), std::end(a), x) - std::begin(a); }\\ntemplate < class container, class value > size_type upper_bound(const container& a, const value& x) { return std::upper_bound(std::begin(a), std::end(a), x) - std::begin(a); }\\n\\nconst std::vector<std::pair<size_type, size_type>> dir4 = { {+1, 0}, {-1, 0}, { 0, +1}, { 0, -1} };\\nconst std::vector<std::pair<size_type, size_type>> dir8 = { {-1, -1}, {-1, 0}, {-1, +1}, { 0, -1}, { 0, +1}, {+1, -1}, {+1, 0}, {+1, +1} };\\n\\n#ifdef _DEBUG\\n#define debug(x) std::cout << \\\"[\\\" << __LINE__ << \\\"] \\\" << #x << \\\": \\\" << x << std::endl\\n#else\\n#define debug(x)\\n#endif\\n\\ntemplate < class container > void concat(container& a, const container& b) {\\n a.insert(std::end(a), std::begin(b), std::end(b));\\n}\\nstd::vector<size_type> iota(const size_type n) {\\n std::vector<size_type> I(n);\\n std::iota(std::begin(I), std::end(I), 0);\\n return I;\\n}\\ntemplate < class container > std::vector<size_type> sort_idx(const container& a) {\\n const size_type n = a.size();\\n std::vector<size_type> I = iota(n);\\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return a[i] < a[j] or (a[i] == a[j] and i < j); });\\n return I;\\n}\\ntemplate < class container, class compare > std::vector<size_type> sort_idx(const container& a, const compare& cmp) {\\n const size_type n = a.size();\\n std::vector<size_type> I = iota(n);\\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return cmp(a[i], a[j]) or (a[i] == a[j] and i < j); });\\n return std::move(I);\\n}\\n\\nstruct grid {\\n using size_type = int;\\n size_type H, W;\\n grid(const size_type H, const size_type W) : H(H), W(W) {}\\n bool contains(const size_type i, const size_type j) {\\n return 0 <= i and i < H and 0 <= j and j < W;\\n }\\n};\\n\\nusing f64 = long double;\\n\\ntemplate < class T > vector< T >& operator++(vector< T >& a) { for(T& x : a) x++; return a; }\\ntemplate < class T > vector< T >& operator--(vector< T >& a) { for(T& x : a) x--; return a; }\\ntemplate < class T > vector< T > operator++(vector< T >& a, signed) { vector< T > res = a; for(T& x : a) x++; return res; }\\ntemplate < class T > vector< T > operator--(vector< T >& a, signed) { vector< T > res = a; for(T& x : a) x--; return res; }\\n\\n} // namespace macro\\n\\nusing namespace macro;\\n#line 3 \\\"A.cpp\\\"\\n\\n#line 1 \\\"cp-library/src/graph/max_flow.hpp\\\"\\ntemplate < class Cap > struct mf_graph {\\n public:\\n explicit mf_graph(int n) : n(n), g(n) {}\\n \\n int add_edge(int from, int to, Cap cap) {\\n assert(0 <= from and from < n);\\n assert(0 <= to and to < n);\\n assert(0 <= cap);\\n int m = pos.size();\\n pos.push_back({from, g[from].size()});\\n int from_id = g[from].size();\\n int to_id = g[to].size() + (from == to);\\n g[from].push_back(_edge{to, to_id, cap});\\n g[to].push_back(_edge{from, from_id, 0});\\n return m;\\n }\\n\\n struct edge {\\n int from, to; Cap cap, flow;\\n };\\n\\n edge get_edge(int i) {\\n int m = pos.size();\\n assert(0 <= i and i < m);\\n _edge e = g[pos[i].first][pos[i].second];\\n _edge r = g[e.to][e.rev];\\n return edge{pos[i].first, e.to, e.cap + r.cap, r.cap};\\n }\\n\\n vector<edge> edges() {\\n int m = pos.size();\\n vector<edge> res(m);\\n for(int i : rep(m)) res[i] = get_edge(i);\\n return res;\\n }\\n\\n void change_edge(int i, Cap cap, Cap flow) {\\n int m = pos.size();\\n assert(0 <= i and i < m);\\n assert(0 <= flow and flow <= cap);\\n _edge& e = g[pos[i].first][pos[i].second];\\n _edge& r = g[e.to][e.rev];\\n e.cap = cap - flow;\\n r.cap = flow;\\n }\\n\\n Cap flow(int s, int t, Cap flow_limit) {\\n assert(0 <= s and s < n);\\n assert(0 <= t and t < n);\\n assert(s != t);\\n\\n vector<int> level(n), iter(n);\\n auto bfs = [&]() {\\n fill(level.begin(), level.end(), -1);\\n level[s] = 0;\\n queue<int> q;\\n q.push(s);\\n while(not q.empty()) {\\n int v = q.front(); q.pop();\\n for(_edge e : g[v]) {\\n if(e.cap == 0 or level[e.to] >= 0) continue;\\n level[e.to] = level[v] + 1;\\n if(e.to == t) return;\\n q.push(e.to);\\n }\\n }\\n };\\n\\n auto dfs = [&](auto self, int v, Cap up) {\\n if(v == s) return up;\\n Cap res = 0;\\n int level_v = level[v];\\n for(int& i = iter[v]; i < int(g[v].size()); i++) {\\n _edge& e = g[v][i];\\n if(level_v <= level[e.to] or g[e.to][e.rev].cap == 0) continue;\\n Cap d = self(self, e.to, min(up - res, g[e.to][e.rev].cap));\\n if(d <= 0) continue;\\n g[v][i].cap += d;\\n g[e.to][e.rev].cap -= d;\\n res += d;\\n if(res == up) return res;\\n }\\n level[v] = n;\\n return res;\\n };\\n\\n Cap flow = 0;\\n while(flow < flow_limit) {\\n bfs();\\n if(level[t] == -1) break;\\n fill(iter.begin(), iter.end(), 0);\\n Cap f = dfs(dfs, t, flow_limit - flow);\\n if(f == 0) break;\\n flow += f;\\n }\\n return flow;\\n }\\n\\n Cap flow(int s, int t) {\\n return flow(s, t, numeric_limits<Cap>::max());\\n }\\n\\n vector<int> min_cut(int s) {\\n vector<int> visited(n, 0);\\n queue<int> q;\\n q.push(s);\\n while(not q.empty()) {\\n int p = q.front(); q.pop();\\n visited[p] = 1;\\n for(_edge e : g[p]) {\\n if(e.cap && not visited[e.to]) {\\n visited[e.to] = 1;\\n q.push(e.to);\\n }\\n }\\n }\\n return visited;\\n }\\n\\n private:\\n int n;\\n struct _edge {\\n int to, rev; Cap cap;\\n };\\n vector<pair<int,int>> pos;\\n vector<vector<_edge>> g;\\n};\\n#line 5 \\\"A.cpp\\\"\\n\\npair<int,int> solve(int n, int m) {\\n vector<pair<int,int>> e(m);\\n for(auto &[u, v] : e) u = in(), v = in(), u--, v--;\\n\\n auto f = [&](int L, int R) -> bool {\\n mf_graph<int> g(n + m + 4);\\n const int S = n + m + 0, T = n + m + 1;\\n const int SS = n + m + 2, TT = n + m + 3;\\n auto V = [&](int i) { return i; };\\n auto E = [&](int i) { return n + i; };\\n for(int i : rep(m)) {\\n auto [u, v] = e[i];\\n g.add_edge(V(u), E(i), 1);\\n g.add_edge(V(v), E(i), 1);\\n g.add_edge(E(i), T, 1);\\n }\\n for(int v : rep(n)) {\\n g.add_edge(S, V(v), R - L);\\n g.add_edge(SS, V(v), L);\\n g.add_edge(S, TT, L);\\n }\\n const int SSTT = g.flow(SS, TT);\\n const int STT = g.flow(S , TT);\\n const int SST = g.flow(SS, T );\\n const int ST = g.flow(S , T );\\n return STT + ST == m;\\n };\\n\\n int ansL = 0, ansR = n;\\n for(int L = 0, R = 0; R <= n; R++) {\\n while(L <= R and f(L, R)) {\\n tie(ansL, ansR) = make_pair(L, R);\\n L++;\\n }\\n }\\n return {ansL, ansR};\\n}\\n\\nint main() {\\n while(true) {\\n int n = in(), m = in();\\n if(make_pair(n, m) == make_pair(0, 0)) return 0;\\n auto [l, h] = solve(n, m);\\n print(l, h);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 300,\n \"memory_kb\": 4268,\n \"score_of_the_acc\": -0.4582,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1615_9340556\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <map>\\n#include <queue>\\n#include <set>\\nusing namespace std;\\ntypedef long long ll;\\n#define rep(i, n) for(int i = 0; i < (n); i++)\\n\\ntemplate<class T>\\nusing vi = vector<T>;\\n\\ntemplate<class T>\\nusing vii = vector<vi<T>>;\\n\\ntemplate<class T>\\nusing viii = vector<vii<T>>;\\n\\nstruct Dinic {\\nprivate:\\n const long long inf = 1e18;\\n vector<int> dist; //sからの距離\\n vector<int> iter; //どこまで調べたか\\npublic:\\n struct edge {\\n int to, rev; long long cap;\\n edge(int t = 0, int r = 0, long long c = 0LL) : to(t), rev(r), cap(c) {}\\n };\\n\\n int n;\\n vector<vector<edge>> to;\\n\\n Dinic(int n_ = 1) : n(n_), to(n_), dist(n_), iter(n_) {}\\n\\n void addedge(int u, int v, long long cap) {//u->vにcapの容量\\n int su = (int)to[u].size(), sv = (int)to[v].size();\\n to[u].push_back({ v, sv, cap });\\n to[v].push_back({ u, su, 0 });\\n }\\n\\n long long dfs(int v, int t, long long f) { //t: 終点, f: flow\\n if (v == t) return f;\\n int sv = (int)to[v].size();\\n for (int& i = iter[v]; i < sv; i++) {\\n edge& nv = to[v][i];\\n if (dist[nv.to] <= dist[v] || nv.cap == 0) continue; //here\\n long long nf = dfs(nv.to, t, min(f, nv.cap));\\n if (nf > 0) {\\n nv.cap -= nf;\\n to[nv.to][nv.rev].cap += nf;\\n return nf;\\n }\\n }\\n return 0;\\n }\\n\\n void bfs(int s) {\\n dist.assign(n, -1);\\n queue<int> q;\\n q.push(s);\\n dist[s] = 0;\\n while (!q.empty()) {\\n int v = q.front();\\n q.pop();\\n for (auto nv : to[v]) {\\n if (nv.cap > 0 && dist[nv.to] < 0) {\\n dist[nv.to] = dist[v] + 1;\\n q.push(nv.to);\\n }\\n }\\n }\\n }\\n\\n long long maxflow(int s, int t) {//s:始点, t:終点\\n long long res = 0, flow = 0;\\n while (true) {\\n bfs(s);\\n if (dist[t] < 0) break;\\n\\n iter.assign(n, 0);\\n while (flow = dfs(s, t, inf)) res += flow;\\n };\\n return res;\\n }\\n};\\n\\nint main() \\n{\\n vi<pair<int, int>> ans;\\n int n, m;\\n while (cin >> n >> m, n) {\\n vi<int> u(m), v(m);\\n rep(i, m) cin >> u[i] >> v[i];\\n rep(i, m) u[i]--;\\n rep(i, m) v[i]--;\\n\\n int high = n, low = 0;\\n int S = n + m, T = S + 1, T2 = S + 2;\\n\\n auto f = [&](int h, int l) {\\n Dinic dn(n + m + 3);\\n rep(i, m) dn.addedge(S, i, 1);\\n rep(i, m) {\\n dn.addedge(i, m + u[i], 1);\\n dn.addedge(i, m + v[i], 1);\\n }\\n rep(i, n) {\\n dn.addedge(m + i, T, h);\\n //dn.addedge(T, m + i, l);\\n dn.addedge(m + i, T2, l);\\n }\\n return dn;\\n };\\n\\n rep(l, n + 1) {\\n for(int h = l; h <= min(n, l + high - low); h++) {\\n Dinic dn = f(h, l);\\n \\n int flow = dn.maxflow(S, T);\\n if (flow < m) continue;\\n\\n int flow_l = dn.maxflow(T, T2);\\n if (flow_l < l * n) continue;\\n\\n if (h - l <= high - low) {\\n high = h;\\n low = l;\\n break;\\n }\\n }\\n }\\n ans.push_back({ low, high });\\n }\\n for (auto elem : ans) cout << elem.first << \\\" \\\" << elem.second << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1810,\n \"memory_kb\": 4000,\n \"score_of_the_acc\": -0.6051,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1615_9340542\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <map>\\n#include <queue>\\n#include <set>\\nusing namespace std;\\ntypedef long long ll;\\n#define rep(i, n) for(int i = 0; i < (n); i++)\\n\\ntemplate<class T>\\nusing vi = vector<T>;\\n\\ntemplate<class T>\\nusing vii = vector<vi<T>>;\\n\\ntemplate<class T>\\nusing viii = vector<vii<T>>;\\n\\nstruct Dinic {\\nprivate:\\n const long long inf = 1e18;\\n vector<int> dist; //sからの距離\\n vector<int> iter; //どこまで調べたか\\npublic:\\n struct edge {\\n int to, rev; long long cap;\\n edge(int t = 0, int r = 0, long long c = 0LL) : to(t), rev(r), cap(c) {}\\n };\\n\\n int n;\\n vector<vector<edge>> to;\\n\\n Dinic(int n_ = 1) : n(n_), to(n_), dist(n_), iter(n_) {}\\n\\n void addedge(int u, int v, long long cap) {//u->vにcapの容量\\n int su = (int)to[u].size(), sv = (int)to[v].size();\\n to[u].push_back({ v, sv, cap });\\n to[v].push_back({ u, su, 0 });\\n }\\n\\n long long dfs(int v, int t, long long f) { //t: 終点, f: flow\\n if (v == t) return f;\\n int sv = (int)to[v].size();\\n for (int& i = iter[v]; i < sv; i++) {\\n edge& nv = to[v][i];\\n if (dist[nv.to] <= dist[v] || nv.cap == 0) continue; //here\\n long long nf = dfs(nv.to, t, min(f, nv.cap));\\n if (nf > 0) {\\n nv.cap -= nf;\\n to[nv.to][nv.rev].cap += nf;\\n return nf;\\n }\\n }\\n return 0;\\n }\\n\\n void bfs(int s) {\\n dist.assign(n, -1);\\n queue<int> q;\\n q.push(s);\\n dist[s] = 0;\\n while (!q.empty()) {\\n int v = q.front();\\n q.pop();\\n for (auto nv : to[v]) {\\n if (nv.cap > 0 && dist[nv.to] < 0) {\\n dist[nv.to] = dist[v] + 1;\\n q.push(nv.to);\\n }\\n }\\n }\\n }\\n\\n long long maxflow(int s, int t) {//s:始点, t:終点\\n long long res = 0, flow = 0;\\n while (true) {\\n bfs(s);\\n if (dist[t] < 0) break;\\n\\n iter.assign(n, 0);\\n while (flow = dfs(s, t, inf)) res += flow;\\n };\\n return res;\\n }\\n};\\n\\nint main() \\n{\\n vi<pair<int, int>> ans;\\n int n, m;\\n while (cin >> n >> m, n) {\\n vi<int> u(m), v(m);\\n rep(i, m) cin >> u[i] >> v[i];\\n rep(i, m) u[i]--;\\n rep(i, m) v[i]--;\\n\\n int high = n, low = 0;\\n int S = n + m, T = S + 1, T2 = S + 2;\\n\\n auto f = [&](int h, int l) {\\n Dinic dn(n + m + 3);\\n rep(i, m) dn.addedge(S, i, 1);\\n rep(i, m) {\\n dn.addedge(i, m + u[i], 1);\\n dn.addedge(i, m + v[i], 1);\\n }\\n rep(i, n) {\\n dn.addedge(m + i, T, h);\\n //dn.addedge(T, m + i, l);\\n dn.addedge(m + i, T2, l);\\n }\\n return dn;\\n };\\n\\n rep(l, n + 1) {\\n for(int h = l; h <= min(n, l + high - low); h++) {\\n Dinic dn = f(h, l);\\n \\n int flow = dn.maxflow(S, T);\\n if (flow < m) continue;\\n\\n int flow_l = dn.maxflow(T, T2);\\n if (flow_l < l * n) continue;\\n\\n if (h - l <= high - low) {\\n high = h;\\n low = l;\\n break;\\n }\\n }\\n }\\n ans.push_back({ low, high });\\n }\\n for (auto elem : ans) cout << elem.first << \\\" \\\" << elem.second << endl;\\n\\treturn 0;\\n}\\n\\n\\n//\\n//struct edge {\\n// int to, cap, rev;\\n//};\\n//\\n//int main()\\n//{\\n// vi<pair<int, int>> ans;\\n// int n, m;\\n// while (cin >> n >> m, n) {\\n// vii<edge> to(n);\\n// vi<int> deg(n);\\n// rep(i, m) {\\n// int u, v;\\n// cin >> u >> v;\\n// u--, v--;\\n// int su = (int)to[u].size();\\n// int sv = (int)to[v].size();\\n// to[u].push_back({ v, 0, sv });\\n// to[v].push_back({ u, 1, su });\\n// deg[u]++;\\n// }\\n//\\n// map<int, set<int>> mp;\\n// rep(i, n) mp[deg[i]].insert(i);\\n//\\n// vi<bool> visited(n);\\n// auto dfs = [&](auto dfs, int s, int v, int mn = 0)->bool {\\n// visited[v] = true;\\n// if ((!mn && deg[s] + 2 <= deg[v]) \\n// || (mn && deg[v] + 2 <= deg[s])) {\\n// mp[deg[v]].erase(v);\\n// mp[deg[s]].erase(s);\\n// if ((int)mp[deg[v]].size() == 0) mp.erase(deg[v]);\\n// if ((int)mp[deg[s]].size() == 0) mp.erase(deg[s]);\\n//\\n// if (!mn) {\\n// deg[v]--;\\n// deg[s]++;\\n// }\\n// else {\\n// deg[v]++;\\n// deg[s]--;\\n// }\\n//\\n// mp[deg[v]].insert(v);\\n// mp[deg[s]].insert(s);\\n// return true;\\n// }\\n// for (auto& elem : to[v]) {\\n// if (elem.cap == mn || visited[elem.to]) continue;\\n// if (dfs(dfs, s, elem.to, mn)) {\\n// elem.cap = mn;\\n// to[elem.to][elem.rev].cap = 1 - mn;\\n// return true;\\n// }\\n// }\\n// return false;\\n// };\\n//\\n// bool ok = true;\\n// while (ok) {\\n// ok = false;\\n// for (int v : mp.begin()->second) {\\n// visited.assign(n, false);\\n// ok = dfs(dfs, v, v);\\n// if (ok) break;\\n// }\\n//\\n// if (ok) continue;\\n//\\n// for (int v : mp.rbegin()->second) {\\n// visited.assign(n, false);\\n// ok = dfs(dfs, v, v, 1);\\n// if (ok) break;\\n// }\\n// }\\n// ans.push_back({ mp.begin()->first, mp.rbegin()->first });\\n// }\\n//\\n// for (auto elem : ans) cout << elem.first << \\\" \\\" << elem.second << endl;\\n// return 0;\\n//}\",\n \"accuracy\": 1,\n \"time_ms\": 1800,\n \"memory_kb\": 4112,\n \"score_of_the_acc\": -0.6598,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1615_9340540\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <map>\\n#include <queue>\\n#include <set>\\nusing namespace std;\\ntypedef long long ll;\\n#define rep(i, n) for(int i = 0; i < (n); i++)\\n\\ntemplate<class T>\\nusing vi = vector<T>;\\n\\ntemplate<class T>\\nusing vii = vector<vi<T>>;\\n\\ntemplate<class T>\\nusing viii = vector<vii<T>>;\\n\\nstruct Dinic {\\nprivate:\\n const long long inf = 1e18;\\n vector<int> dist; //sからの距離\\n vector<int> iter; //どこまで調べたか\\npublic:\\n struct edge {\\n int to, rev; long long cap;\\n edge(int t = 0, int r = 0, long long c = 0LL) : to(t), rev(r), cap(c) {}\\n };\\n\\n int n;\\n vector<vector<edge>> to;\\n\\n Dinic(int n_ = 1) : n(n_), to(n_), dist(n_), iter(n_) {}\\n\\n void addedge(int u, int v, long long cap) {//u->vにcapの容量\\n int su = (int)to[u].size(), sv = (int)to[v].size();\\n to[u].push_back({ v, sv, cap });\\n to[v].push_back({ u, su, 0 });\\n }\\n\\n long long dfs(int v, int t, long long f) { //t: 終点, f: flow\\n if (v == t) return f;\\n int sv = (int)to[v].size();\\n for (int& i = iter[v]; i < sv; i++) {\\n edge& nv = to[v][i];\\n if (dist[nv.to] <= dist[v] || nv.cap == 0) continue; //here\\n long long nf = dfs(nv.to, t, min(f, nv.cap));\\n if (nf > 0) {\\n nv.cap -= nf;\\n to[nv.to][nv.rev].cap += nf;\\n return nf;\\n }\\n }\\n return 0;\\n }\\n\\n void bfs(int s) {\\n dist.assign(n, -1);\\n queue<int> q;\\n q.push(s);\\n dist[s] = 0;\\n while (!q.empty()) {\\n int v = q.front();\\n q.pop();\\n for (auto nv : to[v]) {\\n if (nv.cap > 0 && dist[nv.to] < 0) {\\n dist[nv.to] = dist[v] + 1;\\n q.push(nv.to);\\n }\\n }\\n }\\n }\\n\\n long long maxflow(int s, int t) {//s:始点, t:終点\\n long long res = 0, flow = 0;\\n while (true) {\\n bfs(s);\\n if (dist[t] < 0) break;\\n\\n iter.assign(n, 0);\\n while (flow = dfs(s, t, inf)) res += flow;\\n };\\n return res;\\n }\\n};\\n\\nint main() \\n{\\n vi<pair<int, int>> ans;\\n int n, m;\\n while (cin >> n >> m, n) {\\n vi<int> u(m), v(m);\\n rep(i, m) cin >> u[i] >> v[i];\\n rep(i, m) u[i]--;\\n rep(i, m) v[i]--;\\n\\n int high = m + 1, low = 0;\\n int S = n + m, T = S + 1, T2 = S + 2;\\n\\n auto f = [&](int h, int l) {\\n Dinic dn(n + m + 3);\\n rep(i, m) dn.addedge(S, i, 1);\\n rep(i, m) {\\n dn.addedge(i, m + u[i], 1);\\n dn.addedge(i, m + v[i], 1);\\n }\\n rep(i, n) {\\n dn.addedge(m + i, T, h);\\n //dn.addedge(T, m + i, l);\\n dn.addedge(m + i, T2, l);\\n }\\n return dn;\\n };\\n\\n rep(l, n + 1) {\\n for(int h = l; h <= min(n, l + high - low); h++) {\\n Dinic dn = f(h, l);\\n \\n int flow = dn.maxflow(S, T);\\n if (flow < m) continue;\\n\\n int flow_l = dn.maxflow(T, T2);\\n if (flow_l < l * n) continue;\\n\\n if (h - l <= high - low) {\\n high = h;\\n low = l;\\n break;\\n }\\n }\\n }\\n ans.push_back({ low, high });\\n }\\n for (auto elem : ans) cout << elem.first << \\\" \\\" << elem.second << endl;\\n\\treturn 0;\\n}\\n\\n\\n//\\n//struct edge {\\n// int to, cap, rev;\\n//};\\n//\\n//int main()\\n//{\\n// vi<pair<int, int>> ans;\\n// int n, m;\\n// while (cin >> n >> m, n) {\\n// vii<edge> to(n);\\n// vi<int> deg(n);\\n// rep(i, m) {\\n// int u, v;\\n// cin >> u >> v;\\n// u--, v--;\\n// int su = (int)to[u].size();\\n// int sv = (int)to[v].size();\\n// to[u].push_back({ v, 0, sv });\\n// to[v].push_back({ u, 1, su });\\n// deg[u]++;\\n// }\\n//\\n// map<int, set<int>> mp;\\n// rep(i, n) mp[deg[i]].insert(i);\\n//\\n// vi<bool> visited(n);\\n// auto dfs = [&](auto dfs, int s, int v, int mn = 0)->bool {\\n// visited[v] = true;\\n// if ((!mn && deg[s] + 2 <= deg[v]) \\n// || (mn && deg[v] + 2 <= deg[s])) {\\n// mp[deg[v]].erase(v);\\n// mp[deg[s]].erase(s);\\n// if ((int)mp[deg[v]].size() == 0) mp.erase(deg[v]);\\n// if ((int)mp[deg[s]].size() == 0) mp.erase(deg[s]);\\n//\\n// if (!mn) {\\n// deg[v]--;\\n// deg[s]++;\\n// }\\n// else {\\n// deg[v]++;\\n// deg[s]--;\\n// }\\n//\\n// mp[deg[v]].insert(v);\\n// mp[deg[s]].insert(s);\\n// return true;\\n// }\\n// for (auto& elem : to[v]) {\\n// if (elem.cap == mn || visited[elem.to]) continue;\\n// if (dfs(dfs, s, elem.to, mn)) {\\n// elem.cap = mn;\\n// to[elem.to][elem.rev].cap = 1 - mn;\\n// return true;\\n// }\\n// }\\n// return false;\\n// };\\n//\\n// bool ok = true;\\n// while (ok) {\\n// ok = false;\\n// for (int v : mp.begin()->second) {\\n// visited.assign(n, false);\\n// ok = dfs(dfs, v, v);\\n// if (ok) break;\\n// }\\n//\\n// if (ok) continue;\\n//\\n// for (int v : mp.rbegin()->second) {\\n// visited.assign(n, false);\\n// ok = dfs(dfs, v, v, 1);\\n// if (ok) break;\\n// }\\n// }\\n// ans.push_back({ mp.begin()->first, mp.rbegin()->first });\\n// }\\n//\\n// for (auto elem : ans) cout << elem.first << \\\" \\\" << elem.second << endl;\\n// return 0;\\n//}\",\n \"accuracy\": 1,\n \"time_ms\": 1810,\n \"memory_kb\": 4112,\n \"score_of_the_acc\": -0.6617,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1615_9340539\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <map>\\n#include <queue>\\n#include <set>\\nusing namespace std;\\ntypedef long long ll;\\n#define rep(i, n) for(int i = 0; i < (n); i++)\\n\\ntemplate<class T>\\nusing vi = vector<T>;\\n\\ntemplate<class T>\\nusing vii = vector<vi<T>>;\\n\\ntemplate<class T>\\nusing viii = vector<vii<T>>;\\n\\nstruct Dinic {\\nprivate:\\n const long long inf = 1e18;\\n vector<int> dist; //sからの距離\\n vector<int> iter; //どこまで調べたか\\npublic:\\n struct edge {\\n int to, rev; long long cap;\\n edge(int t = 0, int r = 0, long long c = 0LL) : to(t), rev(r), cap(c) {}\\n };\\n\\n int n;\\n vector<vector<edge>> to;\\n\\n Dinic(int n_ = 1) : n(n_), to(n_), dist(n_), iter(n_) {}\\n\\n void addedge(int u, int v, long long cap) {//u->vにcapの容量\\n int su = (int)to[u].size(), sv = (int)to[v].size();\\n to[u].push_back({ v, sv, cap });\\n to[v].push_back({ u, su, 0 });\\n }\\n\\n long long dfs(int v, int t, long long f) { //t: 終点, f: flow\\n if (v == t) return f;\\n int sv = (int)to[v].size();\\n for (int& i = iter[v]; i < sv; i++) {\\n edge& nv = to[v][i];\\n if (dist[nv.to] <= dist[v] || nv.cap == 0) continue; //here\\n long long nf = dfs(nv.to, t, min(f, nv.cap));\\n if (nf > 0) {\\n nv.cap -= nf;\\n to[nv.to][nv.rev].cap += nf;\\n return nf;\\n }\\n }\\n return 0;\\n }\\n\\n void bfs(int s) {\\n dist.assign(n, -1);\\n queue<int> q;\\n q.push(s);\\n dist[s] = 0;\\n while (!q.empty()) {\\n int v = q.front();\\n q.pop();\\n for (auto nv : to[v]) {\\n if (nv.cap > 0 && dist[nv.to] < 0) {\\n dist[nv.to] = dist[v] + 1;\\n q.push(nv.to);\\n }\\n }\\n }\\n }\\n\\n long long maxflow(int s, int t) {//s:始点, t:終点\\n long long res = 0, flow = 0;\\n while (true) {\\n bfs(s);\\n if (dist[t] < 0) break;\\n\\n iter.assign(n, 0);\\n while (flow = dfs(s, t, inf)) res += flow;\\n };\\n return res;\\n }\\n};\\n\\nint main() \\n{\\n vi<pair<int, int>> ans;\\n int n, m;\\n while (cin >> n >> m, n) {\\n vi<int> u(m), v(m);\\n rep(i, m) cin >> u[i] >> v[i];\\n rep(i, m) u[i]--;\\n rep(i, m) v[i]--;\\n\\n int high = m + 1, low = 0;\\n int S = n + m, T = S + 1, T2 = S + 2;\\n\\n auto f = [&](int h, int l) {\\n Dinic dn(n + m + 3);\\n rep(i, m) dn.addedge(S, i, 1);\\n rep(i, m) {\\n dn.addedge(i, m + u[i], 1);\\n dn.addedge(i, m + v[i], 1);\\n }\\n rep(i, n) {\\n dn.addedge(m + i, T, h);\\n //dn.addedge(T, m + i, l);\\n dn.addedge(m + i, T2, l);\\n }\\n return dn;\\n };\\n\\n rep(l, n + 1) {\\n for(int h = (high == m + 1 ? l : max(high, l)); h <= min(n, l + high - low); h++) {\\n Dinic dn = f(h, l);\\n \\n int flow = dn.maxflow(S, T);\\n if (flow < m) continue;\\n\\n int flow_l = dn.maxflow(T, T2);\\n if (flow_l < l * n) continue;\\n\\n if (h - l <= high - low) {\\n high = h;\\n low = l;\\n break;\\n }\\n }\\n }\\n ans.push_back({ low, high });\\n }\\n for (auto elem : ans) cout << elem.first << \\\" \\\" << elem.second << endl;\\n\\treturn 0;\\n}\\n\\n\\n//\\n//struct edge {\\n// int to, cap, rev;\\n//};\\n//\\n//int main()\\n//{\\n// vi<pair<int, int>> ans;\\n// int n, m;\\n// while (cin >> n >> m, n) {\\n// vii<edge> to(n);\\n// vi<int> deg(n);\\n// rep(i, m) {\\n// int u, v;\\n// cin >> u >> v;\\n// u--, v--;\\n// int su = (int)to[u].size();\\n// int sv = (int)to[v].size();\\n// to[u].push_back({ v, 0, sv });\\n// to[v].push_back({ u, 1, su });\\n// deg[u]++;\\n// }\\n//\\n// map<int, set<int>> mp;\\n// rep(i, n) mp[deg[i]].insert(i);\\n//\\n// vi<bool> visited(n);\\n// auto dfs = [&](auto dfs, int s, int v, int mn = 0)->bool {\\n// visited[v] = true;\\n// if ((!mn && deg[s] + 2 <= deg[v]) \\n// || (mn && deg[v] + 2 <= deg[s])) {\\n// mp[deg[v]].erase(v);\\n// mp[deg[s]].erase(s);\\n// if ((int)mp[deg[v]].size() == 0) mp.erase(deg[v]);\\n// if ((int)mp[deg[s]].size() == 0) mp.erase(deg[s]);\\n//\\n// if (!mn) {\\n// deg[v]--;\\n// deg[s]++;\\n// }\\n// else {\\n// deg[v]++;\\n// deg[s]--;\\n// }\\n//\\n// mp[deg[v]].insert(v);\\n// mp[deg[s]].insert(s);\\n// return true;\\n// }\\n// for (auto& elem : to[v]) {\\n// if (elem.cap == mn || visited[elem.to]) continue;\\n// if (dfs(dfs, s, elem.to, mn)) {\\n// elem.cap = mn;\\n// to[elem.to][elem.rev].cap = 1 - mn;\\n// return true;\\n// }\\n// }\\n// return false;\\n// };\\n//\\n// bool ok = true;\\n// while (ok) {\\n// ok = false;\\n// for (int v : mp.begin()->second) {\\n// visited.assign(n, false);\\n// ok = dfs(dfs, v, v);\\n// if (ok) break;\\n// }\\n//\\n// if (ok) continue;\\n//\\n// for (int v : mp.rbegin()->second) {\\n// visited.assign(n, false);\\n// ok = dfs(dfs, v, v, 1);\\n// if (ok) break;\\n// }\\n// }\\n// ans.push_back({ mp.begin()->first, mp.rbegin()->first });\\n// }\\n//\\n// for (auto elem : ans) cout << elem.first << \\\" \\\" << elem.second << endl;\\n// return 0;\\n//}\",\n \"accuracy\": 1,\n \"time_ms\": 1260,\n \"memory_kb\": 4108,\n \"score_of_the_acc\": -0.5569,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1615_9340285\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <map>\\n#include <queue>\\n#include <set>\\nusing namespace std;\\ntypedef long long ll;\\n#define rep(i, n) for(int i = 0; i < (n); i++)\\n\\ntemplate<class T>\\nusing vi = vector<T>;\\n\\ntemplate<class T>\\nusing vii = vector<vi<T>>;\\n\\ntemplate<class T>\\nusing viii = vector<vii<T>>;\\n\\nstruct Dinic {\\nprivate:\\n const long long inf = 1e18;\\n vector<int> dist; //sからの距離\\n vector<int> iter; //どこまで調べたか\\npublic:\\n struct edge {\\n int to, rev; long long cap;\\n edge(int t = 0, int r = 0, long long c = 0LL) : to(t), rev(r), cap(c) {}\\n };\\n\\n int n;\\n vector<vector<edge>> to;\\n\\n Dinic(int n_ = 1) : n(n_), to(n_), dist(n_), iter(n_) {}\\n\\n void addedge(int u, int v, long long cap) {//u->vにcapの容量\\n int su = (int)to[u].size(), sv = (int)to[v].size();\\n to[u].push_back({ v, sv, cap });\\n to[v].push_back({ u, su, 0 });\\n }\\n\\n long long dfs(int v, int t, long long f) { //t: 終点, f: flow\\n if (v == t) return f;\\n int sv = (int)to[v].size();\\n for (int& i = iter[v]; i < sv; i++) {\\n edge& nv = to[v][i];\\n if (dist[nv.to] <= dist[v] || nv.cap == 0) continue; //here\\n long long nf = dfs(nv.to, t, min(f, nv.cap));\\n if (nf > 0) {\\n nv.cap -= nf;\\n to[nv.to][nv.rev].cap += nf;\\n return nf;\\n }\\n }\\n return 0;\\n }\\n\\n void bfs(int s) {\\n dist.assign(n, -1);\\n queue<int> q;\\n q.push(s);\\n dist[s] = 0;\\n while (!q.empty()) {\\n int v = q.front();\\n q.pop();\\n for (auto nv : to[v]) {\\n if (nv.cap > 0 && dist[nv.to] < 0) {\\n dist[nv.to] = dist[v] + 1;\\n q.push(nv.to);\\n }\\n }\\n }\\n }\\n\\n long long maxflow(int s, int t) {//s:始点, t:終点\\n long long res = 0, flow = 0;\\n while (true) {\\n bfs(s);\\n if (dist[t] < 0) break;\\n\\n iter.assign(n, 0);\\n while (flow = dfs(s, t, inf)) res += flow;\\n };\\n return res;\\n }\\n};\\n\\nint main() \\n{\\n vi<pair<int, int>> ans;\\n int n, m;\\n while (cin >> n >> m, n) {\\n vi<int> u(m), v(m);\\n rep(i, m) cin >> u[i] >> v[i];\\n rep(i, m) u[i]--;\\n rep(i, m) v[i]--;\\n\\n int high = m, low = 0;\\n int S = n + m, T = S + 1, T2 = S + 2;\\n\\n auto f = [&](int h, int l) {\\n Dinic dn(n + m + 3);\\n rep(i, m) dn.addedge(S, i, 1);\\n rep(i, m) {\\n dn.addedge(i, m + u[i], 1);\\n dn.addedge(i, m + v[i], 1);\\n }\\n rep(i, n) {\\n dn.addedge(m + i, T, h);\\n //dn.addedge(T, m + i, l);\\n dn.addedge(m + i, T2, l);\\n }\\n return dn;\\n };\\n\\n rep(l, n + 1) {\\n for(int h = l; h <= min(n, l + high - low); h++) {\\n Dinic dn = f(h, l);\\n \\n int flow = dn.maxflow(S, T);\\n if (flow < m) continue;\\n\\n int flow_l = dn.maxflow(T, T2);\\n if (flow_l < l * n) continue;\\n\\n if (h - l <= high - low) {\\n high = h;\\n low = l;\\n break;\\n }\\n }\\n }\\n ans.push_back({ low, high });\\n }\\n for (auto elem : ans) cout << elem.first << \\\" \\\" << elem.second << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1790,\n \"memory_kb\": 4096,\n \"score_of_the_acc\": -0.6499,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1615_9309817\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\n#include <map>\\n#include <queue>\\n#include <set>\\nusing namespace std;\\ntypedef long long ll;\\n#define rep(i, n) for(int i = 0; i < (n); i++)\\n\\ntemplate<class T>\\nusing vi = vector<T>;\\n\\ntemplate<class T>\\nusing vii = vector<vi<T>>;\\n\\ntemplate<class T>\\nusing viii = vector<vii<T>>;\\n\\nstruct edge {\\n int to, cap, rev;\\n};\\n\\nint main()\\n{\\n vi<pair<int, int>> ans;\\n int n, m;\\n while (cin >> n >> m, n) {\\n vii<edge> to(n);\\n vi<int> deg(n);\\n rep(i, m) {\\n int u, v;\\n cin >> u >> v;\\n u--, v--;\\n int su = (int)to[u].size();\\n int sv = (int)to[v].size();\\n to[u].push_back({ v, 0, sv });\\n to[v].push_back({ u, 1, su });\\n deg[u]++;\\n }\\n\\n map<int, set<int>> mp;\\n rep(i, n) mp[deg[i]].insert(i);\\n\\n vi<bool> visited(n);\\n auto dfs = [&](auto dfs, int s, int v, int mn = 0)->bool {\\n visited[v] = true;\\n if ((!mn && deg[s] + 2 <= deg[v]) \\n || (mn && deg[v] + 2 <= deg[s])) {\\n mp[deg[v]].erase(v);\\n mp[deg[s]].erase(s);\\n if ((int)mp[deg[v]].size() == 0) mp.erase(deg[v]);\\n if ((int)mp[deg[s]].size() == 0) mp.erase(deg[s]);\\n\\n if (!mn) {\\n deg[v]--;\\n deg[s]++;\\n }\\n else {\\n deg[v]++;\\n deg[s]--;\\n }\\n\\n mp[deg[v]].insert(v);\\n mp[deg[s]].insert(s);\\n return true;\\n }\\n for (auto& elem : to[v]) {\\n if (elem.cap == mn || visited[elem.to]) continue;\\n if (dfs(dfs, s, elem.to, mn)) {\\n elem.cap = mn;\\n to[elem.to][elem.rev].cap = 1 - mn;\\n return true;\\n }\\n }\\n return false;\\n };\\n\\n bool ok = true;\\n while (ok) {\\n ok = false;\\n for (int v : mp.begin()->second) {\\n visited.assign(n, false);\\n ok = dfs(dfs, v, v);\\n if (ok) break;\\n }\\n\\n if (ok) continue;\\n\\n for (int v : mp.rbegin()->second) {\\n visited.assign(n, false);\\n ok = dfs(dfs, v, v, 1);\\n if (ok) break;\\n }\\n }\\n ans.push_back({ mp.begin()->first, mp.rbegin()->first });\\n }\\n\\n for (auto elem : ans) cout << elem.first << \\\" \\\" << elem.second << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3580,\n \"score_of_the_acc\": -0.0566,\n \"final_rank\": 2\n }\n]","isConversational":false}}},{"rowIdx":988,"cells":{"group_id":{"kind":"string","value":"aoj_1613_cpp"},"problem_description":{"kind":"string","value":"Deciphering Characters\nImage data which are left by a mysterious syndicate were discovered. \nYou are requested to analyze the data.\nThe syndicate members used characters invented independently. \nA binary image corresponds to one character written in black ink on white paper.\nAlthough you found many variant images that represent the same character, \nyou discovered that you can judge whether or not two images represent the same character with the surrounding relation of connected components. We present some definitions as follows. Here, we assume that white pixels fill outside of the given image.\nWhite connected component\n: A set of white pixels connected to each other horizontally or vertically (see below).\nBlack connected component\n: A set of black pixels connected to each other horizontally, vertically, or diagonally (see below).\nConnected component\n: A white or a black connected component.\nBackground component\n: The connected component including pixels outside of the image. Any white pixels on the periphery of the image are thus included in the background component.\nconnected\ndisconnected\nconnected\nconnected\nConnectedness of white pixels\nConnectedness of black pixels\nLet\nC\n1\nbe a connected component in an image and\nC\n2\nbe another connected component in the same image with the opposite color.\nLet's think of a modified image in which colors of all pixels not included in\nC\n1\nnor\nC\n2\nare changed to that of\nC\n2\n. If neither\nC\n1\nnor\nC\n2\nis the background component, the color of the background component is changed to that of\nC\n2\n. We say that\nC\n1\nsurrounds\nC\n2\nin the original image when pixels in\nC\n2\nare not included in the background component in the modified image. (see below)\nTwo images represent the same character if both of the following conditions are satisfied.\nThe two images have the same number of connected components.\nLet\nS\nand\nS'\nbe the sets of connected components of the two images. A bijective function\nf\n:\nS → S'\nsatisfying the following conditions exists.\nFor each connected component\nC\nthat belongs to\nS\n,\nf\n(\nC\n) has the same color as\nC\n.\nFor each of\nC\n1\nand\nC\n2\nbelonging to\nS\n,\nf\n(\nC\n1\n) surrounds\nf\n(\nC\n2\n) if and only if\nC\n1\nsurrounds\nC\n2\n.\nLet's see an example. Connected components in the images of the figure below has the following surrounding relations.\nC\n1\nsurrounds\nC\n2\n.\nC\n2\nsurrounds\nC\n3\n.\nC\n2\nsurrounds\nC\n4\n.\nC'\n1\nsurrounds\nC'\n2\n.\nC'\n2\nsurrounds\nC'\n3\n.\nC'\n2\nsurrounds\nC'\n4\n.\nA bijective function defined as\nf\n(\nC\ni\n) =\nC'\ni\nfor each connected component satisfies the conditions stated above. Therefore, we can conclude that the two images represent the same character.\nMake a program judging whether given two images represent the same character.\nInput\nThe input consists of at most 200 datasets. The end of the input is represented by a line containing two zeros. Each dataset is formatted as follows.\nimage 1\nimage 2\nEach image has the following format.\nh\nw\np\n(1,1)\n...\np\n(1,\nw\n)\n...\np\n(\nh\n,1)\n...\np\n(\nh\n,\nw\n)\nh\nand\nw\nare the height an\n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1613_10867681","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 REVERSE(x) reverse( (x).begin(),(x).end() )\n#define UNIQUE(x) (x).erase( unique( ALL( (x) ) ) , (x).end() )\n#define PW(x) (1LL<<(x))\n#define SZ(x) ((ll)(x).size())\n#define SHOW(x) cout << #x << \" = \" << x << endl\n#define SHOWA(x,n) for( int yui = 0; yui < n; yui++ ){ cout << x[yui] << \" \"; } cout << endl\n\n#define pb emplace_back\n#define fi first\n#define se second\n\nusing namespace std;\n\ntypedef long double ld;\ntypedef long long int ll;\ntypedef pair<int,int> pi;\ntypedef pair<ll,ll> pl;\ntypedef vector<int> vi;\ntypedef vector<ll> vl;\ntypedef vector<bool> vb;\ntypedef vector<ld> vd;\ntypedef vector<pi> vpi;\ntypedef vector<pl> vpl;\ntypedef vector<vpl> gr;\ntypedef vector<vl> ml;\ntypedef vector<vd> md;\ntypedef vector<vi> mi;\n \nconst ll INF = (ll)1e9 + 10;\nconst ll INFLL = (ll)1e18 + 10;\nconst ld EPS = 1e-12;\nconst ll MOD = 1e9+7;\n \ntemplate<class T> T &chmin( T &a , const T &b ){ return a = min(a,b); }\ntemplate<class T> T &chmax( T &a , const T &b ){ return a = max(a,b); }\ntemplate<class T> inline T sq( T a ){ return a * a; }\n\nll in(){ long long int x; scanf( \"%lld\" , &x ); return x; }\nchar yuyushiki[1000010]; string stin(){ scanf( \"%s\" , yuyushiki ); return yuyushiki; }\n\n// head\n\nconst int dx[] = { 1 , 0 , -1 , 0 , 1 , -1 , -1 , 1 };\nconst int dy[] = { 0 , -1 , 0 , 1 , -1 , -1 , 1 , 1 };\nconst int type[] = { 4 , 8 };\nconst char opp[] = { '#' , '.' };\n\nconst int N = 10;\n\nll A[N];\nll B[N];\n\nvi G[100010];\n\nint it = 0;\n\nint n, m;\n\nbool used[128][128];\n\nstring s[128];\n\nbool isin( int y , int x ){\n return 0 <= y && y < n && 0 <= x && x < m;\n}\n\nvoid dfs2( int y , int x , int t , vpi &v ){\n // cout << y << \" \" << x << endl;\n used[y][x] = true;\n v.pb( y , x );\n REP( i , type[t] ){\n int ny = y + dy[i];\n int nx = x + dx[i];\n if( isin( ny , nx ) && !used[ny][nx] ){\n if( s[ny][nx] == opp[t] ){\n v.pb( ny , nx );\n } else {\n dfs2( ny , nx , t , v );\n }\n }\n }\n}\n\nint dfs( int y, int x , int t ){\n int cur = it++;\n vpi v(0);\n // cout << \"---\" << endl;\n dfs2( y , x , t , v );\n YYS( w , v ){\n if( !used[w.fi][w.se] ){\n G[cur].pb( dfs( w.fi , w.se , 1-t ) );\n }\n }\n return cur;\n}\n\nint get(){\n n = in();\n m = in();\n if( n == 0 && m == 0 ){\n return -1;\n }\n s[0] = string( m+2 , '.' );\n REP( i , n ){\n s[i+1] = \".\" + stin() + \".\";\n }\n s[n+1] = string( m+2 , '.' );\n n += 2;\n m += 2;\n /*\n REP( i , n ){\n cout << s[i] << endl;\n }\n */\n REP( i , n ){\n REP( j , m ){\n used[i][j] = false;\n }\n }\n return dfs( 0 , 0 , 0 );\n}\n\nll ha( int x , ll a , ll b ){\n ll res = a;\n vl v(0);\n YYS( w , G[x] ){\n v.pb( ha( w , a , b ) );\n }\n SORT( v );\n YYS( w , v ){\n res = ( res * a + w ) % MOD;\n }\n return ( res + b ) % MOD;\n}\n\nint main(){\n\n mt19937 mt(727272);\n \n REP( i , N ){\n A[i] = mt();\n B[i] = mt();\n }\n \n while( 1 ){\n REP( i , 100010 ){\n G[i].clear();\n }\n it = 0;\n int ra = get();\n if( ra == -1 ){\n break;\n }\n int rb = get();\n /*\n REP( i , it ){\n SHOWA( G[i] , SZ(G[i]) );\n }\n */\n bool ok = true;\n REP( i , N ){\n if( ha( ra , A[i] , B[i] ) != ha( rb , A[i] , B[i] ) ){\n ok = false;\n break;\n }\n }\n if( ok ){\n puts( \"yes\" );\n } else {\n puts( \"no\" );\n }\n }\n \n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":6104,"score_of_the_acc":-0.7343,"final_rank":15},{"submission_id":"aoj_1613_10675182","code_snippet":"// C++ includes used for precompiling -*- C++ -*-\n// Copyright (C) 2003-2013 Free Software Foundation, Inc.\n//\n// This file is part of the GNU ISO C++ Library. This library is free\n// software; you can redistribute it and/or modify it under the\n// terms of the GNU General Public License as published by the\n// Free Software Foundation; either version 3, or (at your option)\n// any later version.\n// This library is distributed in the hope that it will be useful,\n// but WITHOUT ANY WARRANTY; without even the implied warranty of\n// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n// GNU General Public License for more details.\n// Under Section 7 of GPL version 3, you are granted additional\n// permissions described in the GCC Runtime Library Exception, version\n// 3.1, as published by the Free Software Foundation.\n// You should have received a copy of the GNU General Public License and\n// a copy of the GCC Runtime Library Exception along with this program;\n// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see\n// <http://w...content-available-to-author-only...u.org/licenses/>.\n/** @file stdc++.h\n * This is an implementation file for a precompiled header.\n */\n// 17.4.1.2 Headers\n// C\n#ifndef _GLIBCXX_NO_ASSERT\n#include <cassert>\n#endif\n#include <cctype>\n#include <cerrno>\n#include <cfloat>\n#include <ciso646>\n#include <climits>\n#include <clocale>\n#include <cmath>\n#include <csetjmp>\n#include <csignal>\n#include <cstdarg>\n#include <cstddef>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#if __cplusplus >= 201103L\n#include <ccomplex>\n#include <cfenv>\n#include <cinttypes>\n#include <cstdbool>\n#include <cstdint>\n#include <ctgmath>\n#include <cwchar>\n#include <cwctype>\n#endif\n// C++\n#include <algorithm>\n#include <bitset>\n#include <complex>\n#include <deque>\n#include <exception>\n#include <fstream>\n#include <functional>\n#include <iomanip>\n#include <ios>\n#include <iosfwd>\n#include <iostream>\n#include <istream>\n#include <iterator>\n#include <limits>\n#include <list>\n#include <locale>\n#include <map>\n#include <memory>\n#include <new>\n#include <numeric>\n#include <ostream>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <stdexcept>\n#include <streambuf>\n#include <string>\n#include <typeinfo>\n#include <utility>\n#include <valarray>\n#include <vector>\n#if __cplusplus >= 201103L\n#include <array>\n#include <atomic>\n#include <chrono>\n#include <condition_variable>\n#include <forward_list>\n#include <future>\n#include <initializer_list>\n#include <mutex>\n#include <random>\n#include <ratio>\n#include <regex>\n#include <scoped_allocator>\n#include <system_error>\n#include <thread>\n#include <tuple>\n#include <type_traits>\n#include <typeindex>\n#include <unordered_map>\n#include <unordered_set>\n\n#endif\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing uint = unsigned int;\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define all(v) v.begin(), v.end()\ntemplate <class T, class U>\ninline bool chmax(T &a, U b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T, class U>\ninline bool chmin(T &a, U b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T>\ninline void compress(vector<T> &a) {\n sort(a.begin(), a.end());\n a.erase(unique(a.begin(), a.end()), a.end());\n}\ntemplate <class T>\nT rand(T l, T r) {\n static mt19937 mt(random_device{}());\n // [l, r)\n if constexpr (is_integral_v<T>) {\n return uniform_int_distribution<T>(l, r - 1)(mt);\n } else if constexpr (is_floating_point_v<T>) {\n return uniform_real_distribution<T>(l, r)(mt);\n }\n}\nconstexpr int INF = 1001001001;\nconstexpr ll llINF = 3000000000000000010;\nstruct linear_sieve {\n vector<int> least_factor, prime_list;\n linear_sieve(int n) : least_factor(n + 1, 0) {\n for (int i = 2; i <= n; i++) {\n if (least_factor[i] == 0) {\n least_factor[i] = i;\n prime_list.push_back(i);\n }\n for (int p : prime_list) {\n if (ll(i) * p > n || p > least_factor[i]) break;\n least_factor[i * p] = p;\n }\n }\n }\n};\ntemplate <int modulo>\nstruct modint {\n int x;\n modint() : x(0) {}\n modint(int64_t y) : x(y >= 0 ? y % modulo : (modulo - (-y) % modulo) % modulo) {}\n modint &operator+=(const modint &p) {\n if ((x += p.x) >= modulo) x -= modulo;\n return *this;\n }\n modint &operator-=(const modint &p) {\n if ((x += modulo - p.x) >= modulo) x -= modulo;\n return *this;\n }\n modint &operator*=(const modint &p) {\n x = (int)(1LL * x * p.x % modulo);\n return *this;\n }\n modint &operator/=(const modint &p) {\n *this *= p.inv();\n return *this;\n }\n modint operator-() const { return modint(-x); }\n modint operator+(const modint &p) const { return modint(*this) += p; }\n modint operator-(const modint &p) const { return modint(*this) -= p; }\n modint operator*(const modint &p) const { return modint(*this) *= p; }\n modint operator/(const modint &p) const { return modint(*this) /= p; }\n bool operator==(const modint &p) const { return x == p.x; }\n bool operator!=(const modint &p) const { return x != p.x; }\n modint inv() const {\n int a = x, b = modulo, u = 1, v = 0, t;\n while (b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return modint(u);\n }\n modint pow(int64_t n) const {\n modint ret(1), mul(x);\n while (n > 0) {\n if (n & 1) ret *= mul;\n mul *= mul;\n n >>= 1;\n }\n return ret;\n }\n friend ostream &operator<<(ostream &os, const modint &p) { return os << p.x; }\n friend istream &operator>>(istream &is, modint &a) {\n int64_t t;\n is >> t;\n a = modint<modulo>(t);\n return (is);\n }\n int val() const { return x; }\n static constexpr int mod() { return modulo; }\n static constexpr int half() { return (modulo + 1) >> 1; }\n};\nll extgcd(ll a, ll b, ll &x, ll &y) {\n // ax+by=gcd(|a|,|b|)\n if (a < 0 || b < 0) {\n ll d = extgcd(abs(a), abs(b), x, y);\n if (a < 0) x = -x;\n if (b < 0) y = -y;\n return d;\n }\n if (b == 0) {\n x = 1;\n y = 0;\n return a;\n }\n ll d = extgcd(b, a % b, y, x);\n y -= a / b * x;\n return d;\n}\ntemplate <typename T>\nstruct Binomial {\n vector<T> inv, fact, factinv;\n Binomial(int n) {\n inv.resize(n + 1);\n fact.resize(n + 1);\n factinv.resize(n + 1);\n inv[0] = fact[0] = factinv[0] = 1;\n for (int i = 1; i <= n; i++) fact[i] = fact[i - 1] * i;\n factinv[n] = fact[n].inv();\n inv[n] = fact[n - 1] * factinv[n];\n for (int i = n - 1; i >= 1; i--) {\n factinv[i] = factinv[i + 1] * (i + 1);\n inv[i] = fact[i - 1] * factinv[i];\n }\n }\n T C(int n, int r) {\n if (n < 0 || n < r || r < 0) return 0;\n return fact[n] * factinv[n - r] * factinv[r];\n }\n T P(int n, int r) {\n if (n < 0 || n < r || r < 0) return 0;\n return fact[n] * factinv[n - r];\n }\n T H(int n, int r) {\n if (n == 0 && r == 0) return 1;\n if (n < 0 || r < 0) return 0;\n return r == 0 ? 1 : C(n + r - 1, r);\n }\n};\ntemplate <class T>\nvector<T> dijkstra(vector<vector<pair<int, T>>> &g, vector<int> start) {\n using P = pair<T, int>;\n vector<T> dp(g.size(), numeric_limits<T>::max());\n priority_queue<P, vector<P>, greater<P>> que;\n for (int s : start) {\n dp[s] = 0;\n que.push({0, s});\n }\n while (que.size()) {\n auto [d, v] = que.top();\n que.pop();\n if (dp[v] != d) continue;\n for (auto [u, c] : g[v]) {\n if (chmin(dp[u], d + c)) que.push({dp[u], u});\n }\n }\n return dp;\n}\n\nvector<int> BFS01(vector<vector<pair<int, int>>> &g, vector<int> start) {\n vector<int> dp(g.size(), numeric_limits<int>::max());\n deque<int> que;\n for (int s : start) {\n dp[s] = 0;\n que.push_front(s);\n }\n while (que.size()) {\n auto v = que.front();\n que.pop_front();\n for (auto [u, c] : g[v]) {\n if (chmin(dp[u], dp[v] + c)) {\n if (c == 0)\n que.push_front(u);\n else\n que.push_back(u);\n }\n }\n }\n return dp;\n}\ntemplate <typename T, typename U>\ninline istream &operator>>(istream &is, pair<T, U> &rhs) {\n return is >> rhs.first >> rhs.second;\n}\ntemplate <typename T>\ninline istream &operator>>(istream &is, vector<T> &v) {\n for (auto &e : v) is >> e;\n return is;\n}\ntemplate <typename T, typename U>\ninline ostream &operator<<(ostream &os, const pair<T, U> &rhs) {\n return os << rhs.first << \" \" << rhs.second;\n}\ntemplate <typename T>\ninline ostream &operator<<(ostream &os, const vector<T> &v) {\n for (auto itr = v.begin(), end_itr = v.end(); itr != end_itr;) {\n os << *itr;\n if (++itr != end_itr) os << \" \";\n }\n return os;\n}\n\nstruct UnionFind {\n vector<int> par, siz;\n UnionFind(int x) {\n par.resize(x);\n siz.resize(x);\n for (int i = 0; i < x; i++) {\n par[i] = i;\n siz[i] = 1;\n }\n }\n int find(int x) {\n if (par[x] == x) return x;\n return par[x] = find(par[x]);\n }\n bool unite(int x, int y) {\n x = find(x), y = find(y);\n if (x == y) return false;\n if (siz[x] < siz[y]) swap(x, y);\n par[y] = x;\n siz[x] += siz[y];\n\n return true;\n }\n bool same(int x, int y) { return find(x) == find(y); }\n int size(int x) { return siz[find(x)]; }\n};\ntemplate <class T>\nstruct BIT {\n // 1-indexed\n int n, beki = 1;\n vector<T> bit;\n BIT(int x) {\n bit.resize(x + 1, 0);\n n = x;\n while (beki * 2 <= n) beki *= 2;\n }\n T sum(int i) {\n T res = 0;\n while (i > 0) {\n res += bit[i];\n i -= i & -i;\n }\n return res;\n }\n T sum(int l, int r) {\n //[l,r]\n return sum(r) - (l == 0 ? 0 : sum(l - 1));\n }\n void add(int i, T x) {\n while (i <= n) {\n bit[i] += x;\n i += i & -i;\n }\n }\n int lowerbound(T w) {\n if (w <= 0) return 0;\n int x = 0;\n for (int k = beki; k > 0; k >>= 1) {\n if (x + k <= n && bit[x + k] < w) {\n w -= bit[x + k];\n x += k;\n }\n }\n return x + 1;\n }\n};\nvector<vector<int>> read_tree() {\n int h, w;\n cin >> h >> w;\n if (h == 0 && w == 0) exit(0);\n vector<string> s(h + 2);\n s[0] = s[h + 1] = string(w + 2, '.');\n for (int i = 1; i <= h; i++) {\n cin >> s[i];\n s[i] = '.' + s[i] + '.';\n }\n h += 2, w += 2;\n UnionFind uf(h * w);\n rep(i, h) {\n rep(j, w) {\n if (s[i][j] == '.') {\n if (i && s[i - 1][j] == '.') uf.unite(i * w + j, (i - 1) * w + j);\n if (j && s[i][j - 1] == '.') uf.unite(i * w + j, i * w + (j - 1));\n } else {\n if (i && s[i - 1][j] == '#') uf.unite(i * w + j, (i - 1) * w + j);\n if (j && s[i][j - 1] == '#') uf.unite(i * w + j, i * w + (j - 1));\n if (i && j && s[i - 1][j - 1] == '#') uf.unite(i * w + j, (i - 1) * w + (j - 1));\n if (i && j + 1 < w && s[i - 1][j + 1] == '#') uf.unite(i * w + j, (i - 1) * w + (j + 1));\n }\n }\n }\n int C = 0;\n int n = h * w;\n vector<int> cmp(n);\n cmp[uf.find(0)] = C++;\n rep(i, n) {\n if (uf.same(0, i)) continue;\n if (uf.find(i) == i) cmp[i] = C++;\n }\n rep(i, n) cmp[i] = cmp[uf.find(i)];\n vector<vector<int>> g(C);\n rep(i, h) {\n rep(j, w) {\n if (s[i][j] == '.') {\n if (i && s[i - 1][j] == '#') {\n g[cmp[(i - 1) * w + j]].push_back(cmp[i * w + j]);\n g[cmp[i * w + j]].push_back(cmp[(i - 1) * w + j]);\n }\n\n if (j && s[i][j - 1] == '#') {\n g[cmp[i * w + j - 1]].push_back(cmp[i * w + j]);\n g[cmp[i * w + j]].push_back(cmp[i * w + j - 1]);\n }\n\n if (i + 1 < h && s[i + 1][j] == '#') {\n g[cmp[(i + 1) * w + j]].push_back(cmp[i * w + j]);\n g[cmp[i * w + j]].push_back(cmp[(i + 1) * w + j]);\n }\n\n if (j + 1 < w && s[i][j + 1] == '#') {\n g[cmp[i * w + j + 1]].push_back(cmp[i * w + j]);\n g[cmp[i * w + j]].push_back(cmp[i * w + j + 1]);\n }\n }\n }\n }\n rep(i, C) { compress(g[i]); }\n // rep(i, C) { cout << g[i] << endl; }\n return g;\n}\nusing mint = modint<998244353>;\nmint C = 97;\nmint rooted_tree_hash(vector<vector<int>> g) {\n int n = g.size();\n vector<mint> h(n, 1);\n function<void(int, int)> dfs = [&](int v, int p) {\n for (int u : g[v]) {\n if (u == p) continue;\n dfs(u, v);\n h[v] *= (h[u]*h[u] + C);\n }\n };\n dfs(0, -1);\n return h[0];\n}\nvoid solve() {\n auto g1 = read_tree();\n auto g2 = read_tree();\n if (g1.size() != g2.size()) {\n cout << \"no\" << endl;\n return;\n }\n mint h1 = rooted_tree_hash(g1);\n mint h2 = rooted_tree_hash(g2);\n if (h1 == h2)\n cout << \"yes\" << endl;\n else\n cout << \"no\" << endl;\n}\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n int t = 1;\n // cin >> t;\n while (1) solve();\n}","accuracy":1,"time_ms":30,"memory_kb":4096,"score_of_the_acc":-0.1355,"final_rank":1},{"submission_id":"aoj_1613_10672975","code_snippet":"// C++ includes used for precompiling -*- C++ -*-\n// Copyright (C) 2003-2013 Free Software Foundation, Inc.\n//\n// This file is part of the GNU ISO C++ Library. This library is free\n// software; you can redistribute it and/or modify it under the\n// terms of the GNU General Public License as published by the\n// Free Software Foundation; either version 3, or (at your option)\n// any later version.\n// This library is distributed in the hope that it will be useful,\n// but WITHOUT ANY WARRANTY; without even the implied warranty of\n// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n// GNU General Public License for more details.\n// Under Section 7 of GPL version 3, you are granted additional\n// permissions described in the GCC Runtime Library Exception, version\n// 3.1, as published by the Free Software Foundation.\n// You should have received a copy of the GNU General Public License and\n// a copy of the GCC Runtime Library Exception along with this program;\n// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see\n// <http://w...content-available-to-author-only...u.org/licenses/>.\n/** @file stdc++.h\n * This is an implementation file for a precompiled header.\n */\n// 17.4.1.2 Headers\n// C\n#ifndef _GLIBCXX_NO_ASSERT\n#include <cassert>\n#endif\n#include <cctype>\n#include <cerrno>\n#include <cfloat>\n#include <ciso646>\n#include <climits>\n#include <clocale>\n#include <cmath>\n#include <csetjmp>\n#include <csignal>\n#include <cstdarg>\n#include <cstddef>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#if __cplusplus >= 201103L\n#include <ccomplex>\n#include <cfenv>\n#include <cinttypes>\n#include <cstdbool>\n#include <cstdint>\n#include <ctgmath>\n#include <cwchar>\n#include <cwctype>\n#endif\n// C++\n#include <algorithm>\n#include <bitset>\n#include <complex>\n#include <deque>\n#include <exception>\n#include <fstream>\n#include <functional>\n#include <iomanip>\n#include <ios>\n#include <iosfwd>\n#include <iostream>\n#include <istream>\n#include <iterator>\n#include <limits>\n#include <list>\n#include <locale>\n#include <map>\n#include <memory>\n#include <new>\n#include <numeric>\n#include <ostream>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <stdexcept>\n#include <streambuf>\n#include <string>\n#include <typeinfo>\n#include <utility>\n#include <valarray>\n#include <vector>\n#if __cplusplus >= 201103L\n#include <array>\n#include <atomic>\n#include <chrono>\n#include <condition_variable>\n#include <forward_list>\n#include <future>\n#include <initializer_list>\n#include <mutex>\n#include <random>\n#include <ratio>\n#include <regex>\n#include <scoped_allocator>\n#include <system_error>\n#include <thread>\n#include <tuple>\n#include <type_traits>\n#include <typeindex>\n#include <unordered_map>\n#include <unordered_set>\n\n#endif\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing uint = unsigned int;\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define all(v) v.begin(), v.end()\ntemplate <class T, class U>\ninline bool chmax(T &a, U b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T, class U>\ninline bool chmin(T &a, U b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T>\ninline void compress(vector<T> &a) {\n sort(a.begin(), a.end());\n a.erase(unique(a.begin(), a.end()), a.end());\n}\ntemplate <class T>\nT rand(T l, T r) {\n static mt19937 mt(random_device{}());\n // [l, r)\n if constexpr (is_integral_v<T>) {\n return uniform_int_distribution<T>(l, r - 1)(mt);\n } else if constexpr (is_floating_point_v<T>) {\n return uniform_real_distribution<T>(l, r)(mt);\n }\n}\nconstexpr int INF = 1001001001;\nconstexpr ll llINF = 3000000000000000010;\nstruct linear_sieve {\n vector<int> least_factor, prime_list;\n linear_sieve(int n) : least_factor(n + 1, 0) {\n for (int i = 2; i <= n; i++) {\n if (least_factor[i] == 0) {\n least_factor[i] = i;\n prime_list.push_back(i);\n }\n for (int p : prime_list) {\n if (ll(i) * p > n || p > least_factor[i]) break;\n least_factor[i * p] = p;\n }\n }\n }\n};\ntemplate <int modulo>\nstruct modint {\n int x;\n modint() : x(0) {}\n modint(int64_t y) : x(y >= 0 ? y % modulo : (modulo - (-y) % modulo) % modulo) {}\n modint &operator+=(const modint &p) {\n if ((x += p.x) >= modulo) x -= modulo;\n return *this;\n }\n modint &operator-=(const modint &p) {\n if ((x += modulo - p.x) >= modulo) x -= modulo;\n return *this;\n }\n modint &operator*=(const modint &p) {\n x = (int)(1LL * x * p.x % modulo);\n return *this;\n }\n modint &operator/=(const modint &p) {\n *this *= p.inv();\n return *this;\n }\n modint operator-() const { return modint(-x); }\n modint operator+(const modint &p) const { return modint(*this) += p; }\n modint operator-(const modint &p) const { return modint(*this) -= p; }\n modint operator*(const modint &p) const { return modint(*this) *= p; }\n modint operator/(const modint &p) const { return modint(*this) /= p; }\n bool operator==(const modint &p) const { return x == p.x; }\n bool operator!=(const modint &p) const { return x != p.x; }\n modint inv() const {\n int a = x, b = modulo, u = 1, v = 0, t;\n while (b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return modint(u);\n }\n modint pow(int64_t n) const {\n modint ret(1), mul(x);\n while (n > 0) {\n if (n & 1) ret *= mul;\n mul *= mul;\n n >>= 1;\n }\n return ret;\n }\n friend ostream &operator<<(ostream &os, const modint &p) { return os << p.x; }\n friend istream &operator>>(istream &is, modint &a) {\n int64_t t;\n is >> t;\n a = modint<modulo>(t);\n return (is);\n }\n int val() const { return x; }\n static constexpr int mod() { return modulo; }\n static constexpr int half() { return (modulo + 1) >> 1; }\n};\nll extgcd(ll a, ll b, ll &x, ll &y) {\n // ax+by=gcd(|a|,|b|)\n if (a < 0 || b < 0) {\n ll d = extgcd(abs(a), abs(b), x, y);\n if (a < 0) x = -x;\n if (b < 0) y = -y;\n return d;\n }\n if (b == 0) {\n x = 1;\n y = 0;\n return a;\n }\n ll d = extgcd(b, a % b, y, x);\n y -= a / b * x;\n return d;\n}\ntemplate <typename T>\nstruct Binomial {\n vector<T> inv, fact, factinv;\n Binomial(int n) {\n inv.resize(n + 1);\n fact.resize(n + 1);\n factinv.resize(n + 1);\n inv[0] = fact[0] = factinv[0] = 1;\n for (int i = 1; i <= n; i++) fact[i] = fact[i - 1] * i;\n factinv[n] = fact[n].inv();\n inv[n] = fact[n - 1] * factinv[n];\n for (int i = n - 1; i >= 1; i--) {\n factinv[i] = factinv[i + 1] * (i + 1);\n inv[i] = fact[i - 1] * factinv[i];\n }\n }\n T C(int n, int r) {\n if (n < 0 || n < r || r < 0) return 0;\n return fact[n] * factinv[n - r] * factinv[r];\n }\n T P(int n, int r) {\n if (n < 0 || n < r || r < 0) return 0;\n return fact[n] * factinv[n - r];\n }\n T H(int n, int r) {\n if (n == 0 && r == 0) return 1;\n if (n < 0 || r < 0) return 0;\n return r == 0 ? 1 : C(n + r - 1, r);\n }\n};\ntemplate <class T>\nvector<T> dijkstra(vector<vector<pair<int, T>>> &g, vector<int> start) {\n using P = pair<T, int>;\n vector<T> dp(g.size(), numeric_limits<T>::max());\n priority_queue<P, vector<P>, greater<P>> que;\n for (int s : start) {\n dp[s] = 0;\n que.push({0, s});\n }\n while (que.size()) {\n auto [d, v] = que.top();\n que.pop();\n if (dp[v] != d) continue;\n for (auto [u, c] : g[v]) {\n if (chmin(dp[u], d + c)) que.push({dp[u], u});\n }\n }\n return dp;\n}\n\nvector<int> BFS01(vector<vector<pair<int, int>>> &g, vector<int> start) {\n vector<int> dp(g.size(), numeric_limits<int>::max());\n deque<int> que;\n for (int s : start) {\n dp[s] = 0;\n que.push_front(s);\n }\n while (que.size()) {\n auto v = que.front();\n que.pop_front();\n for (auto [u, c] : g[v]) {\n if (chmin(dp[u], dp[v] + c)) {\n if (c == 0)\n que.push_front(u);\n else\n que.push_back(u);\n }\n }\n }\n return dp;\n}\ntemplate <typename T, typename U>\ninline istream &operator>>(istream &is, pair<T, U> &rhs) {\n return is >> rhs.first >> rhs.second;\n}\ntemplate <typename T>\ninline istream &operator>>(istream &is, vector<T> &v) {\n for (auto &e : v) is >> e;\n return is;\n}\ntemplate <typename T, typename U>\ninline ostream &operator<<(ostream &os, const pair<T, U> &rhs) {\n return os << rhs.first << \" \" << rhs.second;\n}\ntemplate <typename T>\ninline ostream &operator<<(ostream &os, const vector<T> &v) {\n for (auto itr = v.begin(), end_itr = v.end(); itr != end_itr;) {\n os << *itr;\n if (++itr != end_itr) os << \" \";\n }\n return os;\n}\n\nstruct UnionFind {\n vector<int> par, siz;\n UnionFind(int x) {\n par.resize(x);\n siz.resize(x);\n for (int i = 0; i < x; i++) {\n par[i] = i;\n siz[i] = 1;\n }\n }\n int find(int x) {\n if (par[x] == x) return x;\n return par[x] = find(par[x]);\n }\n bool unite(int x, int y) {\n x = find(x), y = find(y);\n if (x == y) return false;\n if (siz[x] < siz[y]) swap(x, y);\n par[y] = x;\n siz[x] += siz[y];\n\n return true;\n }\n bool same(int x, int y) { return find(x) == find(y); }\n int size(int x) { return siz[find(x)]; }\n};\ntemplate <class T>\nstruct BIT {\n // 1-indexed\n int n, beki = 1;\n vector<T> bit;\n BIT(int x) {\n bit.resize(x + 1, 0);\n n = x;\n while (beki * 2 <= n) beki *= 2;\n }\n T sum(int i) {\n T res = 0;\n while (i > 0) {\n res += bit[i];\n i -= i & -i;\n }\n return res;\n }\n T sum(int l, int r) {\n //[l,r]\n return sum(r) - (l == 0 ? 0 : sum(l - 1));\n }\n void add(int i, T x) {\n while (i <= n) {\n bit[i] += x;\n i += i & -i;\n }\n }\n int lowerbound(T w) {\n if (w <= 0) return 0;\n int x = 0;\n for (int k = beki; k > 0; k >>= 1) {\n if (x + k <= n && bit[x + k] < w) {\n w -= bit[x + k];\n x += k;\n }\n }\n return x + 1;\n }\n};\nvector<vector<int>> read_tree() {\n int h, w;\n cin >> h >> w;\n if (h == 0 && w == 0) exit(0);\n vector<string> s(h + 2);\n s[0] = s[h + 1] = string(w + 2, '.');\n for (int i = 1; i <= h; i++) {\n cin >> s[i];\n s[i] = '.' + s[i] + '.';\n }\n h += 2, w += 2;\n UnionFind uf(h * w);\n rep(i, h) {\n rep(j, w) {\n if (s[i][j] == '.') {\n if (i && s[i - 1][j] == '.') uf.unite(i * w + j, (i - 1) * w + j);\n if (j && s[i][j - 1] == '.') uf.unite(i * w + j, i * w + (j - 1));\n } else {\n if (i && s[i - 1][j] == '#') uf.unite(i * w + j, (i - 1) * w + j);\n if (j && s[i][j - 1] == '#') uf.unite(i * w + j, i * w + (j - 1));\n if (i && j && s[i - 1][j - 1] == '#') uf.unite(i * w + j, (i - 1) * w + (j - 1));\n if (i && j + 1 < w && s[i - 1][j + 1] == '#') uf.unite(i * w + j, (i - 1) * w + (j + 1));\n }\n }\n }\n int C = 0;\n int n = h * w;\n vector<int> cmp(n);\n cmp[uf.find(0)] = C++;\n rep(i, n) {\n if (uf.same(0, i)) continue;\n if (uf.find(i) == i) cmp[i] = C++;\n }\n rep(i, n) cmp[i] = cmp[uf.find(i)];\n vector<vector<int>> g(C);\n rep(i, h) {\n rep(j, w) {\n if (s[i][j] == '.') {\n if (i && s[i - 1][j] == '#') {\n g[cmp[(i - 1) * w + j]].push_back(cmp[i * w + j]);\n g[cmp[i * w + j]].push_back(cmp[(i - 1) * w + j]);\n }\n\n if (j && s[i][j - 1] == '#') {\n g[cmp[i * w + j - 1]].push_back(cmp[i * w + j]);\n g[cmp[i * w + j]].push_back(cmp[i * w + j - 1]);\n }\n\n if (i + 1 < h && s[i + 1][j] == '#') {\n g[cmp[(i + 1) * w + j]].push_back(cmp[i * w + j]);\n g[cmp[i * w + j]].push_back(cmp[(i + 1) * w + j]);\n }\n\n if (j + 1 < w && s[i][j + 1] == '#') {\n g[cmp[i * w + j + 1]].push_back(cmp[i * w + j]);\n g[cmp[i * w + j]].push_back(cmp[i * w + j + 1]);\n }\n }\n }\n }\n rep(i, C) { compress(g[i]); }\n // rep(i, C) { cout << g[i] << endl; }\n return g;\n}\nusing mint = modint<998244353>;\nmint C = 97;\nmint rooted_tree_hash(vector<vector<int>> g) {\n int n = g.size();\n vector<mint> h(n, 1);\n function<void(int, int)> dfs = [&](int v, int p) {\n for (int u : g[v]) {\n if (u == p) continue;\n dfs(u, v);\n h[v] *= (h[u] + C);\n }\n };\n dfs(0, -1);\n return h[0];\n}\nvoid solve() {\n auto g1 = read_tree();\n auto g2 = read_tree();\n if (g1.size() != g2.size()) {\n cout << \"no\" << endl;\n return;\n }\n mint h1 = rooted_tree_hash(g1);\n mint h2 = rooted_tree_hash(g2);\n if (h1 == h2)\n cout << \"yes\" << endl;\n else\n cout << \"no\" << endl;\n}\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n int t = 1;\n // cin >> t;\n while (1) solve();\n}","accuracy":1,"time_ms":30,"memory_kb":4096,"score_of_the_acc":-0.1355,"final_rank":1},{"submission_id":"aoj_1613_10670417","code_snippet":"#ifdef LOCAL\n#define _GLIBCXX_DEBUG\n#pragma GCC optimize(\"O0\")\n#else\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#endif\n\n#include <bits/stdc++.h>\n// #include <bits/extc++.h>\nusing namespace std;\n\n#include <atcoder/all>\n\n// #include <atcoder/modint>\n// using mint = atcoder::modint998244353;\n// istream& operator>>(istream& in, mint& x) {\n// long long a;\n// in >> a;\n// x = a;\n// return in;\n// }\n// ostream& operator<<(ostream& out, const mint& x) {\n// return out << x.val();\n// }\n\nusing ll = long long;\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nusing i128 = __int128;\nusing u128 = unsigned __int128;\nusing f128 = __float128;\n\ntemplate <class T>\nconstexpr T infty = 0;\ntemplate <>\nconstexpr int infty<int> = 1'000'000'000;\ntemplate <>\nconstexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;\ntemplate <>\nconstexpr u32 infty<u32> = infty<int>;\ntemplate <>\nconstexpr u64 infty<u64> = infty<ll>;\ntemplate <>\nconstexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;\ntemplate <>\nconstexpr double infty<double> = infty<ll>;\ntemplate <>\nconstexpr long double infty<long double> = infty<ll>;\n\nusing pi = pair<int, int>;\nusing pl = pair<ll, ll>;\nusing vi = vector<int>;\nusing vl = vector<ll>;\ntemplate <class T>\nusing vc = vector<T>;\ntemplate <class T>\nusing vvc = vector<vc<T>>;\nusing vvi = vvc<int>;\nusing vvl = vvc<ll>;\ntemplate <class T>\nusing vvvc = vector<vvc<T>>;\ntemplate <class T>\nusing vvvvc = vector<vvvc<T>>;\ntemplate <class T>\nusing vvvvvc = vector<vvvvc<T>>;\ntemplate <class T>\nusing pqg = std::priority_queue<T, vector<T>, greater<T>>;\ntemplate <class T, class U>\nusing umap = unordered_map<T, U>;\n\n// template <typename K>\n// using tree = __gnu_pbds::tree<K, __gnu_pbds::null_type, std::less<>,\n// __gnu_pbds::rb_tree_tag,\n// __gnu_pbds::tree_order_statistics_node_update>;\n\n#define vv(type, name, h, ...) \\\n vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\n#define vvv(type, name, h, w, ...) \\\n vector<vector<vector<type>>> name( \\\n h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\n#define vvvv(type, name, a, b, c, ...) \\\n vector<vector<vector<vector<type>>>> name( \\\n a, vector<vector<vector<type>>>( \\\n b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\n\n// FOR(a) := for (ll _ = 0; _ < (ll)a; ++_)\n// FOR(i, a) := for (ll i = 0; i < (ll)a; ++i)\n// FOR(i, a, b) := for (ll i = a; i < (ll)b; ++i)\n// FOR(i, a, b, c) := for (ll i = a; i < (ll)b; i += (c))\n// FOR_R(a) := for (ll i = (a) - 1; i >= 0; --i)\n// FOR_R(i, a) := for (ll i = (a) - 1; i >= 0; --i)\n// FOR_R(i, a, b) := for (ll i = (b) - 1; i >= (ll)a; --i)\n#define FOR1(a) for (ll _ = 0; _ < (ll)a; ++_)\n#define FOR2(i, a) for (ll i = 0; i < (ll)a; ++i)\n#define FOR3(i, a, b) for (ll i = a; i < (ll)b; ++i)\n#define FOR4(i, a, b, c) for (ll i = a; i < (ll)b; i += (c))\n#define FOR1_R(a) for (ll i = (a) - 1; i >= 0; --i)\n#define FOR2_R(i, a) for (ll i = (a) - 1; i >= 0; --i)\n#define FOR3_R(i, a, b) for (ll i = (b) - 1; i >= (ll)a; --i)\n#define overload4(a, b, c, d, e, ...) e\n#define overload3(a, b, c, d, ...) d\n#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)\n#define FOR_R(...) overload3(__VA_ARGS__, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)\n\n#define FOR_subset(t, s) \\\n for (int t = (s); t >= 0; t = (t == 0 ? -1 : (t - 1) & (s)))\n#define all(x) x.begin(), x.end()\n#define rall(x) x.rbegin(), x.rend()\n\nint popcnt(int x) { return __builtin_popcount(x); }\nint popcnt(u32 x) { return __builtin_popcount(x); }\nint popcnt(ll x) { return __builtin_popcountll(x); }\nint popcnt(u64 x) { return __builtin_popcountll(x); }\nint popcnt_mod_2(int x) { return __builtin_parity(x); }\nint popcnt_mod_2(u32 x) { return __builtin_parity(x); }\nint popcnt_mod_2(ll x) { return __builtin_parityll(x); }\nint popcnt_mod_2(u64 x) { return __builtin_parityll(x); }\n// (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2)\nint topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }\nint topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }\nint topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nint topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\n// (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2)\nint lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }\nint lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); }\nint lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\nint lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\n\ntemplate <typename T>\nT floor(T a, T b) {\n return a / b - (a % b && (a ^ b) < 0);\n}\ntemplate <typename T>\nT ceil(T x, T y) {\n return floor(x + y - 1, y);\n}\ntemplate <typename T>\nT bmod(T x, T y) {\n return x - y * floor(x, y);\n}\ntemplate <typename T>\npair<T, T> divmod(T x, T y) {\n T q = floor(x, y);\n return {q, x - q * y};\n}\n\ntemplate <typename T, typename U>\nT POW(U x_, int n) {\n T x = x_;\n T ret = 1;\n while (n > 0) {\n if (n & 1) ret *= x;\n x *= x;\n n >>= 1;\n }\n return ret;\n}\n\ntemplate <typename T, typename U>\nT SUM(const vector<U> &A) {\n T sm = 0;\n for (auto &&a : A) sm += a;\n return sm;\n}\n\n#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))\n#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))\n#define UNIQUE(x) \\\n sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()\n\ntemplate <class T, class S>\ninline bool chmax(T &a, const S &b) {\n return (a < b ? a = b, 1 : 0);\n}\ntemplate <class T, class S>\ninline bool chmin(T &a, const S &b) {\n return (a > b ? a = b, 1 : 0);\n}\n\n// ? は -1\nvc<int> s_to_vi(const string &S, char first_char) {\n vc<int> A(S.size());\n FOR(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }\n return A;\n}\n\ntemplate <typename T, typename U>\nvector<T> cumsum(vector<U> &A, int off = 1) {\n int N = A.size();\n vector<T> B(N + 1);\n FOR(i, N) { B[i + 1] = B[i] + A[i]; }\n if (off == 0) B.erase(B.begin());\n return B;\n}\n\ntemplate <typename T>\nvector<int> argsort(const vector<T> &A) {\n vector<int> ids(A.size());\n iota(all(ids), 0);\n sort(all(ids),\n [&](int i, int j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });\n return ids;\n}\n\n// A[I[0]], A[I[1]], ...\ntemplate <typename T>\nvc<T> rearrange(const vc<T> &A, const vc<int> &I) {\n vc<T> B(I.size());\n FOR(i, I.size()) B[i] = A[I[i]];\n return B;\n}\n\ntemplate<class... T>\nconstexpr auto min(T... a){\n return min(initializer_list<common_type_t<T...>>{a...});\n}\ntemplate<class... T>\nconstexpr auto max(T... a){\n return max(initializer_list<common_type_t<T...>>{a...});\n}\n\nvoid print(){\n cout << '\\n';\n}\ntemplate<class T>\nvoid print(const T& a){\n cout << a << '\\n';\n}\ntemplate<class T, class... Ts>\nvoid print(const T& a, const Ts&... b){\n cout << a;\n (cout << ... << (cout << ' ', b));\n cout << '\\n';\n}\ntemplate<class T>\nvoid print(vector<T> &a){\n for (int i = 0; i < (int)a.size(); ++i) {\n cout << a[i] << \" \\n\"[i == (int)a.size() - 1];\n }\n}\ntemplate<class T>\nvoid print(vector<T> &&a){\n for (int i = 0; i < (int)a.size(); ++i) {\n cout << a[i] << \" \\n\"[i == (int)a.size() - 1];\n }\n}\ntemplate<class T>\nvoid print(vector<vector<T>> &a){\n for (int i = 0; i < (int)a.size(); ++i) {\n for (int j = 0; j < (int)a[i].size(); ++j) {\n cout << a[i][j] << \" \\n\"[j == (int)a[i].size() - 1];\n }\n }\n}\ntemplate<class T>\nvoid print(vector<vector<T>> &&a){\n for (int i = 0; i < (int)a.size(); ++i) {\n for (int j = 0; j < (int)a[i].size(); ++j) {\n cout << a[i][j] << \" \\n\"[j == (int)a[i].size() - 1];\n }\n }\n}\nvoid YESNO(bool b) { cout << (b ? \"YES\" : \"NO\") << endl; }\nvoid YesNo(bool b) { cout << (b ? \"Yes\" : \"No\") << endl; }\n\n#ifdef LOCAL\n// https://zenn.dev/sassan/articles/19db660e4da0a4\n#include \"/Library/cpp-dump/dump.hpp\"\n#define dump(...) cpp_dump(__VA_ARGS__)\n// CPP_DUMP_DEFINE_EXPORT_OBJECT(mint, val());\n#else\n#define dump(...)\n#define CPP_DUMP_SET_OPTION(...)\n#define CPP_DUMP_DEFINE_EXPORT_OBJECT(...)\n#define CPP_DUMP_DEFINE_EXPORT_ENUM(...)\n#define CPP_DUMP_DEFINE_DANGEROUS_EXPORT_OBJECT(...)\n#endif\n\n\n//----------------------------------------------------------------\n\nstring stroftree() {\n ll h, w;\n cin >> h >> w;\n if (h == 0 && w == 0) exit(0);\n h += 2;\n w += 2;\n vc<string> p(h);\n p[0] = string(w, '.');\n FOR(i, 1, h - 1) {\n string s;\n cin >> s;\n p[i] = '.' + s + '.';\n }\n p[h-1] = string(w, '.');\n atcoder::dsu uf(h * w);\n FOR(i, h) FOR(j, w - 1) {\n ll idx = i * w + j;\n if (p[i][j] == p[i][j+1]) {\n uf.merge(idx, idx + 1);\n }\n }\n FOR(i, h - 1) FOR(j, w) {\n ll idx = i * w + j;\n if (p[i][j] == p[i+1][j]) {\n uf.merge(idx, idx + w);\n }\n }\n FOR(i, h - 1) FOR(j, 1, w) {\n ll a = i * w + j;\n ll b = (i + 1) * w + j - 1;\n if (p[i][j] == '#' && p[i+1][j-1] == '#') {\n uf.merge(a, b);\n }\n }\n FOR(i, h - 1) FOR(j, w - 1) {\n ll a = i * w + j;\n ll b = (i + 1) * w + j + 1;\n if (p[i][j] == '#' && p[i+1][j+1] == '#') {\n uf.merge(a, b);\n }\n }\n vv(ll, lbl, h, w);\n auto groups = uf.groups();\n FOR(gpi, groups.size()) {\n FOR(pti, groups[gpi].size()) {\n ll idx = groups[gpi][pti];\n ll i = idx / w;\n ll j = idx % w;\n lbl[i][j] = gpi;\n }\n }\n // dump(lbl);\n ll n = groups.size();\n ll di[] = {0, 0, 1, -1};\n ll dj[] = {1, -1, 0, 0};\n vc<set<ll>> vs(n);\n FOR(i, h) FOR(j, w) {\n FOR(k, 4) {\n ll ni = i + di[k];\n ll nj = j + dj[k];\n if (ni < 0 || ni >= h || nj < 0 || nj >= w) {\n continue;\n }\n if (lbl[i][j] == lbl[ni][nj]) continue;\n vs[lbl[i][j]].emplace(lbl[ni][nj]);\n }\n }\n ll slbl = lbl[0][0];\n vc<bool> used(n);\n vvl G(n);\n queue<ll> que;\n que.emplace(slbl);\n while (!que.empty()) {\n ll frm = que.front();\n que.pop();\n used[frm] = true;\n for (auto x : vs[frm]) {\n if (used[x]) continue;\n G[frm].emplace_back(x);\n que.emplace(x);\n }\n }\n auto dfs = [&](auto&& self, ll v) -> string {\n vc<string> ss(G[v].size());\n FOR(i, G[v].size()) {\n ss[i] = '(' + self(self, G[v][i]) + ')';\n }\n sort(all(ss));\n string ret = \"\";\n FOR(i, ss.size()) {\n ret += ss[i];\n }\n return ret;\n };\n return dfs(dfs, slbl);\n}\n\nvoid solve() {\n string s = stroftree();\n string t = stroftree();\n dump(s, t);\n if (s == t) {\n print(\"yes\");\n } else {\n print(\"no\");\n }\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(20);\n CPP_DUMP_SET_OPTION(max_line_width, 80);\n CPP_DUMP_SET_OPTION(log_label_func, cpp_dump::log_label::filename());\n CPP_DUMP_SET_OPTION(enable_asterisk, true);\n while (true) {\n solve();\n }\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":4196,"score_of_the_acc":-0.3279,"final_rank":7},{"submission_id":"aoj_1613_10606879","code_snippet":"#include <bits/stdc++.h>\n#include <unordered_map>\n#include <stdlib.h>\nusing namespace std;\n#define rep(i, a, n) for(ll i = a; i < n; i++)\n#define rrep(i, a, n) for(ll i = a; i >= n; i--)\n#define ll long long\n#define pii pair<int, int>\n#define pll pair<ll, ll>\n#define all(x) (x).begin(), (x).end()\n//constexpr ll MOD = 1000000007;\nconstexpr ll MOD = 998244353;\nconstexpr int IINF = 1001001001;\nconstexpr ll INF = 1LL<<60;\ntemplate<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}\ntemplate<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}\n\nll gcd(ll a, ll b){\n if(a%b == 0){\n return b;\n }else{\n return gcd(b, a%b);\n }\n}\n\nll lcm(ll a, ll b){\n return a*b / gcd(a, b);\n}\n\nll powMod(ll x, ll n) {\n if (n == 0) return 1 % MOD;\n ll val = powMod(x, n / 2);\n val *= val;\n val %= MOD;\n if (n % 2 == 1) val *= x;\n return val % MOD;\n}\n\nclass UnionFind {\n vector<ll> parent, maxi, mini;\n inline ll root(ll n){\n return (parent[n] < 0? n:parent[n] = root(parent[n]));\n }\npublic:\n UnionFind(ll n_ = 1): parent(n_, -1), maxi(n_), mini(n_){\n iota(maxi.begin(), maxi.end(), 0);\n iota(mini.begin(), mini.end(), 0);\n }\n\n inline bool same(ll x, ll y){\n return root(x) == root(y);\n }\n\n inline void unite(ll x, ll y){\n ll rx = root(x);\n ll ry = root(y);\n if(rx == ry) return;\n if(parent[rx] > parent[ry]) swap(rx, ry);\n parent[rx] += parent[ry];\n parent[ry] = rx;\n maxi[rx] = std::max(maxi[rx],maxi[ry]);\n mini[rx] = std::min(mini[rx],mini[ry]);\n }\n\n inline ll min(ll x){\n return mini[root(x)];\n }\n\n inline ll max(ll x){\n return maxi[root(x)];\n }\n\n inline ll size(ll x){\n return (-parent[root(x)]);\n }\n\n inline ll operator[](ll x){\n return root(x);\n }\n\n map<ll,vector<ll>> groups(){\n map<ll,vector<ll>> mp;\n rep(i,0,parent.size())mp[root(i)].push_back(i);\n return mp;\n }\n};\n\nstring solve(vector<string> p){\n ll h = p.size();\n ll w = p[0].size();\n UnionFind uf(h*w);\n rep(i,0,h)rep(j,0,w){\n if(i < h-1 && p[i][j] == p[i+1][j]) uf.unite(i*w+j, (i+1)*w+j);\n if(j < w-1 && p[i][j] == p[i][j+1]) uf.unite(i*w+j, i*w+j+1);\n if(i < h-1 && j < w-1 && p[i][j] == p[i+1][j+1] && p[i][j] == '#') uf.unite(i*w+j, (i+1)*w+j+1);\n if(i > 0 && j < w-1 && p[i][j] == p[i-1][j+1] && p[i][j] == '#') uf.unite(i*w+j, (i-1)*w+j+1);\n }\n auto tmp = uf.groups();\n map<ll,set<ll>> g;\n rep(i,0,h)rep(j,0,w){\n if(i < h-1 && p[i][j] != p[i+1][j]){\n g[uf[i*w+j]].insert(uf[(i+1)*w+j]);\n g[uf[(i+1)*w+j]].insert(uf[i*w+j]);\n }\n if(j < w-1 && p[i][j] != p[i][j+1]){\n g[uf[i*w+j]].insert(uf[i*w+j+1]);\n g[uf[i*w+j+1]].insert(uf[i*w+j]);\n }\n }\n vector<ll> check(h*w,0);\n auto dfs = [&](auto dfs, ll v, ll par) -> string {\n // cout << v << \" \" << par << endl;\n check[v] = 1;\n string res = \"(\";\n vector<string> vec;\n for(auto nv: g[v]){\n if(check[nv]) continue;\n string x = dfs(dfs, nv, v);\n vec.push_back(x);\n }\n sort(all(vec));\n for(auto x: vec) res += x;\n res.push_back(')');\n return res;\n };\n return dfs(dfs, uf[0], -1); \n}\n\nstring solve_(vector<string> p){\n ll h = p.size(), w = p[0].size();\n vector<string> np(h+2, string(w+2, '.'));\n rep(i,0,h)rep(j,0,w) np[i+1][j+1] = p[i][j];\n return solve(np);\n}\n\nint main() {\n while(true){\n ll h1, w1; cin >> h1 >> w1;\n if(h1*w1 == 0) break;\n vector<string> p1(h1);\n rep(i,0,h1) cin >> p1[i];\n string s1 = solve_(p1);\n ll h2, w2; cin >> h2 >> w2;\n vector<string> p2(h2);\n rep(i,0,h2) cin >> p2[i];\n string s2 = solve_(p2);\n if(s1 == s2) cout << \"yes\" << endl;\n else cout << \"no\" << endl;\n // cout << s1 << endl << s2 << endl << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":60,"memory_kb":4296,"score_of_the_acc":-0.4369,"final_rank":10},{"submission_id":"aoj_1613_10578410","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nnamespace noya2 {\n\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const pair<T, U> &p){\n os << p.first << \" \" << p.second;\n return os;\n}\ntemplate <typename T, typename U>\nistream &operator>>(istream &is, pair<T, U> &p){\n is >> p.first >> p.second;\n return is;\n}\n\ntemplate <typename T>\nostream &operator<<(ostream &os, const vector<T> &v){\n int s = (int)v.size();\n for (int i = 0; i < s; i++) os << (i ? \" \" : \"\") << v[i];\n return os;\n}\ntemplate <typename T>\nistream &operator>>(istream &is, vector<T> &v){\n for (auto &x : v) is >> x;\n return is;\n}\n\nvoid in() {}\ntemplate <typename T, class... U>\nvoid in(T &t, U &...u){\n cin >> t;\n in(u...);\n}\n\nvoid out() { cout << \"\\n\"; }\ntemplate <typename T, class... U, char sep = ' '>\nvoid out(const T &t, const U &...u){\n cout << t;\n if (sizeof...(u)) cout << sep;\n out(u...);\n}\n\ntemplate<typename T>\nvoid out(const vector<vector<T>> &vv){\n int s = (int)vv.size();\n for (int i = 0; i < s; i++) out(vv[i]);\n}\n\nstruct IoSetup {\n IoSetup(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n cerr << fixed << setprecision(7);\n }\n} iosetup_noya2;\n\nconst int iinf = 1'000'000'007;\nconst long long linf = 2'000'000'000'000'000'000LL;\nconst long long mod998 = 998244353;\nconst long long mod107 = 1000000007;\nconst long double pi = 3.14159265358979323;\nconst vector<int> dx = {0,1,0,-1,1,1,-1,-1};\nconst vector<int> dy = {1,0,-1,0,1,-1,-1,1};\nconst string ALP = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst string alp = \"abcdefghijklmnopqrstuvwxyz\";\nconst string NUM = \"0123456789\";\n\nvoid yes(){ cout << \"Yes\\n\"; }\nvoid no(){ cout << \"No\\n\"; }\nvoid YES(){ cout << \"YES\\n\"; }\nvoid NO(){ cout << \"NO\\n\"; }\nvoid yn(bool t){ t ? yes() : no(); }\nvoid YN(bool t){ t ? YES() : NO(); }\n\n\nunsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){\n if (a == 0 || b == 0) return a + b;\n int n = __builtin_ctzll(a); a >>= n;\n int m = __builtin_ctzll(b); b >>= m;\n while (a != b) {\n int mm = __builtin_ctzll(a - b);\n bool f = a > b;\n unsigned long long c = f ? a : b;\n b = f ? b : a;\n a = (c - b) >> mm;\n }\n return a << min(n, m);\n}\n\ntemplate<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),abs(b))); }\n\nlong long sqrt_fast(long long n) {\n if (n <= 0) return 0;\n long long x = sqrt(n);\n while ((x + 1) * (x + 1) <= n) x++;\n while (x * x > n) x--;\n return x;\n}\n\ntemplate<typename T> T floor_div(const T n, const T d) {\n assert(d != 0);\n return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);\n}\n\ntemplate<typename T> T ceil_div(const T n, const T d) {\n assert(d != 0);\n return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);\n}\n\ntemplate<typename T> void uniq(vector<T> &v){\n sort(v.begin(),v.end());\n v.erase(unique(v.begin(),v.end()),v.end());\n}\n\ntemplate <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }\n\ntemplate <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }\n\ntemplate<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }\n\n} // namespace noya2\n\n#define rep(i,n) for (int i = 0; i < (int)(n); i++)\n#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)\n#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)\n#define all(v) (v).begin(),(v).end()\n\nusing ll = long long;\nusing ld = long double;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nusing pii = pair<int,int>;\nusing pll = pair<ll,ll>;\nusing pil = pair<int,ll>;\nusing pli = pair<ll,int>;\n\nnamespace noya2{\n\n/* ~ (. _________ . /) */\n\n}\n\nusing namespace noya2;\n\n\n#include <cassert>\n#include <concepts>\n\ntemplate <int m>\nstruct static_modint {\n using mint = static_modint;\n public:\n static constexpr int mod() { return m; }\n static mint raw(int v) {\n mint x;\n x._v = v;\n return x;\n }\n constexpr static_modint() : _v(0) {}\n template<std::signed_integral T>\n constexpr static_modint(T v){\n long long x = (long long)(v % (long long)(umod()));\n if (x < 0) x += umod();\n _v = (unsigned int)(x);\n }\n template<std::unsigned_integral T>\n constexpr static_modint(T v){\n _v = (unsigned int)(v % umod());\n }\n constexpr unsigned int val() const { return _v; }\n mint& operator++() {\n _v++;\n if (_v == umod()) _v = 0;\n return *this;\n }\n mint& operator--() {\n if (_v == 0) _v = umod();\n _v--;\n return *this;\n }\n mint operator++(int) {\n mint result = *this;\n ++*this;\n return result;\n }\n mint operator--(int) {\n mint result = *this;\n --*this;\n return result;\n }\n constexpr mint& operator+=(const mint& rhs) {\n _v += rhs._v;\n if (_v >= umod()) _v -= umod();\n return *this;\n }\n constexpr mint& operator-=(const mint& rhs) {\n _v -= rhs._v;\n if (_v >= umod()) _v += umod();\n return *this;\n }\n constexpr mint& operator*=(const mint& rhs) {\n unsigned long long z = _v;\n z *= rhs._v;\n _v = (unsigned int)(z % umod());\n return *this;\n }\n constexpr mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\n constexpr mint operator+() const { return *this; }\n constexpr mint operator-() const { return mint() - *this; }\n constexpr mint pow(long long n) const {\n assert(0 <= n);\n mint x = *this, r = 1;\n while (n) {\n if (n & 1) r *= x;\n x *= x;\n n >>= 1;\n }\n return r;\n }\n constexpr mint inv() const {\n assert(_v);\n return pow(umod() - 2);\n }\n friend constexpr mint operator+(const mint& lhs, const mint& rhs) {\n return mint(lhs) += rhs;\n }\n friend constexpr mint operator-(const mint& lhs, const mint& rhs) {\n return mint(lhs) -= rhs;\n }\n friend constexpr mint operator*(const mint& lhs, const mint& rhs) {\n return mint(lhs) *= rhs;\n }\n friend constexpr mint operator/(const mint& lhs, const mint& rhs) {\n return mint(lhs) /= rhs;\n }\n friend constexpr bool operator==(const mint& lhs, const mint& rhs) {\n return lhs._v == rhs._v;\n }\n friend constexpr bool operator!=(const mint& lhs, const mint& rhs) {\n return lhs._v != rhs._v;\n }\n friend std::ostream &operator<<(std::ostream &os, const mint& p) {\n return os << p.val();\n }\n friend std::istream &operator>>(std::istream &is, mint &a) {\n long long t; is >> t;\n a = mint(t);\n return (is);\n }\n\n private:\n unsigned int _v;\n static constexpr unsigned int umod() { return m; }\n};\n\nusing mint = static_modint<998244353>;\n\nvector<mint> wdep;\n\nvoid init(){\n wdep.resize(1001001);\n mt19937_64 mt(-1);\n rep(i,wdep.size()){\n wdep[i] = mt();\n }\n}\n\null calc_hash(int h, int w){\n vector<string> a(h+4,string(w+4,'?'));\n rep(i,h){\n string s; in(s);\n rep(j,w){\n a[i+2][j+2] = s[j];\n }\n }\n vector done(h+4,vector<bool>(w+4,false));\n auto findcc = [&](int sx, int sy){\n int kk = (a[sx][sy] == '.' ? 4 : 8);\n vector<pii> ret;\n queue<pii> que;\n que.emplace(sx,sy);\n done[sx][sy] = true;\n while (!que.empty()){\n auto [x, y] = que.front(); que.pop();\n ret.emplace_back(x,y);\n rep(k,kk){\n int nx = x + dx[k];\n int ny = y + dy[k];\n if (!done[nx][ny] && a[sx][sy] == a[nx][ny]){\n done[nx][ny] = true;\n que.emplace(nx,ny);\n }\n }\n }\n return ret;\n };\n auto dfs = [&](auto sfs, vector<pii> cc) -> pair<mint,int> {\n // out(cc);\n int hei = 0;\n mint prd = 1;\n for (auto [ix, iy] : cc){\n rep(k,4){\n int nx = ix + dx[k];\n int ny = iy + dy[k];\n if (!(range(0,nx,h+4) && range(0,ny,w+4))) continue;\n if (done[nx][ny]) continue;\n auto ncc = findcc(nx,ny);\n auto [dp, he] = sfs(sfs,ncc);\n chmax(hei,he+1);\n prd *= dp;\n }\n }\n return {prd+wdep[hei],hei};\n };\n vector<pii> cc;\n rep(i,h+4) rep(j,w+4){\n if (i == 0 || i == h+3 || j == 0 || j == w+3){\n a[i][j] = '#';\n done[i][j] = true;\n cc.emplace_back(i,j);\n }\n else if (i == 1 || i == h+2 || j == 1 || j == w+2){\n a[i][j] = '.';\n }\n }\n // rep(i,h+4) out(a[i]);\n return dfs(dfs,cc).first.val();\n}\n\nvoid solve(int h1, int w1){\n ull x1 = calc_hash(h1,w1);\n int h2, w2; in(h2,w2);\n ull x2 = calc_hash(h2,w2);\n out(x1 == x2 ? \"yes\" : \"no\");\n}\n\nint main(){\n init();\n while (true){\n int h, w; in(h,w);\n if (h == 0) break;\n solve(h,w);\n }\n}","accuracy":1,"time_ms":40,"memory_kb":7464,"score_of_the_acc":-1.0833,"final_rank":18},{"submission_id":"aoj_1613_10275787","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n\nclass UnionFind\n {\n private:\n vector<ll> p;\n vector<ll> rank;\n public:\n UnionFind(ll n){\n p.resize(n,-1);\n rank.resize(n,1);\n }\n ll find(ll x){\n if(p[x]<0)return x;\n return p[x]=find(p[x]);\n }\n void unite(ll x,ll y){\n x = find(x);\n y = find(y);\n if(x == y)return;\n if(rank[x] > rank[y])swap(x,y);\n if(rank[x] == rank[y])rank[y]++;\n p[y] += p[x];\n p[x] = y;\n }\n ll size(ll x){\n return -p[find(x)];\n }\n bool same(ll x, ll y){\n return find(x) == find(y);\n }\n };\n \nvector<int> dx = {1,0,-1,0,1,1,-1,-1};\nvector<int> dy = {0,1,0,-1,1,-1,1,-1};\n\nconst ll mod = 998244353;\nconst ll X = 19960515;\n\nint main(){\n\tauto f = [&](int H , int W , vector<vector<int>> G)->ll{\n\t\tUnionFind uf(H*W);\n\t\tfor(int i = 0; i < H; i++){\n\t\t\tfor(int j = 0; j < W; j++){\n\t\t\t\tfor(int k = 0; k < (G[i][j] == 1 ? 8:4); k++){\n\t\t\t\t\tint ni = i + dx[k];\n\t\t\t\t\tint nj = j + dy[k];\n\t\t\t\t\tif(ni < 0 || ni >= H)continue;\n\t\t\t\t\tif(nj < 0 || nj >= W)continue;\n\t\t\t\t\tif(G[i][j] != G[ni][nj])continue;\n\t\t\t\t\tuf.unite(i*W+j , ni*W+nj);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint N = 0;\n\t\tvector<int> idx(H*W,-1);\n\t\tfor(int i = 0; i < H*W; i++)if(uf.find(i) == i){\n\t\t\tidx[i] = N;\n\t\t\tN++;\n\t\t}\n\t\tvector<set<int>> graph(N);\n\t\tfor(int i = 0; i < H; i++){\n\t\t\tfor(int j = 0; j < W; j++){\n\t\t\t\tfor(int k = 0; k < 4; k++){\n\t\t\t\t\tint ni = i + dx[k];\n\t\t\t\t\tint nj = j + dy[k];\n\t\t\t\t\tif(ni < 0 || ni >= H)continue;\n\t\t\t\t\tif(nj < 0 || nj >= W)continue;\n\t\t\t\t\tint x = uf.find(i*W+j);\n\t\t\t\t\tx = idx[x];\n\t\t\t\t\tint y = uf.find(ni*W+nj);\n\t\t\t\t\ty = idx[y];\n\t\t\t\t\tif(x == y)continue;\n\t\t\t\t\tgraph[x].insert(y);\n\t\t\t\t\tgraph[y].insert(x);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tint root = idx[uf.find(0)];\n\t\tauto dfs = [&](auto dfs , int v , int p = -1)->ll{\n\t\t\tll ret = 1;\n\t\t\tfor(auto c:graph[v]){\n\t\t\t\tif(c == p)continue;\n\t\t\t\tret *= (X + dfs(dfs , c , v));\n\t\t\t\tret %= mod;\n\t\t\t}\n\t\t\treturn ret;\n\t\t};\n\t\treturn dfs(dfs, root);\n\t};\n\twhile(1){\n\t\tint H1,W1; cin >> H1 >> W1;\n\t\tif(H1 == 0){\n\t\t\treturn 0;\n\t\t}\n\t\tvector<vector<int>> G1(H1+2 , vector<int>(W1+2));\n\t\tfor(int i = 1; i <= H1; i++){\n\t\t\tfor(int j = 1; j <= W1; j++){\n\t\t\t\tchar c; cin >> c;\n\t\t\t\tif(c == '#')G1[i][j] = 1;\n\t\t\t}\n\t\t}\n\t\tint H2,W2; cin >> H2 >> W2;\n\t\tvector<vector<int>> G2(H2+2 , vector<int>(W2+2));\n\t\tfor(int i = 1; i <= H2; i++){\n\t\t\tfor(int j = 1; j <= W2; j++){\n\t\t\t\tchar c; cin >> c;\n\t\t\t\tif(c == '#')G2[i][j] = 1;\n\t\t\t}\n\t\t}\n\t\tH1 += 2;\n\t\tW1 += 2;\n\t\tH2 += 2;\n\t\tW2 += 2;\n\t\tif(f(H1,W1,G1) == f(H2,W2,G2))cout << \"yes\" << endl;\n\t\telse cout << \"no\" << endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":70,"memory_kb":4096,"score_of_the_acc":-0.4689,"final_rank":14},{"submission_id":"aoj_1613_9582796","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)), (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#include <unistd.h>\n\nnamespace fastio {\nstatic constexpr uint32_t SZ = 1 << 17;\nchar ibuf[SZ];\nchar obuf[SZ];\nchar out[100];\n// pointer of ibuf, obuf\n\n\nuint32_t pil = 0, pir = 0, por = 0;\n\nstruct Pre {\n char num[10000][4];\n constexpr Pre() : num() {\n for (int i = 0; i < 10000; i++) {\n int n = i;\n for (int j = 3; j >= 0; j--) {\n num[i][j] = n % 10 | '0';\n n /= 10;\n }\n }\n }\n} constexpr pre;\n\ninline void load() {\n memmove(ibuf, ibuf + pil, pir - pil);\n pir = pir - pil + fread(ibuf + pir - pil, 1, SZ - pir + pil, stdin);\n pil = 0;\n if (pir < SZ)\n ibuf[pir++] = '\\n';\n}\n\ninline void flush() {\n fwrite(obuf, 1, por, stdout);\n por = 0;\n}\n\nvoid rd(char &c) {\n do {\n if (pil + 1 > pir)\n load();\n c = ibuf[pil++];\n } while (isspace(c));\n}\n\nvoid rd(string &x) {\n x.clear();\n char c;\n do {\n if (pil + 1 > pir)\n load();\n c = ibuf[pil++];\n } while (isspace(c));\n do {\n x += c;\n if (pil == pir)\n load();\n c = ibuf[pil++];\n } while (!isspace(c));\n}\n\ntemplate <typename T> void rd_real(T &x) {\n string s;\n rd(s);\n x = stod(s);\n}\n\ntemplate <typename T> void rd_integer(T &x) {\n if (pil + 100 > pir)\n load();\n char c;\n do\n c = ibuf[pil++];\n while (c < '-');\n bool minus = 0;\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\n if (c == '-') {\n minus = 1, c = ibuf[pil++];\n }\n }\n x = 0;\n while ('0' <= c) {\n x = x * 10 + (c & 15), c = ibuf[pil++];\n }\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\n if (minus)\n x = -x;\n }\n}\n\nvoid rd(int &x) {\n rd_integer(x);\n}\nvoid rd(ll &x) {\n rd_integer(x);\n}\nvoid rd(i128 &x) {\n rd_integer(x);\n}\nvoid rd(uint &x) {\n rd_integer(x);\n}\nvoid rd(ull &x) {\n rd_integer(x);\n}\nvoid rd(u128 &x) {\n rd_integer(x);\n}\nvoid rd(double &x) {\n rd_real(x);\n}\nvoid rd(long double &x) {\n rd_real(x);\n}\n\ntemplate <class T, class U> void rd(pair<T, U> &p) {\n return rd(p.first), rd(p.second);\n}\ntemplate <size_t N = 0, typename T> void rd_tuple(T &t) {\n if constexpr (N < std::tuple_size<T>::value) {\n auto &x = std::get<N>(t);\n rd(x);\n rd_tuple<N + 1>(t);\n }\n}\ntemplate <class... T> void rd(tuple<T...> &tpl) {\n rd_tuple(tpl);\n}\n\ntemplate <size_t N = 0, typename T> void rd(array<T, N> &x) {\n for (auto &d : x)\n rd(d);\n}\ntemplate <class T> void rd(vector<T> &x) {\n for (auto &d : x)\n rd(d);\n}\n\nvoid read() {}\ntemplate <class H, class... T> void read(H &h, T &...t) {\n rd(h), read(t...);\n}\n\nvoid wt(const char c) {\n if (por == SZ)\n flush();\n obuf[por++] = c;\n}\nvoid wt(const string s) {\n for (char c : s)\n wt(c);\n}\nvoid wt(const char *s) {\n size_t len = strlen(s);\n for (size_t i = 0; i < len; i++)\n wt(s[i]);\n}\n\ntemplate <typename T> void wt_integer(T x) {\n if (por > SZ - 100)\n flush();\n if (x < 0) {\n obuf[por++] = '-', x = -x;\n }\n int outi;\n for (outi = 96; x >= 10000; outi -= 4) {\n memcpy(out + outi, pre.num[x % 10000], 4);\n x /= 10000;\n }\n if (x >= 1000) {\n memcpy(obuf + por, pre.num[x], 4);\n por += 4;\n } else if (x >= 100) {\n memcpy(obuf + por, pre.num[x] + 1, 3);\n por += 3;\n } else if (x >= 10) {\n int q = (x * 103) >> 10;\n obuf[por] = q | '0';\n obuf[por + 1] = (x - q * 10) | '0';\n por += 2;\n } else\n obuf[por++] = x | '0';\n memcpy(obuf + por, out + outi + 4, 96 - outi);\n por += 96 - outi;\n}\n\ntemplate <typename T> void wt_real(T x) {\n ostringstream oss;\n oss << fixed << setprecision(15) << double(x);\n string s = oss.str();\n wt(s);\n}\n\nvoid wt(int x) {\n wt_integer(x);\n}\nvoid wt(ll x) {\n wt_integer(x);\n}\nvoid wt(i128 x) {\n wt_integer(x);\n}\nvoid wt(uint x) {\n wt_integer(x);\n}\nvoid wt(ull x) {\n wt_integer(x);\n}\nvoid wt(u128 x) {\n wt_integer(x);\n}\nvoid wt(double x) {\n wt_real(x);\n}\nvoid wt(long double x) {\n wt_real(x);\n}\n\ntemplate <class T, class U> void wt(const pair<T, U> val) {\n wt(val.first);\n wt(' ');\n wt(val.second);\n}\ntemplate <size_t N = 0, typename T> void wt_tuple(const T t) {\n if constexpr (N < std::tuple_size<T>::value) {\n if constexpr (N > 0) {\n wt(' ');\n }\n const auto x = std::get<N>(t);\n wt(x);\n wt_tuple<N + 1>(t);\n }\n}\ntemplate <class... T> void wt(tuple<T...> tpl) {\n wt_tuple(tpl);\n}\ntemplate <class T, size_t S> void wt(const array<T, S> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i)\n wt(' ');\n wt(val[i]);\n }\n}\ntemplate <class T> void wt(const vector<T> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i)\n wt(' ');\n wt(val[i]);\n }\n}\n\nvoid print() {\n wt('\\n');\n}\ntemplate <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {\n wt(head);\n if (sizeof...(Tail))\n wt(' ');\n print(forward<Tail>(tail)...);\n}\nvoid __attribute__((destructor)) _d() {\n flush();\n}\n} // namespace fastio\n\n\nusing fastio::flush;\nusing fastio::print;\nusing fastio::read;\n\ninline void first(bool i = true) {\n print(i ? \"first\" : \"second\");\n}\ninline void Alice(bool i = true) {\n print(i ? \"Alice\" : \"Bob\");\n}\ninline void Takahashi(bool i = true) {\n print(i ? \"Takahashi\" : \"Aoki\");\n}\ninline void yes(bool i = true) {\n print(i ? \"yes\" : \"no\");\n}\ninline void Yes(bool i = true) {\n print(i ? \"Yes\" : \"No\");\n}\ninline void No() {\n print(\"No\");\n}\ninline void YES(bool i = true) {\n print(i ? \"YES\" : \"NO\");\n}\ninline void NO() {\n print(\"NO\");\n}\ninline void Yay(bool i = true) {\n print(i ? \"Yay!\" : \":(\");\n}\ninline void Possible(bool i = true) {\n print(i ? \"Possible\" : \"Impossible\");\n}\ninline void POSSIBLE(bool i = true) {\n print(i ? \"POSSIBLE\" : \"IMPOSSIBLE\");\n}\n\n/**\n * @brief Fast IO\n */\n\nint dx1[4] = {1,0,-1,0}, dy1[4] = {0,1,0,-1};\nint dx2[8] = {1,1,1,0,-1,-1,-1,0}, dy2[8] = {-1,0,1,1,1,0,-1,-1};\n\nmap<vector<int>,int> mp;\n\nvector<vector<int>> MakeGraph(int N, int M) {\n N += 2, M += 2;\n vector<vector<char>> C(N,vector<char>(M,'.'));\n rep(i,1,N-1) rep(j,1,M-1) cin >> C[i][j];\n int Cur = 0;\n vector<vector<int>> B(N, vector<int>(M,-1));\n rep(i,0,N) {\n rep(j,0,M) {\n if (B[i][j] == -1 && C[i][j] == '.') {\n queue<pair<int,int>> Q;\n Q.push({i,j});\n B[i][j] = Cur;\n while(!Q.empty()) {\n auto [X,Y] = Q.front();\n Q.pop();\n rep(k,0,4) {\n int NX = X + dx1[k], NY = Y + dy1[k];\n if (0 <= NX && NX < N && 0 <= NY && NY < M) {\n if (C[NX][NY] == '.' && B[NX][NY] == -1) {\n B[NX][NY] = Cur;\n Q.push({NX,NY});\n }\n }\n }\n }\n Cur++;\n }\n }\n }\n rep(i,0,N) {\n rep(j,0,M) {\n if (B[i][j] == -1 && C[i][j] == '#') {\n queue<pair<int,int>> Q;\n Q.push({i,j});\n B[i][j] = Cur;\n while(!Q.empty()) {\n auto [X,Y] = Q.front();\n Q.pop();\n rep(k,0,8) {\n int NX = X + dx2[k], NY = Y + dy2[k];\n if (0 <= NX && NX < N && 0 <= NY && NY < M) {\n if (C[NX][NY] == '#' && B[NX][NY] == -1) {\n B[NX][NY] = Cur;\n Q.push({NX,NY});\n }\n }\n }\n }\n Cur++;\n }\n }\n }\n vector<vector<pair<int,int>>> P(Cur);\n rep(i,0,N) {\n rep(j,0,M) {\n P[B[i][j]].push_back({i,j});\n }\n }\n vector<vector<int>> Ret(Cur);\n vector<bool> used(N,false);\n queue<int> Q2;\n Q2.push(0);\n used[0] = true;\n while(!Q2.empty()) {\n int Z = Q2.front();\n Q2.pop();\n for (auto [X,Y] : P[Z]) {\n rep(i,0,4) {\n int NX = X + dx1[i], NY = Y + dy1[i];\n if (0 <= NX && NX < N && 0 <= NY && NY < M) {\n if (!used[B[NX][NY]]) {\n Ret[Z].push_back(B[NX][NY]);\n used[B[NX][NY]] = true;\n Q2.push(B[NX][NY]);\n }\n }\n }\n }\n }\n return Ret;\n}\n\nint ID = 0;\n\nint DFS(vector<vector<int>>& V, int X) {\n vector<int> A;\n for (int NX : V[X]) {\n A.push_back(DFS(V,NX));\n }\n sort(ALL(A));\n if (mp.count(A)) return mp[A];\n else {\n mp[A] = ID;\n return ID++;\n }\n}\n\nbool Compare(vector<vector<int>>& V1, vector<vector<int>>& V2) {\n if (V1.size() != V2.size()) return false;\n return DFS(V1,0) == DFS(V2,0);\n}\n\nint main() {\nwhile(1) {\n int N, M;\n cin >> N >> M;\n if (N == 0 && M == 0) return 0;\n vector<vector<int>> V1 = MakeGraph(N,M);\n cin >> N >> M;\n vector<vector<int>> V2 = MakeGraph(N,M);\n cout << (Compare(V1,V2) ? \"yes\" : \"no\") << endl;\n}\n}","accuracy":1,"time_ms":50,"memory_kb":3792,"score_of_the_acc":-0.2242,"final_rank":5},{"submission_id":"aoj_1613_9582794","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)), (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#include <unistd.h>\n\nnamespace fastio {\nstatic constexpr uint32_t SZ = 1 << 17;\nchar ibuf[SZ];\nchar obuf[SZ];\nchar out[100];\n// pointer of ibuf, obuf\n\n\nuint32_t pil = 0, pir = 0, por = 0;\n\nstruct Pre {\n char num[10000][4];\n constexpr Pre() : num() {\n for (int i = 0; i < 10000; i++) {\n int n = i;\n for (int j = 3; j >= 0; j--) {\n num[i][j] = n % 10 | '0';\n n /= 10;\n }\n }\n }\n} constexpr pre;\n\ninline void load() {\n memmove(ibuf, ibuf + pil, pir - pil);\n pir = pir - pil + fread(ibuf + pir - pil, 1, SZ - pir + pil, stdin);\n pil = 0;\n if (pir < SZ)\n ibuf[pir++] = '\\n';\n}\n\ninline void flush() {\n fwrite(obuf, 1, por, stdout);\n por = 0;\n}\n\nvoid rd(char &c) {\n do {\n if (pil + 1 > pir)\n load();\n c = ibuf[pil++];\n } while (isspace(c));\n}\n\nvoid rd(string &x) {\n x.clear();\n char c;\n do {\n if (pil + 1 > pir)\n load();\n c = ibuf[pil++];\n } while (isspace(c));\n do {\n x += c;\n if (pil == pir)\n load();\n c = ibuf[pil++];\n } while (!isspace(c));\n}\n\ntemplate <typename T> void rd_real(T &x) {\n string s;\n rd(s);\n x = stod(s);\n}\n\ntemplate <typename T> void rd_integer(T &x) {\n if (pil + 100 > pir)\n load();\n char c;\n do\n c = ibuf[pil++];\n while (c < '-');\n bool minus = 0;\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\n if (c == '-') {\n minus = 1, c = ibuf[pil++];\n }\n }\n x = 0;\n while ('0' <= c) {\n x = x * 10 + (c & 15), c = ibuf[pil++];\n }\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\n if (minus)\n x = -x;\n }\n}\n\nvoid rd(int &x) {\n rd_integer(x);\n}\nvoid rd(ll &x) {\n rd_integer(x);\n}\nvoid rd(i128 &x) {\n rd_integer(x);\n}\nvoid rd(uint &x) {\n rd_integer(x);\n}\nvoid rd(ull &x) {\n rd_integer(x);\n}\nvoid rd(u128 &x) {\n rd_integer(x);\n}\nvoid rd(double &x) {\n rd_real(x);\n}\nvoid rd(long double &x) {\n rd_real(x);\n}\n\ntemplate <class T, class U> void rd(pair<T, U> &p) {\n return rd(p.first), rd(p.second);\n}\ntemplate <size_t N = 0, typename T> void rd_tuple(T &t) {\n if constexpr (N < std::tuple_size<T>::value) {\n auto &x = std::get<N>(t);\n rd(x);\n rd_tuple<N + 1>(t);\n }\n}\ntemplate <class... T> void rd(tuple<T...> &tpl) {\n rd_tuple(tpl);\n}\n\ntemplate <size_t N = 0, typename T> void rd(array<T, N> &x) {\n for (auto &d : x)\n rd(d);\n}\ntemplate <class T> void rd(vector<T> &x) {\n for (auto &d : x)\n rd(d);\n}\n\nvoid read() {}\ntemplate <class H, class... T> void read(H &h, T &...t) {\n rd(h), read(t...);\n}\n\nvoid wt(const char c) {\n if (por == SZ)\n flush();\n obuf[por++] = c;\n}\nvoid wt(const string s) {\n for (char c : s)\n wt(c);\n}\nvoid wt(const char *s) {\n size_t len = strlen(s);\n for (size_t i = 0; i < len; i++)\n wt(s[i]);\n}\n\ntemplate <typename T> void wt_integer(T x) {\n if (por > SZ - 100)\n flush();\n if (x < 0) {\n obuf[por++] = '-', x = -x;\n }\n int outi;\n for (outi = 96; x >= 10000; outi -= 4) {\n memcpy(out + outi, pre.num[x % 10000], 4);\n x /= 10000;\n }\n if (x >= 1000) {\n memcpy(obuf + por, pre.num[x], 4);\n por += 4;\n } else if (x >= 100) {\n memcpy(obuf + por, pre.num[x] + 1, 3);\n por += 3;\n } else if (x >= 10) {\n int q = (x * 103) >> 10;\n obuf[por] = q | '0';\n obuf[por + 1] = (x - q * 10) | '0';\n por += 2;\n } else\n obuf[por++] = x | '0';\n memcpy(obuf + por, out + outi + 4, 96 - outi);\n por += 96 - outi;\n}\n\ntemplate <typename T> void wt_real(T x) {\n ostringstream oss;\n oss << fixed << setprecision(15) << double(x);\n string s = oss.str();\n wt(s);\n}\n\nvoid wt(int x) {\n wt_integer(x);\n}\nvoid wt(ll x) {\n wt_integer(x);\n}\nvoid wt(i128 x) {\n wt_integer(x);\n}\nvoid wt(uint x) {\n wt_integer(x);\n}\nvoid wt(ull x) {\n wt_integer(x);\n}\nvoid wt(u128 x) {\n wt_integer(x);\n}\nvoid wt(double x) {\n wt_real(x);\n}\nvoid wt(long double x) {\n wt_real(x);\n}\n\ntemplate <class T, class U> void wt(const pair<T, U> val) {\n wt(val.first);\n wt(' ');\n wt(val.second);\n}\ntemplate <size_t N = 0, typename T> void wt_tuple(const T t) {\n if constexpr (N < std::tuple_size<T>::value) {\n if constexpr (N > 0) {\n wt(' ');\n }\n const auto x = std::get<N>(t);\n wt(x);\n wt_tuple<N + 1>(t);\n }\n}\ntemplate <class... T> void wt(tuple<T...> tpl) {\n wt_tuple(tpl);\n}\ntemplate <class T, size_t S> void wt(const array<T, S> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i)\n wt(' ');\n wt(val[i]);\n }\n}\ntemplate <class T> void wt(const vector<T> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i)\n wt(' ');\n wt(val[i]);\n }\n}\n\nvoid print() {\n wt('\\n');\n}\ntemplate <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {\n wt(head);\n if (sizeof...(Tail))\n wt(' ');\n print(forward<Tail>(tail)...);\n}\nvoid __attribute__((destructor)) _d() {\n flush();\n}\n} // namespace fastio\n\n\nusing fastio::flush;\nusing fastio::print;\nusing fastio::read;\n\ninline void first(bool i = true) {\n print(i ? \"first\" : \"second\");\n}\ninline void Alice(bool i = true) {\n print(i ? \"Alice\" : \"Bob\");\n}\ninline void Takahashi(bool i = true) {\n print(i ? \"Takahashi\" : \"Aoki\");\n}\ninline void yes(bool i = true) {\n print(i ? \"yes\" : \"no\");\n}\ninline void Yes(bool i = true) {\n print(i ? \"Yes\" : \"No\");\n}\ninline void No() {\n print(\"No\");\n}\ninline void YES(bool i = true) {\n print(i ? \"YES\" : \"NO\");\n}\ninline void NO() {\n print(\"NO\");\n}\ninline void Yay(bool i = true) {\n print(i ? \"Yay!\" : \":(\");\n}\ninline void Possible(bool i = true) {\n print(i ? \"Possible\" : \"Impossible\");\n}\ninline void POSSIBLE(bool i = true) {\n print(i ? \"POSSIBLE\" : \"IMPOSSIBLE\");\n}\n\n/**\n * @brief Fast IO\n */\n\nint dx1[4] = {1,0,-1,0}, dy1[4] = {0,1,0,-1};\nint dx2[8] = {1,1,1,0,-1,-1,-1,0}, dy2[8] = {-1,0,1,1,1,0,-1,-1};\n\nmap<vector<int>,int> mp;\n\nvector<vector<int>> MakeGraph(int N, int M) {\n N += 2, M += 2;\n vector<vector<char>> C(N,vector<char>(M,'.'));\n rep(i,1,N-1) rep(j,1,M-1) cin >> C[i][j];\n int Cur = 0;\n vector<vector<int>> B(N, vector<int>(M,-1));\n rep(i,0,N) {\n rep(j,0,M) {\n if (B[i][j] == -1 && C[i][j] == '.') {\n queue<pair<int,int>> Q;\n Q.push({i,j});\n B[i][j] = Cur;\n while(!Q.empty()) {\n auto [X,Y] = Q.front();\n Q.pop();\n rep(k,0,4) {\n int NX = X + dx1[k], NY = Y + dy1[k];\n if (0 <= NX && NX < N && 0 <= NY && NY < M) {\n if (C[NX][NY] == '.' && B[NX][NY] == -1) {\n B[NX][NY] = Cur;\n Q.push({NX,NY});\n }\n }\n }\n }\n Cur++;\n }\n }\n }\n rep(i,0,N) {\n rep(j,0,M) {\n if (B[i][j] == -1 && C[i][j] == '#') {\n queue<pair<int,int>> Q;\n Q.push({i,j});\n B[i][j] = Cur;\n while(!Q.empty()) {\n auto [X,Y] = Q.front();\n Q.pop();\n rep(k,0,8) {\n int NX = X + dx2[k], NY = Y + dy2[k];\n if (0 <= NX && NX < N && 0 <= NY && NY < M) {\n if (C[NX][NY] == '#' && B[NX][NY] == -1) {\n B[NX][NY] = Cur;\n Q.push({NX,NY});\n }\n }\n }\n }\n Cur++;\n }\n }\n }\n vector<vector<pair<int,int>>> P(Cur);\n rep(i,0,N) {\n rep(j,0,M) {\n P[B[i][j]].push_back({i,j});\n }\n }\n vector<vector<int>> Ret(Cur);\n vector<bool> used(N,false);\n queue<int> Q2;\n Q2.push(0);\n used[0] = true;\n while(!Q2.empty()) {\n int Z = Q2.front();\n Q2.pop();\n for (auto [X,Y] : P[Z]) {\n rep(i,0,4) {\n int NX = X + dx1[i], NY = Y + dy1[i];\n if (0 <= NX && NX < N && 0 <= NY && NY < M) {\n if (!used[B[NX][NY]]) {\n Ret[Z].push_back(B[NX][NY]);\n used[B[NX][NY]] = true;\n Q2.push(B[NX][NY]);\n }\n }\n }\n }\n }\n return Ret;\n}\n\nint ID = 0;\n\nint DFS(vector<vector<int>> V, int X) {\n vector<int> A;\n for (int NX : V[X]) {\n A.push_back(DFS(V,NX));\n }\n sort(ALL(A));\n if (mp.count(A)) return mp[A];\n else {\n mp[A] = ID;\n return ID++;\n }\n}\n\nint main() {\nwhile(1) {\n int N, M;\n cin >> N >> M;\n if (N == 0 && M == 0) return 0;\n vector<vector<int>> V1 = MakeGraph(N,M);\n cin >> N >> M;\n vector<vector<int>> V2 = MakeGraph(N,M);\n cout << (DFS(V1,0) == DFS(V2,0) ? \"yes\" : \"no\") << endl;\n}\n}","accuracy":1,"time_ms":70,"memory_kb":3956,"score_of_the_acc":-0.4329,"final_rank":9},{"submission_id":"aoj_1613_9379813","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nconst vector<pair<int,int>>white={{1,0},{-1,0},{0,1},{0,-1}};\nconst vector<pair<int,int>>black={{1,0},{-1,0},{0,1},{0,-1},{1,1},{1,-1},{-1,1},{-1,-1}};\nvector<vector<int>>make_tree(const vector<vector<char>>&g)\n{\n int h=g.size(),w=g[0].size();\n int cnt=0;\n vector<vector<bool>>vis(h,vector<bool>(w,false));\n vector<vector<int>>idx(h,vector<int>(w));\n vector<vector<pair<int,int>>>inv;\n for(int i=0;i<h;i++)for(int j=0;j<w;j++)if(!vis[i][j])\n {\n inv.push_back({});\n vis[i][j]=true;\n queue<pair<int,int>>q;\n q.push(make_pair(i,j));\n while(!q.empty())\n {\n auto[r,c]=q.front();\n q.pop();\n idx[r][c]=cnt;\n inv[cnt].push_back(make_pair(r,c));\n for(auto[dr,dc]:(g[r][c]=='.'?white:black))\n {\n int tr=r+dr,tc=c+dc;\n if(0<=tr&&tr<h&&0<=tc&&tc<w&&!vis[tr][tc]&&g[tr][tc]==g[r][c])\n {\n vis[tr][tc]=true;\n q.push(make_pair(tr,tc));\n }\n }\n }\n cnt++;\n }\n vector<bool>checked(cnt,false);\n checked[0]=true;\n vector<vector<int>>res(cnt);\n for(int i=0;i<cnt;i++)\n {\n // for(int j=0;j<cnt;j++)cout<<checked[j];cout<<endl;\n assert(checked[i]);\n for(auto[r,c]:inv[i])for(auto[dr,dc]:white)\n {\n int tr=r+dr,tc=c+dc;\n if(0<=tr&&tr<h&&0<=tc&&tc<w&&!checked[idx[tr][tc]])\n {\n checked[idx[tr][tc]]=true;\n res[i].push_back(idx[tr][tc]);\n }\n }\n sort(res[i].begin(),res[i].end());\n res[i].erase(unique(res[i].begin(),res[i].end()),res[i].end());\n }\n return res;\n}\nstring tree_hash(const vector<vector<int>>&t)\n{\n auto dfs=[&](auto dfs, int u, int p)->string\n {\n vector<string>cld;\n for(int v:t[u])if(v!=p)cld.push_back(dfs(dfs,v,u));\n sort(cld.begin(),cld.end());\n string res=\"(\";\n for(auto s:cld)res+=s;\n return res+\")\";\n };\n return dfs(dfs,0,-1);\n}\nbool solve()\n{\n int H1,W1;\n cin>>H1>>W1;\n if(H1==0&&W1==0)return false;\n vector<vector<char>>grid1(H1+2,vector<char>(W1+2,'.'));\n for(int i=1;i<=H1;i++)for(int j=1;j<=W1;j++)cin>>grid1[i][j];\n int H2,W2;\n cin>>H2>>W2;\n vector<vector<char>>grid2(H2+2,vector<char>(W2+2,'.'));\n for(int i=1;i<=H2;i++)for(int j=1;j<=W2;j++)cin>>grid2[i][j];\n auto T1=make_tree(grid1);\n auto T2=make_tree(grid2);\n cout<<(tree_hash(T1)==tree_hash(T2)?\"yes\":\"no\")<<endl;\n return true;\n}\nint main(){while(solve()){}}","accuracy":1,"time_ms":60,"memory_kb":3760,"score_of_the_acc":-0.2993,"final_rank":6},{"submission_id":"aoj_1613_9372890","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nbool is_end = false;\n\nconst vector<pair<int, int>> move_white = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};\nconst vector<pair<int, int>> move_black = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}, {1, 1}, {1, -1}, {-1, 1}, {-1, -1}};\n\nstruct grid {\n // grid() : grid(0, 0, 0) {}\n // grid(int h, int w, int c) : H(h), W(w), cnt_component(c) {}\n int H, W;\n int cnt_component = 0;\n vector<vector<char>> p;\n vector<vector<int>> component_id;\n vector<vector<pair<int, int>>> component;\n // グリッドの内部のマスか判定する\n bool _within_area(int r, int c) {\n return (0 <= r && r < H && 0 <= c && c < W);\n }\n // 始点と id を指定 同じ連結成分に id を伝播する\n void _bfs_allocate_id(int r_s, int c_s, int id_s) {\n queue<pair<int, int>> que;\n const vector<pair<int, int>> dir = (p[r_s][c_s] == '.' ? move_white : move_black);\n component_id[r_s][c_s] = id_s;\n component.push_back(vector<pair<int, int>>());\n que.push(make_pair(r_s, c_s));\n while(!que.empty()) {\n auto [r, c] = que.front();\n que.pop();\n for(const auto &[dr, dc] : dir) {\n const int nr = r + dr;\n const int nc = c + dc;\n if(_within_area(nr, nc) && p[nr][nc] == p[r][c] && component_id[nr][nc] == -1) {\n component_id[nr][nc] = component_id[r][c];\n que.push(make_pair(nr, nc));\n }\n }\n }\n }\n // 全体に連結成分の id を割り振る\n void allocate_id() {\n for(int i = 0; i < H; i++) {\n for(int j = 0; j < W; j++) {\n if(component_id[i][j] != -1) continue;\n _bfs_allocate_id(i, j, cnt_component++);\n }\n }\n for(int i = 0; i < H; i++) {\n for(int j = 0; j < W; j++) {\n component[component_id[i][j]].push_back(make_pair(i, j));\n }\n }\n }\n // 木に変形する 直属の子のリストを返す\n vector<vector<int>> to_tree() {\n vector<bool> used(cnt_component);\n vector<vector<int>> child(cnt_component);\n queue<int> que;\n que.push(0);\n used[0] = true;\n while(!que.empty()) {\n const int i = que.front();\n que.pop();\n for(const auto &[r, c] : component[i]) {\n const vector<pair<int, int>> dir = (p[r][c] == '.' ? move_white : move_black);\n for(const auto &[dr, dc] : dir) {\n const int nr = r + dr;\n const int nc = c + dc;\n if(_within_area(nr, nc) && !used[component_id[nr][nc]]) {\n const int j = component_id[nr][nc];\n child[i].push_back(j);\n que.push(j);\n used[j] = true;\n }\n }\n }\n }\n return child;\n }\n // 入力を読む\n grid(int c) : cnt_component(c) {\n cin >> H >> W;\n if(H == 0 && W == 0) {\n is_end = true;\n }\n H += 2, W += 2;\n p = vector(H, vector<char>(W, '.'));\n component_id = vector(H, vector<int>(W, -1));\n for(int i = 1; i < H - 1; i++) {\n string str_in;\n cin >> str_in;\n for(int j = 1; j < W - 1; j++) {\n p[i][j] = str_in[j - 1];\n }\n }\n allocate_id();\n }\n};\n\nstring hash_tree(vector<vector<int>> &child, int cur = 0) {\n if(child[cur].empty()) return \"\";\n vector<string> hash_child;\n for(const int &nxt : child[cur]) {\n hash_child.push_back('(' + hash_tree(child, nxt) + ')');\n }\n sort(hash_child.begin(), hash_child.end());\n string ret = \"\";\n for(const string &str : hash_child) {\n ret += str;\n }\n return ret;\n}\n\nbool solve() {\n grid G1(0);\n if(is_end) { return false; }\n grid G2(0);\n if(G1.cnt_component != G2.cnt_component) { cout << \"no\" << endl; return true; }\n vector<vector<int>> T1 = G1.to_tree();\n vector<vector<int>> T2 = G2.to_tree();\n cout << (hash_tree(T1) == hash_tree(T2) ? \"yes\" : \"no\") << endl;\n return true;\n}\n\nint main() {\n while(solve()) {}\n}","accuracy":1,"time_ms":60,"memory_kb":3928,"score_of_the_acc":-0.3424,"final_rank":8},{"submission_id":"aoj_1613_9372649","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vll = vector<ll>;\n#define rep(i,n) for(ll i=0;i<n;i++)\n\nvll dx={1,0,-1,0,1,-1,1,-1};\nvll dy={0,1,0,-1,1,1,-1,-1};\nvector<vll> to_tree(vector<string> S){\n ll H=S.size();\n ll W=S[0].size();\n\n vector<vector<ll>> val(H,vll(W,-1));\n ll cnt=0;\n rep(h,H)rep(w,W){\n if(val[h][w]!=-1)continue;\n queue<pair<ll,ll>> Q;\n Q.push({h,w});\n val[h][w]=cnt;\n while(!Q.empty()){\n ll y=Q.front().first;\n ll x=Q.front().second;\n Q.pop();\n ll ds=4;\n if(S[y][x]=='#')ds=8;\n rep(d,ds){\n ll ny=y+dy[d];\n ll nx=x+dx[d];\n if(ny<0||nx<0||ny>=H||nx>=W)continue;\n if(S[ny][nx]!=S[y][x])continue;\n if(val[ny][nx]!=-1)continue;\n val[ny][nx]=cnt;\n Q.push({ny,nx});\n }\n }\n cnt++;\n }\n\n // rep(h,H){\n // rep(w,W){\n // cout<<val[h][w];\n // }\n // cout<<endl;\n // }\n\n vector<vll> G(cnt);\n vector<set<ll>> seen(cnt);\n rep(i,cnt)seen[i].insert(i);\n rep(h,H)rep(w,W){\n if(w!=W-1){\n if(!seen[val[h][w]].count(val[h][w+1])){\n G[val[h][w]].push_back(val[h][w+1]);\n seen[val[h][w]].insert(val[h][w+1]);\n }\n }\n if(h!=H-1){\n if(!seen[val[h][w]].count(val[h+1][w])){\n G[val[h][w]].push_back(val[h+1][w]);\n seen[val[h][w]].insert(val[h+1][w]);\n }\n }\n }\n return G;\n\n\n}\n\nusing ull=unsigned long long;\nstruct TreeHasher{\n using uint128=__uint128_t;\n static const ull Mod=(1ull<<61ull)-1;\n static inline ull add(ull a,ull b){if((a+=b)>=Mod)a-=Mod;return a;}\n static inline ull mul(ull a,ull b){uint128 c=(uint128)a*b;return add(c>>61,c&Mod);}\n vector<ull> R;\n // 木のサイズ\n TreeHasher(int n){\n R.push_back(1);\n mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());\n uniform_int_distribution<ull> rand(1,Mod-1);\n for(int i=1;i<=n;i++) R.push_back(rand(mt));\n // R.resize(n+1);\n // iota(ALL(R),1);\n }\n inline vector<int> BFS(vector<vector<int>> &g,int st,vector<int> &dis,bool memo_parent=false){\n vector<int> par;\n if(memo_parent) par.assign(g.size(),-1);\n dis.assign(g.size(),-1);\n dis[st]=0;\n queue<int> que;\n que.push(st);\n while(!que.empty()){\n int cur=que.front();que.pop();\n for(auto &to:g[cur]){\n if(dis[to]>=0) continue;\n dis[to]=dis[cur]+1;\n if(memo_parent) par[to]=cur;\n que.push(to);\n }\n }\n return par;\n }\n\n ull RootedTreeHash(vector<vector<ll>> &g,int root){\n vector<int> dis(g.size(),-1);\n vector<ull> h(g.size());\n function<void(int,int)> dfs=[&](int par,int cur){\n int d=-1;\n for(auto &to:g[cur])if(par!=to){\n dfs(cur,to);\n d=max(d,dis[to]);\n }\n d++;\n dis[cur]=d;\n ull ret=1;\n // rng hash\n for(auto &to:g[cur])if(par!=to) ret=mul(ret,add(h[to],R[d]));\n h[cur]=ret;\n };\n dfs(-1,root);\n return h[root];\n }\n bool RootedTreeIsomorphic(vector<vector<ll>> &g,int g_root,vector<vector<ll>> &h,int h_root){\n if(g.size()!=h.size()) return false;\n return (RootedTreeHash(g,g_root)==RootedTreeHash(h,h_root));\n }\n};\n\n\nvoid solve(ll H,ll W) {\n vector<vector<vll>> G(2); \n rep(i,2){\n vector<string> S(H+2);\n rep(w,W+2){\n S[0].push_back('.');\n S[H+1].push_back('.');\n }\n rep(h,H){\n cin>>S[h+1];\n S[h+1]=\".\"+S[h+1]+\".\";\n }\n\n G[i]=to_tree(S);\n\n if(i==0)cin>>H>>W;\n }\n if(G[0].size()!=G[1].size()){\n cout<<\"no\"<<endl;\n return;\n }\n TreeHasher T(G[0].size());\n cout<<(T.RootedTreeIsomorphic(G[0],0,G[1],0)?\"yes\":\"no\")<<endl;\n}\n\nint main() {\n\n ll H,W;\n\n while (cin >> H>>W) {\n if (H+W == 0)return 0;\n solve(H,W);\n }\n}","accuracy":1,"time_ms":50,"memory_kb":3736,"score_of_the_acc":-0.2098,"final_rank":4},{"submission_id":"aoj_1613_9347359","code_snippet":"#include <bits/stdc++.h>\n// #include <atcoder/all>\n\n#ifdef DEFINED_ONLY_IN_LOCAL\n#include \"../cpp-dump/dump.hpp\"\n#define dump(...) cpp_dump(__VA_ARGS__)\nnamespace cp = cpp_dump;\n#else\n#define dump(...)\n#define CPP_DUMP_SET_OPTION(...)\n#define CPP_DUMP_DEFINE_EXPORT_OBJECT(...)\n#define CPP_DUMP_DEFINE_EXPORT_ENUM(...)\n#define CPP_DUMP_DEFINE_DANGEROUS_EXPORT_OBJECT(...)\n#endif\n\nconst long long INF = 1e9;\nconst long long MOD1 = 1e9 + 7;\nconst long long MOD2 = 998244353;\nconst long long LINF = 1e18;\nusing namespace std;\n// using namespace atcoder;\n\n#define YES(n) cout << ((n) ? \"YES\" : \"NO\") << endl\n#define Yes(n) cout << ((n) ? \"yes\" : \"no\") << endl\n#define POSSIBLE(n) cout << ((n) ? \"POSSIBLE\" : \"IMPOSSIBLE\") << endl\n#define Possible(n) cout << ((n) ? \"Possible\" : \"Impossible\") << endl\n#define Takahashi(n) cout << ((n) ? \"Takahashi\" : \"Aoki\") << endl\n#define TAKAHASHI(n) cout << ((n) ? \"TAKAHASHI\" : \"AOKI\") << endl\n#define First(n) cout << ((n) ? \"First\" : \"Second\") << endl\n#define FIRST(n) cout << ((n) ? \"FIRST\" : \"SECOND\") << endl\n#define COUT(x) cout << (x) << endl\n#define SCOUT(x) cout << (x) << \" \"\n#define VECCOUT(x) \\\n for (auto &youso_ : (x)) \\\n cout << right << setw(10) << youso_ << \" \"; \\\n cout << endl\n#define ENDL cout << endl\n#define CIN(...) \\\n int __VA_ARGS__; \\\n CINT(__VA_ARGS__)\n#define LCIN(...) \\\n long long __VA_ARGS__; \\\n CINT(__VA_ARGS__)\n#define SCIN(...) \\\n string __VA_ARGS__; \\\n CINT(__VA_ARGS__)\n#define VECCIN(x) \\\n for (auto &youso_ : (x)) \\\n cin >> youso_\n#define mp make_pair\n\ntypedef long long ll;\ntypedef vector<long long> vl;\ntypedef vector<vl> vvl;\ntypedef pair<long long, long long> pll;\n\n#define COUT(x) cout << (x) << endl\nvoid CINT()\n{\n}\ntemplate <class Head, class... Tail>\nvoid CINT(Head &&head, Tail &&...tail)\n{\n cin >> head;\n CINT(move(tail)...);\n}\n\n// using mint = modint998244353;\n// ostream& operator<< (ostream& os, const mint &x) {os << x.val(); return os;}\n\nvvl solve(int h, int w, vvl &children)\n{\n\n vector<string> S(h);\n\n VECCIN(S);\n ll count = -LINF;\n for (ll i = 0; i < h; i++)\n for (ll j = 0; j < w; j++)\n if (i * j == 0 || i == h - 1 || j == w - 1)\n if (S.at(i).at(j) == '#')\n count++;\n vvl m(h + 2, vl(w + 2, (count == h * w - (h - 2) * (w - 2)) ? -2 : (-1)));\n for (ll i = 0; i < h; i++)\n {\n for (ll j = 0; j < w; j++)\n {\n m.at(i + 1).at(j + 1) = S.at(i).at(j) == '#' ? -2 : -1;\n }\n }\n int u_id = 0;\n // vvl children;\n set<pair<int, int>> s;\n for (ll i = 0; i < h + 2; i++)\n for (ll j = 0; j < w + 2; j++)\n {\n queue<pair<int, int>> q_outer;\n if (m.at(i).at(j) < 0)\n {\n q_outer.push(mp(i, j));\n }\n while (q_outer.size())\n {\n int q_outer_i, q_outer_j;\n tie(q_outer_i, q_outer_j) = q_outer.front();\n q_outer.pop();\n if (m.at(q_outer_i).at(q_outer_j) >= 0)\n continue;\n children.push_back(vl());\n bool is_black = m.at(q_outer_i).at(q_outer_j) == -2;\n int now = m.at(q_outer_i).at(q_outer_j);\n m.at(q_outer_i).at(q_outer_j) = u_id;\n // dump(now);\n queue<pair<int, int>> q;\n q.push(mp(q_outer_i, q_outer_j));\n while (q.size())\n {\n int ni, nj;\n tie(ni, nj) = q.front();\n q.pop();\n for (int next_i = ni - 1; next_i <= ni + 1; next_i++)\n for (int next_j = nj - 1; next_j <= nj + 1; next_j++)\n if (0 <= next_i && next_i < h + 2 && 0 <= next_j && next_j < w + 2)\n {\n int mdist = abs(next_i - ni) + abs(next_j - nj);\n if ((mdist == 1 && m.at(next_i).at(next_j) >= 0 && m.at(next_i).at(next_j) < u_id) ||\n (mdist == 2 && is_black && m.at(next_i).at(next_j) >= 0 && m.at(next_i).at(next_j) < u_id))\n {\n int child = u_id;\n int parent = m.at(next_i).at(next_j);\n if (s.count(mp(parent, child)) == false)\n children.at(parent).push_back(child);\n s.insert(mp(parent, child));\n }\n if (mdist == 1 && m.at(next_i).at(next_j) == now)\n {\n m.at(next_i).at(next_j) = u_id;\n q.push(mp(next_i, next_j));\n }\n if (mdist == 2 && is_black && m.at(next_i).at(next_j) == now)\n {\n m.at(next_i).at(next_j) = u_id;\n q.push(mp(next_i, next_j));\n }\n }\n }\n u_id++;\n }\n }\n return m;\n}\n\nll hs(vvl &m, int now)\n{\n ll res = 1;\n for (size_t i = 0; i < m.at(now).size(); i++)\n {\n res *= hs(m, m.at(now).at(i));\n res %= MOD1;\n }\n\n res += 37;\n res *= MOD2;\n res %= MOD1;\n return res;\n}\n\nvoid Main()\n{\n while (1)\n {\n LCIN(h_1, w_1);\n if (h_1 == 0)\n break;\n vvl children_1;\n vvl res1 = solve(h_1, w_1, children_1);\n LCIN(h_2, w_2);\n vvl children_2;\n vvl res2 = solve(h_2, w_2, children_2);\n // dump(res1, res2)\n // dump(children_1, children_2);\n // dump(res1, res2);\n ll h1 = hs(children_1, 0);\n ll h2 = hs(children_2, 0);\n // dump(h1, h2);\n Yes(h1 == h2);\n }\n}\nint main()\n{\n cout << fixed << setprecision(15);\n Main();\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":3744,"score_of_the_acc":-0.4618,"final_rank":13},{"submission_id":"aoj_1613_9347352","code_snippet":"#include <bits/stdc++.h>\n// #include <atcoder/all>\n\n#ifdef DEFINED_ONLY_IN_LOCAL\n#include \"../cpp-dump/dump.hpp\"\n#define dump(...) cpp_dump(__VA_ARGS__)\nnamespace cp = cpp_dump;\n#else\n#define dump(...)\n#define CPP_DUMP_SET_OPTION(...)\n#define CPP_DUMP_DEFINE_EXPORT_OBJECT(...)\n#define CPP_DUMP_DEFINE_EXPORT_ENUM(...)\n#define CPP_DUMP_DEFINE_DANGEROUS_EXPORT_OBJECT(...)\n#endif\n\nconst long long INF = 1e9;\nconst long long MOD1 = 1e9 + 7;\nconst long long MOD2 = 998244353;\nconst long long LINF = 1e18;\nusing namespace std;\n// using namespace atcoder;\n\n#define YES(n) cout << ((n) ? \"YES\" : \"NO\") << endl\n#define Yes(n) cout << ((n) ? \"yes\" : \"no\") << endl\n#define POSSIBLE(n) cout << ((n) ? \"POSSIBLE\" : \"IMPOSSIBLE\") << endl\n#define Possible(n) cout << ((n) ? \"Possible\" : \"Impossible\") << endl\n#define Takahashi(n) cout << ((n) ? \"Takahashi\" : \"Aoki\") << endl\n#define TAKAHASHI(n) cout << ((n) ? \"TAKAHASHI\" : \"AOKI\") << endl\n#define First(n) cout << ((n) ? \"First\" : \"Second\") << endl\n#define FIRST(n) cout << ((n) ? \"FIRST\" : \"SECOND\") << endl\n#define COUT(x) cout << (x) << endl\n#define SCOUT(x) cout << (x) << \" \"\n#define VECCOUT(x) \\\n for (auto &youso_ : (x)) \\\n cout << right << setw(10) << youso_ << \" \"; \\\n cout << endl\n#define ENDL cout << endl\n#define CIN(...) \\\n int __VA_ARGS__; \\\n CINT(__VA_ARGS__)\n#define LCIN(...) \\\n long long __VA_ARGS__; \\\n CINT(__VA_ARGS__)\n#define SCIN(...) \\\n string __VA_ARGS__; \\\n CINT(__VA_ARGS__)\n#define VECCIN(x) \\\n for (auto &youso_ : (x)) \\\n cin >> youso_\n#define mp make_pair\n\ntypedef long long ll;\ntypedef vector<long long> vl;\ntypedef vector<vl> vvl;\ntypedef pair<long long, long long> pll;\n\n#define COUT(x) cout << (x) << endl\nvoid CINT()\n{\n}\ntemplate <class Head, class... Tail>\nvoid CINT(Head &&head, Tail &&...tail)\n{\n cin >> head;\n CINT(move(tail)...);\n}\n\n// using mint = modint998244353;\n// ostream& operator<< (ostream& os, const mint &x) {os << x.val(); return os;}\n\nvvl solve(int h, int w, vvl &children)\n{\n\n vector<string> S(h);\n\n VECCIN(S);\n ll count = -LINF;\n for (ll i = 0; i < h; i++)\n for (ll j = 0; j < w; j++)\n if (i * j == 0 || i == h - 1 || j == w - 1)\n if (S.at(i).at(j) == '#')\n count++;\n vvl m(h + 2, vl(w + 2, (count == h * w - (h - 2) * (w - 2)) ? -2 : (-1)));\n for (ll i = 0; i < h; i++)\n {\n for (ll j = 0; j < w; j++)\n {\n dump(i, j, S);\n m.at(i + 1).at(j + 1) = S.at(i).at(j) == '#' ? -2 : -1;\n }\n }\n int u_id = 0;\n // vvl children;\n set<pair<int, int>> s;\n for (ll i = 0; i < h + 2; i++)\n for (ll j = 0; j < w + 2; j++)\n {\n queue<pair<int, int>> q_outer;\n if (m.at(i).at(j) < 0)\n {\n q_outer.push(mp(i, j));\n }\n while (q_outer.size())\n {\n int q_outer_i, q_outer_j;\n tie(q_outer_i, q_outer_j) = q_outer.front();\n q_outer.pop();\n if (m.at(q_outer_i).at(q_outer_j) >= 0)\n continue;\n children.push_back(vl());\n bool is_black = m.at(q_outer_i).at(q_outer_j) == -2;\n int now = m.at(q_outer_i).at(q_outer_j);\n m.at(q_outer_i).at(q_outer_j) = u_id;\n dump(m);\n queue<pair<int, int>> q;\n q.push(mp(q_outer_i, q_outer_j));\n while (q.size())\n {\n int ni, nj;\n tie(ni, nj) = q.front();\n q.pop();\n for (int next_i = ni - 1; next_i <= ni + 1; next_i++)\n for (int next_j = nj - 1; next_j <= nj + 1; next_j++)\n if (0 <= next_i && next_i < h + 2 && 0 <= next_j && next_j < w + 2)\n {\n int mdist = abs(next_i - ni) + abs(next_j - nj);\n if ((mdist == 1 && m.at(next_i).at(next_j) >= 0 && m.at(next_i).at(next_j) < u_id) ||\n (mdist == 2 && is_black && m.at(next_i).at(next_j) >= 0 && m.at(next_i).at(next_j) < u_id))\n {\n int child = u_id;\n int parent = m.at(next_i).at(next_j);\n if (s.count(mp(parent, child)) == false)\n children.at(parent).push_back(child);\n s.insert(mp(parent, child));\n }\n // if (m.at(next_i).at(next_j) < 0)\n // {\n // q_outer.push(mp(next_i, next_j));\n // }\n // dump(next_i, next_j);\n if (mdist == 1 && m.at(next_i).at(next_j) == now)\n {\n // dump(\" if (mdist == 1 && m.at(next_i).at(next_j) == now)\");\n m.at(next_i).at(next_j) = u_id;\n q.push(mp(next_i, next_j));\n }\n if (mdist == 2 && is_black && m.at(next_i).at(next_j) == now)\n {\n // dump(\" if (mdist == 2 && is_black && m.at(next_i).at(next_j) == now)\");\n m.at(next_i).at(next_j) = u_id;\n q.push(mp(next_i, next_j));\n }\n }\n }\n u_id++;\n }\n }\n return m;\n}\n\nll hs(vvl &m, int now)\n{\n ll res = 1;\n for (size_t i = 0; i < m.at(now).size(); i++)\n {\n res *= hs(m, m.at(now).at(i));\n res %= MOD1;\n }\n\n res += 37;\n res *= MOD2;\n res %= MOD1;\n return res;\n}\n\nvoid Main()\n{\n while (1)\n {\n LCIN(h_1, w_1);\n if (h_1 == 0)\n break;\n vvl children_1;\n vvl res1 = solve(h_1, w_1, children_1);\n LCIN(h_2, w_2);\n vvl children_2;\n vvl res2 = solve(h_2, w_2, children_2);\n dump(res1, res2);\n dump(children_1, children_2);\n ll h1 = hs(children_1, 0);\n ll h2 = hs(children_2, 0);\n dump(h1, h2);\n Yes(h1 == h2);\n }\n}\nint main()\n{\n cout << fixed << setprecision(15);\n Main();\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":3696,"score_of_the_acc":-0.4495,"final_rank":12},{"submission_id":"aoj_1613_9347332","code_snippet":"#include <bits/stdc++.h>\n// #include <atcoder/all>\n\n#ifdef DEFINED_ONLY_IN_LOCAL\n#include \"../cpp-dump/dump.hpp\"\n#define dump(...) cpp_dump(__VA_ARGS__)\nnamespace cp = cpp_dump;\n#else\n#define dump(...)\n#define CPP_DUMP_SET_OPTION(...)\n#define CPP_DUMP_DEFINE_EXPORT_OBJECT(...)\n#define CPP_DUMP_DEFINE_EXPORT_ENUM(...)\n#define CPP_DUMP_DEFINE_DANGEROUS_EXPORT_OBJECT(...)\n#endif\n\nconst long long INF = 1e9;\nconst long long MOD1 = 1e9 + 7;\nconst long long MOD2 = 998244353;\nconst long long LINF = 1e18;\nusing namespace std;\n// using namespace atcoder;\n\n#define YES(n) cout << ((n) ? \"YES\" : \"NO\") << endl\n#define Yes(n) cout << ((n) ? \"yes\" : \"no\") << endl\n#define POSSIBLE(n) cout << ((n) ? \"POSSIBLE\" : \"IMPOSSIBLE\") << endl\n#define Possible(n) cout << ((n) ? \"Possible\" : \"Impossible\") << endl\n#define Takahashi(n) cout << ((n) ? \"Takahashi\" : \"Aoki\") << endl\n#define TAKAHASHI(n) cout << ((n) ? \"TAKAHASHI\" : \"AOKI\") << endl\n#define First(n) cout << ((n) ? \"First\" : \"Second\") << endl\n#define FIRST(n) cout << ((n) ? \"FIRST\" : \"SECOND\") << endl\n#define COUT(x) cout << (x) << endl\n#define SCOUT(x) cout << (x) << \" \"\n#define VECCOUT(x) \\\n for (auto &youso_ : (x)) \\\n cout << right << setw(10) << youso_ << \" \"; \\\n cout << endl\n#define ENDL cout << endl\n#define CIN(...) \\\n int __VA_ARGS__; \\\n CINT(__VA_ARGS__)\n#define LCIN(...) \\\n long long __VA_ARGS__; \\\n CINT(__VA_ARGS__)\n#define SCIN(...) \\\n string __VA_ARGS__; \\\n CINT(__VA_ARGS__)\n#define VECCIN(x) \\\n for (auto &youso_ : (x)) \\\n cin >> youso_\n#define mp make_pair\n\ntypedef long long ll;\ntypedef vector<long long> vl;\ntypedef vector<vl> vvl;\ntypedef pair<long long, long long> pll;\n\n#define COUT(x) cout << (x) << endl\nvoid CINT()\n{\n}\ntemplate <class Head, class... Tail>\nvoid CINT(Head &&head, Tail &&...tail)\n{\n cin >> head;\n CINT(move(tail)...);\n}\n\n// using mint = modint998244353;\n// ostream& operator<< (ostream& os, const mint &x) {os << x.val(); return os;}\n\nvvl solve(int h, int w, vvl &children)\n{\n\n vector<string> S(h);\n\n VECCIN(S);\n ll count = -LINF;\n for (ll i = 0; i < h; i++)\n for (ll j = 0; j < w; j++)\n if (i * j == 0 || i == h - 1 || j == w - 1)\n if (S.at(i).at(j) == '#')\n count++;\n vvl m(h + 2, vl(w + 2, (count == h * w - (h - 2) * (w - 2)) ? -2 : (-1)));\n for (ll i = 0; i < h; i++)\n {\n for (ll j = 0; j < w; j++)\n {\n dump(i, j, S);\n m.at(i + 1).at(j + 1) = S.at(i).at(j) == '#' ? -2 : -1;\n }\n }\n int u_id = 0;\n // vvl children;\n set<pair<int, int>> s;\n for (ll i = 0; i < h + 2; i++)\n for (ll j = 0; j < w + 2; j++)\n {\n queue<pair<int, int>> q_outer;\n if (m.at(i).at(j) < 0)\n {\n q_outer.push(mp(i, j));\n }\n while (q_outer.size())\n {\n int q_outer_i, q_outer_j;\n tie(q_outer_i, q_outer_j) = q_outer.front();\n q_outer.pop();\n if (m.at(q_outer_i).at(q_outer_j) >= 0)\n continue;\n children.push_back(vl());\n bool is_black = m.at(q_outer_i).at(q_outer_j) == -2;\n int now = m.at(q_outer_i).at(q_outer_j);\n m.at(q_outer_i).at(q_outer_j) = u_id;\n dump(m);\n queue<pair<int, int>> q;\n q.push(mp(q_outer_i, q_outer_j));\n while (q.size())\n {\n int ni, nj;\n tie(ni, nj) = q.front();\n q.pop();\n for (int next_i = ni - 1; next_i <= ni + 1; next_i++)\n for (int next_j = nj - 1; next_j <= nj + 1; next_j++)\n if (0 <= next_i && next_i < h + 2 && 0 <= next_j && next_j < w + 2)\n {\n int mdist = abs(next_i - ni) + abs(next_j - nj);\n if ((mdist == 1 && m.at(next_i).at(next_j) >= 0 && m.at(next_i).at(next_j) < u_id) ||\n (mdist == 2 && is_black && m.at(next_i).at(next_j) >= 0 && m.at(next_i).at(next_j) < u_id))\n {\n int child = u_id;\n int parent = m.at(next_i).at(next_j);\n if (s.count(mp(parent, child)) == false)\n children.at(parent).push_back(child);\n s.insert(mp(parent, child));\n }\n // if (m.at(next_i).at(next_j) < 0)\n // {\n // q_outer.push(mp(next_i, next_j));\n // }\n // dump(next_i, next_j);\n if (mdist == 1 && m.at(next_i).at(next_j) == now)\n {\n // dump(\" if (mdist == 1 && m.at(next_i).at(next_j) == now)\");\n m.at(next_i).at(next_j) = u_id;\n q.push(mp(next_i, next_j));\n }\n if (mdist == 2 && is_black && m.at(next_i).at(next_j) == now)\n {\n // dump(\" if (mdist == 2 && is_black && m.at(next_i).at(next_j) == now)\");\n m.at(next_i).at(next_j) = u_id;\n q.push(mp(next_i, next_j));\n }\n }\n }\n u_id++;\n }\n }\n return m;\n}\n\nstring hs(vvl &m, int now)\n{\n string res = \"\";\n vector<string> S;\n for (size_t i = 0; i < m.at(now).size(); i++)\n {\n S.push_back(hs(m, m.at(now).at(i)));\n }\n sort(S.begin(), S.end());\n for (size_t i = 0; i < m.at(now).size(); i++)\n res += S.at(i);\n\n return '(' + res + ')';\n}\n\nvoid Main()\n{\n while (1)\n {\n LCIN(h_1, w_1);\n if (h_1 == 0)\n break;\n vvl children_1;\n vvl res1 = solve(h_1, w_1, children_1);\n LCIN(h_2, w_2);\n vvl children_2;\n vvl res2 = solve(h_2, w_2, children_2);\n dump(res1, res2);\n dump(children_1, children_2);\n string h1 = hs(children_1, 0);\n string h2 = hs(children_2, 0);\n dump(h1, h2);\n Yes(h1 == h2);\n }\n}\nint main()\n{\n cout << fixed << setprecision(15);\n Main();\n return 0;\n}","accuracy":1,"time_ms":80,"memory_kb":3656,"score_of_the_acc":-0.4393,"final_rank":11},{"submission_id":"aoj_1613_9347305","code_snippet":"#include <bits/stdc++.h>\n// #include <atcoder/all>\n\n#ifdef DEFINED_ONLY_IN_LOCAL\n#include \"../cpp-dump/dump.hpp\"\n#define dump(...) cpp_dump(__VA_ARGS__)\nnamespace cp = cpp_dump;\n#else\n#define dump(...)\n#define CPP_DUMP_SET_OPTION(...)\n#define CPP_DUMP_DEFINE_EXPORT_OBJECT(...)\n#define CPP_DUMP_DEFINE_EXPORT_ENUM(...)\n#define CPP_DUMP_DEFINE_DANGEROUS_EXPORT_OBJECT(...)\n#endif\n\nconst long long INF = 1e9;\nconst long long MOD1 = 1e9 + 7;\nconst long long MOD2 = 998244353;\nconst long long LINF = 1e18;\nusing namespace std;\n// using namespace atcoder;\n\n#define YES(n) cout << ((n) ? \"YES\" : \"NO\") << endl\n#define Yes(n) cout << ((n) ? \"yes\" : \"no\") << endl\n#define POSSIBLE(n) cout << ((n) ? \"POSSIBLE\" : \"IMPOSSIBLE\") << endl\n#define Possible(n) cout << ((n) ? \"Possible\" : \"Impossible\") << endl\n#define Takahashi(n) cout << ((n) ? \"Takahashi\" : \"Aoki\") << endl\n#define TAKAHASHI(n) cout << ((n) ? \"TAKAHASHI\" : \"AOKI\") << endl\n#define First(n) cout << ((n) ? \"First\" : \"Second\") << endl\n#define FIRST(n) cout << ((n) ? \"FIRST\" : \"SECOND\") << endl\n#define COUT(x) cout << (x) << endl\n#define SCOUT(x) cout << (x) << \" \"\n#define VECCOUT(x) \\\n for (auto &youso_ : (x)) \\\n cout << right << setw(10) << youso_ << \" \"; \\\n cout << endl\n#define ENDL cout << endl\n#define CIN(...) \\\n int __VA_ARGS__; \\\n CINT(__VA_ARGS__)\n#define LCIN(...) \\\n long long __VA_ARGS__; \\\n CINT(__VA_ARGS__)\n#define SCIN(...) \\\n string __VA_ARGS__; \\\n CINT(__VA_ARGS__)\n#define VECCIN(x) \\\n for (auto &youso_ : (x)) \\\n cin >> youso_\n#define mp make_pair\n\ntypedef long long ll;\ntypedef vector<long long> vl;\ntypedef vector<vl> vvl;\ntypedef pair<long long, long long> pll;\n\n#define COUT(x) cout << (x) << endl\nvoid CINT()\n{\n}\ntemplate <class Head, class... Tail>\nvoid CINT(Head &&head, Tail &&...tail)\n{\n cin >> head;\n CINT(move(tail)...);\n}\n\n// using mint = modint998244353;\n// ostream& operator<< (ostream& os, const mint &x) {os << x.val(); return os;}\n\nvvl solve(int h, int w, vvl &children)\n{\n\n vector<string> S(h);\n\n VECCIN(S);\n ll count = 0;\n for (ll i = 0; i < h; i++)\n for (ll j = 0; j < w; j++)\n if (i * j == 0 || i == h - 1 || j == w - 1)\n if (S.at(i).at(j) == '#')\n count++;\n vvl m(h + 2, vl(w + 2, (count == h * w - (h - 2) * (w - 2)) ? -2 : (-1)));\n for (ll i = 0; i < h; i++)\n {\n for (ll j = 0; j < w; j++)\n {\n m.at(i + 1).at(j + 1) = S.at(i).at(j) == '#' ? -2 : -1;\n }\n }\n int u_id = 0;\n // vvl children;\n set<pair<int, int>> s;\n for (ll i = 0; i < h + 2; i++)\n for (ll j = 0; j < w + 2; j++)\n {\n queue<pair<int, int>> q_outer;\n if (m.at(i).at(j) < 0)\n {\n q_outer.push(mp(i, j));\n }\n while (q_outer.size())\n {\n int q_outer_i, q_outer_j;\n tie(q_outer_i, q_outer_j) = q_outer.front();\n q_outer.pop();\n if (m.at(q_outer_i).at(q_outer_j) >= 0)\n continue;\n children.push_back(vl());\n bool is_black = m.at(q_outer_i).at(q_outer_j) == -2;\n int now = m.at(q_outer_i).at(q_outer_j);\n m.at(q_outer_i).at(q_outer_j) = u_id;\n // dump(now);\n queue<pair<int, int>> q;\n q.push(mp(q_outer_i, q_outer_j));\n while (q.size())\n {\n int ni, nj;\n tie(ni, nj) = q.front();\n q.pop();\n for (int next_i = ni - 1; next_i <= ni + 1; next_i++)\n for (int next_j = nj - 1; next_j <= nj + 1; next_j++)\n if (0 <= next_i && next_i < h + 2 && 0 <= next_j && next_j < w + 2)\n {\n int mdist = abs(next_i - ni) + abs(next_j - nj);\n if ((mdist == 1 && m.at(next_i).at(next_j) >= 0 && m.at(next_i).at(next_j) < u_id) ||\n (mdist == 2 && is_black && m.at(next_i).at(next_j) >= 0 && m.at(next_i).at(next_j) < u_id))\n {\n int child = u_id;\n int parent = m.at(next_i).at(next_j);\n if (s.count(mp(parent, child)) == false)\n children.at(parent).push_back(child);\n s.insert(mp(parent, child));\n }\n if (mdist == 1 && m.at(next_i).at(next_j) == now)\n {\n m.at(next_i).at(next_j) = u_id;\n q.push(mp(next_i, next_j));\n }\n if (mdist == 2 && is_black && m.at(next_i).at(next_j) == now)\n {\n m.at(next_i).at(next_j) = u_id;\n q.push(mp(next_i, next_j));\n }\n }\n }\n u_id++;\n }\n }\n return m;\n}\n\nstring hs(vvl &m, int now)\n{\n string res = \"\";\n vector<string> S;\n for (size_t i = 0; i < m.at(now).size(); i++)\n {\n S.push_back(hs(m, m.at(now).at(i)));\n }\n sort(S.begin(), S.end());\n for (size_t i = 0; i < m.at(now).size(); i++)\n res += S.at(i);\n\n return '(' + res + ')';\n}\n\nvoid Main()\n{\n while (1)\n {\n LCIN(h_1, w_1);\n if (h_1 == 0)\n break;\n vvl children_1;\n vvl res1 = solve(h_1, w_1, children_1);\n LCIN(h_2, w_2);\n vvl children_2;\n vvl res2 = solve(h_2, w_2, children_2);\n // dump(res1, res2)\n // dump(children_1, children_2);\n // dump(res1, res2);\n string h1 = hs(children_1, 0);\n string h2 = hs(children_2, 0);\n // dump(h1, h2);\n Yes(h1 == h2);\n }\n}\nint main()\n{\n cout << fixed << setprecision(15);\n Main();\n return 0;\n}","accuracy":0.5,"time_ms":80,"memory_kb":3672,"score_of_the_acc":-0.4434,"final_rank":20},{"submission_id":"aoj_1613_9347299","code_snippet":"#include <bits/stdc++.h>\n// #include <atcoder/all>\n\n#ifdef DEFINED_ONLY_IN_LOCAL\n#include \"../cpp-dump/dump.hpp\"\n#define dump(...) cpp_dump(__VA_ARGS__)\nnamespace cp = cpp_dump;\n#else\n#define dump(...)\n#define CPP_DUMP_SET_OPTION(...)\n#define CPP_DUMP_DEFINE_EXPORT_OBJECT(...)\n#define CPP_DUMP_DEFINE_EXPORT_ENUM(...)\n#define CPP_DUMP_DEFINE_DANGEROUS_EXPORT_OBJECT(...)\n#endif\n\nconst long long INF = 1e9;\nconst long long MOD1 = 1e9 + 7;\nconst long long MOD2 = 998244353;\nconst long long LINF = 1e18;\nusing namespace std;\n// using namespace atcoder;\n\n#define YES(n) cout << ((n) ? \"YES\" : \"NO\") << endl\n#define Yes(n) cout << ((n) ? \"yes\" : \"no\") << endl\n#define POSSIBLE(n) cout << ((n) ? \"POSSIBLE\" : \"IMPOSSIBLE\") << endl\n#define Possible(n) cout << ((n) ? \"Possible\" : \"Impossible\") << endl\n#define Takahashi(n) cout << ((n) ? \"Takahashi\" : \"Aoki\") << endl\n#define TAKAHASHI(n) cout << ((n) ? \"TAKAHASHI\" : \"AOKI\") << endl\n#define First(n) cout << ((n) ? \"First\" : \"Second\") << endl\n#define FIRST(n) cout << ((n) ? \"FIRST\" : \"SECOND\") << endl\n#define COUT(x) cout << (x) << endl\n#define SCOUT(x) cout << (x) << \" \"\n#define VECCOUT(x) \\\n for (auto &youso_ : (x)) \\\n cout << right << setw(10) << youso_ << \" \"; \\\n cout << endl\n#define ENDL cout << endl\n#define CIN(...) \\\n int __VA_ARGS__; \\\n CINT(__VA_ARGS__)\n#define LCIN(...) \\\n long long __VA_ARGS__; \\\n CINT(__VA_ARGS__)\n#define SCIN(...) \\\n string __VA_ARGS__; \\\n CINT(__VA_ARGS__)\n#define VECCIN(x) \\\n for (auto &youso_ : (x)) \\\n cin >> youso_\n#define mp make_pair\n\ntypedef long long ll;\ntypedef vector<long long> vl;\ntypedef vector<vl> vvl;\ntypedef pair<long long, long long> pll;\n\n#define COUT(x) cout << (x) << endl\nvoid CINT()\n{\n}\ntemplate <class Head, class... Tail>\nvoid CINT(Head &&head, Tail &&...tail)\n{\n cin >> head;\n CINT(move(tail)...);\n}\n\n// using mint = modint998244353;\n// ostream& operator<< (ostream& os, const mint &x) {os << x.val(); return os;}\n\nvvl solve(int h, int w, vvl &children)\n{\n\n vector<string> S(h);\n\n VECCIN(S);\n ll count = 0;\n for (ll i = 0; i < h; i++)\n for (ll j = 0; j < w; j++)\n if (i * j == 0 || i == h - 1 || j == w - 1)\n if (S.at(i).at(j) == '#')\n count++;\n vvl m(h + 2, vl(w + 2, (count == h * w - (h - 2) * (w - 2)) ? -2 : (-1)));\n for (ll i = 0; i < h; i++)\n {\n for (ll j = 0; j < w; j++)\n {\n m.at(i + 1).at(j + 1) = S.at(i).at(j) == '#' ? -2 : -1;\n }\n }\n int u_id = 0;\n // vvl children;\n set<pair<int, int>> s;\n for (ll i = 0; i < h + 2; i++)\n for (ll j = 0; j < w + 2; j++)\n {\n queue<pair<int, int>> q_outer;\n if (m.at(i).at(j) < 0)\n {\n q_outer.push(mp(i, j));\n }\n while (q_outer.size())\n {\n int q_outer_i, q_outer_j;\n tie(q_outer_i, q_outer_j) = q_outer.front();\n q_outer.pop();\n if (m.at(q_outer_i).at(q_outer_j) >= 0)\n continue;\n children.push_back(vl());\n bool is_black = m.at(q_outer_i).at(q_outer_j) == -2;\n int now = m.at(q_outer_i).at(q_outer_j);\n m.at(q_outer_i).at(q_outer_j) = u_id;\n // dump(now);\n queue<pair<int, int>> q;\n q.push(mp(q_outer_i, q_outer_j));\n while (q.size())\n {\n int ni, nj;\n tie(ni, nj) = q.front();\n q.pop();\n for (int next_i = ni - 1; next_i <= ni + 1; next_i++)\n for (int next_j = nj - 1; next_j <= nj + 1; next_j++)\n if (0 <= next_i && next_i < h + 2 && 0 <= next_j && next_j < w + 2)\n {\n int mdist = abs(next_i - ni) + abs(next_j - nj);\n if ((mdist == 1 && m.at(next_i).at(next_j) >= 0 && m.at(next_i).at(next_j) < u_id) ||\n (mdist == 2 && is_black && m.at(next_i).at(next_j) >= 0 && m.at(next_i).at(next_j) < u_id))\n {\n int child = u_id;\n int parent = m.at(next_i).at(next_j);\n if (s.count(mp(parent, child)) == false)\n children.at(parent).push_back(child);\n s.insert(mp(parent, child));\n }\n if (mdist == 1 && m.at(next_i).at(next_j) == now)\n {\n m.at(next_i).at(next_j) = u_id;\n q.push(mp(next_i, next_j));\n }\n if (mdist == 2 && is_black && m.at(next_i).at(next_j) == now)\n {\n m.at(next_i).at(next_j) = u_id;\n q.push(mp(next_i, next_j));\n }\n }\n }\n u_id++;\n }\n }\n return m;\n}\n\nll hs(vvl &m, int now)\n{\n ll res = 1;\n for (size_t i = 0; i < m.at(now).size(); i++)\n {\n res *= hs(m, m.at(now).at(i));\n res %= MOD1;\n }\n\n res += 37;\n res *= MOD2;\n res %= MOD1;\n return res;\n}\n\nvoid Main()\n{\n while (1)\n {\n LCIN(h_1, w_1);\n if (h_1 == 0)\n break;\n vvl children_1;\n vvl res1 = solve(h_1, w_1, children_1);\n LCIN(h_2, w_2);\n vvl children_2;\n vvl res2 = solve(h_2, w_2, children_2);\n // dump(res1, res2)\n // dump(children_1, children_2);\n // dump(res1, res2);\n ll h1 = hs(children_1, 0);\n ll h2 = hs(children_2, 0);\n // dump(h1, h2);\n Yes(h1 == h2);\n }\n}\nint main()\n{\n cout << fixed << setprecision(15);\n Main();\n return 0;\n}","accuracy":0.5,"time_ms":80,"memory_kb":3652,"score_of_the_acc":-0.4382,"final_rank":19},{"submission_id":"aoj_1613_9128026","code_snippet":"#include<iostream>\n#include<vector>\n#include<string>\n#include<set>\n#include<queue>\n#include<algorithm>\nusing namespace std;\nint dy4[4] = {1,0,-1,0};\nint dx4[4] = {0,1,0,-1};\nint dy8[8] = {1,1,1,0,-1,-1,-1,0};\nint dx8[8] = {-1,0,1,1,1,0,-1,-1};\nbool inr(int l, int x, int r){\n return (l <= x) && (x < r);\n}\nvoid dfs(int now, vector<set<int>> &G, vector<string> &str, vector<bool> &seen){\n seen[now] = true;\n vector<string> tmp;\n for(int next:G[now]){\n if(seen[next])continue;\n dfs(next, G, str, seen);\n tmp.push_back(str[next]);\n }\n sort(tmp.begin(), tmp.end());\n str[now] = \"(\";\n for(int i = 0; i < (int)tmp.size(); i++){\n str[now] += tmp[i];\n }\n str[now] += \")\";\n return;\n}\nstring graph_to_string(vector<set<int>> G){\n vector<string> str(G.size());\n vector<bool> seen(G.size(), false);\n // 木を括弧からなる文字列に変換する\n dfs(0, G, str, seen);\n return str[0];\n}\nvector<set<int>> pixel_to_graph(int h, int w, vector<string> P){\n // 画像の周りに白のピクセルを追加する\n for(int i = 0; i < h; i++){\n P[i] = \".\" + P[i] + \".\";\n }\n {\n string tmp(w+2, '.');\n P.insert(P.begin(), tmp);\n P.push_back(tmp);\n }\n // ピクセルを幅優先探索で連結成分分解\n int cnt = 0;\n vector<vector<int>> comp(h+2, vector<int>(w+2, -1));\n for(int i = 0; i < h+2; i++){\n for(int j = 0; j < w+2; j++){\n if(comp[i][j] == -1){\n char color = P[i][j];\n queue<pair<int,int>> qu;\n qu.push(make_pair(i,j));\n comp[i][j] = cnt;\n while(!qu.empty()){\n pair<int,int> now = qu.front();\n qu.pop();\n for(int d = 0; d < 8; d++){\n int ny, nx;\n if(color == '.'){ // 白の場合\n if(4 <= d)break;\n ny = now.first + dy4[d];\n nx = now.second + dx4[d];\n }else{ // 黒の場合\n ny = now.first + dy8[d];\n nx = now.second + dx8[d];\n }\n if(!inr(0, ny ,h+2) || !inr(0, nx ,w+2))continue;\n if(P[ny][nx] != color || comp[ny][nx] != -1)continue;\n qu.push(make_pair(ny,nx));\n comp[ny][nx] = cnt;\n }\n }\n cnt++;\n }\n }\n }\n // 連結成分同士の位置関係をグラフに変換する\n vector<set<int>> G(cnt);\n for(int i = 0; i < h+2; i++){\n for(int j = 0; j < w+2; j++){\n if(i+1 < h+2){\n if(comp[i][j] != comp[i+1][j]){\n G[comp[i][j]].insert(comp[i+1][j]);\n G[comp[i+1][j]].insert(comp[i][j]);\n }\n }\n if(j+1 < w+2){\n if(comp[i][j] != comp[i][j+1]){\n G[comp[i][j]].insert(comp[i][j+1]);\n G[comp[i][j+1]].insert(comp[i][j]);\n }\n }\n }\n }\n return G;\n}\nint main(){\n while(1){\n int h[2],w[2];\n vector<string> P[2];\n // 画像1 入力\n cin >> h[0] >> w[0];\n if(h[0] == 0 && w[0] == 0)break; // データセットの終わり\n P[0].resize(h[0]);\n for(int i = 0; i < h[0]; i++){\n cin >> P[0][i];\n }\n\n // 画像2 入力\n cin >> h[1] >> w[1];\n P[1].resize(h[1]);\n for(int i = 0; i < h[1]; i++){\n cin >> P[1][i];\n }\n\n // 出力\n if(graph_to_string(pixel_to_graph(h[0],w[0],P[0])) == graph_to_string(pixel_to_graph(h[1],w[1],P[1]))){\n cout << \"yes\" << endl;\n }else{\n cout << \"no\" << endl;\n }\n }\n}","accuracy":1,"time_ms":50,"memory_kb":3568,"score_of_the_acc":-0.1667,"final_rank":3},{"submission_id":"aoj_1613_9125259","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define ALL(v) v.begin(),v.end()\n#define dbg(x) cerr << #x << \": \" << (x) << endl;\ntemplate<class F, class S>\nostream& operator<<(ostream& os, pair<F,S>& p) {\n os << '(' << p.first << ',' << p.second << ')';\n return os;\n}\ntemplate<class Iter>\nvoid print(Iter beg, Iter end) {\n for (Iter itr = beg; itr != end; ++itr) {\n cerr << *itr << ' ';\n }\n cerr << '\\n';\n}\nusing Pic = vector<vector<char>>;\nusing Graph = vector<vector<int>>;\nPic S[2];\nint dx[] = {1,0,-1,0,1};\n\nvector<pair<int,int>> paintConnected(const Pic& p, vector<vector<int>>& col, int sx, int sy, int idx) {\n vector<pair<int,int>> inside;\n int h = p.size();\n int w = p[0].size();\n queue<pair<int,int>> q;\n q.emplace(sx, sy);\n col[sx][sy] = idx;\n while (q.size()) {\n auto [x,y] = q.front();\n q.pop();\n \n if (p[sx][sy] == '.') {\n for (int i = 0; i < 4; ++i) {\n int nx = x + dx[i];\n int ny = y + dx[i+1];\n if (!(0 <= nx && nx < h && 0 <= ny && ny < w)) continue;\n if (col[nx][ny] != -1) continue;\n if (p[nx][ny] != p[sx][sy]) {\n if (col[nx][ny] == -1) inside.emplace_back(nx, ny);\n continue;\n }\n q.emplace(nx, ny);\n col[nx][ny] = idx;\n }\n } else {\n for (int dx = -1; dx < 2; ++dx) {\n for (int dy = -1; dy < 2; ++dy) {\n if (dx==0 && dy==0) continue;\n int nx = x + dx;\n int ny = y + dy;\n if (!(0 <= nx && nx < h && 0 <= ny && ny < w)) continue;\n if (col[nx][ny] != -1) continue;\n if (p[nx][ny] != p[sx][sy]) {\n if (col[nx][ny] == -1) inside.emplace_back(nx, ny);\n continue;\n }\n q.emplace(nx, ny);\n col[nx][ny] = idx;\n }\n }\n }\n }\n return inside;\n}\n\npair<vector<vector<int>>, int> paint(const Pic& p) {\n int h = p.size();\n int w = p[0].size();\n queue<pair<int,int>> q;\n vector<vector<int>> col(h, vector<int>(w,-1));\n int idx = 0;\n q.emplace(0,0);\n\n while (q.size()) {\n auto [x,y] = q.front();\n q.pop();\n if (col[x][y] != -1) continue;\n\n auto inside = paintConnected(p, col, x, y, idx);\n for (auto x : inside) {\n q.push(x);\n }\n ++idx;\n }\n return {col, idx};\n}\n\nGraph gen(const Pic& p, vector<vector<int>>& col, int kind) {\n int h = col.size();\n int w = col[0].size();\n\n set<pair<int,int>> st;\n\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n for (int dx = -1; dx < 2; ++dx) {\n for (int dy = -1; dy < 2; ++dy) {\n if (dx==0 && dy==0) continue;\n int nx = i + dx;\n int ny = j + dy;\n if (!(0 <= nx && nx < h && 0 <= ny && ny < w)) continue;\n int a = col[nx][ny];\n int b = col[i][j];\n if (p[i][j] == p[nx][ny]) continue;\n if (a == b) continue;\n if (a > b) swap(a,b);\n st.emplace(a, b);\n }\n }\n }\n }\n Graph g(kind);\n for (auto [u,v] : st) {\n g[u].push_back(v);\n g[v].push_back(u);\n }\n return g;\n}\n// O(N + M)\npair<vector<int>, int> bfs(const Graph& g, int start) {\n int n = g.size();\n vector<int> dis(n, 1e9), pre(n, -1);\n queue<int> q;\n dis[start] = 0;\n q.push(start);\n int ma = 0;\n int farthest = start;\n while (q.size()) {\n int pos = q.front();\n q.pop();\n for (int to : g[pos]) {\n if (dis[pos] + 1 < dis[to]) {\n dis[to] = dis[pos] + 1;\n pre[to] = pos;\n q.push(to);\n if (dis[to] > ma) {\n ma = dis[to];\n farthest = to;\n }\n }\n }\n }\n return {pre, farthest};\n}\n\n// 木の中心を求める(木の直径の中央の頂点)\n// 1or2頂点\nvector<int> center(const Graph& tree) {\n auto [pre1, v1] = bfs(tree, 0);\n auto [pre2, v2] = bfs(tree, v1);\n\n vector<int> path;\n int now = v2;\n while (now != -1) {\n path.push_back(now);\n now = pre2[now];\n }\n\n vector<int> centers;\n centers.push_back(path[path.size() / 2]);\n if (path.size() % 2 == 0) centers.push_back(path[path.size() / 2 - 1]);\n return centers;\n}\n// 木の名前を求める\nint name(int pos, int pre, const Graph& tree, map<vector<int>,int>& cmp, int& id) {\n vector<int> seq;\n for (int c : tree[pos]) {\n if (c == pre) continue;\n seq.push_back(name(c, pos, tree, cmp, id));\n }\n if (seq.empty()) {\n return 0;\n }\n sort(ALL(seq));\n if (cmp.count(seq)) {\n return cmp.at(seq);\n } else {\n cmp[seq] = ++id;\n return id;\n }\n}\n// 根付き木の同型性判定\nbool isomorphism_rooted(const Graph& t1, const Graph& t2, int r1, int r2) {\n int id = 0;\n map<vector<int>, int> cmp;\n int name1 = name(r1, -1, t1, cmp, id);\n int name2 = name(r2, -1, t2, cmp, id);\n return (name1 == name2);\n}\n\nbool solve() {\n for (int t = 0; t < 2; ++t) {\n int h,w;\n cin >> h >> w;\n if (h+w == 0) exit(0);\n S[t].assign(h+2, vector<char>(w+2, '.'));\n for (int i = 1; i <= h; ++i) {\n for (int j = 1; j <= w; ++j) {\n cin >> S[t][i][j];\n }\n }\n }\n\n vector<vector<int>> col[2];\n int kind[2];\n for (int i = 0; i < 2; ++i) {\n tie(col[i], kind[i]) = paint(S[i]);\n }\n Graph g[2];\n for (int i = 0; i < 2; ++i) {\n g[i] = gen(S[i], col[i], kind[i]);\n }\n\n return isomorphism_rooted(g[0], g[1], 0, 0);\n}\n\nint main() {\n ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);\n while (true) {\n cout << (solve() ? \"yes\" : \"no\")<< '\\n';\n }\n}","accuracy":1,"time_ms":140,"memory_kb":3716,"score_of_the_acc":-0.9547,"final_rank":16},{"submission_id":"aoj_1613_9125247","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define ALL(v) v.begin(),v.end()\n#define dbg(x) cerr << #x << \": \" << (x) << endl;\ntemplate<class F, class S>\nostream& operator<<(ostream& os, pair<F,S>& p) {\n os << '(' << p.first << ',' << p.second << ')';\n return os;\n}\ntemplate<class Iter>\nvoid print(Iter beg, Iter end) {\n for (Iter itr = beg; itr != end; ++itr) {\n cerr << *itr << ' ';\n }\n cerr << '\\n';\n}\nusing Pic = vector<vector<char>>;\nusing Graph = vector<vector<int>>;\nPic S[2];\nint dx[] = {1,0,-1,0,1};\n\nvector<pair<int,int>> paintConnected(const Pic& p, vector<vector<int>>& col, int sx, int sy, int idx) {\n vector<pair<int,int>> inside;\n int h = p.size();\n int w = p[0].size();\n queue<pair<int,int>> q;\n q.emplace(sx, sy);\n col[sx][sy] = idx;\n while (q.size()) {\n auto [x,y] = q.front();\n q.pop();\n \n if (p[sx][sy] == '.') {\n for (int i = 0; i < 4; ++i) {\n int nx = x + dx[i];\n int ny = y + dx[i+1];\n if (!(0 <= nx && nx < h && 0 <= ny && ny < w)) continue;\n if (col[nx][ny] != -1) continue;\n if (p[nx][ny] != p[sx][sy]) {\n if (col[nx][ny] == -1) inside.emplace_back(nx, ny);\n continue;\n }\n q.emplace(nx, ny);\n col[nx][ny] = idx;\n }\n } else {\n for (int dx = -1; dx < 2; ++dx) {\n for (int dy = -1; dy < 2; ++dy) {\n if (dx==0 && dy==0) continue;\n int nx = x + dx;\n int ny = y + dy;\n if (!(0 <= nx && nx < h && 0 <= ny && ny < w)) continue;\n if (col[nx][ny] != -1) continue;\n if (p[nx][ny] != p[sx][sy]) {\n if (col[nx][ny] == -1) inside.emplace_back(nx, ny);\n continue;\n }\n q.emplace(nx, ny);\n col[nx][ny] = idx;\n }\n }\n }\n }\n return inside;\n}\n\npair<vector<vector<int>>, int> paint(const Pic& p) {\n int h = p.size();\n int w = p[0].size();\n queue<pair<int,int>> q;\n vector<vector<int>> col(h, vector<int>(w,-1));\n int idx = 0;\n q.emplace(0,0);\n\n while (q.size()) {\n auto [x,y] = q.front();\n q.pop();\n if (col[x][y] != -1) continue;\n\n auto inside = paintConnected(p, col, x, y, idx);\n for (auto x : inside) {\n q.push(x);\n }\n ++idx;\n }\n return {col, idx};\n}\n\nGraph gen(const Pic& p, vector<vector<int>>& col, int kind) {\n int h = col.size();\n int w = col[0].size();\n\n set<pair<int,int>> st;\n\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n for (int dx = -1; dx < 2; ++dx) {\n for (int dy = -1; dy < 2; ++dy) {\n if (dx==0 && dy==0) continue;\n int nx = i + dx;\n int ny = j + dy;\n if (!(0 <= nx && nx < h && 0 <= ny && ny < w)) continue;\n int a = col[nx][ny];\n int b = col[i][j];\n if (p[i][j] == p[nx][ny]) continue;\n if (a == b) continue;\n if (a > b) swap(a,b);\n st.emplace(a, b);\n }\n }\n }\n }\n Graph g(kind);\n for (auto [u,v] : st) {\n g[u].push_back(v);\n g[v].push_back(u);\n }\n return g;\n}\n// O(N + M)\ntuple<vector<int>, vector<int>, int> bfs(const Graph& g, int start) {\n int n = g.size();\n vector<int> dis(n, 1e9), pre(n, -1);\n queue<int> q;\n dis[start] = 0;\n q.push(start);\n int ma = 0;\n int farthest = start;\n while (q.size()) {\n int pos = q.front();\n q.pop();\n for (int to : g[pos]) {\n if (dis[pos] + 1 < dis[to]) {\n dis[to] = dis[pos] + 1;\n pre[to] = pos;\n q.push(to);\n if (dis[to] > ma) {\n ma = dis[to];\n farthest = to;\n }\n }\n }\n }\n return {dis, pre, farthest};\n}\n\n// 木の中心を求める(木の直径の中央の頂点)\n// 1or2頂点\nvector<int> center(const Graph& tree) {\n auto [dis1, pre1, v1] = bfs(tree, 0);\n auto [dis2, pre2, v2] = bfs(tree, v1);\n\n vector<int> path;\n int now = v2;\n while (now != -1) {\n path.push_back(now);\n now = pre2[now];\n }\n\n vector<int> centers;\n centers.push_back(path[path.size() / 2]);\n if (path.size() % 2 == 0) centers.push_back(path[path.size() / 2 - 1]);\n return centers;\n}\n// 木の名前を求める\nint name(int pos, int pre, const Graph& tree, map<vector<int>,int>& cmp, int& id) {\n vector<int> seq;\n for (int c : tree[pos]) {\n if (c == pre) continue;\n seq.push_back(name(c, pos, tree, cmp, id));\n }\n if (seq.empty()) {\n return 0;\n }\n sort(ALL(seq));\n if (cmp.count(seq)) {\n return cmp.at(seq);\n } else {\n cmp[seq] = ++id;\n return id;\n }\n}\n// 根付き木の同型性判定\nbool isomorphism_rooted(const Graph& t1, const Graph& t2, int r1, int r2) {\n int id = 0;\n map<vector<int>, int> cmp;\n int name1 = name(r1, -1, t1, cmp, id);\n int name2 = name(r2, -1, t2, cmp, id);\n return (name1 == name2);\n}\n\nbool solve() {\n for (int t = 0; t < 2; ++t) {\n int h,w;\n cin >> h >> w;\n if (h+w == 0) exit(0);\n S[t].assign(h+2, vector<char>(w+2, '.'));\n for (int i = 1; i <= h; ++i) {\n for (int j = 1; j <= w; ++j) {\n cin >> S[t][i][j];\n }\n }\n }\n\n vector<vector<int>> col[2];\n int kind[2];\n for (int i = 0; i < 2; ++i) {\n tie(col[i], kind[i]) = paint(S[i]);\n }\n Graph g[2];\n for (int i = 0; i < 2; ++i) {\n g[i] = gen(S[i], col[i], kind[i]);\n }\n\n return isomorphism_rooted(g[0], g[1], 0, 0);\n}\n\nint main() {\n ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);\n while (true) {\n cout << (solve() ? \"yes\" : \"no\")<< '\\n';\n }\n}","accuracy":1,"time_ms":150,"memory_kb":3588,"score_of_the_acc":-1.0051,"final_rank":17}],"string":"[\n {\n \"submission_id\": \"aoj_1613_10867681\",\n \"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 REVERSE(x) reverse( (x).begin(),(x).end() )\\n#define UNIQUE(x) (x).erase( unique( ALL( (x) ) ) , (x).end() )\\n#define PW(x) (1LL<<(x))\\n#define SZ(x) ((ll)(x).size())\\n#define SHOW(x) cout << #x << \\\" = \\\" << x << endl\\n#define SHOWA(x,n) for( int yui = 0; yui < n; yui++ ){ cout << x[yui] << \\\" \\\"; } cout << endl\\n\\n#define pb emplace_back\\n#define fi first\\n#define se second\\n\\nusing namespace std;\\n\\ntypedef long double ld;\\ntypedef long long int ll;\\ntypedef pair<int,int> pi;\\ntypedef pair<ll,ll> pl;\\ntypedef vector<int> vi;\\ntypedef vector<ll> vl;\\ntypedef vector<bool> vb;\\ntypedef vector<ld> vd;\\ntypedef vector<pi> vpi;\\ntypedef vector<pl> vpl;\\ntypedef vector<vpl> gr;\\ntypedef vector<vl> ml;\\ntypedef vector<vd> md;\\ntypedef vector<vi> mi;\\n \\nconst ll INF = (ll)1e9 + 10;\\nconst ll INFLL = (ll)1e18 + 10;\\nconst ld EPS = 1e-12;\\nconst ll MOD = 1e9+7;\\n \\ntemplate<class T> T &chmin( T &a , const T &b ){ return a = min(a,b); }\\ntemplate<class T> T &chmax( T &a , const T &b ){ return a = max(a,b); }\\ntemplate<class T> inline T sq( T a ){ return a * a; }\\n\\nll in(){ long long int x; scanf( \\\"%lld\\\" , &x ); return x; }\\nchar yuyushiki[1000010]; string stin(){ scanf( \\\"%s\\\" , yuyushiki ); return yuyushiki; }\\n\\n// head\\n\\nconst int dx[] = { 1 , 0 , -1 , 0 , 1 , -1 , -1 , 1 };\\nconst int dy[] = { 0 , -1 , 0 , 1 , -1 , -1 , 1 , 1 };\\nconst int type[] = { 4 , 8 };\\nconst char opp[] = { '#' , '.' };\\n\\nconst int N = 10;\\n\\nll A[N];\\nll B[N];\\n\\nvi G[100010];\\n\\nint it = 0;\\n\\nint n, m;\\n\\nbool used[128][128];\\n\\nstring s[128];\\n\\nbool isin( int y , int x ){\\n return 0 <= y && y < n && 0 <= x && x < m;\\n}\\n\\nvoid dfs2( int y , int x , int t , vpi &v ){\\n // cout << y << \\\" \\\" << x << endl;\\n used[y][x] = true;\\n v.pb( y , x );\\n REP( i , type[t] ){\\n int ny = y + dy[i];\\n int nx = x + dx[i];\\n if( isin( ny , nx ) && !used[ny][nx] ){\\n if( s[ny][nx] == opp[t] ){\\n v.pb( ny , nx );\\n } else {\\n dfs2( ny , nx , t , v );\\n }\\n }\\n }\\n}\\n\\nint dfs( int y, int x , int t ){\\n int cur = it++;\\n vpi v(0);\\n // cout << \\\"---\\\" << endl;\\n dfs2( y , x , t , v );\\n YYS( w , v ){\\n if( !used[w.fi][w.se] ){\\n G[cur].pb( dfs( w.fi , w.se , 1-t ) );\\n }\\n }\\n return cur;\\n}\\n\\nint get(){\\n n = in();\\n m = in();\\n if( n == 0 && m == 0 ){\\n return -1;\\n }\\n s[0] = string( m+2 , '.' );\\n REP( i , n ){\\n s[i+1] = \\\".\\\" + stin() + \\\".\\\";\\n }\\n s[n+1] = string( m+2 , '.' );\\n n += 2;\\n m += 2;\\n /*\\n REP( i , n ){\\n cout << s[i] << endl;\\n }\\n */\\n REP( i , n ){\\n REP( j , m ){\\n used[i][j] = false;\\n }\\n }\\n return dfs( 0 , 0 , 0 );\\n}\\n\\nll ha( int x , ll a , ll b ){\\n ll res = a;\\n vl v(0);\\n YYS( w , G[x] ){\\n v.pb( ha( w , a , b ) );\\n }\\n SORT( v );\\n YYS( w , v ){\\n res = ( res * a + w ) % MOD;\\n }\\n return ( res + b ) % MOD;\\n}\\n\\nint main(){\\n\\n mt19937 mt(727272);\\n \\n REP( i , N ){\\n A[i] = mt();\\n B[i] = mt();\\n }\\n \\n while( 1 ){\\n REP( i , 100010 ){\\n G[i].clear();\\n }\\n it = 0;\\n int ra = get();\\n if( ra == -1 ){\\n break;\\n }\\n int rb = get();\\n /*\\n REP( i , it ){\\n SHOWA( G[i] , SZ(G[i]) );\\n }\\n */\\n bool ok = true;\\n REP( i , N ){\\n if( ha( ra , A[i] , B[i] ) != ha( rb , A[i] , B[i] ) ){\\n ok = false;\\n break;\\n }\\n }\\n if( ok ){\\n puts( \\\"yes\\\" );\\n } else {\\n puts( \\\"no\\\" );\\n }\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 6104,\n \"score_of_the_acc\": -0.7343,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1613_10675182\",\n \"code_snippet\": \"// C++ includes used for precompiling -*- C++ -*-\\n// Copyright (C) 2003-2013 Free Software Foundation, Inc.\\n//\\n// This file is part of the GNU ISO C++ Library. This library is free\\n// software; you can redistribute it and/or modify it under the\\n// terms of the GNU General Public License as published by the\\n// Free Software Foundation; either version 3, or (at your option)\\n// any later version.\\n// This library is distributed in the hope that it will be useful,\\n// but WITHOUT ANY WARRANTY; without even the implied warranty of\\n// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\\n// GNU General Public License for more details.\\n// Under Section 7 of GPL version 3, you are granted additional\\n// permissions described in the GCC Runtime Library Exception, version\\n// 3.1, as published by the Free Software Foundation.\\n// You should have received a copy of the GNU General Public License and\\n// a copy of the GCC Runtime Library Exception along with this program;\\n// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see\\n// <http://w...content-available-to-author-only...u.org/licenses/>.\\n/** @file stdc++.h\\n * This is an implementation file for a precompiled header.\\n */\\n// 17.4.1.2 Headers\\n// C\\n#ifndef _GLIBCXX_NO_ASSERT\\n#include <cassert>\\n#endif\\n#include <cctype>\\n#include <cerrno>\\n#include <cfloat>\\n#include <ciso646>\\n#include <climits>\\n#include <clocale>\\n#include <cmath>\\n#include <csetjmp>\\n#include <csignal>\\n#include <cstdarg>\\n#include <cstddef>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <ctime>\\n#if __cplusplus >= 201103L\\n#include <ccomplex>\\n#include <cfenv>\\n#include <cinttypes>\\n#include <cstdbool>\\n#include <cstdint>\\n#include <ctgmath>\\n#include <cwchar>\\n#include <cwctype>\\n#endif\\n// C++\\n#include <algorithm>\\n#include <bitset>\\n#include <complex>\\n#include <deque>\\n#include <exception>\\n#include <fstream>\\n#include <functional>\\n#include <iomanip>\\n#include <ios>\\n#include <iosfwd>\\n#include <iostream>\\n#include <istream>\\n#include <iterator>\\n#include <limits>\\n#include <list>\\n#include <locale>\\n#include <map>\\n#include <memory>\\n#include <new>\\n#include <numeric>\\n#include <ostream>\\n#include <queue>\\n#include <set>\\n#include <sstream>\\n#include <stack>\\n#include <stdexcept>\\n#include <streambuf>\\n#include <string>\\n#include <typeinfo>\\n#include <utility>\\n#include <valarray>\\n#include <vector>\\n#if __cplusplus >= 201103L\\n#include <array>\\n#include <atomic>\\n#include <chrono>\\n#include <condition_variable>\\n#include <forward_list>\\n#include <future>\\n#include <initializer_list>\\n#include <mutex>\\n#include <random>\\n#include <ratio>\\n#include <regex>\\n#include <scoped_allocator>\\n#include <system_error>\\n#include <thread>\\n#include <tuple>\\n#include <type_traits>\\n#include <typeindex>\\n#include <unordered_map>\\n#include <unordered_set>\\n\\n#endif\\nusing namespace std;\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing uint = unsigned int;\\n#define rep(i, n) for (int i = 0; i < n; i++)\\n#define all(v) v.begin(), v.end()\\ntemplate <class T, class U>\\ninline bool chmax(T &a, U b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <class T, class U>\\ninline bool chmin(T &a, U b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <class T>\\ninline void compress(vector<T> &a) {\\n sort(a.begin(), a.end());\\n a.erase(unique(a.begin(), a.end()), a.end());\\n}\\ntemplate <class T>\\nT rand(T l, T r) {\\n static mt19937 mt(random_device{}());\\n // [l, r)\\n if constexpr (is_integral_v<T>) {\\n return uniform_int_distribution<T>(l, r - 1)(mt);\\n } else if constexpr (is_floating_point_v<T>) {\\n return uniform_real_distribution<T>(l, r)(mt);\\n }\\n}\\nconstexpr int INF = 1001001001;\\nconstexpr ll llINF = 3000000000000000010;\\nstruct linear_sieve {\\n vector<int> least_factor, prime_list;\\n linear_sieve(int n) : least_factor(n + 1, 0) {\\n for (int i = 2; i <= n; i++) {\\n if (least_factor[i] == 0) {\\n least_factor[i] = i;\\n prime_list.push_back(i);\\n }\\n for (int p : prime_list) {\\n if (ll(i) * p > n || p > least_factor[i]) break;\\n least_factor[i * p] = p;\\n }\\n }\\n }\\n};\\ntemplate <int modulo>\\nstruct modint {\\n int x;\\n modint() : x(0) {}\\n modint(int64_t y) : x(y >= 0 ? y % modulo : (modulo - (-y) % modulo) % modulo) {}\\n modint &operator+=(const modint &p) {\\n if ((x += p.x) >= modulo) x -= modulo;\\n return *this;\\n }\\n modint &operator-=(const modint &p) {\\n if ((x += modulo - p.x) >= modulo) x -= modulo;\\n return *this;\\n }\\n modint &operator*=(const modint &p) {\\n x = (int)(1LL * x * p.x % modulo);\\n return *this;\\n }\\n modint &operator/=(const modint &p) {\\n *this *= p.inv();\\n return *this;\\n }\\n modint operator-() const { return modint(-x); }\\n modint operator+(const modint &p) const { return modint(*this) += p; }\\n modint operator-(const modint &p) const { return modint(*this) -= p; }\\n modint operator*(const modint &p) const { return modint(*this) *= p; }\\n modint operator/(const modint &p) const { return modint(*this) /= p; }\\n bool operator==(const modint &p) const { return x == p.x; }\\n bool operator!=(const modint &p) const { return x != p.x; }\\n modint inv() const {\\n int a = x, b = modulo, u = 1, v = 0, t;\\n while (b > 0) {\\n t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return modint(u);\\n }\\n modint pow(int64_t n) const {\\n modint ret(1), mul(x);\\n while (n > 0) {\\n if (n & 1) ret *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return ret;\\n }\\n friend ostream &operator<<(ostream &os, const modint &p) { return os << p.x; }\\n friend istream &operator>>(istream &is, modint &a) {\\n int64_t t;\\n is >> t;\\n a = modint<modulo>(t);\\n return (is);\\n }\\n int val() const { return x; }\\n static constexpr int mod() { return modulo; }\\n static constexpr int half() { return (modulo + 1) >> 1; }\\n};\\nll extgcd(ll a, ll b, ll &x, ll &y) {\\n // ax+by=gcd(|a|,|b|)\\n if (a < 0 || b < 0) {\\n ll d = extgcd(abs(a), abs(b), x, y);\\n if (a < 0) x = -x;\\n if (b < 0) y = -y;\\n return d;\\n }\\n if (b == 0) {\\n x = 1;\\n y = 0;\\n return a;\\n }\\n ll d = extgcd(b, a % b, y, x);\\n y -= a / b * x;\\n return d;\\n}\\ntemplate <typename T>\\nstruct Binomial {\\n vector<T> inv, fact, factinv;\\n Binomial(int n) {\\n inv.resize(n + 1);\\n fact.resize(n + 1);\\n factinv.resize(n + 1);\\n inv[0] = fact[0] = factinv[0] = 1;\\n for (int i = 1; i <= n; i++) fact[i] = fact[i - 1] * i;\\n factinv[n] = fact[n].inv();\\n inv[n] = fact[n - 1] * factinv[n];\\n for (int i = n - 1; i >= 1; i--) {\\n factinv[i] = factinv[i + 1] * (i + 1);\\n inv[i] = fact[i - 1] * factinv[i];\\n }\\n }\\n T C(int n, int r) {\\n if (n < 0 || n < r || r < 0) return 0;\\n return fact[n] * factinv[n - r] * factinv[r];\\n }\\n T P(int n, int r) {\\n if (n < 0 || n < r || r < 0) return 0;\\n return fact[n] * factinv[n - r];\\n }\\n T H(int n, int r) {\\n if (n == 0 && r == 0) return 1;\\n if (n < 0 || r < 0) return 0;\\n return r == 0 ? 1 : C(n + r - 1, r);\\n }\\n};\\ntemplate <class T>\\nvector<T> dijkstra(vector<vector<pair<int, T>>> &g, vector<int> start) {\\n using P = pair<T, int>;\\n vector<T> dp(g.size(), numeric_limits<T>::max());\\n priority_queue<P, vector<P>, greater<P>> que;\\n for (int s : start) {\\n dp[s] = 0;\\n que.push({0, s});\\n }\\n while (que.size()) {\\n auto [d, v] = que.top();\\n que.pop();\\n if (dp[v] != d) continue;\\n for (auto [u, c] : g[v]) {\\n if (chmin(dp[u], d + c)) que.push({dp[u], u});\\n }\\n }\\n return dp;\\n}\\n\\nvector<int> BFS01(vector<vector<pair<int, int>>> &g, vector<int> start) {\\n vector<int> dp(g.size(), numeric_limits<int>::max());\\n deque<int> que;\\n for (int s : start) {\\n dp[s] = 0;\\n que.push_front(s);\\n }\\n while (que.size()) {\\n auto v = que.front();\\n que.pop_front();\\n for (auto [u, c] : g[v]) {\\n if (chmin(dp[u], dp[v] + c)) {\\n if (c == 0)\\n que.push_front(u);\\n else\\n que.push_back(u);\\n }\\n }\\n }\\n return dp;\\n}\\ntemplate <typename T, typename U>\\ninline istream &operator>>(istream &is, pair<T, U> &rhs) {\\n return is >> rhs.first >> rhs.second;\\n}\\ntemplate <typename T>\\ninline istream &operator>>(istream &is, vector<T> &v) {\\n for (auto &e : v) is >> e;\\n return is;\\n}\\ntemplate <typename T, typename U>\\ninline ostream &operator<<(ostream &os, const pair<T, U> &rhs) {\\n return os << rhs.first << \\\" \\\" << rhs.second;\\n}\\ntemplate <typename T>\\ninline ostream &operator<<(ostream &os, const vector<T> &v) {\\n for (auto itr = v.begin(), end_itr = v.end(); itr != end_itr;) {\\n os << *itr;\\n if (++itr != end_itr) os << \\\" \\\";\\n }\\n return os;\\n}\\n\\nstruct UnionFind {\\n vector<int> par, siz;\\n UnionFind(int x) {\\n par.resize(x);\\n siz.resize(x);\\n for (int i = 0; i < x; i++) {\\n par[i] = i;\\n siz[i] = 1;\\n }\\n }\\n int find(int x) {\\n if (par[x] == x) return x;\\n return par[x] = find(par[x]);\\n }\\n bool unite(int x, int y) {\\n x = find(x), y = find(y);\\n if (x == y) return false;\\n if (siz[x] < siz[y]) swap(x, y);\\n par[y] = x;\\n siz[x] += siz[y];\\n\\n return true;\\n }\\n bool same(int x, int y) { return find(x) == find(y); }\\n int size(int x) { return siz[find(x)]; }\\n};\\ntemplate <class T>\\nstruct BIT {\\n // 1-indexed\\n int n, beki = 1;\\n vector<T> bit;\\n BIT(int x) {\\n bit.resize(x + 1, 0);\\n n = x;\\n while (beki * 2 <= n) beki *= 2;\\n }\\n T sum(int i) {\\n T res = 0;\\n while (i > 0) {\\n res += bit[i];\\n i -= i & -i;\\n }\\n return res;\\n }\\n T sum(int l, int r) {\\n //[l,r]\\n return sum(r) - (l == 0 ? 0 : sum(l - 1));\\n }\\n void add(int i, T x) {\\n while (i <= n) {\\n bit[i] += x;\\n i += i & -i;\\n }\\n }\\n int lowerbound(T w) {\\n if (w <= 0) return 0;\\n int x = 0;\\n for (int k = beki; k > 0; k >>= 1) {\\n if (x + k <= n && bit[x + k] < w) {\\n w -= bit[x + k];\\n x += k;\\n }\\n }\\n return x + 1;\\n }\\n};\\nvector<vector<int>> read_tree() {\\n int h, w;\\n cin >> h >> w;\\n if (h == 0 && w == 0) exit(0);\\n vector<string> s(h + 2);\\n s[0] = s[h + 1] = string(w + 2, '.');\\n for (int i = 1; i <= h; i++) {\\n cin >> s[i];\\n s[i] = '.' + s[i] + '.';\\n }\\n h += 2, w += 2;\\n UnionFind uf(h * w);\\n rep(i, h) {\\n rep(j, w) {\\n if (s[i][j] == '.') {\\n if (i && s[i - 1][j] == '.') uf.unite(i * w + j, (i - 1) * w + j);\\n if (j && s[i][j - 1] == '.') uf.unite(i * w + j, i * w + (j - 1));\\n } else {\\n if (i && s[i - 1][j] == '#') uf.unite(i * w + j, (i - 1) * w + j);\\n if (j && s[i][j - 1] == '#') uf.unite(i * w + j, i * w + (j - 1));\\n if (i && j && s[i - 1][j - 1] == '#') uf.unite(i * w + j, (i - 1) * w + (j - 1));\\n if (i && j + 1 < w && s[i - 1][j + 1] == '#') uf.unite(i * w + j, (i - 1) * w + (j + 1));\\n }\\n }\\n }\\n int C = 0;\\n int n = h * w;\\n vector<int> cmp(n);\\n cmp[uf.find(0)] = C++;\\n rep(i, n) {\\n if (uf.same(0, i)) continue;\\n if (uf.find(i) == i) cmp[i] = C++;\\n }\\n rep(i, n) cmp[i] = cmp[uf.find(i)];\\n vector<vector<int>> g(C);\\n rep(i, h) {\\n rep(j, w) {\\n if (s[i][j] == '.') {\\n if (i && s[i - 1][j] == '#') {\\n g[cmp[(i - 1) * w + j]].push_back(cmp[i * w + j]);\\n g[cmp[i * w + j]].push_back(cmp[(i - 1) * w + j]);\\n }\\n\\n if (j && s[i][j - 1] == '#') {\\n g[cmp[i * w + j - 1]].push_back(cmp[i * w + j]);\\n g[cmp[i * w + j]].push_back(cmp[i * w + j - 1]);\\n }\\n\\n if (i + 1 < h && s[i + 1][j] == '#') {\\n g[cmp[(i + 1) * w + j]].push_back(cmp[i * w + j]);\\n g[cmp[i * w + j]].push_back(cmp[(i + 1) * w + j]);\\n }\\n\\n if (j + 1 < w && s[i][j + 1] == '#') {\\n g[cmp[i * w + j + 1]].push_back(cmp[i * w + j]);\\n g[cmp[i * w + j]].push_back(cmp[i * w + j + 1]);\\n }\\n }\\n }\\n }\\n rep(i, C) { compress(g[i]); }\\n // rep(i, C) { cout << g[i] << endl; }\\n return g;\\n}\\nusing mint = modint<998244353>;\\nmint C = 97;\\nmint rooted_tree_hash(vector<vector<int>> g) {\\n int n = g.size();\\n vector<mint> h(n, 1);\\n function<void(int, int)> dfs = [&](int v, int p) {\\n for (int u : g[v]) {\\n if (u == p) continue;\\n dfs(u, v);\\n h[v] *= (h[u]*h[u] + C);\\n }\\n };\\n dfs(0, -1);\\n return h[0];\\n}\\nvoid solve() {\\n auto g1 = read_tree();\\n auto g2 = read_tree();\\n if (g1.size() != g2.size()) {\\n cout << \\\"no\\\" << endl;\\n return;\\n }\\n mint h1 = rooted_tree_hash(g1);\\n mint h2 = rooted_tree_hash(g2);\\n if (h1 == h2)\\n cout << \\\"yes\\\" << endl;\\n else\\n cout << \\\"no\\\" << endl;\\n}\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int t = 1;\\n // cin >> t;\\n while (1) solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 4096,\n \"score_of_the_acc\": -0.1355,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1613_10672975\",\n \"code_snippet\": \"// C++ includes used for precompiling -*- C++ -*-\\n// Copyright (C) 2003-2013 Free Software Foundation, Inc.\\n//\\n// This file is part of the GNU ISO C++ Library. This library is free\\n// software; you can redistribute it and/or modify it under the\\n// terms of the GNU General Public License as published by the\\n// Free Software Foundation; either version 3, or (at your option)\\n// any later version.\\n// This library is distributed in the hope that it will be useful,\\n// but WITHOUT ANY WARRANTY; without even the implied warranty of\\n// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\\n// GNU General Public License for more details.\\n// Under Section 7 of GPL version 3, you are granted additional\\n// permissions described in the GCC Runtime Library Exception, version\\n// 3.1, as published by the Free Software Foundation.\\n// You should have received a copy of the GNU General Public License and\\n// a copy of the GCC Runtime Library Exception along with this program;\\n// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see\\n// <http://w...content-available-to-author-only...u.org/licenses/>.\\n/** @file stdc++.h\\n * This is an implementation file for a precompiled header.\\n */\\n// 17.4.1.2 Headers\\n// C\\n#ifndef _GLIBCXX_NO_ASSERT\\n#include <cassert>\\n#endif\\n#include <cctype>\\n#include <cerrno>\\n#include <cfloat>\\n#include <ciso646>\\n#include <climits>\\n#include <clocale>\\n#include <cmath>\\n#include <csetjmp>\\n#include <csignal>\\n#include <cstdarg>\\n#include <cstddef>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <ctime>\\n#if __cplusplus >= 201103L\\n#include <ccomplex>\\n#include <cfenv>\\n#include <cinttypes>\\n#include <cstdbool>\\n#include <cstdint>\\n#include <ctgmath>\\n#include <cwchar>\\n#include <cwctype>\\n#endif\\n// C++\\n#include <algorithm>\\n#include <bitset>\\n#include <complex>\\n#include <deque>\\n#include <exception>\\n#include <fstream>\\n#include <functional>\\n#include <iomanip>\\n#include <ios>\\n#include <iosfwd>\\n#include <iostream>\\n#include <istream>\\n#include <iterator>\\n#include <limits>\\n#include <list>\\n#include <locale>\\n#include <map>\\n#include <memory>\\n#include <new>\\n#include <numeric>\\n#include <ostream>\\n#include <queue>\\n#include <set>\\n#include <sstream>\\n#include <stack>\\n#include <stdexcept>\\n#include <streambuf>\\n#include <string>\\n#include <typeinfo>\\n#include <utility>\\n#include <valarray>\\n#include <vector>\\n#if __cplusplus >= 201103L\\n#include <array>\\n#include <atomic>\\n#include <chrono>\\n#include <condition_variable>\\n#include <forward_list>\\n#include <future>\\n#include <initializer_list>\\n#include <mutex>\\n#include <random>\\n#include <ratio>\\n#include <regex>\\n#include <scoped_allocator>\\n#include <system_error>\\n#include <thread>\\n#include <tuple>\\n#include <type_traits>\\n#include <typeindex>\\n#include <unordered_map>\\n#include <unordered_set>\\n\\n#endif\\nusing namespace std;\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing uint = unsigned int;\\n#define rep(i, n) for (int i = 0; i < n; i++)\\n#define all(v) v.begin(), v.end()\\ntemplate <class T, class U>\\ninline bool chmax(T &a, U b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <class T, class U>\\ninline bool chmin(T &a, U b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <class T>\\ninline void compress(vector<T> &a) {\\n sort(a.begin(), a.end());\\n a.erase(unique(a.begin(), a.end()), a.end());\\n}\\ntemplate <class T>\\nT rand(T l, T r) {\\n static mt19937 mt(random_device{}());\\n // [l, r)\\n if constexpr (is_integral_v<T>) {\\n return uniform_int_distribution<T>(l, r - 1)(mt);\\n } else if constexpr (is_floating_point_v<T>) {\\n return uniform_real_distribution<T>(l, r)(mt);\\n }\\n}\\nconstexpr int INF = 1001001001;\\nconstexpr ll llINF = 3000000000000000010;\\nstruct linear_sieve {\\n vector<int> least_factor, prime_list;\\n linear_sieve(int n) : least_factor(n + 1, 0) {\\n for (int i = 2; i <= n; i++) {\\n if (least_factor[i] == 0) {\\n least_factor[i] = i;\\n prime_list.push_back(i);\\n }\\n for (int p : prime_list) {\\n if (ll(i) * p > n || p > least_factor[i]) break;\\n least_factor[i * p] = p;\\n }\\n }\\n }\\n};\\ntemplate <int modulo>\\nstruct modint {\\n int x;\\n modint() : x(0) {}\\n modint(int64_t y) : x(y >= 0 ? y % modulo : (modulo - (-y) % modulo) % modulo) {}\\n modint &operator+=(const modint &p) {\\n if ((x += p.x) >= modulo) x -= modulo;\\n return *this;\\n }\\n modint &operator-=(const modint &p) {\\n if ((x += modulo - p.x) >= modulo) x -= modulo;\\n return *this;\\n }\\n modint &operator*=(const modint &p) {\\n x = (int)(1LL * x * p.x % modulo);\\n return *this;\\n }\\n modint &operator/=(const modint &p) {\\n *this *= p.inv();\\n return *this;\\n }\\n modint operator-() const { return modint(-x); }\\n modint operator+(const modint &p) const { return modint(*this) += p; }\\n modint operator-(const modint &p) const { return modint(*this) -= p; }\\n modint operator*(const modint &p) const { return modint(*this) *= p; }\\n modint operator/(const modint &p) const { return modint(*this) /= p; }\\n bool operator==(const modint &p) const { return x == p.x; }\\n bool operator!=(const modint &p) const { return x != p.x; }\\n modint inv() const {\\n int a = x, b = modulo, u = 1, v = 0, t;\\n while (b > 0) {\\n t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return modint(u);\\n }\\n modint pow(int64_t n) const {\\n modint ret(1), mul(x);\\n while (n > 0) {\\n if (n & 1) ret *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return ret;\\n }\\n friend ostream &operator<<(ostream &os, const modint &p) { return os << p.x; }\\n friend istream &operator>>(istream &is, modint &a) {\\n int64_t t;\\n is >> t;\\n a = modint<modulo>(t);\\n return (is);\\n }\\n int val() const { return x; }\\n static constexpr int mod() { return modulo; }\\n static constexpr int half() { return (modulo + 1) >> 1; }\\n};\\nll extgcd(ll a, ll b, ll &x, ll &y) {\\n // ax+by=gcd(|a|,|b|)\\n if (a < 0 || b < 0) {\\n ll d = extgcd(abs(a), abs(b), x, y);\\n if (a < 0) x = -x;\\n if (b < 0) y = -y;\\n return d;\\n }\\n if (b == 0) {\\n x = 1;\\n y = 0;\\n return a;\\n }\\n ll d = extgcd(b, a % b, y, x);\\n y -= a / b * x;\\n return d;\\n}\\ntemplate <typename T>\\nstruct Binomial {\\n vector<T> inv, fact, factinv;\\n Binomial(int n) {\\n inv.resize(n + 1);\\n fact.resize(n + 1);\\n factinv.resize(n + 1);\\n inv[0] = fact[0] = factinv[0] = 1;\\n for (int i = 1; i <= n; i++) fact[i] = fact[i - 1] * i;\\n factinv[n] = fact[n].inv();\\n inv[n] = fact[n - 1] * factinv[n];\\n for (int i = n - 1; i >= 1; i--) {\\n factinv[i] = factinv[i + 1] * (i + 1);\\n inv[i] = fact[i - 1] * factinv[i];\\n }\\n }\\n T C(int n, int r) {\\n if (n < 0 || n < r || r < 0) return 0;\\n return fact[n] * factinv[n - r] * factinv[r];\\n }\\n T P(int n, int r) {\\n if (n < 0 || n < r || r < 0) return 0;\\n return fact[n] * factinv[n - r];\\n }\\n T H(int n, int r) {\\n if (n == 0 && r == 0) return 1;\\n if (n < 0 || r < 0) return 0;\\n return r == 0 ? 1 : C(n + r - 1, r);\\n }\\n};\\ntemplate <class T>\\nvector<T> dijkstra(vector<vector<pair<int, T>>> &g, vector<int> start) {\\n using P = pair<T, int>;\\n vector<T> dp(g.size(), numeric_limits<T>::max());\\n priority_queue<P, vector<P>, greater<P>> que;\\n for (int s : start) {\\n dp[s] = 0;\\n que.push({0, s});\\n }\\n while (que.size()) {\\n auto [d, v] = que.top();\\n que.pop();\\n if (dp[v] != d) continue;\\n for (auto [u, c] : g[v]) {\\n if (chmin(dp[u], d + c)) que.push({dp[u], u});\\n }\\n }\\n return dp;\\n}\\n\\nvector<int> BFS01(vector<vector<pair<int, int>>> &g, vector<int> start) {\\n vector<int> dp(g.size(), numeric_limits<int>::max());\\n deque<int> que;\\n for (int s : start) {\\n dp[s] = 0;\\n que.push_front(s);\\n }\\n while (que.size()) {\\n auto v = que.front();\\n que.pop_front();\\n for (auto [u, c] : g[v]) {\\n if (chmin(dp[u], dp[v] + c)) {\\n if (c == 0)\\n que.push_front(u);\\n else\\n que.push_back(u);\\n }\\n }\\n }\\n return dp;\\n}\\ntemplate <typename T, typename U>\\ninline istream &operator>>(istream &is, pair<T, U> &rhs) {\\n return is >> rhs.first >> rhs.second;\\n}\\ntemplate <typename T>\\ninline istream &operator>>(istream &is, vector<T> &v) {\\n for (auto &e : v) is >> e;\\n return is;\\n}\\ntemplate <typename T, typename U>\\ninline ostream &operator<<(ostream &os, const pair<T, U> &rhs) {\\n return os << rhs.first << \\\" \\\" << rhs.second;\\n}\\ntemplate <typename T>\\ninline ostream &operator<<(ostream &os, const vector<T> &v) {\\n for (auto itr = v.begin(), end_itr = v.end(); itr != end_itr;) {\\n os << *itr;\\n if (++itr != end_itr) os << \\\" \\\";\\n }\\n return os;\\n}\\n\\nstruct UnionFind {\\n vector<int> par, siz;\\n UnionFind(int x) {\\n par.resize(x);\\n siz.resize(x);\\n for (int i = 0; i < x; i++) {\\n par[i] = i;\\n siz[i] = 1;\\n }\\n }\\n int find(int x) {\\n if (par[x] == x) return x;\\n return par[x] = find(par[x]);\\n }\\n bool unite(int x, int y) {\\n x = find(x), y = find(y);\\n if (x == y) return false;\\n if (siz[x] < siz[y]) swap(x, y);\\n par[y] = x;\\n siz[x] += siz[y];\\n\\n return true;\\n }\\n bool same(int x, int y) { return find(x) == find(y); }\\n int size(int x) { return siz[find(x)]; }\\n};\\ntemplate <class T>\\nstruct BIT {\\n // 1-indexed\\n int n, beki = 1;\\n vector<T> bit;\\n BIT(int x) {\\n bit.resize(x + 1, 0);\\n n = x;\\n while (beki * 2 <= n) beki *= 2;\\n }\\n T sum(int i) {\\n T res = 0;\\n while (i > 0) {\\n res += bit[i];\\n i -= i & -i;\\n }\\n return res;\\n }\\n T sum(int l, int r) {\\n //[l,r]\\n return sum(r) - (l == 0 ? 0 : sum(l - 1));\\n }\\n void add(int i, T x) {\\n while (i <= n) {\\n bit[i] += x;\\n i += i & -i;\\n }\\n }\\n int lowerbound(T w) {\\n if (w <= 0) return 0;\\n int x = 0;\\n for (int k = beki; k > 0; k >>= 1) {\\n if (x + k <= n && bit[x + k] < w) {\\n w -= bit[x + k];\\n x += k;\\n }\\n }\\n return x + 1;\\n }\\n};\\nvector<vector<int>> read_tree() {\\n int h, w;\\n cin >> h >> w;\\n if (h == 0 && w == 0) exit(0);\\n vector<string> s(h + 2);\\n s[0] = s[h + 1] = string(w + 2, '.');\\n for (int i = 1; i <= h; i++) {\\n cin >> s[i];\\n s[i] = '.' + s[i] + '.';\\n }\\n h += 2, w += 2;\\n UnionFind uf(h * w);\\n rep(i, h) {\\n rep(j, w) {\\n if (s[i][j] == '.') {\\n if (i && s[i - 1][j] == '.') uf.unite(i * w + j, (i - 1) * w + j);\\n if (j && s[i][j - 1] == '.') uf.unite(i * w + j, i * w + (j - 1));\\n } else {\\n if (i && s[i - 1][j] == '#') uf.unite(i * w + j, (i - 1) * w + j);\\n if (j && s[i][j - 1] == '#') uf.unite(i * w + j, i * w + (j - 1));\\n if (i && j && s[i - 1][j - 1] == '#') uf.unite(i * w + j, (i - 1) * w + (j - 1));\\n if (i && j + 1 < w && s[i - 1][j + 1] == '#') uf.unite(i * w + j, (i - 1) * w + (j + 1));\\n }\\n }\\n }\\n int C = 0;\\n int n = h * w;\\n vector<int> cmp(n);\\n cmp[uf.find(0)] = C++;\\n rep(i, n) {\\n if (uf.same(0, i)) continue;\\n if (uf.find(i) == i) cmp[i] = C++;\\n }\\n rep(i, n) cmp[i] = cmp[uf.find(i)];\\n vector<vector<int>> g(C);\\n rep(i, h) {\\n rep(j, w) {\\n if (s[i][j] == '.') {\\n if (i && s[i - 1][j] == '#') {\\n g[cmp[(i - 1) * w + j]].push_back(cmp[i * w + j]);\\n g[cmp[i * w + j]].push_back(cmp[(i - 1) * w + j]);\\n }\\n\\n if (j && s[i][j - 1] == '#') {\\n g[cmp[i * w + j - 1]].push_back(cmp[i * w + j]);\\n g[cmp[i * w + j]].push_back(cmp[i * w + j - 1]);\\n }\\n\\n if (i + 1 < h && s[i + 1][j] == '#') {\\n g[cmp[(i + 1) * w + j]].push_back(cmp[i * w + j]);\\n g[cmp[i * w + j]].push_back(cmp[(i + 1) * w + j]);\\n }\\n\\n if (j + 1 < w && s[i][j + 1] == '#') {\\n g[cmp[i * w + j + 1]].push_back(cmp[i * w + j]);\\n g[cmp[i * w + j]].push_back(cmp[i * w + j + 1]);\\n }\\n }\\n }\\n }\\n rep(i, C) { compress(g[i]); }\\n // rep(i, C) { cout << g[i] << endl; }\\n return g;\\n}\\nusing mint = modint<998244353>;\\nmint C = 97;\\nmint rooted_tree_hash(vector<vector<int>> g) {\\n int n = g.size();\\n vector<mint> h(n, 1);\\n function<void(int, int)> dfs = [&](int v, int p) {\\n for (int u : g[v]) {\\n if (u == p) continue;\\n dfs(u, v);\\n h[v] *= (h[u] + C);\\n }\\n };\\n dfs(0, -1);\\n return h[0];\\n}\\nvoid solve() {\\n auto g1 = read_tree();\\n auto g2 = read_tree();\\n if (g1.size() != g2.size()) {\\n cout << \\\"no\\\" << endl;\\n return;\\n }\\n mint h1 = rooted_tree_hash(g1);\\n mint h2 = rooted_tree_hash(g2);\\n if (h1 == h2)\\n cout << \\\"yes\\\" << endl;\\n else\\n cout << \\\"no\\\" << endl;\\n}\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int t = 1;\\n // cin >> t;\\n while (1) solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 4096,\n \"score_of_the_acc\": -0.1355,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1613_10670417\",\n \"code_snippet\": \"#ifdef LOCAL\\n#define _GLIBCXX_DEBUG\\n#pragma GCC optimize(\\\"O0\\\")\\n#else\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#endif\\n\\n#include <bits/stdc++.h>\\n// #include <bits/extc++.h>\\nusing namespace std;\\n\\n#include <atcoder/all>\\n\\n// #include <atcoder/modint>\\n// using mint = atcoder::modint998244353;\\n// istream& operator>>(istream& in, mint& x) {\\n// long long a;\\n// in >> a;\\n// x = a;\\n// return in;\\n// }\\n// ostream& operator<<(ostream& out, const mint& x) {\\n// return out << x.val();\\n// }\\n\\nusing ll = long long;\\nusing u32 = unsigned int;\\nusing u64 = unsigned long long;\\nusing i128 = __int128;\\nusing u128 = unsigned __int128;\\nusing f128 = __float128;\\n\\ntemplate <class T>\\nconstexpr T infty = 0;\\ntemplate <>\\nconstexpr int infty<int> = 1'000'000'000;\\ntemplate <>\\nconstexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;\\ntemplate <>\\nconstexpr u32 infty<u32> = infty<int>;\\ntemplate <>\\nconstexpr u64 infty<u64> = infty<ll>;\\ntemplate <>\\nconstexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;\\ntemplate <>\\nconstexpr double infty<double> = infty<ll>;\\ntemplate <>\\nconstexpr long double infty<long double> = infty<ll>;\\n\\nusing pi = pair<int, int>;\\nusing pl = pair<ll, ll>;\\nusing vi = vector<int>;\\nusing vl = vector<ll>;\\ntemplate <class T>\\nusing vc = vector<T>;\\ntemplate <class T>\\nusing vvc = vector<vc<T>>;\\nusing vvi = vvc<int>;\\nusing vvl = vvc<ll>;\\ntemplate <class T>\\nusing vvvc = vector<vvc<T>>;\\ntemplate <class T>\\nusing vvvvc = vector<vvvc<T>>;\\ntemplate <class T>\\nusing vvvvvc = vector<vvvvc<T>>;\\ntemplate <class T>\\nusing pqg = std::priority_queue<T, vector<T>, greater<T>>;\\ntemplate <class T, class U>\\nusing umap = unordered_map<T, U>;\\n\\n// template <typename K>\\n// using tree = __gnu_pbds::tree<K, __gnu_pbds::null_type, std::less<>,\\n// __gnu_pbds::rb_tree_tag,\\n// __gnu_pbds::tree_order_statistics_node_update>;\\n\\n#define vv(type, name, h, ...) \\\\\\n vector<vector<type>> name(h, vector<type>(__VA_ARGS__))\\n#define vvv(type, name, h, w, ...) \\\\\\n vector<vector<vector<type>>> name( \\\\\\n h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))\\n#define vvvv(type, name, a, b, c, ...) \\\\\\n vector<vector<vector<vector<type>>>> name( \\\\\\n a, vector<vector<vector<type>>>( \\\\\\n b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))\\n\\n// FOR(a) := for (ll _ = 0; _ < (ll)a; ++_)\\n// FOR(i, a) := for (ll i = 0; i < (ll)a; ++i)\\n// FOR(i, a, b) := for (ll i = a; i < (ll)b; ++i)\\n// FOR(i, a, b, c) := for (ll i = a; i < (ll)b; i += (c))\\n// FOR_R(a) := for (ll i = (a) - 1; i >= 0; --i)\\n// FOR_R(i, a) := for (ll i = (a) - 1; i >= 0; --i)\\n// FOR_R(i, a, b) := for (ll i = (b) - 1; i >= (ll)a; --i)\\n#define FOR1(a) for (ll _ = 0; _ < (ll)a; ++_)\\n#define FOR2(i, a) for (ll i = 0; i < (ll)a; ++i)\\n#define FOR3(i, a, b) for (ll i = a; i < (ll)b; ++i)\\n#define FOR4(i, a, b, c) for (ll i = a; i < (ll)b; i += (c))\\n#define FOR1_R(a) for (ll i = (a) - 1; i >= 0; --i)\\n#define FOR2_R(i, a) for (ll i = (a) - 1; i >= 0; --i)\\n#define FOR3_R(i, a, b) for (ll i = (b) - 1; i >= (ll)a; --i)\\n#define overload4(a, b, c, d, e, ...) e\\n#define overload3(a, b, c, d, ...) d\\n#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)\\n#define FOR_R(...) overload3(__VA_ARGS__, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)\\n\\n#define FOR_subset(t, s) \\\\\\n for (int t = (s); t >= 0; t = (t == 0 ? -1 : (t - 1) & (s)))\\n#define all(x) x.begin(), x.end()\\n#define rall(x) x.rbegin(), x.rend()\\n\\nint popcnt(int x) { return __builtin_popcount(x); }\\nint popcnt(u32 x) { return __builtin_popcount(x); }\\nint popcnt(ll x) { return __builtin_popcountll(x); }\\nint popcnt(u64 x) { return __builtin_popcountll(x); }\\nint popcnt_mod_2(int x) { return __builtin_parity(x); }\\nint popcnt_mod_2(u32 x) { return __builtin_parity(x); }\\nint popcnt_mod_2(ll x) { return __builtin_parityll(x); }\\nint popcnt_mod_2(u64 x) { return __builtin_parityll(x); }\\n// (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2)\\nint topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }\\nint topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }\\nint topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\\nint topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\\n// (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2)\\nint lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }\\nint lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); }\\nint lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\\nint lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\\n\\ntemplate <typename T>\\nT floor(T a, T b) {\\n return a / b - (a % b && (a ^ b) < 0);\\n}\\ntemplate <typename T>\\nT ceil(T x, T y) {\\n return floor(x + y - 1, y);\\n}\\ntemplate <typename T>\\nT bmod(T x, T y) {\\n return x - y * floor(x, y);\\n}\\ntemplate <typename T>\\npair<T, T> divmod(T x, T y) {\\n T q = floor(x, y);\\n return {q, x - q * y};\\n}\\n\\ntemplate <typename T, typename U>\\nT POW(U x_, int n) {\\n T x = x_;\\n T ret = 1;\\n while (n > 0) {\\n if (n & 1) ret *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return ret;\\n}\\n\\ntemplate <typename T, typename U>\\nT SUM(const vector<U> &A) {\\n T sm = 0;\\n for (auto &&a : A) sm += a;\\n return sm;\\n}\\n\\n#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))\\n#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))\\n#define UNIQUE(x) \\\\\\n sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()\\n\\ntemplate <class T, class S>\\ninline bool chmax(T &a, const S &b) {\\n return (a < b ? a = b, 1 : 0);\\n}\\ntemplate <class T, class S>\\ninline bool chmin(T &a, const S &b) {\\n return (a > b ? a = b, 1 : 0);\\n}\\n\\n// ? は -1\\nvc<int> s_to_vi(const string &S, char first_char) {\\n vc<int> A(S.size());\\n FOR(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }\\n return A;\\n}\\n\\ntemplate <typename T, typename U>\\nvector<T> cumsum(vector<U> &A, int off = 1) {\\n int N = A.size();\\n vector<T> B(N + 1);\\n FOR(i, N) { B[i + 1] = B[i] + A[i]; }\\n if (off == 0) B.erase(B.begin());\\n return B;\\n}\\n\\ntemplate <typename T>\\nvector<int> argsort(const vector<T> &A) {\\n vector<int> ids(A.size());\\n iota(all(ids), 0);\\n sort(all(ids),\\n [&](int i, int j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });\\n return ids;\\n}\\n\\n// A[I[0]], A[I[1]], ...\\ntemplate <typename T>\\nvc<T> rearrange(const vc<T> &A, const vc<int> &I) {\\n vc<T> B(I.size());\\n FOR(i, I.size()) B[i] = A[I[i]];\\n return B;\\n}\\n\\ntemplate<class... T>\\nconstexpr auto min(T... a){\\n return min(initializer_list<common_type_t<T...>>{a...});\\n}\\ntemplate<class... T>\\nconstexpr auto max(T... a){\\n return max(initializer_list<common_type_t<T...>>{a...});\\n}\\n\\nvoid print(){\\n cout << '\\\\n';\\n}\\ntemplate<class T>\\nvoid print(const T& a){\\n cout << a << '\\\\n';\\n}\\ntemplate<class T, class... Ts>\\nvoid print(const T& a, const Ts&... b){\\n cout << a;\\n (cout << ... << (cout << ' ', b));\\n cout << '\\\\n';\\n}\\ntemplate<class T>\\nvoid print(vector<T> &a){\\n for (int i = 0; i < (int)a.size(); ++i) {\\n cout << a[i] << \\\" \\\\n\\\"[i == (int)a.size() - 1];\\n }\\n}\\ntemplate<class T>\\nvoid print(vector<T> &&a){\\n for (int i = 0; i < (int)a.size(); ++i) {\\n cout << a[i] << \\\" \\\\n\\\"[i == (int)a.size() - 1];\\n }\\n}\\ntemplate<class T>\\nvoid print(vector<vector<T>> &a){\\n for (int i = 0; i < (int)a.size(); ++i) {\\n for (int j = 0; j < (int)a[i].size(); ++j) {\\n cout << a[i][j] << \\\" \\\\n\\\"[j == (int)a[i].size() - 1];\\n }\\n }\\n}\\ntemplate<class T>\\nvoid print(vector<vector<T>> &&a){\\n for (int i = 0; i < (int)a.size(); ++i) {\\n for (int j = 0; j < (int)a[i].size(); ++j) {\\n cout << a[i][j] << \\\" \\\\n\\\"[j == (int)a[i].size() - 1];\\n }\\n }\\n}\\nvoid YESNO(bool b) { cout << (b ? \\\"YES\\\" : \\\"NO\\\") << endl; }\\nvoid YesNo(bool b) { cout << (b ? \\\"Yes\\\" : \\\"No\\\") << endl; }\\n\\n#ifdef LOCAL\\n// https://zenn.dev/sassan/articles/19db660e4da0a4\\n#include \\\"/Library/cpp-dump/dump.hpp\\\"\\n#define dump(...) cpp_dump(__VA_ARGS__)\\n// CPP_DUMP_DEFINE_EXPORT_OBJECT(mint, val());\\n#else\\n#define dump(...)\\n#define CPP_DUMP_SET_OPTION(...)\\n#define CPP_DUMP_DEFINE_EXPORT_OBJECT(...)\\n#define CPP_DUMP_DEFINE_EXPORT_ENUM(...)\\n#define CPP_DUMP_DEFINE_DANGEROUS_EXPORT_OBJECT(...)\\n#endif\\n\\n\\n//----------------------------------------------------------------\\n\\nstring stroftree() {\\n ll h, w;\\n cin >> h >> w;\\n if (h == 0 && w == 0) exit(0);\\n h += 2;\\n w += 2;\\n vc<string> p(h);\\n p[0] = string(w, '.');\\n FOR(i, 1, h - 1) {\\n string s;\\n cin >> s;\\n p[i] = '.' + s + '.';\\n }\\n p[h-1] = string(w, '.');\\n atcoder::dsu uf(h * w);\\n FOR(i, h) FOR(j, w - 1) {\\n ll idx = i * w + j;\\n if (p[i][j] == p[i][j+1]) {\\n uf.merge(idx, idx + 1);\\n }\\n }\\n FOR(i, h - 1) FOR(j, w) {\\n ll idx = i * w + j;\\n if (p[i][j] == p[i+1][j]) {\\n uf.merge(idx, idx + w);\\n }\\n }\\n FOR(i, h - 1) FOR(j, 1, w) {\\n ll a = i * w + j;\\n ll b = (i + 1) * w + j - 1;\\n if (p[i][j] == '#' && p[i+1][j-1] == '#') {\\n uf.merge(a, b);\\n }\\n }\\n FOR(i, h - 1) FOR(j, w - 1) {\\n ll a = i * w + j;\\n ll b = (i + 1) * w + j + 1;\\n if (p[i][j] == '#' && p[i+1][j+1] == '#') {\\n uf.merge(a, b);\\n }\\n }\\n vv(ll, lbl, h, w);\\n auto groups = uf.groups();\\n FOR(gpi, groups.size()) {\\n FOR(pti, groups[gpi].size()) {\\n ll idx = groups[gpi][pti];\\n ll i = idx / w;\\n ll j = idx % w;\\n lbl[i][j] = gpi;\\n }\\n }\\n // dump(lbl);\\n ll n = groups.size();\\n ll di[] = {0, 0, 1, -1};\\n ll dj[] = {1, -1, 0, 0};\\n vc<set<ll>> vs(n);\\n FOR(i, h) FOR(j, w) {\\n FOR(k, 4) {\\n ll ni = i + di[k];\\n ll nj = j + dj[k];\\n if (ni < 0 || ni >= h || nj < 0 || nj >= w) {\\n continue;\\n }\\n if (lbl[i][j] == lbl[ni][nj]) continue;\\n vs[lbl[i][j]].emplace(lbl[ni][nj]);\\n }\\n }\\n ll slbl = lbl[0][0];\\n vc<bool> used(n);\\n vvl G(n);\\n queue<ll> que;\\n que.emplace(slbl);\\n while (!que.empty()) {\\n ll frm = que.front();\\n que.pop();\\n used[frm] = true;\\n for (auto x : vs[frm]) {\\n if (used[x]) continue;\\n G[frm].emplace_back(x);\\n que.emplace(x);\\n }\\n }\\n auto dfs = [&](auto&& self, ll v) -> string {\\n vc<string> ss(G[v].size());\\n FOR(i, G[v].size()) {\\n ss[i] = '(' + self(self, G[v][i]) + ')';\\n }\\n sort(all(ss));\\n string ret = \\\"\\\";\\n FOR(i, ss.size()) {\\n ret += ss[i];\\n }\\n return ret;\\n };\\n return dfs(dfs, slbl);\\n}\\n\\nvoid solve() {\\n string s = stroftree();\\n string t = stroftree();\\n dump(s, t);\\n if (s == t) {\\n print(\\\"yes\\\");\\n } else {\\n print(\\\"no\\\");\\n }\\n}\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(20);\\n CPP_DUMP_SET_OPTION(max_line_width, 80);\\n CPP_DUMP_SET_OPTION(log_label_func, cpp_dump::log_label::filename());\\n CPP_DUMP_SET_OPTION(enable_asterisk, true);\\n while (true) {\\n solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 4196,\n \"score_of_the_acc\": -0.3279,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1613_10606879\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#include <unordered_map>\\n#include <stdlib.h>\\nusing namespace std;\\n#define rep(i, a, n) for(ll i = a; i < n; i++)\\n#define rrep(i, a, n) for(ll i = a; i >= n; i--)\\n#define ll long long\\n#define pii pair<int, int>\\n#define pll pair<ll, ll>\\n#define all(x) (x).begin(), (x).end()\\n//constexpr ll MOD = 1000000007;\\nconstexpr ll MOD = 998244353;\\nconstexpr int IINF = 1001001001;\\nconstexpr ll INF = 1LL<<60;\\ntemplate<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}\\ntemplate<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}\\n\\nll gcd(ll a, ll b){\\n if(a%b == 0){\\n return b;\\n }else{\\n return gcd(b, a%b);\\n }\\n}\\n\\nll lcm(ll a, ll b){\\n return a*b / gcd(a, b);\\n}\\n\\nll powMod(ll x, ll n) {\\n if (n == 0) return 1 % MOD;\\n ll val = powMod(x, n / 2);\\n val *= val;\\n val %= MOD;\\n if (n % 2 == 1) val *= x;\\n return val % MOD;\\n}\\n\\nclass UnionFind {\\n vector<ll> parent, maxi, mini;\\n inline ll root(ll n){\\n return (parent[n] < 0? n:parent[n] = root(parent[n]));\\n }\\npublic:\\n UnionFind(ll n_ = 1): parent(n_, -1), maxi(n_), mini(n_){\\n iota(maxi.begin(), maxi.end(), 0);\\n iota(mini.begin(), mini.end(), 0);\\n }\\n\\n inline bool same(ll x, ll y){\\n return root(x) == root(y);\\n }\\n\\n inline void unite(ll x, ll y){\\n ll rx = root(x);\\n ll ry = root(y);\\n if(rx == ry) return;\\n if(parent[rx] > parent[ry]) swap(rx, ry);\\n parent[rx] += parent[ry];\\n parent[ry] = rx;\\n maxi[rx] = std::max(maxi[rx],maxi[ry]);\\n mini[rx] = std::min(mini[rx],mini[ry]);\\n }\\n\\n inline ll min(ll x){\\n return mini[root(x)];\\n }\\n\\n inline ll max(ll x){\\n return maxi[root(x)];\\n }\\n\\n inline ll size(ll x){\\n return (-parent[root(x)]);\\n }\\n\\n inline ll operator[](ll x){\\n return root(x);\\n }\\n\\n map<ll,vector<ll>> groups(){\\n map<ll,vector<ll>> mp;\\n rep(i,0,parent.size())mp[root(i)].push_back(i);\\n return mp;\\n }\\n};\\n\\nstring solve(vector<string> p){\\n ll h = p.size();\\n ll w = p[0].size();\\n UnionFind uf(h*w);\\n rep(i,0,h)rep(j,0,w){\\n if(i < h-1 && p[i][j] == p[i+1][j]) uf.unite(i*w+j, (i+1)*w+j);\\n if(j < w-1 && p[i][j] == p[i][j+1]) uf.unite(i*w+j, i*w+j+1);\\n if(i < h-1 && j < w-1 && p[i][j] == p[i+1][j+1] && p[i][j] == '#') uf.unite(i*w+j, (i+1)*w+j+1);\\n if(i > 0 && j < w-1 && p[i][j] == p[i-1][j+1] && p[i][j] == '#') uf.unite(i*w+j, (i-1)*w+j+1);\\n }\\n auto tmp = uf.groups();\\n map<ll,set<ll>> g;\\n rep(i,0,h)rep(j,0,w){\\n if(i < h-1 && p[i][j] != p[i+1][j]){\\n g[uf[i*w+j]].insert(uf[(i+1)*w+j]);\\n g[uf[(i+1)*w+j]].insert(uf[i*w+j]);\\n }\\n if(j < w-1 && p[i][j] != p[i][j+1]){\\n g[uf[i*w+j]].insert(uf[i*w+j+1]);\\n g[uf[i*w+j+1]].insert(uf[i*w+j]);\\n }\\n }\\n vector<ll> check(h*w,0);\\n auto dfs = [&](auto dfs, ll v, ll par) -> string {\\n // cout << v << \\\" \\\" << par << endl;\\n check[v] = 1;\\n string res = \\\"(\\\";\\n vector<string> vec;\\n for(auto nv: g[v]){\\n if(check[nv]) continue;\\n string x = dfs(dfs, nv, v);\\n vec.push_back(x);\\n }\\n sort(all(vec));\\n for(auto x: vec) res += x;\\n res.push_back(')');\\n return res;\\n };\\n return dfs(dfs, uf[0], -1); \\n}\\n\\nstring solve_(vector<string> p){\\n ll h = p.size(), w = p[0].size();\\n vector<string> np(h+2, string(w+2, '.'));\\n rep(i,0,h)rep(j,0,w) np[i+1][j+1] = p[i][j];\\n return solve(np);\\n}\\n\\nint main() {\\n while(true){\\n ll h1, w1; cin >> h1 >> w1;\\n if(h1*w1 == 0) break;\\n vector<string> p1(h1);\\n rep(i,0,h1) cin >> p1[i];\\n string s1 = solve_(p1);\\n ll h2, w2; cin >> h2 >> w2;\\n vector<string> p2(h2);\\n rep(i,0,h2) cin >> p2[i];\\n string s2 = solve_(p2);\\n if(s1 == s2) cout << \\\"yes\\\" << endl;\\n else cout << \\\"no\\\" << endl;\\n // cout << s1 << endl << s2 << endl << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 4296,\n \"score_of_the_acc\": -0.4369,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1613_10578410\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nnamespace noya2 {\\n\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, const pair<T, U> &p){\\n os << p.first << \\\" \\\" << p.second;\\n return os;\\n}\\ntemplate <typename T, typename U>\\nistream &operator>>(istream &is, pair<T, U> &p){\\n is >> p.first >> p.second;\\n return is;\\n}\\n\\ntemplate <typename T>\\nostream &operator<<(ostream &os, const vector<T> &v){\\n int s = (int)v.size();\\n for (int i = 0; i < s; i++) os << (i ? \\\" \\\" : \\\"\\\") << v[i];\\n return os;\\n}\\ntemplate <typename T>\\nistream &operator>>(istream &is, vector<T> &v){\\n for (auto &x : v) is >> x;\\n return is;\\n}\\n\\nvoid in() {}\\ntemplate <typename T, class... U>\\nvoid in(T &t, U &...u){\\n cin >> t;\\n in(u...);\\n}\\n\\nvoid out() { cout << \\\"\\\\n\\\"; }\\ntemplate <typename T, class... U, char sep = ' '>\\nvoid out(const T &t, const U &...u){\\n cout << t;\\n if (sizeof...(u)) cout << sep;\\n out(u...);\\n}\\n\\ntemplate<typename T>\\nvoid out(const vector<vector<T>> &vv){\\n int s = (int)vv.size();\\n for (int i = 0; i < s; i++) out(vv[i]);\\n}\\n\\nstruct IoSetup {\\n IoSetup(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(15);\\n cerr << fixed << setprecision(7);\\n }\\n} iosetup_noya2;\\n\\nconst int iinf = 1'000'000'007;\\nconst long long linf = 2'000'000'000'000'000'000LL;\\nconst long long mod998 = 998244353;\\nconst long long mod107 = 1000000007;\\nconst long double pi = 3.14159265358979323;\\nconst vector<int> dx = {0,1,0,-1,1,1,-1,-1};\\nconst vector<int> dy = {1,0,-1,0,1,-1,-1,1};\\nconst string ALP = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\nconst string alp = \\\"abcdefghijklmnopqrstuvwxyz\\\";\\nconst string NUM = \\\"0123456789\\\";\\n\\nvoid yes(){ cout << \\\"Yes\\\\n\\\"; }\\nvoid no(){ cout << \\\"No\\\\n\\\"; }\\nvoid YES(){ cout << \\\"YES\\\\n\\\"; }\\nvoid NO(){ cout << \\\"NO\\\\n\\\"; }\\nvoid yn(bool t){ t ? yes() : no(); }\\nvoid YN(bool t){ t ? YES() : NO(); }\\n\\n\\nunsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){\\n if (a == 0 || b == 0) return a + b;\\n int n = __builtin_ctzll(a); a >>= n;\\n int m = __builtin_ctzll(b); b >>= m;\\n while (a != b) {\\n int mm = __builtin_ctzll(a - b);\\n bool f = a > b;\\n unsigned long long c = f ? a : b;\\n b = f ? b : a;\\n a = (c - b) >> mm;\\n }\\n return a << min(n, m);\\n}\\n\\ntemplate<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),abs(b))); }\\n\\nlong long sqrt_fast(long long n) {\\n if (n <= 0) return 0;\\n long long x = sqrt(n);\\n while ((x + 1) * (x + 1) <= n) x++;\\n while (x * x > n) x--;\\n return x;\\n}\\n\\ntemplate<typename T> T floor_div(const T n, const T d) {\\n assert(d != 0);\\n return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);\\n}\\n\\ntemplate<typename T> T ceil_div(const T n, const T d) {\\n assert(d != 0);\\n return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);\\n}\\n\\ntemplate<typename T> void uniq(vector<T> &v){\\n sort(v.begin(),v.end());\\n v.erase(unique(v.begin(),v.end()),v.end());\\n}\\n\\ntemplate <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }\\n\\ntemplate <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }\\n\\ntemplate<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }\\n\\n} // namespace noya2\\n\\n#define rep(i,n) for (int i = 0; i < (int)(n); i++)\\n#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)\\n#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)\\n#define all(v) (v).begin(),(v).end()\\n\\nusing ll = long long;\\nusing ld = long double;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nusing pii = pair<int,int>;\\nusing pll = pair<ll,ll>;\\nusing pil = pair<int,ll>;\\nusing pli = pair<ll,int>;\\n\\nnamespace noya2{\\n\\n/* ~ (. _________ . /) */\\n\\n}\\n\\nusing namespace noya2;\\n\\n\\n#include <cassert>\\n#include <concepts>\\n\\ntemplate <int m>\\nstruct static_modint {\\n using mint = static_modint;\\n public:\\n static constexpr int mod() { return m; }\\n static mint raw(int v) {\\n mint x;\\n x._v = v;\\n return x;\\n }\\n constexpr static_modint() : _v(0) {}\\n template<std::signed_integral T>\\n constexpr static_modint(T v){\\n long long x = (long long)(v % (long long)(umod()));\\n if (x < 0) x += umod();\\n _v = (unsigned int)(x);\\n }\\n template<std::unsigned_integral T>\\n constexpr static_modint(T v){\\n _v = (unsigned int)(v % umod());\\n }\\n constexpr unsigned int val() const { return _v; }\\n mint& operator++() {\\n _v++;\\n if (_v == umod()) _v = 0;\\n return *this;\\n }\\n mint& operator--() {\\n if (_v == 0) _v = umod();\\n _v--;\\n return *this;\\n }\\n mint operator++(int) {\\n mint result = *this;\\n ++*this;\\n return result;\\n }\\n mint operator--(int) {\\n mint result = *this;\\n --*this;\\n return result;\\n }\\n constexpr mint& operator+=(const mint& rhs) {\\n _v += rhs._v;\\n if (_v >= umod()) _v -= umod();\\n return *this;\\n }\\n constexpr mint& operator-=(const mint& rhs) {\\n _v -= rhs._v;\\n if (_v >= umod()) _v += umod();\\n return *this;\\n }\\n constexpr mint& operator*=(const mint& rhs) {\\n unsigned long long z = _v;\\n z *= rhs._v;\\n _v = (unsigned int)(z % umod());\\n return *this;\\n }\\n constexpr mint& operator/=(const mint& rhs) { return *this = *this * rhs.inv(); }\\n constexpr mint operator+() const { return *this; }\\n constexpr mint operator-() const { return mint() - *this; }\\n constexpr mint pow(long long n) const {\\n assert(0 <= n);\\n mint x = *this, r = 1;\\n while (n) {\\n if (n & 1) r *= x;\\n x *= x;\\n n >>= 1;\\n }\\n return r;\\n }\\n constexpr mint inv() const {\\n assert(_v);\\n return pow(umod() - 2);\\n }\\n friend constexpr mint operator+(const mint& lhs, const mint& rhs) {\\n return mint(lhs) += rhs;\\n }\\n friend constexpr mint operator-(const mint& lhs, const mint& rhs) {\\n return mint(lhs) -= rhs;\\n }\\n friend constexpr mint operator*(const mint& lhs, const mint& rhs) {\\n return mint(lhs) *= rhs;\\n }\\n friend constexpr mint operator/(const mint& lhs, const mint& rhs) {\\n return mint(lhs) /= rhs;\\n }\\n friend constexpr bool operator==(const mint& lhs, const mint& rhs) {\\n return lhs._v == rhs._v;\\n }\\n friend constexpr bool operator!=(const mint& lhs, const mint& rhs) {\\n return lhs._v != rhs._v;\\n }\\n friend std::ostream &operator<<(std::ostream &os, const mint& p) {\\n return os << p.val();\\n }\\n friend std::istream &operator>>(std::istream &is, mint &a) {\\n long long t; is >> t;\\n a = mint(t);\\n return (is);\\n }\\n\\n private:\\n unsigned int _v;\\n static constexpr unsigned int umod() { return m; }\\n};\\n\\nusing mint = static_modint<998244353>;\\n\\nvector<mint> wdep;\\n\\nvoid init(){\\n wdep.resize(1001001);\\n mt19937_64 mt(-1);\\n rep(i,wdep.size()){\\n wdep[i] = mt();\\n }\\n}\\n\\null calc_hash(int h, int w){\\n vector<string> a(h+4,string(w+4,'?'));\\n rep(i,h){\\n string s; in(s);\\n rep(j,w){\\n a[i+2][j+2] = s[j];\\n }\\n }\\n vector done(h+4,vector<bool>(w+4,false));\\n auto findcc = [&](int sx, int sy){\\n int kk = (a[sx][sy] == '.' ? 4 : 8);\\n vector<pii> ret;\\n queue<pii> que;\\n que.emplace(sx,sy);\\n done[sx][sy] = true;\\n while (!que.empty()){\\n auto [x, y] = que.front(); que.pop();\\n ret.emplace_back(x,y);\\n rep(k,kk){\\n int nx = x + dx[k];\\n int ny = y + dy[k];\\n if (!done[nx][ny] && a[sx][sy] == a[nx][ny]){\\n done[nx][ny] = true;\\n que.emplace(nx,ny);\\n }\\n }\\n }\\n return ret;\\n };\\n auto dfs = [&](auto sfs, vector<pii> cc) -> pair<mint,int> {\\n // out(cc);\\n int hei = 0;\\n mint prd = 1;\\n for (auto [ix, iy] : cc){\\n rep(k,4){\\n int nx = ix + dx[k];\\n int ny = iy + dy[k];\\n if (!(range(0,nx,h+4) && range(0,ny,w+4))) continue;\\n if (done[nx][ny]) continue;\\n auto ncc = findcc(nx,ny);\\n auto [dp, he] = sfs(sfs,ncc);\\n chmax(hei,he+1);\\n prd *= dp;\\n }\\n }\\n return {prd+wdep[hei],hei};\\n };\\n vector<pii> cc;\\n rep(i,h+4) rep(j,w+4){\\n if (i == 0 || i == h+3 || j == 0 || j == w+3){\\n a[i][j] = '#';\\n done[i][j] = true;\\n cc.emplace_back(i,j);\\n }\\n else if (i == 1 || i == h+2 || j == 1 || j == w+2){\\n a[i][j] = '.';\\n }\\n }\\n // rep(i,h+4) out(a[i]);\\n return dfs(dfs,cc).first.val();\\n}\\n\\nvoid solve(int h1, int w1){\\n ull x1 = calc_hash(h1,w1);\\n int h2, w2; in(h2,w2);\\n ull x2 = calc_hash(h2,w2);\\n out(x1 == x2 ? \\\"yes\\\" : \\\"no\\\");\\n}\\n\\nint main(){\\n init();\\n while (true){\\n int h, w; in(h,w);\\n if (h == 0) break;\\n solve(h,w);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 7464,\n \"score_of_the_acc\": -1.0833,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1613_10275787\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\n\\nclass UnionFind\\n {\\n private:\\n vector<ll> p;\\n vector<ll> rank;\\n public:\\n UnionFind(ll n){\\n p.resize(n,-1);\\n rank.resize(n,1);\\n }\\n ll find(ll x){\\n if(p[x]<0)return x;\\n return p[x]=find(p[x]);\\n }\\n void unite(ll x,ll y){\\n x = find(x);\\n y = find(y);\\n if(x == y)return;\\n if(rank[x] > rank[y])swap(x,y);\\n if(rank[x] == rank[y])rank[y]++;\\n p[y] += p[x];\\n p[x] = y;\\n }\\n ll size(ll x){\\n return -p[find(x)];\\n }\\n bool same(ll x, ll y){\\n return find(x) == find(y);\\n }\\n };\\n \\nvector<int> dx = {1,0,-1,0,1,1,-1,-1};\\nvector<int> dy = {0,1,0,-1,1,-1,1,-1};\\n\\nconst ll mod = 998244353;\\nconst ll X = 19960515;\\n\\nint main(){\\n\\tauto f = [&](int H , int W , vector<vector<int>> G)->ll{\\n\\t\\tUnionFind uf(H*W);\\n\\t\\tfor(int i = 0; i < H; i++){\\n\\t\\t\\tfor(int j = 0; j < W; j++){\\n\\t\\t\\t\\tfor(int k = 0; k < (G[i][j] == 1 ? 8:4); k++){\\n\\t\\t\\t\\t\\tint ni = i + dx[k];\\n\\t\\t\\t\\t\\tint nj = j + dy[k];\\n\\t\\t\\t\\t\\tif(ni < 0 || ni >= H)continue;\\n\\t\\t\\t\\t\\tif(nj < 0 || nj >= W)continue;\\n\\t\\t\\t\\t\\tif(G[i][j] != G[ni][nj])continue;\\n\\t\\t\\t\\t\\tuf.unite(i*W+j , ni*W+nj);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tint N = 0;\\n\\t\\tvector<int> idx(H*W,-1);\\n\\t\\tfor(int i = 0; i < H*W; i++)if(uf.find(i) == i){\\n\\t\\t\\tidx[i] = N;\\n\\t\\t\\tN++;\\n\\t\\t}\\n\\t\\tvector<set<int>> graph(N);\\n\\t\\tfor(int i = 0; i < H; i++){\\n\\t\\t\\tfor(int j = 0; j < W; j++){\\n\\t\\t\\t\\tfor(int k = 0; k < 4; k++){\\n\\t\\t\\t\\t\\tint ni = i + dx[k];\\n\\t\\t\\t\\t\\tint nj = j + dy[k];\\n\\t\\t\\t\\t\\tif(ni < 0 || ni >= H)continue;\\n\\t\\t\\t\\t\\tif(nj < 0 || nj >= W)continue;\\n\\t\\t\\t\\t\\tint x = uf.find(i*W+j);\\n\\t\\t\\t\\t\\tx = idx[x];\\n\\t\\t\\t\\t\\tint y = uf.find(ni*W+nj);\\n\\t\\t\\t\\t\\ty = idx[y];\\n\\t\\t\\t\\t\\tif(x == y)continue;\\n\\t\\t\\t\\t\\tgraph[x].insert(y);\\n\\t\\t\\t\\t\\tgraph[y].insert(x);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tint root = idx[uf.find(0)];\\n\\t\\tauto dfs = [&](auto dfs , int v , int p = -1)->ll{\\n\\t\\t\\tll ret = 1;\\n\\t\\t\\tfor(auto c:graph[v]){\\n\\t\\t\\t\\tif(c == p)continue;\\n\\t\\t\\t\\tret *= (X + dfs(dfs , c , v));\\n\\t\\t\\t\\tret %= mod;\\n\\t\\t\\t}\\n\\t\\t\\treturn ret;\\n\\t\\t};\\n\\t\\treturn dfs(dfs, root);\\n\\t};\\n\\twhile(1){\\n\\t\\tint H1,W1; cin >> H1 >> W1;\\n\\t\\tif(H1 == 0){\\n\\t\\t\\treturn 0;\\n\\t\\t}\\n\\t\\tvector<vector<int>> G1(H1+2 , vector<int>(W1+2));\\n\\t\\tfor(int i = 1; i <= H1; i++){\\n\\t\\t\\tfor(int j = 1; j <= W1; j++){\\n\\t\\t\\t\\tchar c; cin >> c;\\n\\t\\t\\t\\tif(c == '#')G1[i][j] = 1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tint H2,W2; cin >> H2 >> W2;\\n\\t\\tvector<vector<int>> G2(H2+2 , vector<int>(W2+2));\\n\\t\\tfor(int i = 1; i <= H2; i++){\\n\\t\\t\\tfor(int j = 1; j <= W2; j++){\\n\\t\\t\\t\\tchar c; cin >> c;\\n\\t\\t\\t\\tif(c == '#')G2[i][j] = 1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tH1 += 2;\\n\\t\\tW1 += 2;\\n\\t\\tH2 += 2;\\n\\t\\tW2 += 2;\\n\\t\\tif(f(H1,W1,G1) == f(H2,W2,G2))cout << \\\"yes\\\" << endl;\\n\\t\\telse cout << \\\"no\\\" << endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 4096,\n \"score_of_the_acc\": -0.4689,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1613_9582796\",\n \"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)), (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#include <unistd.h>\\n\\nnamespace fastio {\\nstatic constexpr uint32_t SZ = 1 << 17;\\nchar ibuf[SZ];\\nchar obuf[SZ];\\nchar out[100];\\n// pointer of ibuf, obuf\\n\\n\\nuint32_t pil = 0, pir = 0, por = 0;\\n\\nstruct Pre {\\n char num[10000][4];\\n constexpr Pre() : num() {\\n for (int i = 0; i < 10000; i++) {\\n int n = i;\\n for (int j = 3; j >= 0; j--) {\\n num[i][j] = n % 10 | '0';\\n n /= 10;\\n }\\n }\\n }\\n} constexpr pre;\\n\\ninline void load() {\\n memmove(ibuf, ibuf + pil, pir - pil);\\n pir = pir - pil + fread(ibuf + pir - pil, 1, SZ - pir + pil, stdin);\\n pil = 0;\\n if (pir < SZ)\\n ibuf[pir++] = '\\\\n';\\n}\\n\\ninline void flush() {\\n fwrite(obuf, 1, por, stdout);\\n por = 0;\\n}\\n\\nvoid rd(char &c) {\\n do {\\n if (pil + 1 > pir)\\n load();\\n c = ibuf[pil++];\\n } while (isspace(c));\\n}\\n\\nvoid rd(string &x) {\\n x.clear();\\n char c;\\n do {\\n if (pil + 1 > pir)\\n load();\\n c = ibuf[pil++];\\n } while (isspace(c));\\n do {\\n x += c;\\n if (pil == pir)\\n load();\\n c = ibuf[pil++];\\n } while (!isspace(c));\\n}\\n\\ntemplate <typename T> void rd_real(T &x) {\\n string s;\\n rd(s);\\n x = stod(s);\\n}\\n\\ntemplate <typename T> void rd_integer(T &x) {\\n if (pil + 100 > pir)\\n load();\\n char c;\\n do\\n c = ibuf[pil++];\\n while (c < '-');\\n bool minus = 0;\\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\\n if (c == '-') {\\n minus = 1, c = ibuf[pil++];\\n }\\n }\\n x = 0;\\n while ('0' <= c) {\\n x = x * 10 + (c & 15), c = ibuf[pil++];\\n }\\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\\n if (minus)\\n x = -x;\\n }\\n}\\n\\nvoid rd(int &x) {\\n rd_integer(x);\\n}\\nvoid rd(ll &x) {\\n rd_integer(x);\\n}\\nvoid rd(i128 &x) {\\n rd_integer(x);\\n}\\nvoid rd(uint &x) {\\n rd_integer(x);\\n}\\nvoid rd(ull &x) {\\n rd_integer(x);\\n}\\nvoid rd(u128 &x) {\\n rd_integer(x);\\n}\\nvoid rd(double &x) {\\n rd_real(x);\\n}\\nvoid rd(long double &x) {\\n rd_real(x);\\n}\\n\\ntemplate <class T, class U> void rd(pair<T, U> &p) {\\n return rd(p.first), rd(p.second);\\n}\\ntemplate <size_t N = 0, typename T> void rd_tuple(T &t) {\\n if constexpr (N < std::tuple_size<T>::value) {\\n auto &x = std::get<N>(t);\\n rd(x);\\n rd_tuple<N + 1>(t);\\n }\\n}\\ntemplate <class... T> void rd(tuple<T...> &tpl) {\\n rd_tuple(tpl);\\n}\\n\\ntemplate <size_t N = 0, typename T> void rd(array<T, N> &x) {\\n for (auto &d : x)\\n rd(d);\\n}\\ntemplate <class T> void rd(vector<T> &x) {\\n for (auto &d : x)\\n rd(d);\\n}\\n\\nvoid read() {}\\ntemplate <class H, class... T> void read(H &h, T &...t) {\\n rd(h), read(t...);\\n}\\n\\nvoid wt(const char c) {\\n if (por == SZ)\\n flush();\\n obuf[por++] = c;\\n}\\nvoid wt(const string s) {\\n for (char c : s)\\n wt(c);\\n}\\nvoid wt(const char *s) {\\n size_t len = strlen(s);\\n for (size_t i = 0; i < len; i++)\\n wt(s[i]);\\n}\\n\\ntemplate <typename T> void wt_integer(T x) {\\n if (por > SZ - 100)\\n flush();\\n if (x < 0) {\\n obuf[por++] = '-', x = -x;\\n }\\n int outi;\\n for (outi = 96; x >= 10000; outi -= 4) {\\n memcpy(out + outi, pre.num[x % 10000], 4);\\n x /= 10000;\\n }\\n if (x >= 1000) {\\n memcpy(obuf + por, pre.num[x], 4);\\n por += 4;\\n } else if (x >= 100) {\\n memcpy(obuf + por, pre.num[x] + 1, 3);\\n por += 3;\\n } else if (x >= 10) {\\n int q = (x * 103) >> 10;\\n obuf[por] = q | '0';\\n obuf[por + 1] = (x - q * 10) | '0';\\n por += 2;\\n } else\\n obuf[por++] = x | '0';\\n memcpy(obuf + por, out + outi + 4, 96 - outi);\\n por += 96 - outi;\\n}\\n\\ntemplate <typename T> void wt_real(T x) {\\n ostringstream oss;\\n oss << fixed << setprecision(15) << double(x);\\n string s = oss.str();\\n wt(s);\\n}\\n\\nvoid wt(int x) {\\n wt_integer(x);\\n}\\nvoid wt(ll x) {\\n wt_integer(x);\\n}\\nvoid wt(i128 x) {\\n wt_integer(x);\\n}\\nvoid wt(uint x) {\\n wt_integer(x);\\n}\\nvoid wt(ull x) {\\n wt_integer(x);\\n}\\nvoid wt(u128 x) {\\n wt_integer(x);\\n}\\nvoid wt(double x) {\\n wt_real(x);\\n}\\nvoid wt(long double x) {\\n wt_real(x);\\n}\\n\\ntemplate <class T, class U> void wt(const pair<T, U> val) {\\n wt(val.first);\\n wt(' ');\\n wt(val.second);\\n}\\ntemplate <size_t N = 0, typename T> void wt_tuple(const T t) {\\n if constexpr (N < std::tuple_size<T>::value) {\\n if constexpr (N > 0) {\\n wt(' ');\\n }\\n const auto x = std::get<N>(t);\\n wt(x);\\n wt_tuple<N + 1>(t);\\n }\\n}\\ntemplate <class... T> void wt(tuple<T...> tpl) {\\n wt_tuple(tpl);\\n}\\ntemplate <class T, size_t S> void wt(const array<T, S> val) {\\n auto n = val.size();\\n for (size_t i = 0; i < n; i++) {\\n if (i)\\n wt(' ');\\n wt(val[i]);\\n }\\n}\\ntemplate <class T> void wt(const vector<T> val) {\\n auto n = val.size();\\n for (size_t i = 0; i < n; i++) {\\n if (i)\\n wt(' ');\\n wt(val[i]);\\n }\\n}\\n\\nvoid print() {\\n wt('\\\\n');\\n}\\ntemplate <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {\\n wt(head);\\n if (sizeof...(Tail))\\n wt(' ');\\n print(forward<Tail>(tail)...);\\n}\\nvoid __attribute__((destructor)) _d() {\\n flush();\\n}\\n} // namespace fastio\\n\\n\\nusing fastio::flush;\\nusing fastio::print;\\nusing fastio::read;\\n\\ninline void first(bool i = true) {\\n print(i ? \\\"first\\\" : \\\"second\\\");\\n}\\ninline void Alice(bool i = true) {\\n print(i ? \\\"Alice\\\" : \\\"Bob\\\");\\n}\\ninline void Takahashi(bool i = true) {\\n print(i ? \\\"Takahashi\\\" : \\\"Aoki\\\");\\n}\\ninline void yes(bool i = true) {\\n print(i ? \\\"yes\\\" : \\\"no\\\");\\n}\\ninline void Yes(bool i = true) {\\n print(i ? \\\"Yes\\\" : \\\"No\\\");\\n}\\ninline void No() {\\n print(\\\"No\\\");\\n}\\ninline void YES(bool i = true) {\\n print(i ? \\\"YES\\\" : \\\"NO\\\");\\n}\\ninline void NO() {\\n print(\\\"NO\\\");\\n}\\ninline void Yay(bool i = true) {\\n print(i ? \\\"Yay!\\\" : \\\":(\\\");\\n}\\ninline void Possible(bool i = true) {\\n print(i ? \\\"Possible\\\" : \\\"Impossible\\\");\\n}\\ninline void POSSIBLE(bool i = true) {\\n print(i ? \\\"POSSIBLE\\\" : \\\"IMPOSSIBLE\\\");\\n}\\n\\n/**\\n * @brief Fast IO\\n */\\n\\nint dx1[4] = {1,0,-1,0}, dy1[4] = {0,1,0,-1};\\nint dx2[8] = {1,1,1,0,-1,-1,-1,0}, dy2[8] = {-1,0,1,1,1,0,-1,-1};\\n\\nmap<vector<int>,int> mp;\\n\\nvector<vector<int>> MakeGraph(int N, int M) {\\n N += 2, M += 2;\\n vector<vector<char>> C(N,vector<char>(M,'.'));\\n rep(i,1,N-1) rep(j,1,M-1) cin >> C[i][j];\\n int Cur = 0;\\n vector<vector<int>> B(N, vector<int>(M,-1));\\n rep(i,0,N) {\\n rep(j,0,M) {\\n if (B[i][j] == -1 && C[i][j] == '.') {\\n queue<pair<int,int>> Q;\\n Q.push({i,j});\\n B[i][j] = Cur;\\n while(!Q.empty()) {\\n auto [X,Y] = Q.front();\\n Q.pop();\\n rep(k,0,4) {\\n int NX = X + dx1[k], NY = Y + dy1[k];\\n if (0 <= NX && NX < N && 0 <= NY && NY < M) {\\n if (C[NX][NY] == '.' && B[NX][NY] == -1) {\\n B[NX][NY] = Cur;\\n Q.push({NX,NY});\\n }\\n }\\n }\\n }\\n Cur++;\\n }\\n }\\n }\\n rep(i,0,N) {\\n rep(j,0,M) {\\n if (B[i][j] == -1 && C[i][j] == '#') {\\n queue<pair<int,int>> Q;\\n Q.push({i,j});\\n B[i][j] = Cur;\\n while(!Q.empty()) {\\n auto [X,Y] = Q.front();\\n Q.pop();\\n rep(k,0,8) {\\n int NX = X + dx2[k], NY = Y + dy2[k];\\n if (0 <= NX && NX < N && 0 <= NY && NY < M) {\\n if (C[NX][NY] == '#' && B[NX][NY] == -1) {\\n B[NX][NY] = Cur;\\n Q.push({NX,NY});\\n }\\n }\\n }\\n }\\n Cur++;\\n }\\n }\\n }\\n vector<vector<pair<int,int>>> P(Cur);\\n rep(i,0,N) {\\n rep(j,0,M) {\\n P[B[i][j]].push_back({i,j});\\n }\\n }\\n vector<vector<int>> Ret(Cur);\\n vector<bool> used(N,false);\\n queue<int> Q2;\\n Q2.push(0);\\n used[0] = true;\\n while(!Q2.empty()) {\\n int Z = Q2.front();\\n Q2.pop();\\n for (auto [X,Y] : P[Z]) {\\n rep(i,0,4) {\\n int NX = X + dx1[i], NY = Y + dy1[i];\\n if (0 <= NX && NX < N && 0 <= NY && NY < M) {\\n if (!used[B[NX][NY]]) {\\n Ret[Z].push_back(B[NX][NY]);\\n used[B[NX][NY]] = true;\\n Q2.push(B[NX][NY]);\\n }\\n }\\n }\\n }\\n }\\n return Ret;\\n}\\n\\nint ID = 0;\\n\\nint DFS(vector<vector<int>>& V, int X) {\\n vector<int> A;\\n for (int NX : V[X]) {\\n A.push_back(DFS(V,NX));\\n }\\n sort(ALL(A));\\n if (mp.count(A)) return mp[A];\\n else {\\n mp[A] = ID;\\n return ID++;\\n }\\n}\\n\\nbool Compare(vector<vector<int>>& V1, vector<vector<int>>& V2) {\\n if (V1.size() != V2.size()) return false;\\n return DFS(V1,0) == DFS(V2,0);\\n}\\n\\nint main() {\\nwhile(1) {\\n int N, M;\\n cin >> N >> M;\\n if (N == 0 && M == 0) return 0;\\n vector<vector<int>> V1 = MakeGraph(N,M);\\n cin >> N >> M;\\n vector<vector<int>> V2 = MakeGraph(N,M);\\n cout << (Compare(V1,V2) ? \\\"yes\\\" : \\\"no\\\") << endl;\\n}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3792,\n \"score_of_the_acc\": -0.2242,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1613_9582794\",\n \"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)), (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#include <unistd.h>\\n\\nnamespace fastio {\\nstatic constexpr uint32_t SZ = 1 << 17;\\nchar ibuf[SZ];\\nchar obuf[SZ];\\nchar out[100];\\n// pointer of ibuf, obuf\\n\\n\\nuint32_t pil = 0, pir = 0, por = 0;\\n\\nstruct Pre {\\n char num[10000][4];\\n constexpr Pre() : num() {\\n for (int i = 0; i < 10000; i++) {\\n int n = i;\\n for (int j = 3; j >= 0; j--) {\\n num[i][j] = n % 10 | '0';\\n n /= 10;\\n }\\n }\\n }\\n} constexpr pre;\\n\\ninline void load() {\\n memmove(ibuf, ibuf + pil, pir - pil);\\n pir = pir - pil + fread(ibuf + pir - pil, 1, SZ - pir + pil, stdin);\\n pil = 0;\\n if (pir < SZ)\\n ibuf[pir++] = '\\\\n';\\n}\\n\\ninline void flush() {\\n fwrite(obuf, 1, por, stdout);\\n por = 0;\\n}\\n\\nvoid rd(char &c) {\\n do {\\n if (pil + 1 > pir)\\n load();\\n c = ibuf[pil++];\\n } while (isspace(c));\\n}\\n\\nvoid rd(string &x) {\\n x.clear();\\n char c;\\n do {\\n if (pil + 1 > pir)\\n load();\\n c = ibuf[pil++];\\n } while (isspace(c));\\n do {\\n x += c;\\n if (pil == pir)\\n load();\\n c = ibuf[pil++];\\n } while (!isspace(c));\\n}\\n\\ntemplate <typename T> void rd_real(T &x) {\\n string s;\\n rd(s);\\n x = stod(s);\\n}\\n\\ntemplate <typename T> void rd_integer(T &x) {\\n if (pil + 100 > pir)\\n load();\\n char c;\\n do\\n c = ibuf[pil++];\\n while (c < '-');\\n bool minus = 0;\\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\\n if (c == '-') {\\n minus = 1, c = ibuf[pil++];\\n }\\n }\\n x = 0;\\n while ('0' <= c) {\\n x = x * 10 + (c & 15), c = ibuf[pil++];\\n }\\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\\n if (minus)\\n x = -x;\\n }\\n}\\n\\nvoid rd(int &x) {\\n rd_integer(x);\\n}\\nvoid rd(ll &x) {\\n rd_integer(x);\\n}\\nvoid rd(i128 &x) {\\n rd_integer(x);\\n}\\nvoid rd(uint &x) {\\n rd_integer(x);\\n}\\nvoid rd(ull &x) {\\n rd_integer(x);\\n}\\nvoid rd(u128 &x) {\\n rd_integer(x);\\n}\\nvoid rd(double &x) {\\n rd_real(x);\\n}\\nvoid rd(long double &x) {\\n rd_real(x);\\n}\\n\\ntemplate <class T, class U> void rd(pair<T, U> &p) {\\n return rd(p.first), rd(p.second);\\n}\\ntemplate <size_t N = 0, typename T> void rd_tuple(T &t) {\\n if constexpr (N < std::tuple_size<T>::value) {\\n auto &x = std::get<N>(t);\\n rd(x);\\n rd_tuple<N + 1>(t);\\n }\\n}\\ntemplate <class... T> void rd(tuple<T...> &tpl) {\\n rd_tuple(tpl);\\n}\\n\\ntemplate <size_t N = 0, typename T> void rd(array<T, N> &x) {\\n for (auto &d : x)\\n rd(d);\\n}\\ntemplate <class T> void rd(vector<T> &x) {\\n for (auto &d : x)\\n rd(d);\\n}\\n\\nvoid read() {}\\ntemplate <class H, class... T> void read(H &h, T &...t) {\\n rd(h), read(t...);\\n}\\n\\nvoid wt(const char c) {\\n if (por == SZ)\\n flush();\\n obuf[por++] = c;\\n}\\nvoid wt(const string s) {\\n for (char c : s)\\n wt(c);\\n}\\nvoid wt(const char *s) {\\n size_t len = strlen(s);\\n for (size_t i = 0; i < len; i++)\\n wt(s[i]);\\n}\\n\\ntemplate <typename T> void wt_integer(T x) {\\n if (por > SZ - 100)\\n flush();\\n if (x < 0) {\\n obuf[por++] = '-', x = -x;\\n }\\n int outi;\\n for (outi = 96; x >= 10000; outi -= 4) {\\n memcpy(out + outi, pre.num[x % 10000], 4);\\n x /= 10000;\\n }\\n if (x >= 1000) {\\n memcpy(obuf + por, pre.num[x], 4);\\n por += 4;\\n } else if (x >= 100) {\\n memcpy(obuf + por, pre.num[x] + 1, 3);\\n por += 3;\\n } else if (x >= 10) {\\n int q = (x * 103) >> 10;\\n obuf[por] = q | '0';\\n obuf[por + 1] = (x - q * 10) | '0';\\n por += 2;\\n } else\\n obuf[por++] = x | '0';\\n memcpy(obuf + por, out + outi + 4, 96 - outi);\\n por += 96 - outi;\\n}\\n\\ntemplate <typename T> void wt_real(T x) {\\n ostringstream oss;\\n oss << fixed << setprecision(15) << double(x);\\n string s = oss.str();\\n wt(s);\\n}\\n\\nvoid wt(int x) {\\n wt_integer(x);\\n}\\nvoid wt(ll x) {\\n wt_integer(x);\\n}\\nvoid wt(i128 x) {\\n wt_integer(x);\\n}\\nvoid wt(uint x) {\\n wt_integer(x);\\n}\\nvoid wt(ull x) {\\n wt_integer(x);\\n}\\nvoid wt(u128 x) {\\n wt_integer(x);\\n}\\nvoid wt(double x) {\\n wt_real(x);\\n}\\nvoid wt(long double x) {\\n wt_real(x);\\n}\\n\\ntemplate <class T, class U> void wt(const pair<T, U> val) {\\n wt(val.first);\\n wt(' ');\\n wt(val.second);\\n}\\ntemplate <size_t N = 0, typename T> void wt_tuple(const T t) {\\n if constexpr (N < std::tuple_size<T>::value) {\\n if constexpr (N > 0) {\\n wt(' ');\\n }\\n const auto x = std::get<N>(t);\\n wt(x);\\n wt_tuple<N + 1>(t);\\n }\\n}\\ntemplate <class... T> void wt(tuple<T...> tpl) {\\n wt_tuple(tpl);\\n}\\ntemplate <class T, size_t S> void wt(const array<T, S> val) {\\n auto n = val.size();\\n for (size_t i = 0; i < n; i++) {\\n if (i)\\n wt(' ');\\n wt(val[i]);\\n }\\n}\\ntemplate <class T> void wt(const vector<T> val) {\\n auto n = val.size();\\n for (size_t i = 0; i < n; i++) {\\n if (i)\\n wt(' ');\\n wt(val[i]);\\n }\\n}\\n\\nvoid print() {\\n wt('\\\\n');\\n}\\ntemplate <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {\\n wt(head);\\n if (sizeof...(Tail))\\n wt(' ');\\n print(forward<Tail>(tail)...);\\n}\\nvoid __attribute__((destructor)) _d() {\\n flush();\\n}\\n} // namespace fastio\\n\\n\\nusing fastio::flush;\\nusing fastio::print;\\nusing fastio::read;\\n\\ninline void first(bool i = true) {\\n print(i ? \\\"first\\\" : \\\"second\\\");\\n}\\ninline void Alice(bool i = true) {\\n print(i ? \\\"Alice\\\" : \\\"Bob\\\");\\n}\\ninline void Takahashi(bool i = true) {\\n print(i ? \\\"Takahashi\\\" : \\\"Aoki\\\");\\n}\\ninline void yes(bool i = true) {\\n print(i ? \\\"yes\\\" : \\\"no\\\");\\n}\\ninline void Yes(bool i = true) {\\n print(i ? \\\"Yes\\\" : \\\"No\\\");\\n}\\ninline void No() {\\n print(\\\"No\\\");\\n}\\ninline void YES(bool i = true) {\\n print(i ? \\\"YES\\\" : \\\"NO\\\");\\n}\\ninline void NO() {\\n print(\\\"NO\\\");\\n}\\ninline void Yay(bool i = true) {\\n print(i ? \\\"Yay!\\\" : \\\":(\\\");\\n}\\ninline void Possible(bool i = true) {\\n print(i ? \\\"Possible\\\" : \\\"Impossible\\\");\\n}\\ninline void POSSIBLE(bool i = true) {\\n print(i ? \\\"POSSIBLE\\\" : \\\"IMPOSSIBLE\\\");\\n}\\n\\n/**\\n * @brief Fast IO\\n */\\n\\nint dx1[4] = {1,0,-1,0}, dy1[4] = {0,1,0,-1};\\nint dx2[8] = {1,1,1,0,-1,-1,-1,0}, dy2[8] = {-1,0,1,1,1,0,-1,-1};\\n\\nmap<vector<int>,int> mp;\\n\\nvector<vector<int>> MakeGraph(int N, int M) {\\n N += 2, M += 2;\\n vector<vector<char>> C(N,vector<char>(M,'.'));\\n rep(i,1,N-1) rep(j,1,M-1) cin >> C[i][j];\\n int Cur = 0;\\n vector<vector<int>> B(N, vector<int>(M,-1));\\n rep(i,0,N) {\\n rep(j,0,M) {\\n if (B[i][j] == -1 && C[i][j] == '.') {\\n queue<pair<int,int>> Q;\\n Q.push({i,j});\\n B[i][j] = Cur;\\n while(!Q.empty()) {\\n auto [X,Y] = Q.front();\\n Q.pop();\\n rep(k,0,4) {\\n int NX = X + dx1[k], NY = Y + dy1[k];\\n if (0 <= NX && NX < N && 0 <= NY && NY < M) {\\n if (C[NX][NY] == '.' && B[NX][NY] == -1) {\\n B[NX][NY] = Cur;\\n Q.push({NX,NY});\\n }\\n }\\n }\\n }\\n Cur++;\\n }\\n }\\n }\\n rep(i,0,N) {\\n rep(j,0,M) {\\n if (B[i][j] == -1 && C[i][j] == '#') {\\n queue<pair<int,int>> Q;\\n Q.push({i,j});\\n B[i][j] = Cur;\\n while(!Q.empty()) {\\n auto [X,Y] = Q.front();\\n Q.pop();\\n rep(k,0,8) {\\n int NX = X + dx2[k], NY = Y + dy2[k];\\n if (0 <= NX && NX < N && 0 <= NY && NY < M) {\\n if (C[NX][NY] == '#' && B[NX][NY] == -1) {\\n B[NX][NY] = Cur;\\n Q.push({NX,NY});\\n }\\n }\\n }\\n }\\n Cur++;\\n }\\n }\\n }\\n vector<vector<pair<int,int>>> P(Cur);\\n rep(i,0,N) {\\n rep(j,0,M) {\\n P[B[i][j]].push_back({i,j});\\n }\\n }\\n vector<vector<int>> Ret(Cur);\\n vector<bool> used(N,false);\\n queue<int> Q2;\\n Q2.push(0);\\n used[0] = true;\\n while(!Q2.empty()) {\\n int Z = Q2.front();\\n Q2.pop();\\n for (auto [X,Y] : P[Z]) {\\n rep(i,0,4) {\\n int NX = X + dx1[i], NY = Y + dy1[i];\\n if (0 <= NX && NX < N && 0 <= NY && NY < M) {\\n if (!used[B[NX][NY]]) {\\n Ret[Z].push_back(B[NX][NY]);\\n used[B[NX][NY]] = true;\\n Q2.push(B[NX][NY]);\\n }\\n }\\n }\\n }\\n }\\n return Ret;\\n}\\n\\nint ID = 0;\\n\\nint DFS(vector<vector<int>> V, int X) {\\n vector<int> A;\\n for (int NX : V[X]) {\\n A.push_back(DFS(V,NX));\\n }\\n sort(ALL(A));\\n if (mp.count(A)) return mp[A];\\n else {\\n mp[A] = ID;\\n return ID++;\\n }\\n}\\n\\nint main() {\\nwhile(1) {\\n int N, M;\\n cin >> N >> M;\\n if (N == 0 && M == 0) return 0;\\n vector<vector<int>> V1 = MakeGraph(N,M);\\n cin >> N >> M;\\n vector<vector<int>> V2 = MakeGraph(N,M);\\n cout << (DFS(V1,0) == DFS(V2,0) ? \\\"yes\\\" : \\\"no\\\") << endl;\\n}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3956,\n \"score_of_the_acc\": -0.4329,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1613_9379813\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nconst vector<pair<int,int>>white={{1,0},{-1,0},{0,1},{0,-1}};\\nconst vector<pair<int,int>>black={{1,0},{-1,0},{0,1},{0,-1},{1,1},{1,-1},{-1,1},{-1,-1}};\\nvector<vector<int>>make_tree(const vector<vector<char>>&g)\\n{\\n int h=g.size(),w=g[0].size();\\n int cnt=0;\\n vector<vector<bool>>vis(h,vector<bool>(w,false));\\n vector<vector<int>>idx(h,vector<int>(w));\\n vector<vector<pair<int,int>>>inv;\\n for(int i=0;i<h;i++)for(int j=0;j<w;j++)if(!vis[i][j])\\n {\\n inv.push_back({});\\n vis[i][j]=true;\\n queue<pair<int,int>>q;\\n q.push(make_pair(i,j));\\n while(!q.empty())\\n {\\n auto[r,c]=q.front();\\n q.pop();\\n idx[r][c]=cnt;\\n inv[cnt].push_back(make_pair(r,c));\\n for(auto[dr,dc]:(g[r][c]=='.'?white:black))\\n {\\n int tr=r+dr,tc=c+dc;\\n if(0<=tr&&tr<h&&0<=tc&&tc<w&&!vis[tr][tc]&&g[tr][tc]==g[r][c])\\n {\\n vis[tr][tc]=true;\\n q.push(make_pair(tr,tc));\\n }\\n }\\n }\\n cnt++;\\n }\\n vector<bool>checked(cnt,false);\\n checked[0]=true;\\n vector<vector<int>>res(cnt);\\n for(int i=0;i<cnt;i++)\\n {\\n // for(int j=0;j<cnt;j++)cout<<checked[j];cout<<endl;\\n assert(checked[i]);\\n for(auto[r,c]:inv[i])for(auto[dr,dc]:white)\\n {\\n int tr=r+dr,tc=c+dc;\\n if(0<=tr&&tr<h&&0<=tc&&tc<w&&!checked[idx[tr][tc]])\\n {\\n checked[idx[tr][tc]]=true;\\n res[i].push_back(idx[tr][tc]);\\n }\\n }\\n sort(res[i].begin(),res[i].end());\\n res[i].erase(unique(res[i].begin(),res[i].end()),res[i].end());\\n }\\n return res;\\n}\\nstring tree_hash(const vector<vector<int>>&t)\\n{\\n auto dfs=[&](auto dfs, int u, int p)->string\\n {\\n vector<string>cld;\\n for(int v:t[u])if(v!=p)cld.push_back(dfs(dfs,v,u));\\n sort(cld.begin(),cld.end());\\n string res=\\\"(\\\";\\n for(auto s:cld)res+=s;\\n return res+\\\")\\\";\\n };\\n return dfs(dfs,0,-1);\\n}\\nbool solve()\\n{\\n int H1,W1;\\n cin>>H1>>W1;\\n if(H1==0&&W1==0)return false;\\n vector<vector<char>>grid1(H1+2,vector<char>(W1+2,'.'));\\n for(int i=1;i<=H1;i++)for(int j=1;j<=W1;j++)cin>>grid1[i][j];\\n int H2,W2;\\n cin>>H2>>W2;\\n vector<vector<char>>grid2(H2+2,vector<char>(W2+2,'.'));\\n for(int i=1;i<=H2;i++)for(int j=1;j<=W2;j++)cin>>grid2[i][j];\\n auto T1=make_tree(grid1);\\n auto T2=make_tree(grid2);\\n cout<<(tree_hash(T1)==tree_hash(T2)?\\\"yes\\\":\\\"no\\\")<<endl;\\n return true;\\n}\\nint main(){while(solve()){}}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3760,\n \"score_of_the_acc\": -0.2993,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1613_9372890\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nbool is_end = false;\\n\\nconst vector<pair<int, int>> move_white = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};\\nconst vector<pair<int, int>> move_black = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}, {1, 1}, {1, -1}, {-1, 1}, {-1, -1}};\\n\\nstruct grid {\\n // grid() : grid(0, 0, 0) {}\\n // grid(int h, int w, int c) : H(h), W(w), cnt_component(c) {}\\n int H, W;\\n int cnt_component = 0;\\n vector<vector<char>> p;\\n vector<vector<int>> component_id;\\n vector<vector<pair<int, int>>> component;\\n // グリッドの内部のマスか判定する\\n bool _within_area(int r, int c) {\\n return (0 <= r && r < H && 0 <= c && c < W);\\n }\\n // 始点と id を指定 同じ連結成分に id を伝播する\\n void _bfs_allocate_id(int r_s, int c_s, int id_s) {\\n queue<pair<int, int>> que;\\n const vector<pair<int, int>> dir = (p[r_s][c_s] == '.' ? move_white : move_black);\\n component_id[r_s][c_s] = id_s;\\n component.push_back(vector<pair<int, int>>());\\n que.push(make_pair(r_s, c_s));\\n while(!que.empty()) {\\n auto [r, c] = que.front();\\n que.pop();\\n for(const auto &[dr, dc] : dir) {\\n const int nr = r + dr;\\n const int nc = c + dc;\\n if(_within_area(nr, nc) && p[nr][nc] == p[r][c] && component_id[nr][nc] == -1) {\\n component_id[nr][nc] = component_id[r][c];\\n que.push(make_pair(nr, nc));\\n }\\n }\\n }\\n }\\n // 全体に連結成分の id を割り振る\\n void allocate_id() {\\n for(int i = 0; i < H; i++) {\\n for(int j = 0; j < W; j++) {\\n if(component_id[i][j] != -1) continue;\\n _bfs_allocate_id(i, j, cnt_component++);\\n }\\n }\\n for(int i = 0; i < H; i++) {\\n for(int j = 0; j < W; j++) {\\n component[component_id[i][j]].push_back(make_pair(i, j));\\n }\\n }\\n }\\n // 木に変形する 直属の子のリストを返す\\n vector<vector<int>> to_tree() {\\n vector<bool> used(cnt_component);\\n vector<vector<int>> child(cnt_component);\\n queue<int> que;\\n que.push(0);\\n used[0] = true;\\n while(!que.empty()) {\\n const int i = que.front();\\n que.pop();\\n for(const auto &[r, c] : component[i]) {\\n const vector<pair<int, int>> dir = (p[r][c] == '.' ? move_white : move_black);\\n for(const auto &[dr, dc] : dir) {\\n const int nr = r + dr;\\n const int nc = c + dc;\\n if(_within_area(nr, nc) && !used[component_id[nr][nc]]) {\\n const int j = component_id[nr][nc];\\n child[i].push_back(j);\\n que.push(j);\\n used[j] = true;\\n }\\n }\\n }\\n }\\n return child;\\n }\\n // 入力を読む\\n grid(int c) : cnt_component(c) {\\n cin >> H >> W;\\n if(H == 0 && W == 0) {\\n is_end = true;\\n }\\n H += 2, W += 2;\\n p = vector(H, vector<char>(W, '.'));\\n component_id = vector(H, vector<int>(W, -1));\\n for(int i = 1; i < H - 1; i++) {\\n string str_in;\\n cin >> str_in;\\n for(int j = 1; j < W - 1; j++) {\\n p[i][j] = str_in[j - 1];\\n }\\n }\\n allocate_id();\\n }\\n};\\n\\nstring hash_tree(vector<vector<int>> &child, int cur = 0) {\\n if(child[cur].empty()) return \\\"\\\";\\n vector<string> hash_child;\\n for(const int &nxt : child[cur]) {\\n hash_child.push_back('(' + hash_tree(child, nxt) + ')');\\n }\\n sort(hash_child.begin(), hash_child.end());\\n string ret = \\\"\\\";\\n for(const string &str : hash_child) {\\n ret += str;\\n }\\n return ret;\\n}\\n\\nbool solve() {\\n grid G1(0);\\n if(is_end) { return false; }\\n grid G2(0);\\n if(G1.cnt_component != G2.cnt_component) { cout << \\\"no\\\" << endl; return true; }\\n vector<vector<int>> T1 = G1.to_tree();\\n vector<vector<int>> T2 = G2.to_tree();\\n cout << (hash_tree(T1) == hash_tree(T2) ? \\\"yes\\\" : \\\"no\\\") << endl;\\n return true;\\n}\\n\\nint main() {\\n while(solve()) {}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3928,\n \"score_of_the_acc\": -0.3424,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1613_9372649\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing vll = vector<ll>;\\n#define rep(i,n) for(ll i=0;i<n;i++)\\n\\nvll dx={1,0,-1,0,1,-1,1,-1};\\nvll dy={0,1,0,-1,1,1,-1,-1};\\nvector<vll> to_tree(vector<string> S){\\n ll H=S.size();\\n ll W=S[0].size();\\n\\n vector<vector<ll>> val(H,vll(W,-1));\\n ll cnt=0;\\n rep(h,H)rep(w,W){\\n if(val[h][w]!=-1)continue;\\n queue<pair<ll,ll>> Q;\\n Q.push({h,w});\\n val[h][w]=cnt;\\n while(!Q.empty()){\\n ll y=Q.front().first;\\n ll x=Q.front().second;\\n Q.pop();\\n ll ds=4;\\n if(S[y][x]=='#')ds=8;\\n rep(d,ds){\\n ll ny=y+dy[d];\\n ll nx=x+dx[d];\\n if(ny<0||nx<0||ny>=H||nx>=W)continue;\\n if(S[ny][nx]!=S[y][x])continue;\\n if(val[ny][nx]!=-1)continue;\\n val[ny][nx]=cnt;\\n Q.push({ny,nx});\\n }\\n }\\n cnt++;\\n }\\n\\n // rep(h,H){\\n // rep(w,W){\\n // cout<<val[h][w];\\n // }\\n // cout<<endl;\\n // }\\n\\n vector<vll> G(cnt);\\n vector<set<ll>> seen(cnt);\\n rep(i,cnt)seen[i].insert(i);\\n rep(h,H)rep(w,W){\\n if(w!=W-1){\\n if(!seen[val[h][w]].count(val[h][w+1])){\\n G[val[h][w]].push_back(val[h][w+1]);\\n seen[val[h][w]].insert(val[h][w+1]);\\n }\\n }\\n if(h!=H-1){\\n if(!seen[val[h][w]].count(val[h+1][w])){\\n G[val[h][w]].push_back(val[h+1][w]);\\n seen[val[h][w]].insert(val[h+1][w]);\\n }\\n }\\n }\\n return G;\\n\\n\\n}\\n\\nusing ull=unsigned long long;\\nstruct TreeHasher{\\n using uint128=__uint128_t;\\n static const ull Mod=(1ull<<61ull)-1;\\n static inline ull add(ull a,ull b){if((a+=b)>=Mod)a-=Mod;return a;}\\n static inline ull mul(ull a,ull b){uint128 c=(uint128)a*b;return add(c>>61,c&Mod);}\\n vector<ull> R;\\n // 木のサイズ\\n TreeHasher(int n){\\n R.push_back(1);\\n mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());\\n uniform_int_distribution<ull> rand(1,Mod-1);\\n for(int i=1;i<=n;i++) R.push_back(rand(mt));\\n // R.resize(n+1);\\n // iota(ALL(R),1);\\n }\\n inline vector<int> BFS(vector<vector<int>> &g,int st,vector<int> &dis,bool memo_parent=false){\\n vector<int> par;\\n if(memo_parent) par.assign(g.size(),-1);\\n dis.assign(g.size(),-1);\\n dis[st]=0;\\n queue<int> que;\\n que.push(st);\\n while(!que.empty()){\\n int cur=que.front();que.pop();\\n for(auto &to:g[cur]){\\n if(dis[to]>=0) continue;\\n dis[to]=dis[cur]+1;\\n if(memo_parent) par[to]=cur;\\n que.push(to);\\n }\\n }\\n return par;\\n }\\n\\n ull RootedTreeHash(vector<vector<ll>> &g,int root){\\n vector<int> dis(g.size(),-1);\\n vector<ull> h(g.size());\\n function<void(int,int)> dfs=[&](int par,int cur){\\n int d=-1;\\n for(auto &to:g[cur])if(par!=to){\\n dfs(cur,to);\\n d=max(d,dis[to]);\\n }\\n d++;\\n dis[cur]=d;\\n ull ret=1;\\n // rng hash\\n for(auto &to:g[cur])if(par!=to) ret=mul(ret,add(h[to],R[d]));\\n h[cur]=ret;\\n };\\n dfs(-1,root);\\n return h[root];\\n }\\n bool RootedTreeIsomorphic(vector<vector<ll>> &g,int g_root,vector<vector<ll>> &h,int h_root){\\n if(g.size()!=h.size()) return false;\\n return (RootedTreeHash(g,g_root)==RootedTreeHash(h,h_root));\\n }\\n};\\n\\n\\nvoid solve(ll H,ll W) {\\n vector<vector<vll>> G(2); \\n rep(i,2){\\n vector<string> S(H+2);\\n rep(w,W+2){\\n S[0].push_back('.');\\n S[H+1].push_back('.');\\n }\\n rep(h,H){\\n cin>>S[h+1];\\n S[h+1]=\\\".\\\"+S[h+1]+\\\".\\\";\\n }\\n\\n G[i]=to_tree(S);\\n\\n if(i==0)cin>>H>>W;\\n }\\n if(G[0].size()!=G[1].size()){\\n cout<<\\\"no\\\"<<endl;\\n return;\\n }\\n TreeHasher T(G[0].size());\\n cout<<(T.RootedTreeIsomorphic(G[0],0,G[1],0)?\\\"yes\\\":\\\"no\\\")<<endl;\\n}\\n\\nint main() {\\n\\n ll H,W;\\n\\n while (cin >> H>>W) {\\n if (H+W == 0)return 0;\\n solve(H,W);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3736,\n \"score_of_the_acc\": -0.2098,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1613_9347359\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n// #include <atcoder/all>\\n\\n#ifdef DEFINED_ONLY_IN_LOCAL\\n#include \\\"../cpp-dump/dump.hpp\\\"\\n#define dump(...) cpp_dump(__VA_ARGS__)\\nnamespace cp = cpp_dump;\\n#else\\n#define dump(...)\\n#define CPP_DUMP_SET_OPTION(...)\\n#define CPP_DUMP_DEFINE_EXPORT_OBJECT(...)\\n#define CPP_DUMP_DEFINE_EXPORT_ENUM(...)\\n#define CPP_DUMP_DEFINE_DANGEROUS_EXPORT_OBJECT(...)\\n#endif\\n\\nconst long long INF = 1e9;\\nconst long long MOD1 = 1e9 + 7;\\nconst long long MOD2 = 998244353;\\nconst long long LINF = 1e18;\\nusing namespace std;\\n// using namespace atcoder;\\n\\n#define YES(n) cout << ((n) ? \\\"YES\\\" : \\\"NO\\\") << endl\\n#define Yes(n) cout << ((n) ? \\\"yes\\\" : \\\"no\\\") << endl\\n#define POSSIBLE(n) cout << ((n) ? \\\"POSSIBLE\\\" : \\\"IMPOSSIBLE\\\") << endl\\n#define Possible(n) cout << ((n) ? \\\"Possible\\\" : \\\"Impossible\\\") << endl\\n#define Takahashi(n) cout << ((n) ? \\\"Takahashi\\\" : \\\"Aoki\\\") << endl\\n#define TAKAHASHI(n) cout << ((n) ? \\\"TAKAHASHI\\\" : \\\"AOKI\\\") << endl\\n#define First(n) cout << ((n) ? \\\"First\\\" : \\\"Second\\\") << endl\\n#define FIRST(n) cout << ((n) ? \\\"FIRST\\\" : \\\"SECOND\\\") << endl\\n#define COUT(x) cout << (x) << endl\\n#define SCOUT(x) cout << (x) << \\\" \\\"\\n#define VECCOUT(x) \\\\\\n for (auto &youso_ : (x)) \\\\\\n cout << right << setw(10) << youso_ << \\\" \\\"; \\\\\\n cout << endl\\n#define ENDL cout << endl\\n#define CIN(...) \\\\\\n int __VA_ARGS__; \\\\\\n CINT(__VA_ARGS__)\\n#define LCIN(...) \\\\\\n long long __VA_ARGS__; \\\\\\n CINT(__VA_ARGS__)\\n#define SCIN(...) \\\\\\n string __VA_ARGS__; \\\\\\n CINT(__VA_ARGS__)\\n#define VECCIN(x) \\\\\\n for (auto &youso_ : (x)) \\\\\\n cin >> youso_\\n#define mp make_pair\\n\\ntypedef long long ll;\\ntypedef vector<long long> vl;\\ntypedef vector<vl> vvl;\\ntypedef pair<long long, long long> pll;\\n\\n#define COUT(x) cout << (x) << endl\\nvoid CINT()\\n{\\n}\\ntemplate <class Head, class... Tail>\\nvoid CINT(Head &&head, Tail &&...tail)\\n{\\n cin >> head;\\n CINT(move(tail)...);\\n}\\n\\n// using mint = modint998244353;\\n// ostream& operator<< (ostream& os, const mint &x) {os << x.val(); return os;}\\n\\nvvl solve(int h, int w, vvl &children)\\n{\\n\\n vector<string> S(h);\\n\\n VECCIN(S);\\n ll count = -LINF;\\n for (ll i = 0; i < h; i++)\\n for (ll j = 0; j < w; j++)\\n if (i * j == 0 || i == h - 1 || j == w - 1)\\n if (S.at(i).at(j) == '#')\\n count++;\\n vvl m(h + 2, vl(w + 2, (count == h * w - (h - 2) * (w - 2)) ? -2 : (-1)));\\n for (ll i = 0; i < h; i++)\\n {\\n for (ll j = 0; j < w; j++)\\n {\\n m.at(i + 1).at(j + 1) = S.at(i).at(j) == '#' ? -2 : -1;\\n }\\n }\\n int u_id = 0;\\n // vvl children;\\n set<pair<int, int>> s;\\n for (ll i = 0; i < h + 2; i++)\\n for (ll j = 0; j < w + 2; j++)\\n {\\n queue<pair<int, int>> q_outer;\\n if (m.at(i).at(j) < 0)\\n {\\n q_outer.push(mp(i, j));\\n }\\n while (q_outer.size())\\n {\\n int q_outer_i, q_outer_j;\\n tie(q_outer_i, q_outer_j) = q_outer.front();\\n q_outer.pop();\\n if (m.at(q_outer_i).at(q_outer_j) >= 0)\\n continue;\\n children.push_back(vl());\\n bool is_black = m.at(q_outer_i).at(q_outer_j) == -2;\\n int now = m.at(q_outer_i).at(q_outer_j);\\n m.at(q_outer_i).at(q_outer_j) = u_id;\\n // dump(now);\\n queue<pair<int, int>> q;\\n q.push(mp(q_outer_i, q_outer_j));\\n while (q.size())\\n {\\n int ni, nj;\\n tie(ni, nj) = q.front();\\n q.pop();\\n for (int next_i = ni - 1; next_i <= ni + 1; next_i++)\\n for (int next_j = nj - 1; next_j <= nj + 1; next_j++)\\n if (0 <= next_i && next_i < h + 2 && 0 <= next_j && next_j < w + 2)\\n {\\n int mdist = abs(next_i - ni) + abs(next_j - nj);\\n if ((mdist == 1 && m.at(next_i).at(next_j) >= 0 && m.at(next_i).at(next_j) < u_id) ||\\n (mdist == 2 && is_black && m.at(next_i).at(next_j) >= 0 && m.at(next_i).at(next_j) < u_id))\\n {\\n int child = u_id;\\n int parent = m.at(next_i).at(next_j);\\n if (s.count(mp(parent, child)) == false)\\n children.at(parent).push_back(child);\\n s.insert(mp(parent, child));\\n }\\n if (mdist == 1 && m.at(next_i).at(next_j) == now)\\n {\\n m.at(next_i).at(next_j) = u_id;\\n q.push(mp(next_i, next_j));\\n }\\n if (mdist == 2 && is_black && m.at(next_i).at(next_j) == now)\\n {\\n m.at(next_i).at(next_j) = u_id;\\n q.push(mp(next_i, next_j));\\n }\\n }\\n }\\n u_id++;\\n }\\n }\\n return m;\\n}\\n\\nll hs(vvl &m, int now)\\n{\\n ll res = 1;\\n for (size_t i = 0; i < m.at(now).size(); i++)\\n {\\n res *= hs(m, m.at(now).at(i));\\n res %= MOD1;\\n }\\n\\n res += 37;\\n res *= MOD2;\\n res %= MOD1;\\n return res;\\n}\\n\\nvoid Main()\\n{\\n while (1)\\n {\\n LCIN(h_1, w_1);\\n if (h_1 == 0)\\n break;\\n vvl children_1;\\n vvl res1 = solve(h_1, w_1, children_1);\\n LCIN(h_2, w_2);\\n vvl children_2;\\n vvl res2 = solve(h_2, w_2, children_2);\\n // dump(res1, res2)\\n // dump(children_1, children_2);\\n // dump(res1, res2);\\n ll h1 = hs(children_1, 0);\\n ll h2 = hs(children_2, 0);\\n // dump(h1, h2);\\n Yes(h1 == h2);\\n }\\n}\\nint main()\\n{\\n cout << fixed << setprecision(15);\\n Main();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3744,\n \"score_of_the_acc\": -0.4618,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1613_9347352\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n// #include <atcoder/all>\\n\\n#ifdef DEFINED_ONLY_IN_LOCAL\\n#include \\\"../cpp-dump/dump.hpp\\\"\\n#define dump(...) cpp_dump(__VA_ARGS__)\\nnamespace cp = cpp_dump;\\n#else\\n#define dump(...)\\n#define CPP_DUMP_SET_OPTION(...)\\n#define CPP_DUMP_DEFINE_EXPORT_OBJECT(...)\\n#define CPP_DUMP_DEFINE_EXPORT_ENUM(...)\\n#define CPP_DUMP_DEFINE_DANGEROUS_EXPORT_OBJECT(...)\\n#endif\\n\\nconst long long INF = 1e9;\\nconst long long MOD1 = 1e9 + 7;\\nconst long long MOD2 = 998244353;\\nconst long long LINF = 1e18;\\nusing namespace std;\\n// using namespace atcoder;\\n\\n#define YES(n) cout << ((n) ? \\\"YES\\\" : \\\"NO\\\") << endl\\n#define Yes(n) cout << ((n) ? \\\"yes\\\" : \\\"no\\\") << endl\\n#define POSSIBLE(n) cout << ((n) ? \\\"POSSIBLE\\\" : \\\"IMPOSSIBLE\\\") << endl\\n#define Possible(n) cout << ((n) ? \\\"Possible\\\" : \\\"Impossible\\\") << endl\\n#define Takahashi(n) cout << ((n) ? \\\"Takahashi\\\" : \\\"Aoki\\\") << endl\\n#define TAKAHASHI(n) cout << ((n) ? \\\"TAKAHASHI\\\" : \\\"AOKI\\\") << endl\\n#define First(n) cout << ((n) ? \\\"First\\\" : \\\"Second\\\") << endl\\n#define FIRST(n) cout << ((n) ? \\\"FIRST\\\" : \\\"SECOND\\\") << endl\\n#define COUT(x) cout << (x) << endl\\n#define SCOUT(x) cout << (x) << \\\" \\\"\\n#define VECCOUT(x) \\\\\\n for (auto &youso_ : (x)) \\\\\\n cout << right << setw(10) << youso_ << \\\" \\\"; \\\\\\n cout << endl\\n#define ENDL cout << endl\\n#define CIN(...) \\\\\\n int __VA_ARGS__; \\\\\\n CINT(__VA_ARGS__)\\n#define LCIN(...) \\\\\\n long long __VA_ARGS__; \\\\\\n CINT(__VA_ARGS__)\\n#define SCIN(...) \\\\\\n string __VA_ARGS__; \\\\\\n CINT(__VA_ARGS__)\\n#define VECCIN(x) \\\\\\n for (auto &youso_ : (x)) \\\\\\n cin >> youso_\\n#define mp make_pair\\n\\ntypedef long long ll;\\ntypedef vector<long long> vl;\\ntypedef vector<vl> vvl;\\ntypedef pair<long long, long long> pll;\\n\\n#define COUT(x) cout << (x) << endl\\nvoid CINT()\\n{\\n}\\ntemplate <class Head, class... Tail>\\nvoid CINT(Head &&head, Tail &&...tail)\\n{\\n cin >> head;\\n CINT(move(tail)...);\\n}\\n\\n// using mint = modint998244353;\\n// ostream& operator<< (ostream& os, const mint &x) {os << x.val(); return os;}\\n\\nvvl solve(int h, int w, vvl &children)\\n{\\n\\n vector<string> S(h);\\n\\n VECCIN(S);\\n ll count = -LINF;\\n for (ll i = 0; i < h; i++)\\n for (ll j = 0; j < w; j++)\\n if (i * j == 0 || i == h - 1 || j == w - 1)\\n if (S.at(i).at(j) == '#')\\n count++;\\n vvl m(h + 2, vl(w + 2, (count == h * w - (h - 2) * (w - 2)) ? -2 : (-1)));\\n for (ll i = 0; i < h; i++)\\n {\\n for (ll j = 0; j < w; j++)\\n {\\n dump(i, j, S);\\n m.at(i + 1).at(j + 1) = S.at(i).at(j) == '#' ? -2 : -1;\\n }\\n }\\n int u_id = 0;\\n // vvl children;\\n set<pair<int, int>> s;\\n for (ll i = 0; i < h + 2; i++)\\n for (ll j = 0; j < w + 2; j++)\\n {\\n queue<pair<int, int>> q_outer;\\n if (m.at(i).at(j) < 0)\\n {\\n q_outer.push(mp(i, j));\\n }\\n while (q_outer.size())\\n {\\n int q_outer_i, q_outer_j;\\n tie(q_outer_i, q_outer_j) = q_outer.front();\\n q_outer.pop();\\n if (m.at(q_outer_i).at(q_outer_j) >= 0)\\n continue;\\n children.push_back(vl());\\n bool is_black = m.at(q_outer_i).at(q_outer_j) == -2;\\n int now = m.at(q_outer_i).at(q_outer_j);\\n m.at(q_outer_i).at(q_outer_j) = u_id;\\n dump(m);\\n queue<pair<int, int>> q;\\n q.push(mp(q_outer_i, q_outer_j));\\n while (q.size())\\n {\\n int ni, nj;\\n tie(ni, nj) = q.front();\\n q.pop();\\n for (int next_i = ni - 1; next_i <= ni + 1; next_i++)\\n for (int next_j = nj - 1; next_j <= nj + 1; next_j++)\\n if (0 <= next_i && next_i < h + 2 && 0 <= next_j && next_j < w + 2)\\n {\\n int mdist = abs(next_i - ni) + abs(next_j - nj);\\n if ((mdist == 1 && m.at(next_i).at(next_j) >= 0 && m.at(next_i).at(next_j) < u_id) ||\\n (mdist == 2 && is_black && m.at(next_i).at(next_j) >= 0 && m.at(next_i).at(next_j) < u_id))\\n {\\n int child = u_id;\\n int parent = m.at(next_i).at(next_j);\\n if (s.count(mp(parent, child)) == false)\\n children.at(parent).push_back(child);\\n s.insert(mp(parent, child));\\n }\\n // if (m.at(next_i).at(next_j) < 0)\\n // {\\n // q_outer.push(mp(next_i, next_j));\\n // }\\n // dump(next_i, next_j);\\n if (mdist == 1 && m.at(next_i).at(next_j) == now)\\n {\\n // dump(\\\" if (mdist == 1 && m.at(next_i).at(next_j) == now)\\\");\\n m.at(next_i).at(next_j) = u_id;\\n q.push(mp(next_i, next_j));\\n }\\n if (mdist == 2 && is_black && m.at(next_i).at(next_j) == now)\\n {\\n // dump(\\\" if (mdist == 2 && is_black && m.at(next_i).at(next_j) == now)\\\");\\n m.at(next_i).at(next_j) = u_id;\\n q.push(mp(next_i, next_j));\\n }\\n }\\n }\\n u_id++;\\n }\\n }\\n return m;\\n}\\n\\nll hs(vvl &m, int now)\\n{\\n ll res = 1;\\n for (size_t i = 0; i < m.at(now).size(); i++)\\n {\\n res *= hs(m, m.at(now).at(i));\\n res %= MOD1;\\n }\\n\\n res += 37;\\n res *= MOD2;\\n res %= MOD1;\\n return res;\\n}\\n\\nvoid Main()\\n{\\n while (1)\\n {\\n LCIN(h_1, w_1);\\n if (h_1 == 0)\\n break;\\n vvl children_1;\\n vvl res1 = solve(h_1, w_1, children_1);\\n LCIN(h_2, w_2);\\n vvl children_2;\\n vvl res2 = solve(h_2, w_2, children_2);\\n dump(res1, res2);\\n dump(children_1, children_2);\\n ll h1 = hs(children_1, 0);\\n ll h2 = hs(children_2, 0);\\n dump(h1, h2);\\n Yes(h1 == h2);\\n }\\n}\\nint main()\\n{\\n cout << fixed << setprecision(15);\\n Main();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3696,\n \"score_of_the_acc\": -0.4495,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1613_9347332\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n// #include <atcoder/all>\\n\\n#ifdef DEFINED_ONLY_IN_LOCAL\\n#include \\\"../cpp-dump/dump.hpp\\\"\\n#define dump(...) cpp_dump(__VA_ARGS__)\\nnamespace cp = cpp_dump;\\n#else\\n#define dump(...)\\n#define CPP_DUMP_SET_OPTION(...)\\n#define CPP_DUMP_DEFINE_EXPORT_OBJECT(...)\\n#define CPP_DUMP_DEFINE_EXPORT_ENUM(...)\\n#define CPP_DUMP_DEFINE_DANGEROUS_EXPORT_OBJECT(...)\\n#endif\\n\\nconst long long INF = 1e9;\\nconst long long MOD1 = 1e9 + 7;\\nconst long long MOD2 = 998244353;\\nconst long long LINF = 1e18;\\nusing namespace std;\\n// using namespace atcoder;\\n\\n#define YES(n) cout << ((n) ? \\\"YES\\\" : \\\"NO\\\") << endl\\n#define Yes(n) cout << ((n) ? \\\"yes\\\" : \\\"no\\\") << endl\\n#define POSSIBLE(n) cout << ((n) ? \\\"POSSIBLE\\\" : \\\"IMPOSSIBLE\\\") << endl\\n#define Possible(n) cout << ((n) ? \\\"Possible\\\" : \\\"Impossible\\\") << endl\\n#define Takahashi(n) cout << ((n) ? \\\"Takahashi\\\" : \\\"Aoki\\\") << endl\\n#define TAKAHASHI(n) cout << ((n) ? \\\"TAKAHASHI\\\" : \\\"AOKI\\\") << endl\\n#define First(n) cout << ((n) ? \\\"First\\\" : \\\"Second\\\") << endl\\n#define FIRST(n) cout << ((n) ? \\\"FIRST\\\" : \\\"SECOND\\\") << endl\\n#define COUT(x) cout << (x) << endl\\n#define SCOUT(x) cout << (x) << \\\" \\\"\\n#define VECCOUT(x) \\\\\\n for (auto &youso_ : (x)) \\\\\\n cout << right << setw(10) << youso_ << \\\" \\\"; \\\\\\n cout << endl\\n#define ENDL cout << endl\\n#define CIN(...) \\\\\\n int __VA_ARGS__; \\\\\\n CINT(__VA_ARGS__)\\n#define LCIN(...) \\\\\\n long long __VA_ARGS__; \\\\\\n CINT(__VA_ARGS__)\\n#define SCIN(...) \\\\\\n string __VA_ARGS__; \\\\\\n CINT(__VA_ARGS__)\\n#define VECCIN(x) \\\\\\n for (auto &youso_ : (x)) \\\\\\n cin >> youso_\\n#define mp make_pair\\n\\ntypedef long long ll;\\ntypedef vector<long long> vl;\\ntypedef vector<vl> vvl;\\ntypedef pair<long long, long long> pll;\\n\\n#define COUT(x) cout << (x) << endl\\nvoid CINT()\\n{\\n}\\ntemplate <class Head, class... Tail>\\nvoid CINT(Head &&head, Tail &&...tail)\\n{\\n cin >> head;\\n CINT(move(tail)...);\\n}\\n\\n// using mint = modint998244353;\\n// ostream& operator<< (ostream& os, const mint &x) {os << x.val(); return os;}\\n\\nvvl solve(int h, int w, vvl &children)\\n{\\n\\n vector<string> S(h);\\n\\n VECCIN(S);\\n ll count = -LINF;\\n for (ll i = 0; i < h; i++)\\n for (ll j = 0; j < w; j++)\\n if (i * j == 0 || i == h - 1 || j == w - 1)\\n if (S.at(i).at(j) == '#')\\n count++;\\n vvl m(h + 2, vl(w + 2, (count == h * w - (h - 2) * (w - 2)) ? -2 : (-1)));\\n for (ll i = 0; i < h; i++)\\n {\\n for (ll j = 0; j < w; j++)\\n {\\n dump(i, j, S);\\n m.at(i + 1).at(j + 1) = S.at(i).at(j) == '#' ? -2 : -1;\\n }\\n }\\n int u_id = 0;\\n // vvl children;\\n set<pair<int, int>> s;\\n for (ll i = 0; i < h + 2; i++)\\n for (ll j = 0; j < w + 2; j++)\\n {\\n queue<pair<int, int>> q_outer;\\n if (m.at(i).at(j) < 0)\\n {\\n q_outer.push(mp(i, j));\\n }\\n while (q_outer.size())\\n {\\n int q_outer_i, q_outer_j;\\n tie(q_outer_i, q_outer_j) = q_outer.front();\\n q_outer.pop();\\n if (m.at(q_outer_i).at(q_outer_j) >= 0)\\n continue;\\n children.push_back(vl());\\n bool is_black = m.at(q_outer_i).at(q_outer_j) == -2;\\n int now = m.at(q_outer_i).at(q_outer_j);\\n m.at(q_outer_i).at(q_outer_j) = u_id;\\n dump(m);\\n queue<pair<int, int>> q;\\n q.push(mp(q_outer_i, q_outer_j));\\n while (q.size())\\n {\\n int ni, nj;\\n tie(ni, nj) = q.front();\\n q.pop();\\n for (int next_i = ni - 1; next_i <= ni + 1; next_i++)\\n for (int next_j = nj - 1; next_j <= nj + 1; next_j++)\\n if (0 <= next_i && next_i < h + 2 && 0 <= next_j && next_j < w + 2)\\n {\\n int mdist = abs(next_i - ni) + abs(next_j - nj);\\n if ((mdist == 1 && m.at(next_i).at(next_j) >= 0 && m.at(next_i).at(next_j) < u_id) ||\\n (mdist == 2 && is_black && m.at(next_i).at(next_j) >= 0 && m.at(next_i).at(next_j) < u_id))\\n {\\n int child = u_id;\\n int parent = m.at(next_i).at(next_j);\\n if (s.count(mp(parent, child)) == false)\\n children.at(parent).push_back(child);\\n s.insert(mp(parent, child));\\n }\\n // if (m.at(next_i).at(next_j) < 0)\\n // {\\n // q_outer.push(mp(next_i, next_j));\\n // }\\n // dump(next_i, next_j);\\n if (mdist == 1 && m.at(next_i).at(next_j) == now)\\n {\\n // dump(\\\" if (mdist == 1 && m.at(next_i).at(next_j) == now)\\\");\\n m.at(next_i).at(next_j) = u_id;\\n q.push(mp(next_i, next_j));\\n }\\n if (mdist == 2 && is_black && m.at(next_i).at(next_j) == now)\\n {\\n // dump(\\\" if (mdist == 2 && is_black && m.at(next_i).at(next_j) == now)\\\");\\n m.at(next_i).at(next_j) = u_id;\\n q.push(mp(next_i, next_j));\\n }\\n }\\n }\\n u_id++;\\n }\\n }\\n return m;\\n}\\n\\nstring hs(vvl &m, int now)\\n{\\n string res = \\\"\\\";\\n vector<string> S;\\n for (size_t i = 0; i < m.at(now).size(); i++)\\n {\\n S.push_back(hs(m, m.at(now).at(i)));\\n }\\n sort(S.begin(), S.end());\\n for (size_t i = 0; i < m.at(now).size(); i++)\\n res += S.at(i);\\n\\n return '(' + res + ')';\\n}\\n\\nvoid Main()\\n{\\n while (1)\\n {\\n LCIN(h_1, w_1);\\n if (h_1 == 0)\\n break;\\n vvl children_1;\\n vvl res1 = solve(h_1, w_1, children_1);\\n LCIN(h_2, w_2);\\n vvl children_2;\\n vvl res2 = solve(h_2, w_2, children_2);\\n dump(res1, res2);\\n dump(children_1, children_2);\\n string h1 = hs(children_1, 0);\\n string h2 = hs(children_2, 0);\\n dump(h1, h2);\\n Yes(h1 == h2);\\n }\\n}\\nint main()\\n{\\n cout << fixed << setprecision(15);\\n Main();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3656,\n \"score_of_the_acc\": -0.4393,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1613_9347305\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n// #include <atcoder/all>\\n\\n#ifdef DEFINED_ONLY_IN_LOCAL\\n#include \\\"../cpp-dump/dump.hpp\\\"\\n#define dump(...) cpp_dump(__VA_ARGS__)\\nnamespace cp = cpp_dump;\\n#else\\n#define dump(...)\\n#define CPP_DUMP_SET_OPTION(...)\\n#define CPP_DUMP_DEFINE_EXPORT_OBJECT(...)\\n#define CPP_DUMP_DEFINE_EXPORT_ENUM(...)\\n#define CPP_DUMP_DEFINE_DANGEROUS_EXPORT_OBJECT(...)\\n#endif\\n\\nconst long long INF = 1e9;\\nconst long long MOD1 = 1e9 + 7;\\nconst long long MOD2 = 998244353;\\nconst long long LINF = 1e18;\\nusing namespace std;\\n// using namespace atcoder;\\n\\n#define YES(n) cout << ((n) ? \\\"YES\\\" : \\\"NO\\\") << endl\\n#define Yes(n) cout << ((n) ? \\\"yes\\\" : \\\"no\\\") << endl\\n#define POSSIBLE(n) cout << ((n) ? \\\"POSSIBLE\\\" : \\\"IMPOSSIBLE\\\") << endl\\n#define Possible(n) cout << ((n) ? \\\"Possible\\\" : \\\"Impossible\\\") << endl\\n#define Takahashi(n) cout << ((n) ? \\\"Takahashi\\\" : \\\"Aoki\\\") << endl\\n#define TAKAHASHI(n) cout << ((n) ? \\\"TAKAHASHI\\\" : \\\"AOKI\\\") << endl\\n#define First(n) cout << ((n) ? \\\"First\\\" : \\\"Second\\\") << endl\\n#define FIRST(n) cout << ((n) ? \\\"FIRST\\\" : \\\"SECOND\\\") << endl\\n#define COUT(x) cout << (x) << endl\\n#define SCOUT(x) cout << (x) << \\\" \\\"\\n#define VECCOUT(x) \\\\\\n for (auto &youso_ : (x)) \\\\\\n cout << right << setw(10) << youso_ << \\\" \\\"; \\\\\\n cout << endl\\n#define ENDL cout << endl\\n#define CIN(...) \\\\\\n int __VA_ARGS__; \\\\\\n CINT(__VA_ARGS__)\\n#define LCIN(...) \\\\\\n long long __VA_ARGS__; \\\\\\n CINT(__VA_ARGS__)\\n#define SCIN(...) \\\\\\n string __VA_ARGS__; \\\\\\n CINT(__VA_ARGS__)\\n#define VECCIN(x) \\\\\\n for (auto &youso_ : (x)) \\\\\\n cin >> youso_\\n#define mp make_pair\\n\\ntypedef long long ll;\\ntypedef vector<long long> vl;\\ntypedef vector<vl> vvl;\\ntypedef pair<long long, long long> pll;\\n\\n#define COUT(x) cout << (x) << endl\\nvoid CINT()\\n{\\n}\\ntemplate <class Head, class... Tail>\\nvoid CINT(Head &&head, Tail &&...tail)\\n{\\n cin >> head;\\n CINT(move(tail)...);\\n}\\n\\n// using mint = modint998244353;\\n// ostream& operator<< (ostream& os, const mint &x) {os << x.val(); return os;}\\n\\nvvl solve(int h, int w, vvl &children)\\n{\\n\\n vector<string> S(h);\\n\\n VECCIN(S);\\n ll count = 0;\\n for (ll i = 0; i < h; i++)\\n for (ll j = 0; j < w; j++)\\n if (i * j == 0 || i == h - 1 || j == w - 1)\\n if (S.at(i).at(j) == '#')\\n count++;\\n vvl m(h + 2, vl(w + 2, (count == h * w - (h - 2) * (w - 2)) ? -2 : (-1)));\\n for (ll i = 0; i < h; i++)\\n {\\n for (ll j = 0; j < w; j++)\\n {\\n m.at(i + 1).at(j + 1) = S.at(i).at(j) == '#' ? -2 : -1;\\n }\\n }\\n int u_id = 0;\\n // vvl children;\\n set<pair<int, int>> s;\\n for (ll i = 0; i < h + 2; i++)\\n for (ll j = 0; j < w + 2; j++)\\n {\\n queue<pair<int, int>> q_outer;\\n if (m.at(i).at(j) < 0)\\n {\\n q_outer.push(mp(i, j));\\n }\\n while (q_outer.size())\\n {\\n int q_outer_i, q_outer_j;\\n tie(q_outer_i, q_outer_j) = q_outer.front();\\n q_outer.pop();\\n if (m.at(q_outer_i).at(q_outer_j) >= 0)\\n continue;\\n children.push_back(vl());\\n bool is_black = m.at(q_outer_i).at(q_outer_j) == -2;\\n int now = m.at(q_outer_i).at(q_outer_j);\\n m.at(q_outer_i).at(q_outer_j) = u_id;\\n // dump(now);\\n queue<pair<int, int>> q;\\n q.push(mp(q_outer_i, q_outer_j));\\n while (q.size())\\n {\\n int ni, nj;\\n tie(ni, nj) = q.front();\\n q.pop();\\n for (int next_i = ni - 1; next_i <= ni + 1; next_i++)\\n for (int next_j = nj - 1; next_j <= nj + 1; next_j++)\\n if (0 <= next_i && next_i < h + 2 && 0 <= next_j && next_j < w + 2)\\n {\\n int mdist = abs(next_i - ni) + abs(next_j - nj);\\n if ((mdist == 1 && m.at(next_i).at(next_j) >= 0 && m.at(next_i).at(next_j) < u_id) ||\\n (mdist == 2 && is_black && m.at(next_i).at(next_j) >= 0 && m.at(next_i).at(next_j) < u_id))\\n {\\n int child = u_id;\\n int parent = m.at(next_i).at(next_j);\\n if (s.count(mp(parent, child)) == false)\\n children.at(parent).push_back(child);\\n s.insert(mp(parent, child));\\n }\\n if (mdist == 1 && m.at(next_i).at(next_j) == now)\\n {\\n m.at(next_i).at(next_j) = u_id;\\n q.push(mp(next_i, next_j));\\n }\\n if (mdist == 2 && is_black && m.at(next_i).at(next_j) == now)\\n {\\n m.at(next_i).at(next_j) = u_id;\\n q.push(mp(next_i, next_j));\\n }\\n }\\n }\\n u_id++;\\n }\\n }\\n return m;\\n}\\n\\nstring hs(vvl &m, int now)\\n{\\n string res = \\\"\\\";\\n vector<string> S;\\n for (size_t i = 0; i < m.at(now).size(); i++)\\n {\\n S.push_back(hs(m, m.at(now).at(i)));\\n }\\n sort(S.begin(), S.end());\\n for (size_t i = 0; i < m.at(now).size(); i++)\\n res += S.at(i);\\n\\n return '(' + res + ')';\\n}\\n\\nvoid Main()\\n{\\n while (1)\\n {\\n LCIN(h_1, w_1);\\n if (h_1 == 0)\\n break;\\n vvl children_1;\\n vvl res1 = solve(h_1, w_1, children_1);\\n LCIN(h_2, w_2);\\n vvl children_2;\\n vvl res2 = solve(h_2, w_2, children_2);\\n // dump(res1, res2)\\n // dump(children_1, children_2);\\n // dump(res1, res2);\\n string h1 = hs(children_1, 0);\\n string h2 = hs(children_2, 0);\\n // dump(h1, h2);\\n Yes(h1 == h2);\\n }\\n}\\nint main()\\n{\\n cout << fixed << setprecision(15);\\n Main();\\n return 0;\\n}\",\n \"accuracy\": 0.5,\n \"time_ms\": 80,\n \"memory_kb\": 3672,\n \"score_of_the_acc\": -0.4434,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1613_9347299\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n// #include <atcoder/all>\\n\\n#ifdef DEFINED_ONLY_IN_LOCAL\\n#include \\\"../cpp-dump/dump.hpp\\\"\\n#define dump(...) cpp_dump(__VA_ARGS__)\\nnamespace cp = cpp_dump;\\n#else\\n#define dump(...)\\n#define CPP_DUMP_SET_OPTION(...)\\n#define CPP_DUMP_DEFINE_EXPORT_OBJECT(...)\\n#define CPP_DUMP_DEFINE_EXPORT_ENUM(...)\\n#define CPP_DUMP_DEFINE_DANGEROUS_EXPORT_OBJECT(...)\\n#endif\\n\\nconst long long INF = 1e9;\\nconst long long MOD1 = 1e9 + 7;\\nconst long long MOD2 = 998244353;\\nconst long long LINF = 1e18;\\nusing namespace std;\\n// using namespace atcoder;\\n\\n#define YES(n) cout << ((n) ? \\\"YES\\\" : \\\"NO\\\") << endl\\n#define Yes(n) cout << ((n) ? \\\"yes\\\" : \\\"no\\\") << endl\\n#define POSSIBLE(n) cout << ((n) ? \\\"POSSIBLE\\\" : \\\"IMPOSSIBLE\\\") << endl\\n#define Possible(n) cout << ((n) ? \\\"Possible\\\" : \\\"Impossible\\\") << endl\\n#define Takahashi(n) cout << ((n) ? \\\"Takahashi\\\" : \\\"Aoki\\\") << endl\\n#define TAKAHASHI(n) cout << ((n) ? \\\"TAKAHASHI\\\" : \\\"AOKI\\\") << endl\\n#define First(n) cout << ((n) ? \\\"First\\\" : \\\"Second\\\") << endl\\n#define FIRST(n) cout << ((n) ? \\\"FIRST\\\" : \\\"SECOND\\\") << endl\\n#define COUT(x) cout << (x) << endl\\n#define SCOUT(x) cout << (x) << \\\" \\\"\\n#define VECCOUT(x) \\\\\\n for (auto &youso_ : (x)) \\\\\\n cout << right << setw(10) << youso_ << \\\" \\\"; \\\\\\n cout << endl\\n#define ENDL cout << endl\\n#define CIN(...) \\\\\\n int __VA_ARGS__; \\\\\\n CINT(__VA_ARGS__)\\n#define LCIN(...) \\\\\\n long long __VA_ARGS__; \\\\\\n CINT(__VA_ARGS__)\\n#define SCIN(...) \\\\\\n string __VA_ARGS__; \\\\\\n CINT(__VA_ARGS__)\\n#define VECCIN(x) \\\\\\n for (auto &youso_ : (x)) \\\\\\n cin >> youso_\\n#define mp make_pair\\n\\ntypedef long long ll;\\ntypedef vector<long long> vl;\\ntypedef vector<vl> vvl;\\ntypedef pair<long long, long long> pll;\\n\\n#define COUT(x) cout << (x) << endl\\nvoid CINT()\\n{\\n}\\ntemplate <class Head, class... Tail>\\nvoid CINT(Head &&head, Tail &&...tail)\\n{\\n cin >> head;\\n CINT(move(tail)...);\\n}\\n\\n// using mint = modint998244353;\\n// ostream& operator<< (ostream& os, const mint &x) {os << x.val(); return os;}\\n\\nvvl solve(int h, int w, vvl &children)\\n{\\n\\n vector<string> S(h);\\n\\n VECCIN(S);\\n ll count = 0;\\n for (ll i = 0; i < h; i++)\\n for (ll j = 0; j < w; j++)\\n if (i * j == 0 || i == h - 1 || j == w - 1)\\n if (S.at(i).at(j) == '#')\\n count++;\\n vvl m(h + 2, vl(w + 2, (count == h * w - (h - 2) * (w - 2)) ? -2 : (-1)));\\n for (ll i = 0; i < h; i++)\\n {\\n for (ll j = 0; j < w; j++)\\n {\\n m.at(i + 1).at(j + 1) = S.at(i).at(j) == '#' ? -2 : -1;\\n }\\n }\\n int u_id = 0;\\n // vvl children;\\n set<pair<int, int>> s;\\n for (ll i = 0; i < h + 2; i++)\\n for (ll j = 0; j < w + 2; j++)\\n {\\n queue<pair<int, int>> q_outer;\\n if (m.at(i).at(j) < 0)\\n {\\n q_outer.push(mp(i, j));\\n }\\n while (q_outer.size())\\n {\\n int q_outer_i, q_outer_j;\\n tie(q_outer_i, q_outer_j) = q_outer.front();\\n q_outer.pop();\\n if (m.at(q_outer_i).at(q_outer_j) >= 0)\\n continue;\\n children.push_back(vl());\\n bool is_black = m.at(q_outer_i).at(q_outer_j) == -2;\\n int now = m.at(q_outer_i).at(q_outer_j);\\n m.at(q_outer_i).at(q_outer_j) = u_id;\\n // dump(now);\\n queue<pair<int, int>> q;\\n q.push(mp(q_outer_i, q_outer_j));\\n while (q.size())\\n {\\n int ni, nj;\\n tie(ni, nj) = q.front();\\n q.pop();\\n for (int next_i = ni - 1; next_i <= ni + 1; next_i++)\\n for (int next_j = nj - 1; next_j <= nj + 1; next_j++)\\n if (0 <= next_i && next_i < h + 2 && 0 <= next_j && next_j < w + 2)\\n {\\n int mdist = abs(next_i - ni) + abs(next_j - nj);\\n if ((mdist == 1 && m.at(next_i).at(next_j) >= 0 && m.at(next_i).at(next_j) < u_id) ||\\n (mdist == 2 && is_black && m.at(next_i).at(next_j) >= 0 && m.at(next_i).at(next_j) < u_id))\\n {\\n int child = u_id;\\n int parent = m.at(next_i).at(next_j);\\n if (s.count(mp(parent, child)) == false)\\n children.at(parent).push_back(child);\\n s.insert(mp(parent, child));\\n }\\n if (mdist == 1 && m.at(next_i).at(next_j) == now)\\n {\\n m.at(next_i).at(next_j) = u_id;\\n q.push(mp(next_i, next_j));\\n }\\n if (mdist == 2 && is_black && m.at(next_i).at(next_j) == now)\\n {\\n m.at(next_i).at(next_j) = u_id;\\n q.push(mp(next_i, next_j));\\n }\\n }\\n }\\n u_id++;\\n }\\n }\\n return m;\\n}\\n\\nll hs(vvl &m, int now)\\n{\\n ll res = 1;\\n for (size_t i = 0; i < m.at(now).size(); i++)\\n {\\n res *= hs(m, m.at(now).at(i));\\n res %= MOD1;\\n }\\n\\n res += 37;\\n res *= MOD2;\\n res %= MOD1;\\n return res;\\n}\\n\\nvoid Main()\\n{\\n while (1)\\n {\\n LCIN(h_1, w_1);\\n if (h_1 == 0)\\n break;\\n vvl children_1;\\n vvl res1 = solve(h_1, w_1, children_1);\\n LCIN(h_2, w_2);\\n vvl children_2;\\n vvl res2 = solve(h_2, w_2, children_2);\\n // dump(res1, res2)\\n // dump(children_1, children_2);\\n // dump(res1, res2);\\n ll h1 = hs(children_1, 0);\\n ll h2 = hs(children_2, 0);\\n // dump(h1, h2);\\n Yes(h1 == h2);\\n }\\n}\\nint main()\\n{\\n cout << fixed << setprecision(15);\\n Main();\\n return 0;\\n}\",\n \"accuracy\": 0.5,\n \"time_ms\": 80,\n \"memory_kb\": 3652,\n \"score_of_the_acc\": -0.4382,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1613_9128026\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n#include<string>\\n#include<set>\\n#include<queue>\\n#include<algorithm>\\nusing namespace std;\\nint dy4[4] = {1,0,-1,0};\\nint dx4[4] = {0,1,0,-1};\\nint dy8[8] = {1,1,1,0,-1,-1,-1,0};\\nint dx8[8] = {-1,0,1,1,1,0,-1,-1};\\nbool inr(int l, int x, int r){\\n return (l <= x) && (x < r);\\n}\\nvoid dfs(int now, vector<set<int>> &G, vector<string> &str, vector<bool> &seen){\\n seen[now] = true;\\n vector<string> tmp;\\n for(int next:G[now]){\\n if(seen[next])continue;\\n dfs(next, G, str, seen);\\n tmp.push_back(str[next]);\\n }\\n sort(tmp.begin(), tmp.end());\\n str[now] = \\\"(\\\";\\n for(int i = 0; i < (int)tmp.size(); i++){\\n str[now] += tmp[i];\\n }\\n str[now] += \\\")\\\";\\n return;\\n}\\nstring graph_to_string(vector<set<int>> G){\\n vector<string> str(G.size());\\n vector<bool> seen(G.size(), false);\\n // 木を括弧からなる文字列に変換する\\n dfs(0, G, str, seen);\\n return str[0];\\n}\\nvector<set<int>> pixel_to_graph(int h, int w, vector<string> P){\\n // 画像の周りに白のピクセルを追加する\\n for(int i = 0; i < h; i++){\\n P[i] = \\\".\\\" + P[i] + \\\".\\\";\\n }\\n {\\n string tmp(w+2, '.');\\n P.insert(P.begin(), tmp);\\n P.push_back(tmp);\\n }\\n // ピクセルを幅優先探索で連結成分分解\\n int cnt = 0;\\n vector<vector<int>> comp(h+2, vector<int>(w+2, -1));\\n for(int i = 0; i < h+2; i++){\\n for(int j = 0; j < w+2; j++){\\n if(comp[i][j] == -1){\\n char color = P[i][j];\\n queue<pair<int,int>> qu;\\n qu.push(make_pair(i,j));\\n comp[i][j] = cnt;\\n while(!qu.empty()){\\n pair<int,int> now = qu.front();\\n qu.pop();\\n for(int d = 0; d < 8; d++){\\n int ny, nx;\\n if(color == '.'){ // 白の場合\\n if(4 <= d)break;\\n ny = now.first + dy4[d];\\n nx = now.second + dx4[d];\\n }else{ // 黒の場合\\n ny = now.first + dy8[d];\\n nx = now.second + dx8[d];\\n }\\n if(!inr(0, ny ,h+2) || !inr(0, nx ,w+2))continue;\\n if(P[ny][nx] != color || comp[ny][nx] != -1)continue;\\n qu.push(make_pair(ny,nx));\\n comp[ny][nx] = cnt;\\n }\\n }\\n cnt++;\\n }\\n }\\n }\\n // 連結成分同士の位置関係をグラフに変換する\\n vector<set<int>> G(cnt);\\n for(int i = 0; i < h+2; i++){\\n for(int j = 0; j < w+2; j++){\\n if(i+1 < h+2){\\n if(comp[i][j] != comp[i+1][j]){\\n G[comp[i][j]].insert(comp[i+1][j]);\\n G[comp[i+1][j]].insert(comp[i][j]);\\n }\\n }\\n if(j+1 < w+2){\\n if(comp[i][j] != comp[i][j+1]){\\n G[comp[i][j]].insert(comp[i][j+1]);\\n G[comp[i][j+1]].insert(comp[i][j]);\\n }\\n }\\n }\\n }\\n return G;\\n}\\nint main(){\\n while(1){\\n int h[2],w[2];\\n vector<string> P[2];\\n // 画像1 入力\\n cin >> h[0] >> w[0];\\n if(h[0] == 0 && w[0] == 0)break; // データセットの終わり\\n P[0].resize(h[0]);\\n for(int i = 0; i < h[0]; i++){\\n cin >> P[0][i];\\n }\\n\\n // 画像2 入力\\n cin >> h[1] >> w[1];\\n P[1].resize(h[1]);\\n for(int i = 0; i < h[1]; i++){\\n cin >> P[1][i];\\n }\\n\\n // 出力\\n if(graph_to_string(pixel_to_graph(h[0],w[0],P[0])) == graph_to_string(pixel_to_graph(h[1],w[1],P[1]))){\\n cout << \\\"yes\\\" << endl;\\n }else{\\n cout << \\\"no\\\" << endl;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3568,\n \"score_of_the_acc\": -0.1667,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1613_9125259\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define ALL(v) v.begin(),v.end()\\n#define dbg(x) cerr << #x << \\\": \\\" << (x) << endl;\\ntemplate<class F, class S>\\nostream& operator<<(ostream& os, pair<F,S>& p) {\\n os << '(' << p.first << ',' << p.second << ')';\\n return os;\\n}\\ntemplate<class Iter>\\nvoid print(Iter beg, Iter end) {\\n for (Iter itr = beg; itr != end; ++itr) {\\n cerr << *itr << ' ';\\n }\\n cerr << '\\\\n';\\n}\\nusing Pic = vector<vector<char>>;\\nusing Graph = vector<vector<int>>;\\nPic S[2];\\nint dx[] = {1,0,-1,0,1};\\n\\nvector<pair<int,int>> paintConnected(const Pic& p, vector<vector<int>>& col, int sx, int sy, int idx) {\\n vector<pair<int,int>> inside;\\n int h = p.size();\\n int w = p[0].size();\\n queue<pair<int,int>> q;\\n q.emplace(sx, sy);\\n col[sx][sy] = idx;\\n while (q.size()) {\\n auto [x,y] = q.front();\\n q.pop();\\n \\n if (p[sx][sy] == '.') {\\n for (int i = 0; i < 4; ++i) {\\n int nx = x + dx[i];\\n int ny = y + dx[i+1];\\n if (!(0 <= nx && nx < h && 0 <= ny && ny < w)) continue;\\n if (col[nx][ny] != -1) continue;\\n if (p[nx][ny] != p[sx][sy]) {\\n if (col[nx][ny] == -1) inside.emplace_back(nx, ny);\\n continue;\\n }\\n q.emplace(nx, ny);\\n col[nx][ny] = idx;\\n }\\n } else {\\n for (int dx = -1; dx < 2; ++dx) {\\n for (int dy = -1; dy < 2; ++dy) {\\n if (dx==0 && dy==0) continue;\\n int nx = x + dx;\\n int ny = y + dy;\\n if (!(0 <= nx && nx < h && 0 <= ny && ny < w)) continue;\\n if (col[nx][ny] != -1) continue;\\n if (p[nx][ny] != p[sx][sy]) {\\n if (col[nx][ny] == -1) inside.emplace_back(nx, ny);\\n continue;\\n }\\n q.emplace(nx, ny);\\n col[nx][ny] = idx;\\n }\\n }\\n }\\n }\\n return inside;\\n}\\n\\npair<vector<vector<int>>, int> paint(const Pic& p) {\\n int h = p.size();\\n int w = p[0].size();\\n queue<pair<int,int>> q;\\n vector<vector<int>> col(h, vector<int>(w,-1));\\n int idx = 0;\\n q.emplace(0,0);\\n\\n while (q.size()) {\\n auto [x,y] = q.front();\\n q.pop();\\n if (col[x][y] != -1) continue;\\n\\n auto inside = paintConnected(p, col, x, y, idx);\\n for (auto x : inside) {\\n q.push(x);\\n }\\n ++idx;\\n }\\n return {col, idx};\\n}\\n\\nGraph gen(const Pic& p, vector<vector<int>>& col, int kind) {\\n int h = col.size();\\n int w = col[0].size();\\n\\n set<pair<int,int>> st;\\n\\n for (int i = 0; i < h; ++i) {\\n for (int j = 0; j < w; ++j) {\\n for (int dx = -1; dx < 2; ++dx) {\\n for (int dy = -1; dy < 2; ++dy) {\\n if (dx==0 && dy==0) continue;\\n int nx = i + dx;\\n int ny = j + dy;\\n if (!(0 <= nx && nx < h && 0 <= ny && ny < w)) continue;\\n int a = col[nx][ny];\\n int b = col[i][j];\\n if (p[i][j] == p[nx][ny]) continue;\\n if (a == b) continue;\\n if (a > b) swap(a,b);\\n st.emplace(a, b);\\n }\\n }\\n }\\n }\\n Graph g(kind);\\n for (auto [u,v] : st) {\\n g[u].push_back(v);\\n g[v].push_back(u);\\n }\\n return g;\\n}\\n// O(N + M)\\npair<vector<int>, int> bfs(const Graph& g, int start) {\\n int n = g.size();\\n vector<int> dis(n, 1e9), pre(n, -1);\\n queue<int> q;\\n dis[start] = 0;\\n q.push(start);\\n int ma = 0;\\n int farthest = start;\\n while (q.size()) {\\n int pos = q.front();\\n q.pop();\\n for (int to : g[pos]) {\\n if (dis[pos] + 1 < dis[to]) {\\n dis[to] = dis[pos] + 1;\\n pre[to] = pos;\\n q.push(to);\\n if (dis[to] > ma) {\\n ma = dis[to];\\n farthest = to;\\n }\\n }\\n }\\n }\\n return {pre, farthest};\\n}\\n\\n// 木の中心を求める(木の直径の中央の頂点)\\n// 1or2頂点\\nvector<int> center(const Graph& tree) {\\n auto [pre1, v1] = bfs(tree, 0);\\n auto [pre2, v2] = bfs(tree, v1);\\n\\n vector<int> path;\\n int now = v2;\\n while (now != -1) {\\n path.push_back(now);\\n now = pre2[now];\\n }\\n\\n vector<int> centers;\\n centers.push_back(path[path.size() / 2]);\\n if (path.size() % 2 == 0) centers.push_back(path[path.size() / 2 - 1]);\\n return centers;\\n}\\n// 木の名前を求める\\nint name(int pos, int pre, const Graph& tree, map<vector<int>,int>& cmp, int& id) {\\n vector<int> seq;\\n for (int c : tree[pos]) {\\n if (c == pre) continue;\\n seq.push_back(name(c, pos, tree, cmp, id));\\n }\\n if (seq.empty()) {\\n return 0;\\n }\\n sort(ALL(seq));\\n if (cmp.count(seq)) {\\n return cmp.at(seq);\\n } else {\\n cmp[seq] = ++id;\\n return id;\\n }\\n}\\n// 根付き木の同型性判定\\nbool isomorphism_rooted(const Graph& t1, const Graph& t2, int r1, int r2) {\\n int id = 0;\\n map<vector<int>, int> cmp;\\n int name1 = name(r1, -1, t1, cmp, id);\\n int name2 = name(r2, -1, t2, cmp, id);\\n return (name1 == name2);\\n}\\n\\nbool solve() {\\n for (int t = 0; t < 2; ++t) {\\n int h,w;\\n cin >> h >> w;\\n if (h+w == 0) exit(0);\\n S[t].assign(h+2, vector<char>(w+2, '.'));\\n for (int i = 1; i <= h; ++i) {\\n for (int j = 1; j <= w; ++j) {\\n cin >> S[t][i][j];\\n }\\n }\\n }\\n\\n vector<vector<int>> col[2];\\n int kind[2];\\n for (int i = 0; i < 2; ++i) {\\n tie(col[i], kind[i]) = paint(S[i]);\\n }\\n Graph g[2];\\n for (int i = 0; i < 2; ++i) {\\n g[i] = gen(S[i], col[i], kind[i]);\\n }\\n\\n return isomorphism_rooted(g[0], g[1], 0, 0);\\n}\\n\\nint main() {\\n ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);\\n while (true) {\\n cout << (solve() ? \\\"yes\\\" : \\\"no\\\")<< '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 3716,\n \"score_of_the_acc\": -0.9547,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1613_9125247\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define ALL(v) v.begin(),v.end()\\n#define dbg(x) cerr << #x << \\\": \\\" << (x) << endl;\\ntemplate<class F, class S>\\nostream& operator<<(ostream& os, pair<F,S>& p) {\\n os << '(' << p.first << ',' << p.second << ')';\\n return os;\\n}\\ntemplate<class Iter>\\nvoid print(Iter beg, Iter end) {\\n for (Iter itr = beg; itr != end; ++itr) {\\n cerr << *itr << ' ';\\n }\\n cerr << '\\\\n';\\n}\\nusing Pic = vector<vector<char>>;\\nusing Graph = vector<vector<int>>;\\nPic S[2];\\nint dx[] = {1,0,-1,0,1};\\n\\nvector<pair<int,int>> paintConnected(const Pic& p, vector<vector<int>>& col, int sx, int sy, int idx) {\\n vector<pair<int,int>> inside;\\n int h = p.size();\\n int w = p[0].size();\\n queue<pair<int,int>> q;\\n q.emplace(sx, sy);\\n col[sx][sy] = idx;\\n while (q.size()) {\\n auto [x,y] = q.front();\\n q.pop();\\n \\n if (p[sx][sy] == '.') {\\n for (int i = 0; i < 4; ++i) {\\n int nx = x + dx[i];\\n int ny = y + dx[i+1];\\n if (!(0 <= nx && nx < h && 0 <= ny && ny < w)) continue;\\n if (col[nx][ny] != -1) continue;\\n if (p[nx][ny] != p[sx][sy]) {\\n if (col[nx][ny] == -1) inside.emplace_back(nx, ny);\\n continue;\\n }\\n q.emplace(nx, ny);\\n col[nx][ny] = idx;\\n }\\n } else {\\n for (int dx = -1; dx < 2; ++dx) {\\n for (int dy = -1; dy < 2; ++dy) {\\n if (dx==0 && dy==0) continue;\\n int nx = x + dx;\\n int ny = y + dy;\\n if (!(0 <= nx && nx < h && 0 <= ny && ny < w)) continue;\\n if (col[nx][ny] != -1) continue;\\n if (p[nx][ny] != p[sx][sy]) {\\n if (col[nx][ny] == -1) inside.emplace_back(nx, ny);\\n continue;\\n }\\n q.emplace(nx, ny);\\n col[nx][ny] = idx;\\n }\\n }\\n }\\n }\\n return inside;\\n}\\n\\npair<vector<vector<int>>, int> paint(const Pic& p) {\\n int h = p.size();\\n int w = p[0].size();\\n queue<pair<int,int>> q;\\n vector<vector<int>> col(h, vector<int>(w,-1));\\n int idx = 0;\\n q.emplace(0,0);\\n\\n while (q.size()) {\\n auto [x,y] = q.front();\\n q.pop();\\n if (col[x][y] != -1) continue;\\n\\n auto inside = paintConnected(p, col, x, y, idx);\\n for (auto x : inside) {\\n q.push(x);\\n }\\n ++idx;\\n }\\n return {col, idx};\\n}\\n\\nGraph gen(const Pic& p, vector<vector<int>>& col, int kind) {\\n int h = col.size();\\n int w = col[0].size();\\n\\n set<pair<int,int>> st;\\n\\n for (int i = 0; i < h; ++i) {\\n for (int j = 0; j < w; ++j) {\\n for (int dx = -1; dx < 2; ++dx) {\\n for (int dy = -1; dy < 2; ++dy) {\\n if (dx==0 && dy==0) continue;\\n int nx = i + dx;\\n int ny = j + dy;\\n if (!(0 <= nx && nx < h && 0 <= ny && ny < w)) continue;\\n int a = col[nx][ny];\\n int b = col[i][j];\\n if (p[i][j] == p[nx][ny]) continue;\\n if (a == b) continue;\\n if (a > b) swap(a,b);\\n st.emplace(a, b);\\n }\\n }\\n }\\n }\\n Graph g(kind);\\n for (auto [u,v] : st) {\\n g[u].push_back(v);\\n g[v].push_back(u);\\n }\\n return g;\\n}\\n// O(N + M)\\ntuple<vector<int>, vector<int>, int> bfs(const Graph& g, int start) {\\n int n = g.size();\\n vector<int> dis(n, 1e9), pre(n, -1);\\n queue<int> q;\\n dis[start] = 0;\\n q.push(start);\\n int ma = 0;\\n int farthest = start;\\n while (q.size()) {\\n int pos = q.front();\\n q.pop();\\n for (int to : g[pos]) {\\n if (dis[pos] + 1 < dis[to]) {\\n dis[to] = dis[pos] + 1;\\n pre[to] = pos;\\n q.push(to);\\n if (dis[to] > ma) {\\n ma = dis[to];\\n farthest = to;\\n }\\n }\\n }\\n }\\n return {dis, pre, farthest};\\n}\\n\\n// 木の中心を求める(木の直径の中央の頂点)\\n// 1or2頂点\\nvector<int> center(const Graph& tree) {\\n auto [dis1, pre1, v1] = bfs(tree, 0);\\n auto [dis2, pre2, v2] = bfs(tree, v1);\\n\\n vector<int> path;\\n int now = v2;\\n while (now != -1) {\\n path.push_back(now);\\n now = pre2[now];\\n }\\n\\n vector<int> centers;\\n centers.push_back(path[path.size() / 2]);\\n if (path.size() % 2 == 0) centers.push_back(path[path.size() / 2 - 1]);\\n return centers;\\n}\\n// 木の名前を求める\\nint name(int pos, int pre, const Graph& tree, map<vector<int>,int>& cmp, int& id) {\\n vector<int> seq;\\n for (int c : tree[pos]) {\\n if (c == pre) continue;\\n seq.push_back(name(c, pos, tree, cmp, id));\\n }\\n if (seq.empty()) {\\n return 0;\\n }\\n sort(ALL(seq));\\n if (cmp.count(seq)) {\\n return cmp.at(seq);\\n } else {\\n cmp[seq] = ++id;\\n return id;\\n }\\n}\\n// 根付き木の同型性判定\\nbool isomorphism_rooted(const Graph& t1, const Graph& t2, int r1, int r2) {\\n int id = 0;\\n map<vector<int>, int> cmp;\\n int name1 = name(r1, -1, t1, cmp, id);\\n int name2 = name(r2, -1, t2, cmp, id);\\n return (name1 == name2);\\n}\\n\\nbool solve() {\\n for (int t = 0; t < 2; ++t) {\\n int h,w;\\n cin >> h >> w;\\n if (h+w == 0) exit(0);\\n S[t].assign(h+2, vector<char>(w+2, '.'));\\n for (int i = 1; i <= h; ++i) {\\n for (int j = 1; j <= w; ++j) {\\n cin >> S[t][i][j];\\n }\\n }\\n }\\n\\n vector<vector<int>> col[2];\\n int kind[2];\\n for (int i = 0; i < 2; ++i) {\\n tie(col[i], kind[i]) = paint(S[i]);\\n }\\n Graph g[2];\\n for (int i = 0; i < 2; ++i) {\\n g[i] = gen(S[i], col[i], kind[i]);\\n }\\n\\n return isomorphism_rooted(g[0], g[1], 0, 0);\\n}\\n\\nint main() {\\n ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);\\n while (true) {\\n cout << (solve() ? \\\"yes\\\" : \\\"no\\\")<< '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 3588,\n \"score_of_the_acc\": -1.0051,\n \"final_rank\": 17\n }\n]","isConversational":false}}},{"rowIdx":989,"cells":{"group_id":{"kind":"string","value":"aoj_1618_cpp"},"problem_description":{"kind":"string","value":"A Garden with Ponds\nMr. Gardiner is a modern garden designer who is excellent at utilizing the terrain features.\n His design method is unique: he first decides the location of ponds and design them with the terrain features intact.\nAccording to his unique design procedure, all of his ponds are rectangular with simple aspect ratios.\n First, Mr. Gardiner draws a regular grid on the map of the garden site so that the land is divided into cells of unit square, and annotates every cell with its elevation.\n In his design method, a pond occupies a rectangular area consisting of a number of cells.\n Each of its outermost cells has to be higher than all of its inner cells.\n For instance, in the following grid map, in which numbers are elevations of cells, a pond can occupy the shaded area, where the outermost cells are shaded darker and the inner cells are shaded lighter.\n You can easily see that the elevations of the outermost cells are at least three and those of the inner ones are at most two.\nA rectangular area on which a pond is built must have at least one inner cell.\n Therefore, both its width and depth are at least three.\nWhen you pour water at an inner cell of a pond, the water can be kept in the pond until its level reaches that of the lowest outermost cells.\n If you continue pouring, the water inevitably spills over. \n Mr. Gardiner considers the larger\ncapacity\nthe pond has, the better it is.\n Here, the capacity of a pond is the maximum amount of water it can keep.\n For instance, when a pond is built on the shaded area in the above map, its capacity is (3 − 1) + (3 − 0) + (3 − 2) = 6, where 3 is the lowest elevation of the outermost cells and 1, 0, 2 are the elevations of the inner cells.\n Your mission is to write a computer program that, given a grid map describing the elevation of each unit square cell, calculates the largest possible capacity of a pond built in the site.\nNote that neither of the following rectangular areas can be a pond.\n In the left one, the cell at the bottom right corner is not higher than the inner cell.\n In the right one, the central cell is as high as the outermost cells.\nInput\nThe input consists of at most 100 datasets, each in the following format.\nd w\ne\n1, 1\n...\ne\n1,\nw\n...\ne\nd\n, 1\n...\ne\nd, w\nThe first line contains\nd\nand\nw\n, representing the depth and the width, respectively, of the garden site described in the map. \nThey are positive integers between 3 and 10, inclusive.\nEach of the following\nd\nlines contains\nw\nintegers between 0 and 9, inclusive, separated by a space.\nThe\nx\n-th integer in the\ny\n-th line of the\nd\nlines is the elevation of the unit square cell with coordinates (\nx, y\n).\nThe end of the input is indicated by a line containing two zeros separated by a space.\nOutput\nFor each dataset, output a single line containing the largest possible capacity of a pond that can be built in the garden site described in the dataset.\n If no ponds can be built, output a single line containing a zero.\nSample\n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1618_10542183","code_snippet":"#include<iostream>\n#include<cmath>\n#include<string>\n#include<vector>\n#include<algorithm>\n#include<tuple>\n#include<map>\n#include<queue>\n#include<set>\n#include<unordered_set>\n#include<stack>\n#include<deque>\n#include<bitset>\n#include<cassert>\n#include<numeric>\n#include<regex>\n#define ll long long\n#define int_max ((int)2147483647)\n#define ll_max ((ll)9223372036854775807)\n#define all(a) (a).begin(), (a).end()\nusing namespace std;\n\nvoid solve(const int d, const int w){\n\n vector<vector<int>> grid(d,vector<int>(w));\n\n for(int i=0;i<d;i++){\n for(int j=0;j<w;j++){\n cin>>grid[i][j];\n }\n }\n\n int ans=0;\n\n for(int h = 1; h < 10; h++){\n vector<vector<int>> lake(d,vector<int>(w));\n for(int i = 0; i < d; i++){\n for(int j = 0; j < w; j++){\n lake[i][j] = max(0, h - grid[i][j]);\n }\n }\n\n for(int i = 1; i < d-1; i++){\n for(int j = 1; j < w-1; j++){\n for(int x = i; x < d-1; x++){\n for(int y = j; y < w-1; y++){\n \n int v = 0;\n bool isLake = true;\n\n for(int k = i-1; k <= x+1; k++){\n for(int l = j-1; l <= y+1; l++){\n if((k == i-1 || k == x+1) || (l == j-1 || l == y+1)){\n if(lake[k][l] != 0){\n isLake = false;\n }\n }\n else{\n if(lake[k][l] == 0){\n isLake = false;\n }\n else{\n v += lake[k][l];\n }\n }\n }\n }\n\n if(isLake){\n ans = max(ans, v);\n }\n }\n }\n }\n }\n }\n\n cout<<ans<<endl;\n\n}\n\nint main(){\n\n int d,w;\n cin>>d>>w;\n\n while(0<d+w){\n solve(d,w);\n cin>>d>>w;\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3380,"score_of_the_acc":-1.3476,"final_rank":17},{"submission_id":"aoj_1618_9405426","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\nusing vi = vector<int>;\nusing vl = vector<long long>;\nusing vs = vector<string>;\nusing vc = vector<char>;\nusing vb = vector<bool>;\nusing vpii = vector<pair<int, int>>;\nusing vpll = vector<pair<long long, long long>>;\nusing vvi = vector<vector<int>>;\nusing vvl = vector<vector<long long>>;\nusing vvc = vector<vector<char>>;\nusing vvvi = vector<vector<vector<int>>>;\nusing pii = pair<int, int>;\nusing vvb = vector<vector<bool>>;\nusing Graph = vector<vector<ll>>;\nconst ll LINF = 1001002003004005006ll;\nconst int INF = 1001001001;\nconst int MOD = 998244353;\n\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define rep3(i, m, n) for (int i = (m); i < (int)(n); i++)\n#define rrep(i, m, n) for (int i = (m); i >= (int)(n); i--)\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\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\nvi dx4 = {1, 0, -1, 0}, dy4 = {0, 1, 0, -1};\nvi dx8 = {1, 1, 1, 0, 0, -1, -1, -1}, dy8 = {1, 0, -1, 1, -1, 1, 0, -1};\n\nint solve(vvi e, int t, int b, int l, int r)\n{\n int min = INF;\n rep3(i, t, b + 1) { chmin(min, e[i][l]); }\n rep3(i, t, b + 1) { chmin(min, e[i][r]); }\n rep3(i, l, r + 1) { chmin(min, e[t][i]); }\n rep3(i, l, r + 1) { chmin(min, e[b][i]); }\n int max = 0;\n rep3(i, t + 1, b)\n {\n rep3(j, l + 1, r) { chmax(max, e[i][j]); }\n }\n if (min <= max)\n {\n return 0;\n }\n int res = 0;\n rep3(i, t + 1, b)\n {\n rep3(j, l + 1, r) { res += min - e[i][j]; }\n }\n return res;\n}\n\nint main()\n{\n while (1)\n {\n // 宣言・入力の受け取り\n int d, w;\n cin >> d >> w;\n // 終了条件\n if (d == 0 && w == 0)\n {\n break;\n }\n // 宣言・入力の受け取り\n vvi e(d, vi(w));\n rep(i, d)\n {\n rep(j, w) { cin >> e[i][j]; }\n }\n // solve\n int ans = 0;\n rep(t, d)\n {\n rep(l, w)\n {\n rep(b, d)\n {\n rep(r, w)\n {\n if (t + 2 <= b && l + 2 <= r)\n {\n chmax(ans, solve(e, t, b, l, r));\n }\n }\n }\n }\n }\n // 出力\n cout << ans << '\\n';\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3344,"score_of_the_acc":-0.7619,"final_rank":11},{"submission_id":"aoj_1618_9377643","code_snippet":"#include <bits/stdc++.h>\n\n// #include <atcoder/all>\n\nusing namespace std;\n// using namespace atcoder;\ntypedef long long ll;\ntemplate <class T, class... Ts>\nvoid println(const T& a, const Ts&... b) {\n cout << a;\n (void)(cout << ... << (cout << ' ', b));\n cout << '\\n';\n}\ntemplate <class T>\nvoid printv(const T& a, string sep = \" \", string end = \"\\n\") {\n for (auto x : a) {\n (void)(cout << x << sep);\n }\n cout << end;\n}\nvoid println() { cout << '\\n'; }\ntemplate <class T, class... Ts>\nvoid eprintln(const T& a, const Ts&... b) {\n cerr << a;\n (void)(cerr << ... << (cerr << ' ', b));\n cerr << '\\n';\n}\ntemplate <class T>\nvoid eprintv(const T& a, string sep = \" \", string end = \"\\n\") {\n for (auto x : a) {\n (void)(cerr << x << sep);\n }\n cerr << end;\n}\nvoid eprintln() { cerr << '\\n'; }\ntemplate <class... T>\nvoid input(T&... a) { (cin >> ... >> a); }\n#define rep(i, n) for (ll i = 0; i < n; i++)\n#define rep1(i, n) for (ll i = 1; i <= n; i++)\n#define yesno(a) cout << (a ? \"Yes\" : \"No\") << '\\n';\n#define YESNO(a) cout << (a ? \"YES\" : \"NO\") << '\\n';\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n cout.tie(nullptr);\n cout << fixed << setprecision(15);\n\n while (1) {\n ll n, m;\n input(n, m);\n if (n == 0 && m == 0) break;\n\n vector<vector<ll>> board(n, vector<ll>(m));\n rep(i, n) rep(j, m) input(board[i][j]);\n\n // rep(sx, n - 2) {\n ll best_ans = 0;\n for (ll sx = 0; sx < n - 2; sx++) {\n for (ll ex = sx + 2; ex < n; ex++) {\n for (ll sy = 0; sy < m - 2; sy++) {\n for (ll ey = sy + 2; ey < m; ey++) {\n // println(\"RANGE\", sx, ex, sy, ey);\n ll maxv = 0;\n ll minv = LLONG_MAX;\n set<ll> outer, inner;\n vector<ll> inner_all;\n for (ll x = sx; x <= ex; x++) {\n for (ll y = sy; y <= ey; y++) {\n // println(x, y);\n if ((x == sx || x == ex) || (y == sy || y == ey)) {\n // println(\"outer\", x, y);\n outer.insert(board[x][y]);\n } else {\n // println(\"inner\", x, y);\n inner.insert(board[x][y]);\n inner_all.push_back(board[x][y]);\n }\n }\n }\n // printv(outer);\n // printv(inner);\n ll lower_outer = *outer.begin();\n ll upper_inner = *inner.rbegin();\n // println(lower_outer, upper_inner);\n if (lower_outer > upper_inner) {\n ll tot = 0;\n for (auto i : inner_all) {\n tot += (lower_outer - i);\n }\n best_ans = max(best_ans, tot);\n }\n }\n }\n }\n }\n println(best_ans);\n }\n\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3356,"score_of_the_acc":-1.7905,"final_rank":18},{"submission_id":"aoj_1618_8037499","code_snippet":"#include<bits/stdc++.h>\n\nusing namespace std;\nusing ll = long long;\nusing pint = pair<int,int>;\nconst int INF = 1e9;\n\nint main()\n{\n\n\tauto calc=[](vector<vector<int>> g) {\n\t\tint h=g.size();\n\t\tint w=g[0].size();\n\t\tint soto=g[0][0];\n\t\tfor(int i=0;i<h;i++)soto=min({soto,g[i][0],g[i][w-1]});\n\t\tfor(int i=0;i<w;i++)soto=min({soto,g[0][i],g[h-1][i]});\n\t\t\n\t\tint sum=0;\n\t\tfor(int i=1;i<h-1;i++){\n\t\t\tfor(int j=1; j<w-1;j++){\n\t\t\t\tif(g[i][j]>=soto)sum=-INF;\n\t\t\t\telse sum+=soto-g[i][j];\n\t\t\t}\n\t\t}\n\t\treturn sum;\n\t};\n\n\twhile(true) {\n\t\tint d,w;\n\t\tcin>>d>>w;\n\t\tif(d+w==0)break;\n\t\tvector<vector<int>> g(d,vector<int>(w));\n\t\tfor(auto &i:g)for(auto &j:i)cin>>j;\n\n\t\tauto get_grid = [&](int y1,int x1, int y2, int x2) {\n\t\t\tvector<vector<int>> grid(y2-y1,vector<int>(x2-x1));\n\t\t\tfor(int i=y1;i<y2;i++){\n\t\t\t\tfor(int j=x1;j<x2;j++){\n\t\t\t\t\tgrid[i-y1][j-x1]=g[i][j];\n\t\t\t\t}\n\t\t\t}\n\t\t\treturn grid;\n\t\t};\n\n\t\tint ans = -INF;\n\t\tfor(int y1=0;y1<d;y1++){\n\t\t\tfor(int x1=0;x1<w;x1++){\n\t\t\t\tfor(int y2=y1+3;y2<=d;y2++){\n\t\t\t\t\tfor(int x2=x1+3;x2<=w;x2++){\n\n\t\t\t\t\t\tvector<vector<int>> grid=get_grid(y1,x1,y2,x2);\n\t\t\t\t\t\tint ret=calc(grid);\n\t\t\t\t\t\tans=max(ans,ret);\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tcout<<(ans<0?0:ans)<<endl;\n\t}\n}","accuracy":1,"time_ms":10,"memory_kb":3352,"score_of_the_acc":-0.781,"final_rank":12},{"submission_id":"aoj_1618_6981089","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n int d, w, e[22][22], cnt[22][22], sum, ans;\n bool ike;\n while(cin >> d >> w, d!=0){\n for(int i=0;i<d;i++){\n for(int j=0;j<w;j++){\n cin >> e[i][j];\n cnt[i][j] = 0;\n }\n }\n ans = 0;\n for(int k=1;k<=9;k++){\n for(int i=0;i<d;i++){\n for(int j=0;j<w;j++){\n if(e[i][j] < k){\n cnt[i][j]++;\n }\n }\n }\n for(int y1=0;y1<d;y1++){\n for(int y2=y1+2;y2<d;y2++){\n for(int x1=0;x1<w;x1++){\n for(int x2=x1+2;x2<w;x2++){\n ike = true;\n sum = 0;\n if(count(cnt[y1]+x1, cnt[y1]+x2+1, 0) < x2-x1+1) ike = false;\n if(count(cnt[y2]+x1, cnt[y2]+x2+1, 0) < x2-x1+1) ike = false;\n for(int i=y1+1;i<y2;i++){\n if(cnt[i][x1]!=0 || cnt[i][x2]!=0 || count(cnt[i]+x1+1, cnt[i]+x2, 0) > 0) ike = false;\n sum += accumulate(cnt[i]+x1, cnt[i]+x2+1, 0);\n }\n if(ike){\n ans = max(ans, sum);\n }\n }\n }\n }\n }\n \n }\n cout << ans << endl;\n }\n return(0);\n}","accuracy":1,"time_ms":10,"memory_kb":3092,"score_of_the_acc":-0.1619,"final_rank":4},{"submission_id":"aoj_1618_6760796","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n\n#define rep(i, a, b) for (auto i = (a); i < (b); ++i)\n#define repc(i, a, b) for (auto i = (a); i <= (b); ++i)\n#define repr(i, a, b) for (int i = (a); i >= (b); --i)\n#define each_rev(itr, a) for (auto itr = rbegin(a); itr != rend(a); ++itr)\n#define fn1(x, expr) [&](const auto& x) { return (expr); }\n#define fn2(x, y, expr) [&](const auto& x, const auto& y) { return (expr); }\n#define pb push_back\n#define eb emplace_back\n#define LEN(a) int(a.size())\n#define all(a) begin(a), end(a)\n#define rall(a) rbegin(a), rend(a)\n#define lb(a, elem) distance(std::begin(a), lower_bound(all(a), (elem)))\n#define ub(a, elem) distance(std::begin(a), upper_bound(all(a), (elem)))\n#define MIN(a) (*min_element(all(a)))\n#define MAX(a) (*max_element(all(a)))\n#define UNIQ(a) a.erase(unique(all(a)), end(a))\n#define IN(x, begin, end) ((begin) <= (x) && (x) < (end))\n// type alias\n#define let const auto\nusing i64 = int64_t;\nusing u64 = uint64_t;\nusing i32 = int32_t;\nusing u32 = uint32_t;\nusing i128 = __int128_t;\nusing u128 = __uint128_t;\nusing pii = pair<int, int>;\nusing pll = pair<i64, i64>;\nusing ldouble = long double;\ntemplate <class T> using vec = std::vector<T>;\ntemplate <class T> using MaxHeap = std::priority_queue<T>;\ntemplate <class T> using MinHeap = std::priority_queue<T, std::vector<T>, std::greater<T>>;\n// constants\nconstexpr int INF = 0x3f3f3f3f;\nconstexpr i64 LINF = 0x3f3f3f3f3f3f3f3f;\nconstexpr double PI = 3.14159265358979323846;\nconstexpr std::pair<int, int> DIR4[] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};\nconstexpr std::pair<int, int> DIR8[] = {{-1, -1}, {0, -1}, {1, -1}, {-1, 0}, {1, 0}, {-1, 1}, {0, 1}, {1, 1}};\n// utils\ntemplate <class T, class U> inline bool chmin(T& a, const U& b) { return b < a && (a = b, true); }\ntemplate <class T, class U> inline bool chmax(T& a, const U& b) { return b > a && (a = b, true); }\ntemplate <class T> inline int sgn(T x) noexcept { return (T(0) < x) - (x < T(0)); }\ntemplate <class T, class U> inline auto divup(T a, U b) noexcept { return (a + b - 1) / b; }\ntemplate <class T, class U> inline auto sigma(const T& l, const U& r) noexcept { return (l + r) * (r - l + 1) / 2; }\ninline i64 sigma(int l, int r) noexcept { return sigma((i64)l, (i64)r); }\ninline i64 choose2(i64 n) noexcept { return n * (n - 1) >> 1; }\ninline void yes(bool x = true) { cout << (x ? \"yes\\n\" : \"no\\n\"); }\ninline void Yes(bool x = true) { cout << (x ? \"Yes\\n\" : \"No\\n\"); }\ninline void YES(bool x = true) { cout << (x ? \"YES\\n\" : \"NO\\n\"); }\n#define WHEN_BYTESIZE(T, bytes) template <typename T, std::enable_if_t<sizeof(T) == (bytes), std::nullptr_t> = nullptr>\nWHEN_BYTESIZE(T, 4) inline int popcnt(T n) { return __builtin_popcount((unsigned)n); }\nWHEN_BYTESIZE(T, 8) inline int popcnt(T n) { return __builtin_popcountll((unsigned long long)n); }\nWHEN_BYTESIZE(T, 4) inline int topbit(T n) { return n == 0 ? -1 : 31 - __builtin_clz((unsigned)n); }\nWHEN_BYTESIZE(T, 8) inline int topbit(T n) { return n == 0 ? -1 : 63 - __builtin_clzll((unsigned long long)n); }\nWHEN_BYTESIZE(T, 4) inline int lowbit(T n) { return n == 0 ? 32 : __builtin_ctz((unsigned)n); }\nWHEN_BYTESIZE(T, 8) inline int lowbit(T n) { return n == 0 ? 64 : __builtin_ctzll((unsigned long long)n); }\ntemplate <typename T> inline bool ispow2(T i) { return i && (i & -i) == i; }\n\ntemplate <class Container, enable_if_t<not is_same_v<typename Container::value_type, char>, nullptr_t> = nullptr>\nistream& operator>>(istream& is, Container& a) {\n for (auto&& e : a) is >> e;\n return is;\n}\nistream& operator>>(istream& is, vector<char>& a) {\n for (auto& c: a) is >> c;\n return is;\n}\ntemplate <class Container, enable_if_t<not is_same_v<typename Container::value_type, char>, nullptr_t> = nullptr>\nostream& operator<<(ostream& os, const Container& a) {\n if (&os != &cout) {\n os << '[';\n unsigned cnt = 0;\n for (auto it = begin(a); it != end(a) && cnt < 30; ++it, ++cnt) os << *it << (cnt + 1 < size(a) ? \", \" : \"\");\n if (cnt < size(a)) os << \"...\";\n return os << ']';\n }\n if (a.size() == 0) return os;\n os << *begin(a);\n for (auto it = next(begin(a)); it != end(a); ++it) os << ' ' << *it;\n return os;\n}\nostream& operator<<(ostream& os, const vector<char>& a) {\n os << '[';\n for (auto it = a.begin(); it != a.end(); ++it) {\n if (isprint(*it)) os << '\\'' << *it << '\\'';\n else os << int(*it);\n os << \" \"[it + 1 == a.end()];\n }\n return os << ']';\n}\ntemplate <class T, class U> istream& operator>>(istream& is, pair<T, U>& p) { return is >> p.first >> p.second; }\ntemplate <class T, class U> ostream& operator<<(ostream& os, const pair<T, U>& p) { return os << '(' << p.first << \", \" << p.second << ')'; }\n\nostream& operator<<(ostream& os, __uint128_t n) {\n if (n == 0) return os << '0';\n char buf[40]{};\n char* p = buf + 38;\n while (n) {\n *(p--) = char(n % 10) + '0';\n n /= 10;\n }\n return os << (p + 1);\n}\n\nostream& operator<<(ostream& os, __int128_t n) {\n if (n < 0) return os << '-' << __uint128_t(-n);\n return os << __uint128_t(n);\n}\n\nistream& operator>>(istream& is, __uint128_t& n) {\n int c;\n while (isspace(c = is.get()));\n n = unsigned(c - '0');\n while (isdigit(c = is.get())) n = n * 10 + unsigned(c - '0');\n return is;\n}\n\nistream& operator>>(istream& is, __int128_t& n) {\n int c;\n bool neg;\n while (isspace(c = is.get()));\n if (c == '-') {\n n = 0;\n neg = true;\n } else {\n n = c - '0';\n neg = false;\n }\n while (isdigit(c = is.get())) n = n * 10 + (c - '0');\n if (neg) n = -n;\n return is;\n}\n\ninline void echo() { std::cout << '\\n'; }\n\ntemplate <class Head, class... Tail>\ninline void echo(Head&& head, Tail&&... tail) {\n std::cout << head;\n if constexpr (sizeof...(tail)) std::cout << ' ';\n echo(std::forward<Tail>(tail)...);\n}\n\ntemplate <class... Args>\ninline void read(Args&... args) {\n (std::cin >> ... >> args);\n}\n\nstatic inline void __attribute__((constructor)) io_setup() {\n std::ios_base::sync_with_stdio(false);\n std::cin.tie(nullptr);\n std::cout << std::fixed << std::setprecision(10);\n}\n\n#ifdef LOCAL_DEBUG\n#define dump(...) (std::clog << \"\\e[34;1mL\" << __LINE__ << \": \\e[m\"), dbg_impl::dump_(dbg_impl::split_(#__VA_ARGS__).begin(), __VA_ARGS__)\nnamespace dbg_impl {\nvector<string> split_(const char* s) {\n vector<string> res;\n char buf[64], *end = buf;\n unsigned paren = 0, brace = 0;\n for (const char* p = s; *p != '\\0'; ++p) {\n if (*p == ' ') continue;\n if (*p == ',' && paren == 0 && brace == 0) {\n res.emplace_back(buf, end), end = buf;\n continue;\n }\n if (*p == '(') ++paren;\n if (*p == ')') --paren;\n if (*p == '{') ++brace;\n if (*p == '}') --brace;\n *end++ = *p;\n }\n res.emplace_back(buf, end);\n return res;\n}\nvoid dump_(vector<string>::iterator) { std::clog << std::endl; }\n\ntemplate <class Head, class... Tail>\nvoid dump_(vector<string>::iterator itr, Head&& head, Tail&&... tail) {\n std::clog << *itr << \"\\e[90;1m=\\e[33;1m\" << head << \"\\e[m, \";\n dump_(++itr, std::forward<Tail>(tail)...);\n}\n} // namespace dbg_impl\n#else\n#define dump(...) ((void)0)\n#endif\n\n#define INT(...) int __VA_ARGS__; read(__VA_ARGS__)\n#define LL(...) i64 __VA_ARGS__; read(__VA_ARGS__)\n#define STR(...) string __VA_ARGS__; read(__VA_ARGS__)\n#define CHR(...) char __VA_ARGS__; read(__VA_ARGS__)\n#define DBL(...) double __VA_ARGS__; read(__VA_ARGS__)\n#define VEC(type, name, len) vector<type> name(len); cin >> name\n\ntemplate <class T>\nstruct Cumsum {\n using value_type = T;\n std::valarray<T> data;\n Cumsum() = default;\n explicit Cumsum(const std::vector<T>& a) : data(a.size() + 1) {\n for (size_t i = 0; i < a.size(); ++i) data[i + 1] = data[i] + a[i];\n }\n //! range sum [l, r)\n inline const T sum(size_t l, size_t r) const {\n assert(l <= r);\n return data[r] - data[l];\n }\n inline size_t size() const { return data.size(); }\n inline auto begin() const { return std::begin(data); }\n inline auto end() const { return std::end(data); }\n};\n\ntemplate <class T, class Func>\ninline T bin_search(T ok, T ng, const Func& isOk) {\n while (std::abs(ok - ng) > 1) {\n const T mid = (ok + ng) >> 1;\n (isOk(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n\ntemplate <class ForwardItr>\nauto runlength(const ForwardItr begin, const ForwardItr end) {\n vector<pair<ForwardItr, size_t>> res;\n res.reserve(distance(begin, end));\n for (auto itr = begin; itr != end;) {\n size_t cnt = 1;\n const auto head = itr++;\n while (itr != end && *itr == *head) ++itr, ++cnt;\n res.emplace_back(head, cnt);\n }\n res.shrink_to_fit();\n return res;\n}\n\ntemplate <typename T>\nconstexpr T power(T x, int64_t exp) {\n T res(1);\n if (exp < 0) exp = -exp, x = 1 / x;\n for (; exp; exp >>= 1) {\n if (exp & 1) res *= x;\n x *= x;\n }\n return res;\n}\n\ntemplate <typename CostT>\nstruct WeightedEdge {\n using Self = WeightedEdge<CostT>;\n uint32_t to;\n CostT cost;\n\n WeightedEdge() = default;\n WeightedEdge(unsigned to_, CostT cost_) : to(to_), cost(cost_) {}\n operator int() const { return (int)to; }\n operator uint32_t() const { return (uint32_t)to; }\n bool operator<(const Self& other) const { return cost < other.cost; }\n bool operator>(const Self& other) const { return cost > other.cost; }\n bool operator<=(const Self& other) const { return cost <= other.cost; }\n bool operator>=(const Self& other) const { return cost >= other.cost; }\n friend ostream& operator<<(ostream& os, const Self& e) { return os << \"(to=\" << e.to << \", cost=\" << e.cost << \")\"; }\n};\ntemplate <class CostT>\nusing WGraph = vector<vector<WeightedEdge<CostT>>>;\n\nusing UWGraph = vector<vector<uint32_t>>;\n\nenum class Directed : bool { No, Yes };\n\ntemplate <Directed directed>\nUWGraph read_unweighted_graph(size_t vertex_num, size_t edge_num, bool decrement_node_id = true) {\n UWGraph g(vertex_num);\n for (size_t i = 0; i < edge_num; ++i) {\n uint32_t a, b;\n cin >> a >> b;\n if (decrement_node_id) --a, --b;\n g[a].push_back(b);\n if constexpr (directed == Directed::No) g[b].push_back(a);\n }\n return g;\n}\n\ntemplate <Directed directed, class CostT>\nWGraph<CostT> read_weighted_graph(size_t vertex_num, size_t edge_num, bool decrement_node_id = true) {\n WGraph<CostT> g(vertex_num);\n for (size_t i = 0; i < edge_num; ++i) {\n uint32_t a, b;\n CostT cost;\n cin >> a >> b >> cost;\n if (decrement_node_id) --a, --b;\n g[a].emplace_back(b, cost);\n if constexpr (directed == Directed::No) g[b].emplace_back(a, cost);\n }\n return g;\n}\n\n// -------------------- main --------------------\n\nint main() {\n int H, W;\n while (cin >> H >> W, H && W) {\n auto S = vector(H, vector(W, 0));\n rep(i, 0, H) {\n cin >> S[i];\n }\n\n int ans = 0;\n rep(sy, 0, H) rep(sx, 0, W) {\n rep(gy, sy + 2, H) rep(gx, sx + 2, W) {\n\n vec<int> inner;\n vec<int> outer;\n repc(i, sy, gy) repc(j, sx, gx) {\n if (i == sy || i == gy || j == sx || j == gx) {\n outer.push_back(S[i][j]);\n } else {\n inner.push_back(S[i][j]);\n }\n }\n\n let outer_min = MIN(outer);\n let inner_max = MAX(inner);\n if (outer_min <= inner_max) continue;\n\n int sum = 0;\n for (let x : inner) {\n sum += outer_min - x;\n }\n\n chmax(ans, sum);\n }\n }\n\n echo(ans);\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3380,"score_of_the_acc":-0.8476,"final_rank":14},{"submission_id":"aoj_1618_5970485","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\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 ALL(obj) (obj).begin(), (obj).end()\n#define vi vector<int>\n#define vvi vector<vector<int>>\n#define vs vector<string>\n#define vc vector<char>\n#define pii pair<int, int>\n#define us unordered_set\n#define ud unordered_dict\n#define um unordered_map\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#define Find(vec, n) find((vec).begin(), (vec).end(), n)\n#define rev_sort(vec) sort((vec).begin(), (vec).end(), greater<int>())\nusing Graph = vector<vector<int>>;\nconst int INF = 1LL << 60;\nconst int MOD = (int)1e9 + 7;\nconst double EPS = 1e-9;\n//const string alphabet = abcdefghijklmnopqrstuvwxyz;\n//const string Alphabet = ABCDEFGHIJKLMNOPQRSTUVWXYZ;\n\nsigned main() {\n int d, w;\n while (true) {\n cin >> d >> w;\n if (d == 0) break;\n\n vvi field(d, vector<int>(w));\n int intmp;\n REP(i, d) {\n REP(j, w) {\n cin >> intmp;\n field[i][j] = intmp;\n }\n }\n int ans = 0;\n\n FOR(height, 3, d+1) {\n FOR(width, 3, w+1) {\n REP(r_head, d+1-height) {\n REP(c_head, w+1-width) {\n vi out, in;\n FOR(r, r_head, r_head+height) {\n FOR(c, c_head, c_head+width) {\n if ((r == r_head || c == c_head) || (r == r_head+height-1 || c == c_head+width-1)) {\n out.push_back(field[r][c]);\n }\n else {\n in.push_back(field[r][c]);\n }\n }\n }\n int out_min = *min_element(ALL(out));\n int in_max = *max_element(ALL(in));\n if (out_min <= in_max) continue;\n int volume = out_min * in.size() - accumulate(ALL(in), 0);\n ans = max(ans, volume);\n }\n }\n }\n }\n\n cout << ans << endl;\n }\n\n}","accuracy":1,"time_ms":10,"memory_kb":3444,"score_of_the_acc":-1,"final_rank":16},{"submission_id":"aoj_1618_5849240","code_snippet":"#include <algorithm>\n#include <iomanip>\n#include <array>\n#include <bitset>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <deque>\n#include <functional>\n#include <iostream>\n#include <iterator>\n#include <map>\n#include <queue>\n#include <set>\n#include <string>\n#include <sstream>\n#include <unordered_map>\n#include <unordered_set>\n#include <utility>\n#include <numeric>\n#include <vector>\nusing namespace std;\n#if __has_include(<atcoder/all>)\n#include <atcoder/all>\nusing namespace atcoder;\n#endif\n#define GET_MACRO(_1, _2, _3, NAME, ...) NAME\n#define _rep(i, n) _rep2(i, 0, n)\n#define _rep2(i, a, b) for(int i = (int)(a); i < (int)(b); i++)\n#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\nusing i64 = long long;\ntemplate<class T, class U>\nbool chmin(T& a, const U& b) { return (b < a) ? (a = b, true) : false; }\ntemplate<class T, class U>\nbool chmax(T& a, const U& b) { return (b > a) ? (a = b, true) : false; }\n\ntemplate<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,v.size())i>>v[j];return i;}\ntemplate<typename T>string join(vector<T>&v){stringstream s;rep(i,v.size())s<<' '<<v[i];return s.str().substr(1);}\ntemplate<typename T>ostream& operator<<(ostream&o,vector<T>&v){if(v.size())o<<join(v);return o;}\ntemplate<typename T>string join(vector<vector<T>>&vv){string s=\"\\n\";rep(i,vv.size())s+=join(vv[i])+\"\\n\";return s;}\ntemplate<typename T>ostream& operator<<(ostream&o,vector<vector<T>>&vv){if(vv.size())o<<join(vv);return o;}\ntemplate<class T> using pq = priority_queue<T, vector<T>, greater<T>>;\n\nint main() {\n while(1) {\n int d, w;\n cin >> d >> w;\n if(d == 0 && w == 0) break;\n vector table(d, vector<int>(w));\n rep(i, d) rep(j, w) cin >> table[i][j];\n int ans = 0;\n rep(i1, d) {\n rep(j1, w){\n rep(i2, i1 + 1, d) {\n rep(j2, j1 + 1, w) {\n vector<int> out, in;\n //上\n rep(j3, j1, j2 + 1) out.push_back(table[i1][j3]);\n //下\n rep(j3, j1, j2 + 1) out.push_back(table[i2][j3]);\n //左\n rep(i3, i1, i2 + 1) out.push_back(table[i3][j1]);\n //右\n rep(i3, i1, i2 + 1) out.push_back(table[i3][j2]);\n rep(i3, i1 + 1, i2) {\n rep(j3, j1 + 1, j2) {\n in.push_back(table[i3][j3]);\n }\n }\n if(int(in.size()) == 0) continue;\n int out_min = *min_element(all(out));\n int in_max = *max_element(all(in));\n if(out_min <= in_max) continue;\n int now_ans = 0;\n for(auto now : in) now_ans += out_min - now;\n chmax(ans, now_ans);\n }\n }\n }\n }\n cout << ans << endl;\n } \n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3364,"score_of_the_acc":-0.8095,"final_rank":13},{"submission_id":"aoj_1618_5849233","code_snippet":"#include <algorithm>\n#include <iomanip>\n#include <array>\n#include <bitset>\n#include <cassert>\n#include <cmath>\n#include <cstdio>\n#include <deque>\n#include <functional>\n#include <iostream>\n#include <iterator>\n#include <map>\n#include <queue>\n#include <set>\n#include <string>\n#include <sstream>\n#include <unordered_map>\n#include <unordered_set>\n#include <utility>\n#include <numeric>\n#include <vector>\nusing namespace std;\n#if __has_include(<atcoder/all>)\n#include <atcoder/all>\nusing namespace atcoder;\n#endif\n#define GET_MACRO(_1, _2, _3, NAME, ...) NAME\n#define _rep(i, n) _rep2(i, 0, n)\n#define _rep2(i, a, b) for(int i = (int)(a); i < (int)(b); i++)\n#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)\n#define all(x) (x).begin(), (x).end()\n#define rall(x) (x).rbegin(), (x).rend()\nusing i64 = long long;\ntemplate<class T, class U>\nbool chmin(T& a, const U& b) { return (b < a) ? (a = b, true) : false; }\ntemplate<class T, class U>\nbool chmax(T& a, const U& b) { return (b > a) ? (a = b, true) : false; }\n\ntemplate<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,v.size())i>>v[j];return i;}\ntemplate<typename T>string join(vector<T>&v){stringstream s;rep(i,v.size())s<<' '<<v[i];return s.str().substr(1);}\ntemplate<typename T>ostream& operator<<(ostream&o,vector<T>&v){if(v.size())o<<join(v);return o;}\ntemplate<typename T>string join(vector<vector<T>>&vv){string s=\"\\n\";rep(i,vv.size())s+=join(vv[i])+\"\\n\";return s;}\ntemplate<typename T>ostream& operator<<(ostream&o,vector<vector<T>>&vv){if(vv.size())o<<join(vv);return o;}\ntemplate<class T> using pq = priority_queue<T, vector<T>, greater<T>>;\n\nint main() {\n while(1) {\n int d, w;\n cin >> d >> w;\n if(d == 0 && w == 0) break;\n vector table(d, vector<int>(w));\n rep(i, d) rep(j, w) cin >> table[i][j];\n int ans = 0;\n rep(i1, d) {\n rep(j1, w){\n rep(i2, i1 + 1, d) {\n rep(j2, j1 + 1, w) {\n vector<int> out, in;\n //上\n rep(j3, j1, j2 + 1) out.push_back(table[i1][j3]);\n // if(i1 == 0 && j1 == 0 && i2 == 2 && j2 == 3) {\n // cout << out << endl;\n // }\n //下\n rep(j3, j1, j2 + 1) out.push_back(table[i2][j3]);\n // if(i1 == 0 && j1 == 0 && i2 == 2 && j2 == 3) {\n // cout << out << endl;\n // }\n //左\n rep(i3, i1, i2 + 1) out.push_back(table[i3][j1]);\n // if(i1 == 0 && j1 == 0 && i2 == 2 && j2 == 3) {\n // cout << out << endl;\n // }\n //右\n rep(i3, i1, i2 + 1) out.push_back(table[i3][j2]);\n rep(i3, i1 + 1, i2) {\n rep(j3, j1 + 1, j2) {\n in.push_back(table[i3][j3]);\n }\n }\n if(int(in.size()) == 0) continue;\n int out_min = *min_element(all(out));\n int in_max = *max_element(all(in));\n if(out_min <= in_max) continue;\n int now_ans = 0;\n // cout << \"来てる\" << endl;\n for(auto now : in) now_ans += out_min - now;\n // cout << \"now_ans : \" << now_ans << endl;\n if(now_ans == 5) {\n // cout << i1 << \" \" << j1 << \" \" << i2 << \" \" << j2 << endl;\n // cout << \"out : \" << out << endl;\n // cout << \"in : \" << in << endl;\n }\n chmax(ans, now_ans);\n }\n }\n }\n }\n cout << ans << endl;\n } \n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3336,"score_of_the_acc":-0.7429,"final_rank":10},{"submission_id":"aoj_1618_4939903","code_snippet":"#include <bits/stdc++.h>\n\n#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"Ofast\")\n#pragma GCC optimize(\"unroll-loops\")\n//#include <boost/multiprecision/cpp_int.hpp>\nusing namespace std;\n\n//using namespace boost::multiprecision;\n//#include<atcoder/all>\n//using namespace atcoder;\n\nusing dou =long double;\nstring yes=\"yes\";\nstring Yes=\"Yes\";\nstring YES=\"YES\";\nstring no=\"no\";\nstring No=\"No\";\nstring NO=\"NO\";\n\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }\ntypedef long long ll;\ntypedef pair<int,int> P;\ntypedef pair<ll,ll> PL;\n\nconst ll mod = 998244353ll;\n//const ll mod = 1000000007ll;\n//const ll mod = 100000;\n\n\nstruct mint {\n ll x; // typedef long long ll;\n mint(ll x=0):x((x%mod+mod)%mod){}\n mint operator-() const { return mint(-x);}\n mint& operator+=(const mint a) {\n if ((x += a.x) >= mod) x -= mod;\n return *this;\n }\n mint& operator-=(const mint a) {\n if ((x += mod-a.x) >= mod) x -= mod;\n return *this;\n }\n mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}\n mint operator+(const mint a) const { return mint(*this) += a;}\n mint operator-(const mint a) const { return mint(*this) -= a;}\n mint operator*(const mint a) const { return mint(*this) *= a;}\n mint pow(ll t) const {\n if (!t) return 1;\n mint a = pow(t>>1);\n a *= a;\n if (t&1) a *= *this;\n return a;\n }\n\n // for prime modhttps://atcoder.jp/contests/abc166/submit?taskScreenName=abc166_f\n mint inv() const { return pow(mod-2);}\n mint& operator/=(const mint a) { return *this *= a.inv();}\n mint operator/(const mint a) const { return mint(*this) /= a;}\n};\n\nistream& operator>>(istream& is, const mint& a) { return is >> a.x;}\nostream& operator<<(ostream& os, const mint& a) { return os << a.x;}\n\n#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)\n#define brep(n) for(int bit=0;bit<(1<<n);bit++)\n#define bbrep(n) for(int bbit=0;bbit<(1<<n);bbit++)\n#define erep(i,container) for (auto &i : container)\n#define itrep(i,container) for (auto i : container)\n#define irep(i, n) for(ll i = n-1; i >= (ll)0ll; i--)\n#define rrep(i,m,n) for(ll i = m; i < (ll)(n); i++)\n#define reprep(i,j,h,w) rep(i,h)rep(j,w)\n#define repreprep(i,j,k,h,w,n) rep(i,h)rep(j,w)rep(k,n)\n#define all(x) (x).begin(),(x).end()\n#define rall(x) (x).rbegin(),(x).rend()\n#define VEC(type,name,n) std::vector<type> name(n);rep(i,n)std::cin >> name[i];\n#define pb push_back\n#define pf push_front\n#define query int qq;std::cin >> qq;rep(qqq,qq)\n#define lb lower_bound\n#define ub upper_bound\n#define fi first\n#define se second\n#define itn int\n#define mp make_pair\n//#define sum(a) accumulate(all(a),0ll)\n#define keta fixed<<setprecision\n#define vout(a) erep(qxqxqx,a)std::cout << qxqxqx << ' ';std::cout << std::endl;\n#define vvector(name,typ,m,n,a)vector<vector<typ> > name(m,vector<typ> (n,a))\n//#define vvector(name,typ,m,n)vector<vector<typ> > name(m,vector<typ> (n))\n#define vvvector(name,t,l,m,n,a) vector<vector<vector<t> > > name(l, vector<vector<t> >(m, vector<t>(n,a)));\n#define vvvvector(name,t,k,l,m,n,a) vector<vector<vector<vector<t> > > > name(k,vector<vector<vector<t> > >(l, vector<vector<t> >(m, vector<t>(n,a)) ));\n#define case std::cout <<\"Case #\" <<qqq+1<<\":\"\n#define RES(a,i,j) a.resize(i);rep(ii,i)a[ii].resize(j);\n#define RESRES(a,i,j,k) a.resize(i);rep(ii,i)a[ii].resize(j);reprep(ii,jj,i,j){dp[ii][jj].resize(k)};\n#define res resize\n#define as assign\n#define ffor for(;;)\n#define ppri(a,b) std::cout << a<<\" \"<<b << std::endl\n#define pppri(a,b,c) std::cout << a<<\" \"<<b <<\" \"<< c<<std::endl\n#define ppppri(a,b,c,d) std::cout << a<<\" \"<<b <<\" \"<< c<<' '<<d<<std::endl\n#define aall(x,n) (x).begin(),(x).begin()+(n)\n#define SUM(a) accumulate(all(a),0ll) \n#define stirng string\n#define gin(a,b) int a,b;std::cin >> a>>b;a--;b--;\n#define popcount __builtin_popcount\n#define permu(a) next_permutation(all(a))\n#define aru(a,d) a.find(d)!=a.end()\n\n//#define grid_input(a,type) int h,w;std::cin >> h>>w;vvector(a,type,h,w,0);reprep(i,j,h,w)std::cin >> a[i][j];\n\n//typedef long long T;\nll ceili(ll a,ll b){\n return ((a+b-1)/b);\n}\nconst int INF = 2'000'000'000;\nconst ll INF64 =32233720854775807ll;\n//const ll INF64 = 9223372036854775807ll;\n\n//const ll INF64 = 243'000'000'000'000'000'0;\n\n\n//const ll MOD = 100'000'000'7ll;\nconst ll MOD = 998244353ll;\n//const ll MOD = 1000003ll;\nconst ll OD = 1000000000000007ll;\nconst dou pi=3.141592653589793;\n\nlong long modpow(long long a, long long n) { //累乗の剰余\n long long res = 1;\n while (n > 0) {\n if (n & 1) res = res * a % MOD;\n a = a * a % MOD;\n n >>= 1;\n }\n return res;\n}\n\n//メモ\n//ゲーム(Grundy数とか)の復習をする\n//リスニング力をどうにかする\n//モノイドをやる！！！！\n//特に理由がなければllを使おうキャンペーン\n//個数制限付きナップサックの復習\n//戻すDP\n//周期性の解析結果の考察をする\n//いい加減英語スライドを作り始める\n//改良モデルを深堀りすると良さそう\n//被服調査票を提出する\n//PGバトル 10/24 13:00~\n//学科棟まで書類を受け取りに行く\n//全方位木DPとスライド最小値\n//やること困ったらSRM 500番台やるといいかも\n\nint main(){\n ffor{\n int h,w;\n std::cin >> h>>w;\n if(h==0)break;\n vvector(a,int,h,w,0);\n reprep(i,j,h,w)std::cin >> a[i][j];\n int ans=0;\n reprep(i,j,h,w){\n rrep(ii,i+2,h){\n rrep(jj,j+2,w){\n bool ok=1;\n std::vector<int> d;\n int ma=0,mi=INF;\n rrep(y,i,ii+1){\n rrep(x,j,jj+1){\n if(y==i||y==ii||x==j||x==jj){\n chmin(mi,a[y][x]);\n }\n else{\n chmax(ma,a[y][x]);\n d.pb(a[y][x]);\n }\n }\n }\n if(mi<=ma)continue;\n int dum=0;\n erep(p,d)dum+=mi-p;\n chmax(ans,dum);\n }\n }\n }\n std::cout << ans << std::endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3188,"score_of_the_acc":-0.3905,"final_rank":9},{"submission_id":"aoj_1618_4892512","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define N (1000000000+7)\n//#define N (998244353)\n#define INF 1e16\ntypedef long long ll;\n\nint board[20][20];\n\nint calc(int x,int y,int z, int w){\n int M1= 1000;\n vector<int>s;\n for(int i=x;i<=y;i++){\n for(int j=z;j<=w;j++){\n if(i==x||i==y){\n M1 = min(M1,board[i][j]);\n }\n else{\n if(j==z||j==w){\n M1 = min(M1,board[i][j]);\n }\n else{\n s.push_back(board[i][j]);\n }\n }\n }\n }\n sort(s.begin(),s.end(),greater<int>());\n if(M1<=s[0])return 0;\n else{\n int ans = 0;\n for(int i=0;i<s.size();i++){\n ans+=abs(M1-s[i]);\n }\n return ans;\n }\n\n}\n\nint main(void){\n while(true){\n int d,w;\n cin>>d>>w;\n if(d==0 && w==0)break;\n for(int i=0;i<d;i++){\n for(int j=0;j<w;j++){\n cin>>board[i][j];\n }\n }\n int ans = 0;\n for(int i=0;i<d;i++){\n for(int j=i+2;j<d;j++){\n for(int k=0;k<w;k++){\n for(int l=k+2;l<w;l++){\n ans = max(ans,calc(i,j,k,l));\n }\n }\n }\n }\n cout<<ans<<endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3436,"score_of_the_acc":-0.981,"final_rank":15},{"submission_id":"aoj_1618_4887439","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#define int long long\n\n// debug methods\n// usage: debug(x,y);\n#define CHOOSE(a) CHOOSE2 a\n#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x\n#define debug_1(x1) cout<<#x1<<\": \"<<x1<<endl\n#define debug_2(x1,x2) cout<<#x1<<\": \"<<x1<<\", \"#x2<<\": \"<<x2<<endl\n#define debug_3(x1,x2,x3) cout<<#x1<<\": \"<<x1<<\", \"#x2<<\": \"<<x2<<\", \"#x3<<\": \"<<x3<<endl\n#define debug_4(x1,x2,x3,x4) cout<<#x1<<\": \"<<x1<<\", \"#x2<<\": \"<<x2<<\", \"#x3<<\": \"<<x3<<\", \"#x4<<\": \"<<x4<<endl\n#define debug_5(x1,x2,x3,x4,x5) cout<<#x1<<\": \"<<x1<<\", \"#x2<<\": \"<<x2<<\", \"#x3<<\": \"<<x3<<\", \"#x4<<\": \"<<x4<<\", \"#x5<<\": \"<<x5<<endl\n#ifdef _DEBUG\n#define debug(...) CHOOSE((__VA_ARGS__,debug_5,debug_4,debug_3,debug_2,debug_1,~))(__VA_ARGS__)\n#else\n#define debug(...)\n#endif\n\n#define MAX_N (1000006)\n#define INF (1LL << 60)\nconst int MOD = (int)1e9 + 7;\n\n\nsigned main(){\n while(1){\n int d,w;\n cin >> d >> w;\n if(d==0)break;\n vector<vector<int>> e(d, vector<int>(w));\n for(int i=0; i<d; i++)\n for(int j=0; j<w; j++)\n cin >> e[i][j];\n\n int ans = 0;\n for(int i=0; i<d; i++){\n for(int j=0; j<w; j++){\n // (i,j) (k,l) が池\n for(int k=i; k<d; k++){\n for(int l=j; l<w; l++){\n int mn = INF;\n vector<int> inner;\n for(int p=i; p<=k; p++){\n for(int q=j; q<=l; q++){\n if(p==i || p==k || q==j || q==l) {\n mn = min(mn, e[p][q]);\n } else {\n inner.push_back(e[p][q]);\n }\n }\n }\n if(inner.empty()) continue;\n int sum = 0;\n bool f=true;\n for(auto x: inner) {\n if(mn-x<=0){\n f=false;\n break;\n }\n sum += mn-x;\n }\n if(f){\n ans = max(ans, sum);\n }\n }\n }\n }\n }\n cout << ans << endl;\n }\n}\n\n/*\n\n*/","accuracy":1,"time_ms":10,"memory_kb":3152,"score_of_the_acc":-0.3048,"final_rank":7},{"submission_id":"aoj_1618_3957502","code_snippet":"#include <bits/stdc++.h>\n#define REP(i, n) for (int i = 0; i < (int)(n); i++)\nusing namespace std;\n\nint main() {\n for (int d, w; cin >> d >> w, d;) {\n vector<vector<int>> e(d, vector<int>(w));\n REP(i, d) REP(j, w) cin >> e[i][j];\n int ans = 0;\n REP(sx, d) REP(sy, w) {\n REP(tx, d) REP(ty, w) {\n if (sx >= tx || sy >= ty) continue;\n int mn = 1e9;\n REP(i, d) {\n if (i < sx || i > tx) continue;\n mn = min(mn, e[i][sy]);\n mn = min(mn, e[i][ty]);\n }\n REP(j, w) {\n if (j < sy || j > ty) continue;\n mn = min(mn, e[sx][j]);\n mn = min(mn, e[tx][j]);\n }\n bool f = false;\n int c = 0;\n REP(i, d) REP(j, w) {\n if (i <= sx || i >= tx) continue;\n if (j <= sy || j >= ty) continue;\n if (mn <= e[i][j]) f = true;\n c += mn - e[i][j];\n }\n if (f) continue;\n ans = max(ans, c);\n }\n }\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3036,"score_of_the_acc":-0.0286,"final_rank":2},{"submission_id":"aoj_1618_3727368","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for(long long int i=0;i<n;++i)\ntypedef long long int ll;\n\nint func(vector<vector<int>> m,int a,int b,int c,int d){\n int ret=10;\n for(int i=b;i<=d;i++){\n ret=min({ret,m[a][i],m[c][i]});\n }\n for(int i=a;i<=c;i++){\n ret=min({ret,m[i][b],m[i][d]});\n }\n int ff=-1;\n a++;b++;c--;d--;\n for(int i=b;i<=d;i++){\n ff=max({ff,m[a][i],m[c][i]});\n }\n for(int i=a;i<=c;i++){\n ff=max({ff,m[i][b],m[i][d]});\n }\n if(ff>=ret){\n ret=-1;\n }\n return ret;\n}\n\nint main(){\n\n while(1){\n int d,w;\n cin >> d >> w;\n if(d==0)break;\n vector<vector<int>> m(d,vector<int>(w));\n for(int i=0;i<d;i++){\n for(int j=0;j<w;j++){\n cin >> m[i][j];\n }\n }\n int ans=0;\n for(int i=0;i<=d-3;i++){\n for(int j=0;j<=w-3;j++){\n for(int k=i+2;k<d;k++){\n for(int l=j+2;l<w;l++){\n int mi=func(m,i,j,k,l);\n int su=0;\n if(mi==-1)continue;\n for(int s=i+1;s<k;s++){\n for(int t=j+1;t<l;t++){\n su+=max(0,mi-m[s][t]);\n }\n }\n ans=max(ans,su);\n }\n }\n }\n }\n cout << ans << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3060,"score_of_the_acc":-0.0857,"final_rank":3},{"submission_id":"aoj_1618_3680133","code_snippet":"#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\n\n\nint main(){\n\nwhile(1){\n int d,w;\n cin >> d >>w;\n if(d==0 && w==0)break;\n int ground[d][w];\n for(int i=0;i<d;i++){\n for(int j=0;j<w;j++){\n cin >>ground[i][j];\n }\n }\n int ans=0;\n vector<int> lake(0);\n vector<int> wall(0);\n for(int dstart=0;dstart<d-2;dstart++){\n for(int dend=dstart+2;dend<d;dend++){\n for(int wstart=0;wstart<w-2;wstart++){\n for(int wend=wstart+2;wend<w;wend++){\n lake.clear();\n wall.clear();\n for(int dd=dstart;dd<=dend;dd++){\n for(int ww=wstart;ww<=wend;ww++){\n if(dd==dstart || dd==dend || ww==wstart|| ww==wend){\n wall.push_back(ground[dd][ww]);\n }\n else lake.push_back(ground[dd][ww]);\n }\n }\n if(wall.size()!=0)sort(wall.begin(),wall.end());\n if(lake.size()!=0){\n sort(lake.begin(),lake.end());\n reverse(lake.begin(),lake.end());\n }\n int temp=0;\n for(int pl=0;pl<lake.size();pl++)temp+=(wall[0]-lake[pl]);\n if(wall[0]<=lake[0])temp=0;\n ans=max(ans,temp);\n }\n }\n }\n }\n cout << ans <<endl;\n }\n\n}","accuracy":1,"time_ms":10,"memory_kb":3100,"score_of_the_acc":-0.181,"final_rank":5},{"submission_id":"aoj_1618_3677912","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint solve(int d, int w) {\n int e[d][w];\n for (int i = 0; i < d; i++) {\n for (int j = 0; j < w; j++) {\n cin >> e[i][j];\n }\n }\n int ans = 0;\n for (int x1 = 0; x1 < d; x1++) {\n for (int x2 = 0; x2 < d; x2++) {\n if (x2 - x1 < 2) continue;\n for (int y1 = 0; y1 < w; y1++) {\n for (int y2 = 0; y2 < w; y2++) {\n if (y2 - y1 < 2) continue;\n int inner_height = 0;\n int surround_height = 100;\n int inner_sum = 0;\n int counter = 0;\n for (int i = 0; i < d; i++) {\n for (int j = 0; j < w; j++) {\n if (x1 < i && i < x2 && y1 < j && j < y2) {\n inner_height = max(inner_height, e[i][j]);\n inner_sum += e[i][j];\n counter++;\n }\n if (x1 <= i && i <= x2 && (j == y1 || j == y2)) {\n surround_height = min(surround_height, e[i][j]);\n }\n if (y1 <= j && j <= y2 && (i == x1 || i == x2)) {\n surround_height = min(surround_height, e[i][j]);\n }\n }\n }\n if (surround_height > inner_height) {\n int tmp = counter * surround_height - inner_sum;\n ans = max(ans, tmp);\n }\n }\n }\n }\n }\n return ans;\n}\n\nint main() {\n int d, w;\n while (true) {\n cin >> d >> w;\n if (!d && !w) return 0;\n cout << solve(d, w) << endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3024,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_1618_3342793","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = int64_t;\nusing P = pair<ll, ll>;\n\nconst ll INF = 5e15;\n\nint main(){\n while(1){\n ll H, W;\n ll ans = 0;\n cin >> H >> W;\n if(!H && !W) break;\n vector<vector<ll>> V(H, vector<ll>(W));\n for(auto &v : V) for(auto &e : v) cin >> e;\n for(ll up = 0; up < H; up++){\n for(ll down = up + 2; down < H; down++){\n for(ll left = 0; left < W; left++){\n for(ll right = left + 2; right < W; right++){\n ll mine = INF, maxl = 0;\n ll suml = 0;\n for(ll h = 0; h < H; h++){\n for(ll w = 0; w < W; w++){\n if(!(left <= w && w <= right &&\n up <= h && h <= down)) continue;\n if(h == up || \n h == down ||\n w == left || \n w == right){\n mine = min(mine, V[h][w]);\n }else{\n maxl = max(maxl, V[h][w]);\n suml += V[h][w];\n }\n }\n }\n if(mine <= maxl) continue;\n ll lenh = down - up + 1;\n ll lenw = right - left + 1;\n ll area = lenh * lenw - 2 * lenh - 2 * lenw + 4;\n ans = max(ans, area * mine - suml);\n }\n }\n }\n }\n cout << ans << '\\n';\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3156,"score_of_the_acc":-0.3143,"final_rank":8},{"submission_id":"aoj_1618_2883107","code_snippet":"#include<iostream>\n#include<algorithm>\n#include<vector>\n\nusing namespace std;\n\nstruct Pond\n{\n int up,down,left,right;\n vector<int> canal;\n vector<int> moat;\n int min,max;\n void make(int up,int down,int left,int right,vector<int> canal,vector<int>moat)\n {\n this->up=up; this->down=down; this->left=left; this->right=right;\n this->canal=canal; this->moat=moat;\n }\n void setVals(){\n max= *max_element(canal.begin(),canal.end());\n min= *min_element(moat.begin(),moat.end());\n }\n bool isMake()\n {\n return (max<min);\n }\n};\n\nint calc(Pond pond)\n{\n int sum=0;\n for(int i=0;i<pond.canal.size();i++){\n sum+=pond.min-pond.canal[i];\n }\n return sum;\n}\nvoid print(vector<int> list){\n for(int x:list) cout<<x<<\" \";\n cout<<endl;\n}\nint main()\n{\n while(1){\n int depth,width;\n vector<int> canal(0),moat(0);\n cin>>depth>>width;\n int stage[depth][width];\n if((depth==0)and(width==0)) return 0;\n \n for(int i=0;i<depth;i++){\n for(int j=0;j<width;j++){\n\tcin>>stage[i][j];\n }\n }\n int mx=0;\n for(int up=0;up<depth-1;up++){\n for(int left=0;left<width-1;left++){\n\tfor(int down=up+2;down<depth;down++){\n\t for(int right=left+2;right<width;right++){\n\t //cout<<\"up=\"<<up<<\" down=\"<<down<<endl;\n\t //cout<<\"left=\"<<left<<\" right=\"<<right<<endl;\n\t canal.resize(0);\n\t moat.resize(0);\n\t for(int s=up;s<=down;s++){\n\t for(int t=left;t<=right;t++){\n\t\t//cout<<\"s=\"<<s<<\" t=\"<<t<<endl;\n\t\tif((s!=up and s!=down)and(t!=left and t!=right)){\n\t\t //cout<<\"canal.push(\"<<stage[s][t]<<\")\"<<endl;\n\t\t canal.push_back(stage[s][t]);\n\t\t}else{\n\t\t //cout<<\"moat.push(\"<<stage[s][t]<<\")\"<<endl;\n\t\t moat.push_back(stage[s][t]);\n\t\t}\n\t }\n\t }\n\t //print(canal);\n\t //print(moat);\n\t Pond pond;\n\t pond.make(up,down,left,right,canal,moat);\n\t pond.setVals();\n\t //cout<<\"make pond:\"<<endl;\n\t if(pond.isMake()){\n\t //cout<<\"judge=YES\"<<endl;\n\t mx=max(mx,calc(pond));\n\t }else{\n\t //cout<<\"judge=NO\"<<endl;\n\t }\n\t }\n\t}\n }\n }\n //cout<<\"count=\"<<count<<endl;\n cout<<mx<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3140,"score_of_the_acc":-0.2762,"final_rank":6}],"string":"[\n {\n \"submission_id\": \"aoj_1618_10542183\",\n \"code_snippet\": \"#include<iostream>\\n#include<cmath>\\n#include<string>\\n#include<vector>\\n#include<algorithm>\\n#include<tuple>\\n#include<map>\\n#include<queue>\\n#include<set>\\n#include<unordered_set>\\n#include<stack>\\n#include<deque>\\n#include<bitset>\\n#include<cassert>\\n#include<numeric>\\n#include<regex>\\n#define ll long long\\n#define int_max ((int)2147483647)\\n#define ll_max ((ll)9223372036854775807)\\n#define all(a) (a).begin(), (a).end()\\nusing namespace std;\\n\\nvoid solve(const int d, const int w){\\n\\n vector<vector<int>> grid(d,vector<int>(w));\\n\\n for(int i=0;i<d;i++){\\n for(int j=0;j<w;j++){\\n cin>>grid[i][j];\\n }\\n }\\n\\n int ans=0;\\n\\n for(int h = 1; h < 10; h++){\\n vector<vector<int>> lake(d,vector<int>(w));\\n for(int i = 0; i < d; i++){\\n for(int j = 0; j < w; j++){\\n lake[i][j] = max(0, h - grid[i][j]);\\n }\\n }\\n\\n for(int i = 1; i < d-1; i++){\\n for(int j = 1; j < w-1; j++){\\n for(int x = i; x < d-1; x++){\\n for(int y = j; y < w-1; y++){\\n \\n int v = 0;\\n bool isLake = true;\\n\\n for(int k = i-1; k <= x+1; k++){\\n for(int l = j-1; l <= y+1; l++){\\n if((k == i-1 || k == x+1) || (l == j-1 || l == y+1)){\\n if(lake[k][l] != 0){\\n isLake = false;\\n }\\n }\\n else{\\n if(lake[k][l] == 0){\\n isLake = false;\\n }\\n else{\\n v += lake[k][l];\\n }\\n }\\n }\\n }\\n\\n if(isLake){\\n ans = max(ans, v);\\n }\\n }\\n }\\n }\\n }\\n }\\n\\n cout<<ans<<endl;\\n\\n}\\n\\nint main(){\\n\\n int d,w;\\n cin>>d>>w;\\n\\n while(0<d+w){\\n solve(d,w);\\n cin>>d>>w;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3380,\n \"score_of_the_acc\": -1.3476,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1618_9405426\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long;\\nusing vi = vector<int>;\\nusing vl = vector<long long>;\\nusing vs = vector<string>;\\nusing vc = vector<char>;\\nusing vb = vector<bool>;\\nusing vpii = vector<pair<int, int>>;\\nusing vpll = vector<pair<long long, long long>>;\\nusing vvi = vector<vector<int>>;\\nusing vvl = vector<vector<long long>>;\\nusing vvc = vector<vector<char>>;\\nusing vvvi = vector<vector<vector<int>>>;\\nusing pii = pair<int, int>;\\nusing vvb = vector<vector<bool>>;\\nusing Graph = vector<vector<ll>>;\\nconst ll LINF = 1001002003004005006ll;\\nconst int INF = 1001001001;\\nconst int MOD = 998244353;\\n\\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\\n#define rep3(i, m, n) for (int i = (m); i < (int)(n); i++)\\n#define rrep(i, m, n) for (int i = (m); i >= (int)(n); i--)\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\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\\nvi dx4 = {1, 0, -1, 0}, dy4 = {0, 1, 0, -1};\\nvi dx8 = {1, 1, 1, 0, 0, -1, -1, -1}, dy8 = {1, 0, -1, 1, -1, 1, 0, -1};\\n\\nint solve(vvi e, int t, int b, int l, int r)\\n{\\n int min = INF;\\n rep3(i, t, b + 1) { chmin(min, e[i][l]); }\\n rep3(i, t, b + 1) { chmin(min, e[i][r]); }\\n rep3(i, l, r + 1) { chmin(min, e[t][i]); }\\n rep3(i, l, r + 1) { chmin(min, e[b][i]); }\\n int max = 0;\\n rep3(i, t + 1, b)\\n {\\n rep3(j, l + 1, r) { chmax(max, e[i][j]); }\\n }\\n if (min <= max)\\n {\\n return 0;\\n }\\n int res = 0;\\n rep3(i, t + 1, b)\\n {\\n rep3(j, l + 1, r) { res += min - e[i][j]; }\\n }\\n return res;\\n}\\n\\nint main()\\n{\\n while (1)\\n {\\n // 宣言・入力の受け取り\\n int d, w;\\n cin >> d >> w;\\n // 終了条件\\n if (d == 0 && w == 0)\\n {\\n break;\\n }\\n // 宣言・入力の受け取り\\n vvi e(d, vi(w));\\n rep(i, d)\\n {\\n rep(j, w) { cin >> e[i][j]; }\\n }\\n // solve\\n int ans = 0;\\n rep(t, d)\\n {\\n rep(l, w)\\n {\\n rep(b, d)\\n {\\n rep(r, w)\\n {\\n if (t + 2 <= b && l + 2 <= r)\\n {\\n chmax(ans, solve(e, t, b, l, r));\\n }\\n }\\n }\\n }\\n }\\n // 出力\\n cout << ans << '\\\\n';\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3344,\n \"score_of_the_acc\": -0.7619,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1618_9377643\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n// #include <atcoder/all>\\n\\nusing namespace std;\\n// using namespace atcoder;\\ntypedef long long ll;\\ntemplate <class T, class... Ts>\\nvoid println(const T& a, const Ts&... b) {\\n cout << a;\\n (void)(cout << ... << (cout << ' ', b));\\n cout << '\\\\n';\\n}\\ntemplate <class T>\\nvoid printv(const T& a, string sep = \\\" \\\", string end = \\\"\\\\n\\\") {\\n for (auto x : a) {\\n (void)(cout << x << sep);\\n }\\n cout << end;\\n}\\nvoid println() { cout << '\\\\n'; }\\ntemplate <class T, class... Ts>\\nvoid eprintln(const T& a, const Ts&... b) {\\n cerr << a;\\n (void)(cerr << ... << (cerr << ' ', b));\\n cerr << '\\\\n';\\n}\\ntemplate <class T>\\nvoid eprintv(const T& a, string sep = \\\" \\\", string end = \\\"\\\\n\\\") {\\n for (auto x : a) {\\n (void)(cerr << x << sep);\\n }\\n cerr << end;\\n}\\nvoid eprintln() { cerr << '\\\\n'; }\\ntemplate <class... T>\\nvoid input(T&... a) { (cin >> ... >> a); }\\n#define rep(i, n) for (ll i = 0; i < n; i++)\\n#define rep1(i, n) for (ll i = 1; i <= n; i++)\\n#define yesno(a) cout << (a ? \\\"Yes\\\" : \\\"No\\\") << '\\\\n';\\n#define YESNO(a) cout << (a ? \\\"YES\\\" : \\\"NO\\\") << '\\\\n';\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout.tie(nullptr);\\n cout << fixed << setprecision(15);\\n\\n while (1) {\\n ll n, m;\\n input(n, m);\\n if (n == 0 && m == 0) break;\\n\\n vector<vector<ll>> board(n, vector<ll>(m));\\n rep(i, n) rep(j, m) input(board[i][j]);\\n\\n // rep(sx, n - 2) {\\n ll best_ans = 0;\\n for (ll sx = 0; sx < n - 2; sx++) {\\n for (ll ex = sx + 2; ex < n; ex++) {\\n for (ll sy = 0; sy < m - 2; sy++) {\\n for (ll ey = sy + 2; ey < m; ey++) {\\n // println(\\\"RANGE\\\", sx, ex, sy, ey);\\n ll maxv = 0;\\n ll minv = LLONG_MAX;\\n set<ll> outer, inner;\\n vector<ll> inner_all;\\n for (ll x = sx; x <= ex; x++) {\\n for (ll y = sy; y <= ey; y++) {\\n // println(x, y);\\n if ((x == sx || x == ex) || (y == sy || y == ey)) {\\n // println(\\\"outer\\\", x, y);\\n outer.insert(board[x][y]);\\n } else {\\n // println(\\\"inner\\\", x, y);\\n inner.insert(board[x][y]);\\n inner_all.push_back(board[x][y]);\\n }\\n }\\n }\\n // printv(outer);\\n // printv(inner);\\n ll lower_outer = *outer.begin();\\n ll upper_inner = *inner.rbegin();\\n // println(lower_outer, upper_inner);\\n if (lower_outer > upper_inner) {\\n ll tot = 0;\\n for (auto i : inner_all) {\\n tot += (lower_outer - i);\\n }\\n best_ans = max(best_ans, tot);\\n }\\n }\\n }\\n }\\n }\\n println(best_ans);\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3356,\n \"score_of_the_acc\": -1.7905,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1618_8037499\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n\\nusing namespace std;\\nusing ll = long long;\\nusing pint = pair<int,int>;\\nconst int INF = 1e9;\\n\\nint main()\\n{\\n\\n\\tauto calc=[](vector<vector<int>> g) {\\n\\t\\tint h=g.size();\\n\\t\\tint w=g[0].size();\\n\\t\\tint soto=g[0][0];\\n\\t\\tfor(int i=0;i<h;i++)soto=min({soto,g[i][0],g[i][w-1]});\\n\\t\\tfor(int i=0;i<w;i++)soto=min({soto,g[0][i],g[h-1][i]});\\n\\t\\t\\n\\t\\tint sum=0;\\n\\t\\tfor(int i=1;i<h-1;i++){\\n\\t\\t\\tfor(int j=1; j<w-1;j++){\\n\\t\\t\\t\\tif(g[i][j]>=soto)sum=-INF;\\n\\t\\t\\t\\telse sum+=soto-g[i][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn sum;\\n\\t};\\n\\n\\twhile(true) {\\n\\t\\tint d,w;\\n\\t\\tcin>>d>>w;\\n\\t\\tif(d+w==0)break;\\n\\t\\tvector<vector<int>> g(d,vector<int>(w));\\n\\t\\tfor(auto &i:g)for(auto &j:i)cin>>j;\\n\\n\\t\\tauto get_grid = [&](int y1,int x1, int y2, int x2) {\\n\\t\\t\\tvector<vector<int>> grid(y2-y1,vector<int>(x2-x1));\\n\\t\\t\\tfor(int i=y1;i<y2;i++){\\n\\t\\t\\t\\tfor(int j=x1;j<x2;j++){\\n\\t\\t\\t\\t\\tgrid[i-y1][j-x1]=g[i][j];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\treturn grid;\\n\\t\\t};\\n\\n\\t\\tint ans = -INF;\\n\\t\\tfor(int y1=0;y1<d;y1++){\\n\\t\\t\\tfor(int x1=0;x1<w;x1++){\\n\\t\\t\\t\\tfor(int y2=y1+3;y2<=d;y2++){\\n\\t\\t\\t\\t\\tfor(int x2=x1+3;x2<=w;x2++){\\n\\n\\t\\t\\t\\t\\t\\tvector<vector<int>> grid=get_grid(y1,x1,y2,x2);\\n\\t\\t\\t\\t\\t\\tint ret=calc(grid);\\n\\t\\t\\t\\t\\t\\tans=max(ans,ret);\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tcout<<(ans<0?0:ans)<<endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3352,\n \"score_of_the_acc\": -0.781,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1618_6981089\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nint main(){\\n int d, w, e[22][22], cnt[22][22], sum, ans;\\n bool ike;\\n while(cin >> d >> w, d!=0){\\n for(int i=0;i<d;i++){\\n for(int j=0;j<w;j++){\\n cin >> e[i][j];\\n cnt[i][j] = 0;\\n }\\n }\\n ans = 0;\\n for(int k=1;k<=9;k++){\\n for(int i=0;i<d;i++){\\n for(int j=0;j<w;j++){\\n if(e[i][j] < k){\\n cnt[i][j]++;\\n }\\n }\\n }\\n for(int y1=0;y1<d;y1++){\\n for(int y2=y1+2;y2<d;y2++){\\n for(int x1=0;x1<w;x1++){\\n for(int x2=x1+2;x2<w;x2++){\\n ike = true;\\n sum = 0;\\n if(count(cnt[y1]+x1, cnt[y1]+x2+1, 0) < x2-x1+1) ike = false;\\n if(count(cnt[y2]+x1, cnt[y2]+x2+1, 0) < x2-x1+1) ike = false;\\n for(int i=y1+1;i<y2;i++){\\n if(cnt[i][x1]!=0 || cnt[i][x2]!=0 || count(cnt[i]+x1+1, cnt[i]+x2, 0) > 0) ike = false;\\n sum += accumulate(cnt[i]+x1, cnt[i]+x2+1, 0);\\n }\\n if(ike){\\n ans = max(ans, sum);\\n }\\n }\\n }\\n }\\n }\\n \\n }\\n cout << ans << endl;\\n }\\n return(0);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3092,\n \"score_of_the_acc\": -0.1619,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1618_6760796\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n\\n#define rep(i, a, b) for (auto i = (a); i < (b); ++i)\\n#define repc(i, a, b) for (auto i = (a); i <= (b); ++i)\\n#define repr(i, a, b) for (int i = (a); i >= (b); --i)\\n#define each_rev(itr, a) for (auto itr = rbegin(a); itr != rend(a); ++itr)\\n#define fn1(x, expr) [&](const auto& x) { return (expr); }\\n#define fn2(x, y, expr) [&](const auto& x, const auto& y) { return (expr); }\\n#define pb push_back\\n#define eb emplace_back\\n#define LEN(a) int(a.size())\\n#define all(a) begin(a), end(a)\\n#define rall(a) rbegin(a), rend(a)\\n#define lb(a, elem) distance(std::begin(a), lower_bound(all(a), (elem)))\\n#define ub(a, elem) distance(std::begin(a), upper_bound(all(a), (elem)))\\n#define MIN(a) (*min_element(all(a)))\\n#define MAX(a) (*max_element(all(a)))\\n#define UNIQ(a) a.erase(unique(all(a)), end(a))\\n#define IN(x, begin, end) ((begin) <= (x) && (x) < (end))\\n// type alias\\n#define let const auto\\nusing i64 = int64_t;\\nusing u64 = uint64_t;\\nusing i32 = int32_t;\\nusing u32 = uint32_t;\\nusing i128 = __int128_t;\\nusing u128 = __uint128_t;\\nusing pii = pair<int, int>;\\nusing pll = pair<i64, i64>;\\nusing ldouble = long double;\\ntemplate <class T> using vec = std::vector<T>;\\ntemplate <class T> using MaxHeap = std::priority_queue<T>;\\ntemplate <class T> using MinHeap = std::priority_queue<T, std::vector<T>, std::greater<T>>;\\n// constants\\nconstexpr int INF = 0x3f3f3f3f;\\nconstexpr i64 LINF = 0x3f3f3f3f3f3f3f3f;\\nconstexpr double PI = 3.14159265358979323846;\\nconstexpr std::pair<int, int> DIR4[] = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};\\nconstexpr std::pair<int, int> DIR8[] = {{-1, -1}, {0, -1}, {1, -1}, {-1, 0}, {1, 0}, {-1, 1}, {0, 1}, {1, 1}};\\n// utils\\ntemplate <class T, class U> inline bool chmin(T& a, const U& b) { return b < a && (a = b, true); }\\ntemplate <class T, class U> inline bool chmax(T& a, const U& b) { return b > a && (a = b, true); }\\ntemplate <class T> inline int sgn(T x) noexcept { return (T(0) < x) - (x < T(0)); }\\ntemplate <class T, class U> inline auto divup(T a, U b) noexcept { return (a + b - 1) / b; }\\ntemplate <class T, class U> inline auto sigma(const T& l, const U& r) noexcept { return (l + r) * (r - l + 1) / 2; }\\ninline i64 sigma(int l, int r) noexcept { return sigma((i64)l, (i64)r); }\\ninline i64 choose2(i64 n) noexcept { return n * (n - 1) >> 1; }\\ninline void yes(bool x = true) { cout << (x ? \\\"yes\\\\n\\\" : \\\"no\\\\n\\\"); }\\ninline void Yes(bool x = true) { cout << (x ? \\\"Yes\\\\n\\\" : \\\"No\\\\n\\\"); }\\ninline void YES(bool x = true) { cout << (x ? \\\"YES\\\\n\\\" : \\\"NO\\\\n\\\"); }\\n#define WHEN_BYTESIZE(T, bytes) template <typename T, std::enable_if_t<sizeof(T) == (bytes), std::nullptr_t> = nullptr>\\nWHEN_BYTESIZE(T, 4) inline int popcnt(T n) { return __builtin_popcount((unsigned)n); }\\nWHEN_BYTESIZE(T, 8) inline int popcnt(T n) { return __builtin_popcountll((unsigned long long)n); }\\nWHEN_BYTESIZE(T, 4) inline int topbit(T n) { return n == 0 ? -1 : 31 - __builtin_clz((unsigned)n); }\\nWHEN_BYTESIZE(T, 8) inline int topbit(T n) { return n == 0 ? -1 : 63 - __builtin_clzll((unsigned long long)n); }\\nWHEN_BYTESIZE(T, 4) inline int lowbit(T n) { return n == 0 ? 32 : __builtin_ctz((unsigned)n); }\\nWHEN_BYTESIZE(T, 8) inline int lowbit(T n) { return n == 0 ? 64 : __builtin_ctzll((unsigned long long)n); }\\ntemplate <typename T> inline bool ispow2(T i) { return i && (i & -i) == i; }\\n\\ntemplate <class Container, enable_if_t<not is_same_v<typename Container::value_type, char>, nullptr_t> = nullptr>\\nistream& operator>>(istream& is, Container& a) {\\n for (auto&& e : a) is >> e;\\n return is;\\n}\\nistream& operator>>(istream& is, vector<char>& a) {\\n for (auto& c: a) is >> c;\\n return is;\\n}\\ntemplate <class Container, enable_if_t<not is_same_v<typename Container::value_type, char>, nullptr_t> = nullptr>\\nostream& operator<<(ostream& os, const Container& a) {\\n if (&os != &cout) {\\n os << '[';\\n unsigned cnt = 0;\\n for (auto it = begin(a); it != end(a) && cnt < 30; ++it, ++cnt) os << *it << (cnt + 1 < size(a) ? \\\", \\\" : \\\"\\\");\\n if (cnt < size(a)) os << \\\"...\\\";\\n return os << ']';\\n }\\n if (a.size() == 0) return os;\\n os << *begin(a);\\n for (auto it = next(begin(a)); it != end(a); ++it) os << ' ' << *it;\\n return os;\\n}\\nostream& operator<<(ostream& os, const vector<char>& a) {\\n os << '[';\\n for (auto it = a.begin(); it != a.end(); ++it) {\\n if (isprint(*it)) os << '\\\\'' << *it << '\\\\'';\\n else os << int(*it);\\n os << \\\" \\\"[it + 1 == a.end()];\\n }\\n return os << ']';\\n}\\ntemplate <class T, class U> istream& operator>>(istream& is, pair<T, U>& p) { return is >> p.first >> p.second; }\\ntemplate <class T, class U> ostream& operator<<(ostream& os, const pair<T, U>& p) { return os << '(' << p.first << \\\", \\\" << p.second << ')'; }\\n\\nostream& operator<<(ostream& os, __uint128_t n) {\\n if (n == 0) return os << '0';\\n char buf[40]{};\\n char* p = buf + 38;\\n while (n) {\\n *(p--) = char(n % 10) + '0';\\n n /= 10;\\n }\\n return os << (p + 1);\\n}\\n\\nostream& operator<<(ostream& os, __int128_t n) {\\n if (n < 0) return os << '-' << __uint128_t(-n);\\n return os << __uint128_t(n);\\n}\\n\\nistream& operator>>(istream& is, __uint128_t& n) {\\n int c;\\n while (isspace(c = is.get()));\\n n = unsigned(c - '0');\\n while (isdigit(c = is.get())) n = n * 10 + unsigned(c - '0');\\n return is;\\n}\\n\\nistream& operator>>(istream& is, __int128_t& n) {\\n int c;\\n bool neg;\\n while (isspace(c = is.get()));\\n if (c == '-') {\\n n = 0;\\n neg = true;\\n } else {\\n n = c - '0';\\n neg = false;\\n }\\n while (isdigit(c = is.get())) n = n * 10 + (c - '0');\\n if (neg) n = -n;\\n return is;\\n}\\n\\ninline void echo() { std::cout << '\\\\n'; }\\n\\ntemplate <class Head, class... Tail>\\ninline void echo(Head&& head, Tail&&... tail) {\\n std::cout << head;\\n if constexpr (sizeof...(tail)) std::cout << ' ';\\n echo(std::forward<Tail>(tail)...);\\n}\\n\\ntemplate <class... Args>\\ninline void read(Args&... args) {\\n (std::cin >> ... >> args);\\n}\\n\\nstatic inline void __attribute__((constructor)) io_setup() {\\n std::ios_base::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n std::cout << std::fixed << std::setprecision(10);\\n}\\n\\n#ifdef LOCAL_DEBUG\\n#define dump(...) (std::clog << \\\"\\\\e[34;1mL\\\" << __LINE__ << \\\": \\\\e[m\\\"), dbg_impl::dump_(dbg_impl::split_(#__VA_ARGS__).begin(), __VA_ARGS__)\\nnamespace dbg_impl {\\nvector<string> split_(const char* s) {\\n vector<string> res;\\n char buf[64], *end = buf;\\n unsigned paren = 0, brace = 0;\\n for (const char* p = s; *p != '\\\\0'; ++p) {\\n if (*p == ' ') continue;\\n if (*p == ',' && paren == 0 && brace == 0) {\\n res.emplace_back(buf, end), end = buf;\\n continue;\\n }\\n if (*p == '(') ++paren;\\n if (*p == ')') --paren;\\n if (*p == '{') ++brace;\\n if (*p == '}') --brace;\\n *end++ = *p;\\n }\\n res.emplace_back(buf, end);\\n return res;\\n}\\nvoid dump_(vector<string>::iterator) { std::clog << std::endl; }\\n\\ntemplate <class Head, class... Tail>\\nvoid dump_(vector<string>::iterator itr, Head&& head, Tail&&... tail) {\\n std::clog << *itr << \\\"\\\\e[90;1m=\\\\e[33;1m\\\" << head << \\\"\\\\e[m, \\\";\\n dump_(++itr, std::forward<Tail>(tail)...);\\n}\\n} // namespace dbg_impl\\n#else\\n#define dump(...) ((void)0)\\n#endif\\n\\n#define INT(...) int __VA_ARGS__; read(__VA_ARGS__)\\n#define LL(...) i64 __VA_ARGS__; read(__VA_ARGS__)\\n#define STR(...) string __VA_ARGS__; read(__VA_ARGS__)\\n#define CHR(...) char __VA_ARGS__; read(__VA_ARGS__)\\n#define DBL(...) double __VA_ARGS__; read(__VA_ARGS__)\\n#define VEC(type, name, len) vector<type> name(len); cin >> name\\n\\ntemplate <class T>\\nstruct Cumsum {\\n using value_type = T;\\n std::valarray<T> data;\\n Cumsum() = default;\\n explicit Cumsum(const std::vector<T>& a) : data(a.size() + 1) {\\n for (size_t i = 0; i < a.size(); ++i) data[i + 1] = data[i] + a[i];\\n }\\n //! range sum [l, r)\\n inline const T sum(size_t l, size_t r) const {\\n assert(l <= r);\\n return data[r] - data[l];\\n }\\n inline size_t size() const { return data.size(); }\\n inline auto begin() const { return std::begin(data); }\\n inline auto end() const { return std::end(data); }\\n};\\n\\ntemplate <class T, class Func>\\ninline T bin_search(T ok, T ng, const Func& isOk) {\\n while (std::abs(ok - ng) > 1) {\\n const T mid = (ok + ng) >> 1;\\n (isOk(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n\\ntemplate <class ForwardItr>\\nauto runlength(const ForwardItr begin, const ForwardItr end) {\\n vector<pair<ForwardItr, size_t>> res;\\n res.reserve(distance(begin, end));\\n for (auto itr = begin; itr != end;) {\\n size_t cnt = 1;\\n const auto head = itr++;\\n while (itr != end && *itr == *head) ++itr, ++cnt;\\n res.emplace_back(head, cnt);\\n }\\n res.shrink_to_fit();\\n return res;\\n}\\n\\ntemplate <typename T>\\nconstexpr T power(T x, int64_t exp) {\\n T res(1);\\n if (exp < 0) exp = -exp, x = 1 / x;\\n for (; exp; exp >>= 1) {\\n if (exp & 1) res *= x;\\n x *= x;\\n }\\n return res;\\n}\\n\\ntemplate <typename CostT>\\nstruct WeightedEdge {\\n using Self = WeightedEdge<CostT>;\\n uint32_t to;\\n CostT cost;\\n\\n WeightedEdge() = default;\\n WeightedEdge(unsigned to_, CostT cost_) : to(to_), cost(cost_) {}\\n operator int() const { return (int)to; }\\n operator uint32_t() const { return (uint32_t)to; }\\n bool operator<(const Self& other) const { return cost < other.cost; }\\n bool operator>(const Self& other) const { return cost > other.cost; }\\n bool operator<=(const Self& other) const { return cost <= other.cost; }\\n bool operator>=(const Self& other) const { return cost >= other.cost; }\\n friend ostream& operator<<(ostream& os, const Self& e) { return os << \\\"(to=\\\" << e.to << \\\", cost=\\\" << e.cost << \\\")\\\"; }\\n};\\ntemplate <class CostT>\\nusing WGraph = vector<vector<WeightedEdge<CostT>>>;\\n\\nusing UWGraph = vector<vector<uint32_t>>;\\n\\nenum class Directed : bool { No, Yes };\\n\\ntemplate <Directed directed>\\nUWGraph read_unweighted_graph(size_t vertex_num, size_t edge_num, bool decrement_node_id = true) {\\n UWGraph g(vertex_num);\\n for (size_t i = 0; i < edge_num; ++i) {\\n uint32_t a, b;\\n cin >> a >> b;\\n if (decrement_node_id) --a, --b;\\n g[a].push_back(b);\\n if constexpr (directed == Directed::No) g[b].push_back(a);\\n }\\n return g;\\n}\\n\\ntemplate <Directed directed, class CostT>\\nWGraph<CostT> read_weighted_graph(size_t vertex_num, size_t edge_num, bool decrement_node_id = true) {\\n WGraph<CostT> g(vertex_num);\\n for (size_t i = 0; i < edge_num; ++i) {\\n uint32_t a, b;\\n CostT cost;\\n cin >> a >> b >> cost;\\n if (decrement_node_id) --a, --b;\\n g[a].emplace_back(b, cost);\\n if constexpr (directed == Directed::No) g[b].emplace_back(a, cost);\\n }\\n return g;\\n}\\n\\n// -------------------- main --------------------\\n\\nint main() {\\n int H, W;\\n while (cin >> H >> W, H && W) {\\n auto S = vector(H, vector(W, 0));\\n rep(i, 0, H) {\\n cin >> S[i];\\n }\\n\\n int ans = 0;\\n rep(sy, 0, H) rep(sx, 0, W) {\\n rep(gy, sy + 2, H) rep(gx, sx + 2, W) {\\n\\n vec<int> inner;\\n vec<int> outer;\\n repc(i, sy, gy) repc(j, sx, gx) {\\n if (i == sy || i == gy || j == sx || j == gx) {\\n outer.push_back(S[i][j]);\\n } else {\\n inner.push_back(S[i][j]);\\n }\\n }\\n\\n let outer_min = MIN(outer);\\n let inner_max = MAX(inner);\\n if (outer_min <= inner_max) continue;\\n\\n int sum = 0;\\n for (let x : inner) {\\n sum += outer_min - x;\\n }\\n\\n chmax(ans, sum);\\n }\\n }\\n\\n echo(ans);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3380,\n \"score_of_the_acc\": -0.8476,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1618_5970485\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\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 ALL(obj) (obj).begin(), (obj).end()\\n#define vi vector<int>\\n#define vvi vector<vector<int>>\\n#define vs vector<string>\\n#define vc vector<char>\\n#define pii pair<int, int>\\n#define us unordered_set\\n#define ud unordered_dict\\n#define um unordered_map\\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#define Find(vec, n) find((vec).begin(), (vec).end(), n)\\n#define rev_sort(vec) sort((vec).begin(), (vec).end(), greater<int>())\\nusing Graph = vector<vector<int>>;\\nconst int INF = 1LL << 60;\\nconst int MOD = (int)1e9 + 7;\\nconst double EPS = 1e-9;\\n//const string alphabet = abcdefghijklmnopqrstuvwxyz;\\n//const string Alphabet = ABCDEFGHIJKLMNOPQRSTUVWXYZ;\\n\\nsigned main() {\\n int d, w;\\n while (true) {\\n cin >> d >> w;\\n if (d == 0) break;\\n\\n vvi field(d, vector<int>(w));\\n int intmp;\\n REP(i, d) {\\n REP(j, w) {\\n cin >> intmp;\\n field[i][j] = intmp;\\n }\\n }\\n int ans = 0;\\n\\n FOR(height, 3, d+1) {\\n FOR(width, 3, w+1) {\\n REP(r_head, d+1-height) {\\n REP(c_head, w+1-width) {\\n vi out, in;\\n FOR(r, r_head, r_head+height) {\\n FOR(c, c_head, c_head+width) {\\n if ((r == r_head || c == c_head) || (r == r_head+height-1 || c == c_head+width-1)) {\\n out.push_back(field[r][c]);\\n }\\n else {\\n in.push_back(field[r][c]);\\n }\\n }\\n }\\n int out_min = *min_element(ALL(out));\\n int in_max = *max_element(ALL(in));\\n if (out_min <= in_max) continue;\\n int volume = out_min * in.size() - accumulate(ALL(in), 0);\\n ans = max(ans, volume);\\n }\\n }\\n }\\n }\\n\\n cout << ans << endl;\\n }\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3444,\n \"score_of_the_acc\": -1,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1618_5849240\",\n \"code_snippet\": \"#include <algorithm>\\n#include <iomanip>\\n#include <array>\\n#include <bitset>\\n#include <cassert>\\n#include <cmath>\\n#include <cstdio>\\n#include <deque>\\n#include <functional>\\n#include <iostream>\\n#include <iterator>\\n#include <map>\\n#include <queue>\\n#include <set>\\n#include <string>\\n#include <sstream>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <utility>\\n#include <numeric>\\n#include <vector>\\nusing namespace std;\\n#if __has_include(<atcoder/all>)\\n#include <atcoder/all>\\nusing namespace atcoder;\\n#endif\\n#define GET_MACRO(_1, _2, _3, NAME, ...) NAME\\n#define _rep(i, n) _rep2(i, 0, n)\\n#define _rep2(i, a, b) for(int i = (int)(a); i < (int)(b); i++)\\n#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\nusing i64 = long long;\\ntemplate<class T, class U>\\nbool chmin(T& a, const U& b) { return (b < a) ? (a = b, true) : false; }\\ntemplate<class T, class U>\\nbool chmax(T& a, const U& b) { return (b > a) ? (a = b, true) : false; }\\n\\ntemplate<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,v.size())i>>v[j];return i;}\\ntemplate<typename T>string join(vector<T>&v){stringstream s;rep(i,v.size())s<<' '<<v[i];return s.str().substr(1);}\\ntemplate<typename T>ostream& operator<<(ostream&o,vector<T>&v){if(v.size())o<<join(v);return o;}\\ntemplate<typename T>string join(vector<vector<T>>&vv){string s=\\\"\\\\n\\\";rep(i,vv.size())s+=join(vv[i])+\\\"\\\\n\\\";return s;}\\ntemplate<typename T>ostream& operator<<(ostream&o,vector<vector<T>>&vv){if(vv.size())o<<join(vv);return o;}\\ntemplate<class T> using pq = priority_queue<T, vector<T>, greater<T>>;\\n\\nint main() {\\n while(1) {\\n int d, w;\\n cin >> d >> w;\\n if(d == 0 && w == 0) break;\\n vector table(d, vector<int>(w));\\n rep(i, d) rep(j, w) cin >> table[i][j];\\n int ans = 0;\\n rep(i1, d) {\\n rep(j1, w){\\n rep(i2, i1 + 1, d) {\\n rep(j2, j1 + 1, w) {\\n vector<int> out, in;\\n //上\\n rep(j3, j1, j2 + 1) out.push_back(table[i1][j3]);\\n //下\\n rep(j3, j1, j2 + 1) out.push_back(table[i2][j3]);\\n //左\\n rep(i3, i1, i2 + 1) out.push_back(table[i3][j1]);\\n //右\\n rep(i3, i1, i2 + 1) out.push_back(table[i3][j2]);\\n rep(i3, i1 + 1, i2) {\\n rep(j3, j1 + 1, j2) {\\n in.push_back(table[i3][j3]);\\n }\\n }\\n if(int(in.size()) == 0) continue;\\n int out_min = *min_element(all(out));\\n int in_max = *max_element(all(in));\\n if(out_min <= in_max) continue;\\n int now_ans = 0;\\n for(auto now : in) now_ans += out_min - now;\\n chmax(ans, now_ans);\\n }\\n }\\n }\\n }\\n cout << ans << endl;\\n } \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3364,\n \"score_of_the_acc\": -0.8095,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1618_5849233\",\n \"code_snippet\": \"#include <algorithm>\\n#include <iomanip>\\n#include <array>\\n#include <bitset>\\n#include <cassert>\\n#include <cmath>\\n#include <cstdio>\\n#include <deque>\\n#include <functional>\\n#include <iostream>\\n#include <iterator>\\n#include <map>\\n#include <queue>\\n#include <set>\\n#include <string>\\n#include <sstream>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <utility>\\n#include <numeric>\\n#include <vector>\\nusing namespace std;\\n#if __has_include(<atcoder/all>)\\n#include <atcoder/all>\\nusing namespace atcoder;\\n#endif\\n#define GET_MACRO(_1, _2, _3, NAME, ...) NAME\\n#define _rep(i, n) _rep2(i, 0, n)\\n#define _rep2(i, a, b) for(int i = (int)(a); i < (int)(b); i++)\\n#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)\\n#define all(x) (x).begin(), (x).end()\\n#define rall(x) (x).rbegin(), (x).rend()\\nusing i64 = long long;\\ntemplate<class T, class U>\\nbool chmin(T& a, const U& b) { return (b < a) ? (a = b, true) : false; }\\ntemplate<class T, class U>\\nbool chmax(T& a, const U& b) { return (b > a) ? (a = b, true) : false; }\\n\\ntemplate<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,v.size())i>>v[j];return i;}\\ntemplate<typename T>string join(vector<T>&v){stringstream s;rep(i,v.size())s<<' '<<v[i];return s.str().substr(1);}\\ntemplate<typename T>ostream& operator<<(ostream&o,vector<T>&v){if(v.size())o<<join(v);return o;}\\ntemplate<typename T>string join(vector<vector<T>>&vv){string s=\\\"\\\\n\\\";rep(i,vv.size())s+=join(vv[i])+\\\"\\\\n\\\";return s;}\\ntemplate<typename T>ostream& operator<<(ostream&o,vector<vector<T>>&vv){if(vv.size())o<<join(vv);return o;}\\ntemplate<class T> using pq = priority_queue<T, vector<T>, greater<T>>;\\n\\nint main() {\\n while(1) {\\n int d, w;\\n cin >> d >> w;\\n if(d == 0 && w == 0) break;\\n vector table(d, vector<int>(w));\\n rep(i, d) rep(j, w) cin >> table[i][j];\\n int ans = 0;\\n rep(i1, d) {\\n rep(j1, w){\\n rep(i2, i1 + 1, d) {\\n rep(j2, j1 + 1, w) {\\n vector<int> out, in;\\n //上\\n rep(j3, j1, j2 + 1) out.push_back(table[i1][j3]);\\n // if(i1 == 0 && j1 == 0 && i2 == 2 && j2 == 3) {\\n // cout << out << endl;\\n // }\\n //下\\n rep(j3, j1, j2 + 1) out.push_back(table[i2][j3]);\\n // if(i1 == 0 && j1 == 0 && i2 == 2 && j2 == 3) {\\n // cout << out << endl;\\n // }\\n //左\\n rep(i3, i1, i2 + 1) out.push_back(table[i3][j1]);\\n // if(i1 == 0 && j1 == 0 && i2 == 2 && j2 == 3) {\\n // cout << out << endl;\\n // }\\n //右\\n rep(i3, i1, i2 + 1) out.push_back(table[i3][j2]);\\n rep(i3, i1 + 1, i2) {\\n rep(j3, j1 + 1, j2) {\\n in.push_back(table[i3][j3]);\\n }\\n }\\n if(int(in.size()) == 0) continue;\\n int out_min = *min_element(all(out));\\n int in_max = *max_element(all(in));\\n if(out_min <= in_max) continue;\\n int now_ans = 0;\\n // cout << \\\"来てる\\\" << endl;\\n for(auto now : in) now_ans += out_min - now;\\n // cout << \\\"now_ans : \\\" << now_ans << endl;\\n if(now_ans == 5) {\\n // cout << i1 << \\\" \\\" << j1 << \\\" \\\" << i2 << \\\" \\\" << j2 << endl;\\n // cout << \\\"out : \\\" << out << endl;\\n // cout << \\\"in : \\\" << in << endl;\\n }\\n chmax(ans, now_ans);\\n }\\n }\\n }\\n }\\n cout << ans << endl;\\n } \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3336,\n \"score_of_the_acc\": -0.7429,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1618_4939903\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n#pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"Ofast\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n//#include <boost/multiprecision/cpp_int.hpp>\\nusing namespace std;\\n\\n//using namespace boost::multiprecision;\\n//#include<atcoder/all>\\n//using namespace atcoder;\\n\\nusing dou =long double;\\nstring yes=\\\"yes\\\";\\nstring Yes=\\\"Yes\\\";\\nstring YES=\\\"YES\\\";\\nstring no=\\\"no\\\";\\nstring No=\\\"No\\\";\\nstring NO=\\\"NO\\\";\\n\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }\\ntypedef long long ll;\\ntypedef pair<int,int> P;\\ntypedef pair<ll,ll> PL;\\n\\nconst ll mod = 998244353ll;\\n//const ll mod = 1000000007ll;\\n//const ll mod = 100000;\\n\\n\\nstruct mint {\\n ll x; // typedef long long ll;\\n mint(ll x=0):x((x%mod+mod)%mod){}\\n mint operator-() const { return mint(-x);}\\n mint& operator+=(const mint a) {\\n if ((x += a.x) >= mod) x -= mod;\\n return *this;\\n }\\n mint& operator-=(const mint a) {\\n if ((x += mod-a.x) >= mod) x -= mod;\\n return *this;\\n }\\n mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}\\n mint operator+(const mint a) const { return mint(*this) += a;}\\n mint operator-(const mint a) const { return mint(*this) -= a;}\\n mint operator*(const mint a) const { return mint(*this) *= a;}\\n mint pow(ll t) const {\\n if (!t) return 1;\\n mint a = pow(t>>1);\\n a *= a;\\n if (t&1) a *= *this;\\n return a;\\n }\\n\\n // for prime modhttps://atcoder.jp/contests/abc166/submit?taskScreenName=abc166_f\\n mint inv() const { return pow(mod-2);}\\n mint& operator/=(const mint a) { return *this *= a.inv();}\\n mint operator/(const mint a) const { return mint(*this) /= a;}\\n};\\n\\nistream& operator>>(istream& is, const mint& a) { return is >> a.x;}\\nostream& operator<<(ostream& os, const mint& a) { return os << a.x;}\\n\\n#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)\\n#define brep(n) for(int bit=0;bit<(1<<n);bit++)\\n#define bbrep(n) for(int bbit=0;bbit<(1<<n);bbit++)\\n#define erep(i,container) for (auto &i : container)\\n#define itrep(i,container) for (auto i : container)\\n#define irep(i, n) for(ll i = n-1; i >= (ll)0ll; i--)\\n#define rrep(i,m,n) for(ll i = m; i < (ll)(n); i++)\\n#define reprep(i,j,h,w) rep(i,h)rep(j,w)\\n#define repreprep(i,j,k,h,w,n) rep(i,h)rep(j,w)rep(k,n)\\n#define all(x) (x).begin(),(x).end()\\n#define rall(x) (x).rbegin(),(x).rend()\\n#define VEC(type,name,n) std::vector<type> name(n);rep(i,n)std::cin >> name[i];\\n#define pb push_back\\n#define pf push_front\\n#define query int qq;std::cin >> qq;rep(qqq,qq)\\n#define lb lower_bound\\n#define ub upper_bound\\n#define fi first\\n#define se second\\n#define itn int\\n#define mp make_pair\\n//#define sum(a) accumulate(all(a),0ll)\\n#define keta fixed<<setprecision\\n#define vout(a) erep(qxqxqx,a)std::cout << qxqxqx << ' ';std::cout << std::endl;\\n#define vvector(name,typ,m,n,a)vector<vector<typ> > name(m,vector<typ> (n,a))\\n//#define vvector(name,typ,m,n)vector<vector<typ> > name(m,vector<typ> (n))\\n#define vvvector(name,t,l,m,n,a) vector<vector<vector<t> > > name(l, vector<vector<t> >(m, vector<t>(n,a)));\\n#define vvvvector(name,t,k,l,m,n,a) vector<vector<vector<vector<t> > > > name(k,vector<vector<vector<t> > >(l, vector<vector<t> >(m, vector<t>(n,a)) ));\\n#define case std::cout <<\\\"Case #\\\" <<qqq+1<<\\\":\\\"\\n#define RES(a,i,j) a.resize(i);rep(ii,i)a[ii].resize(j);\\n#define RESRES(a,i,j,k) a.resize(i);rep(ii,i)a[ii].resize(j);reprep(ii,jj,i,j){dp[ii][jj].resize(k)};\\n#define res resize\\n#define as assign\\n#define ffor for(;;)\\n#define ppri(a,b) std::cout << a<<\\\" \\\"<<b << std::endl\\n#define pppri(a,b,c) std::cout << a<<\\\" \\\"<<b <<\\\" \\\"<< c<<std::endl\\n#define ppppri(a,b,c,d) std::cout << a<<\\\" \\\"<<b <<\\\" \\\"<< c<<' '<<d<<std::endl\\n#define aall(x,n) (x).begin(),(x).begin()+(n)\\n#define SUM(a) accumulate(all(a),0ll) \\n#define stirng string\\n#define gin(a,b) int a,b;std::cin >> a>>b;a--;b--;\\n#define popcount __builtin_popcount\\n#define permu(a) next_permutation(all(a))\\n#define aru(a,d) a.find(d)!=a.end()\\n\\n//#define grid_input(a,type) int h,w;std::cin >> h>>w;vvector(a,type,h,w,0);reprep(i,j,h,w)std::cin >> a[i][j];\\n\\n//typedef long long T;\\nll ceili(ll a,ll b){\\n return ((a+b-1)/b);\\n}\\nconst int INF = 2'000'000'000;\\nconst ll INF64 =32233720854775807ll;\\n//const ll INF64 = 9223372036854775807ll;\\n\\n//const ll INF64 = 243'000'000'000'000'000'0;\\n\\n\\n//const ll MOD = 100'000'000'7ll;\\nconst ll MOD = 998244353ll;\\n//const ll MOD = 1000003ll;\\nconst ll OD = 1000000000000007ll;\\nconst dou pi=3.141592653589793;\\n\\nlong long modpow(long long a, long long n) { //累乗の剰余\\n long long res = 1;\\n while (n > 0) {\\n if (n & 1) res = res * a % MOD;\\n a = a * a % MOD;\\n n >>= 1;\\n }\\n return res;\\n}\\n\\n//メモ\\n//ゲーム(Grundy数とか)の復習をする\\n//リスニング力をどうにかする\\n//モノイドをやる！！！！\\n//特に理由がなければllを使おうキャンペーン\\n//個数制限付きナップサックの復習\\n//戻すDP\\n//周期性の解析結果の考察をする\\n//いい加減英語スライドを作り始める\\n//改良モデルを深堀りすると良さそう\\n//被服調査票を提出する\\n//PGバトル 10/24 13:00~\\n//学科棟まで書類を受け取りに行く\\n//全方位木DPとスライド最小値\\n//やること困ったらSRM 500番台やるといいかも\\n\\nint main(){\\n ffor{\\n int h,w;\\n std::cin >> h>>w;\\n if(h==0)break;\\n vvector(a,int,h,w,0);\\n reprep(i,j,h,w)std::cin >> a[i][j];\\n int ans=0;\\n reprep(i,j,h,w){\\n rrep(ii,i+2,h){\\n rrep(jj,j+2,w){\\n bool ok=1;\\n std::vector<int> d;\\n int ma=0,mi=INF;\\n rrep(y,i,ii+1){\\n rrep(x,j,jj+1){\\n if(y==i||y==ii||x==j||x==jj){\\n chmin(mi,a[y][x]);\\n }\\n else{\\n chmax(ma,a[y][x]);\\n d.pb(a[y][x]);\\n }\\n }\\n }\\n if(mi<=ma)continue;\\n int dum=0;\\n erep(p,d)dum+=mi-p;\\n chmax(ans,dum);\\n }\\n }\\n }\\n std::cout << ans << std::endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3188,\n \"score_of_the_acc\": -0.3905,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1618_4892512\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define N (1000000000+7)\\n//#define N (998244353)\\n#define INF 1e16\\ntypedef long long ll;\\n\\nint board[20][20];\\n\\nint calc(int x,int y,int z, int w){\\n int M1= 1000;\\n vector<int>s;\\n for(int i=x;i<=y;i++){\\n for(int j=z;j<=w;j++){\\n if(i==x||i==y){\\n M1 = min(M1,board[i][j]);\\n }\\n else{\\n if(j==z||j==w){\\n M1 = min(M1,board[i][j]);\\n }\\n else{\\n s.push_back(board[i][j]);\\n }\\n }\\n }\\n }\\n sort(s.begin(),s.end(),greater<int>());\\n if(M1<=s[0])return 0;\\n else{\\n int ans = 0;\\n for(int i=0;i<s.size();i++){\\n ans+=abs(M1-s[i]);\\n }\\n return ans;\\n }\\n\\n}\\n\\nint main(void){\\n while(true){\\n int d,w;\\n cin>>d>>w;\\n if(d==0 && w==0)break;\\n for(int i=0;i<d;i++){\\n for(int j=0;j<w;j++){\\n cin>>board[i][j];\\n }\\n }\\n int ans = 0;\\n for(int i=0;i<d;i++){\\n for(int j=i+2;j<d;j++){\\n for(int k=0;k<w;k++){\\n for(int l=k+2;l<w;l++){\\n ans = max(ans,calc(i,j,k,l));\\n }\\n }\\n }\\n }\\n cout<<ans<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3436,\n \"score_of_the_acc\": -0.981,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1618_4887439\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#define int long long\\n\\n// debug methods\\n// usage: debug(x,y);\\n#define CHOOSE(a) CHOOSE2 a\\n#define CHOOSE2(a0,a1,a2,a3,a4,x,...) x\\n#define debug_1(x1) cout<<#x1<<\\\": \\\"<<x1<<endl\\n#define debug_2(x1,x2) cout<<#x1<<\\\": \\\"<<x1<<\\\", \\\"#x2<<\\\": \\\"<<x2<<endl\\n#define debug_3(x1,x2,x3) cout<<#x1<<\\\": \\\"<<x1<<\\\", \\\"#x2<<\\\": \\\"<<x2<<\\\", \\\"#x3<<\\\": \\\"<<x3<<endl\\n#define debug_4(x1,x2,x3,x4) cout<<#x1<<\\\": \\\"<<x1<<\\\", \\\"#x2<<\\\": \\\"<<x2<<\\\", \\\"#x3<<\\\": \\\"<<x3<<\\\", \\\"#x4<<\\\": \\\"<<x4<<endl\\n#define debug_5(x1,x2,x3,x4,x5) cout<<#x1<<\\\": \\\"<<x1<<\\\", \\\"#x2<<\\\": \\\"<<x2<<\\\", \\\"#x3<<\\\": \\\"<<x3<<\\\", \\\"#x4<<\\\": \\\"<<x4<<\\\", \\\"#x5<<\\\": \\\"<<x5<<endl\\n#ifdef _DEBUG\\n#define debug(...) CHOOSE((__VA_ARGS__,debug_5,debug_4,debug_3,debug_2,debug_1,~))(__VA_ARGS__)\\n#else\\n#define debug(...)\\n#endif\\n\\n#define MAX_N (1000006)\\n#define INF (1LL << 60)\\nconst int MOD = (int)1e9 + 7;\\n\\n\\nsigned main(){\\n while(1){\\n int d,w;\\n cin >> d >> w;\\n if(d==0)break;\\n vector<vector<int>> e(d, vector<int>(w));\\n for(int i=0; i<d; i++)\\n for(int j=0; j<w; j++)\\n cin >> e[i][j];\\n\\n int ans = 0;\\n for(int i=0; i<d; i++){\\n for(int j=0; j<w; j++){\\n // (i,j) (k,l) が池\\n for(int k=i; k<d; k++){\\n for(int l=j; l<w; l++){\\n int mn = INF;\\n vector<int> inner;\\n for(int p=i; p<=k; p++){\\n for(int q=j; q<=l; q++){\\n if(p==i || p==k || q==j || q==l) {\\n mn = min(mn, e[p][q]);\\n } else {\\n inner.push_back(e[p][q]);\\n }\\n }\\n }\\n if(inner.empty()) continue;\\n int sum = 0;\\n bool f=true;\\n for(auto x: inner) {\\n if(mn-x<=0){\\n f=false;\\n break;\\n }\\n sum += mn-x;\\n }\\n if(f){\\n ans = max(ans, sum);\\n }\\n }\\n }\\n }\\n }\\n cout << ans << endl;\\n }\\n}\\n\\n/*\\n\\n*/\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3152,\n \"score_of_the_acc\": -0.3048,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1618_3957502\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define REP(i, n) for (int i = 0; i < (int)(n); i++)\\nusing namespace std;\\n\\nint main() {\\n for (int d, w; cin >> d >> w, d;) {\\n vector<vector<int>> e(d, vector<int>(w));\\n REP(i, d) REP(j, w) cin >> e[i][j];\\n int ans = 0;\\n REP(sx, d) REP(sy, w) {\\n REP(tx, d) REP(ty, w) {\\n if (sx >= tx || sy >= ty) continue;\\n int mn = 1e9;\\n REP(i, d) {\\n if (i < sx || i > tx) continue;\\n mn = min(mn, e[i][sy]);\\n mn = min(mn, e[i][ty]);\\n }\\n REP(j, w) {\\n if (j < sy || j > ty) continue;\\n mn = min(mn, e[sx][j]);\\n mn = min(mn, e[tx][j]);\\n }\\n bool f = false;\\n int c = 0;\\n REP(i, d) REP(j, w) {\\n if (i <= sx || i >= tx) continue;\\n if (j <= sy || j >= ty) continue;\\n if (mn <= e[i][j]) f = true;\\n c += mn - e[i][j];\\n }\\n if (f) continue;\\n ans = max(ans, c);\\n }\\n }\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3036,\n \"score_of_the_acc\": -0.0286,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1618_3727368\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define rep(i,n) for(long long int i=0;i<n;++i)\\ntypedef long long int ll;\\n\\nint func(vector<vector<int>> m,int a,int b,int c,int d){\\n int ret=10;\\n for(int i=b;i<=d;i++){\\n ret=min({ret,m[a][i],m[c][i]});\\n }\\n for(int i=a;i<=c;i++){\\n ret=min({ret,m[i][b],m[i][d]});\\n }\\n int ff=-1;\\n a++;b++;c--;d--;\\n for(int i=b;i<=d;i++){\\n ff=max({ff,m[a][i],m[c][i]});\\n }\\n for(int i=a;i<=c;i++){\\n ff=max({ff,m[i][b],m[i][d]});\\n }\\n if(ff>=ret){\\n ret=-1;\\n }\\n return ret;\\n}\\n\\nint main(){\\n\\n while(1){\\n int d,w;\\n cin >> d >> w;\\n if(d==0)break;\\n vector<vector<int>> m(d,vector<int>(w));\\n for(int i=0;i<d;i++){\\n for(int j=0;j<w;j++){\\n cin >> m[i][j];\\n }\\n }\\n int ans=0;\\n for(int i=0;i<=d-3;i++){\\n for(int j=0;j<=w-3;j++){\\n for(int k=i+2;k<d;k++){\\n for(int l=j+2;l<w;l++){\\n int mi=func(m,i,j,k,l);\\n int su=0;\\n if(mi==-1)continue;\\n for(int s=i+1;s<k;s++){\\n for(int t=j+1;t<l;t++){\\n su+=max(0,mi-m[s][t]);\\n }\\n }\\n ans=max(ans,su);\\n }\\n }\\n }\\n }\\n cout << ans << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3060,\n \"score_of_the_acc\": -0.0857,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1618_3680133\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <algorithm>\\nusing namespace std;\\n\\n\\n\\nint main(){\\n\\nwhile(1){\\n int d,w;\\n cin >> d >>w;\\n if(d==0 && w==0)break;\\n int ground[d][w];\\n for(int i=0;i<d;i++){\\n for(int j=0;j<w;j++){\\n cin >>ground[i][j];\\n }\\n }\\n int ans=0;\\n vector<int> lake(0);\\n vector<int> wall(0);\\n for(int dstart=0;dstart<d-2;dstart++){\\n for(int dend=dstart+2;dend<d;dend++){\\n for(int wstart=0;wstart<w-2;wstart++){\\n for(int wend=wstart+2;wend<w;wend++){\\n lake.clear();\\n wall.clear();\\n for(int dd=dstart;dd<=dend;dd++){\\n for(int ww=wstart;ww<=wend;ww++){\\n if(dd==dstart || dd==dend || ww==wstart|| ww==wend){\\n wall.push_back(ground[dd][ww]);\\n }\\n else lake.push_back(ground[dd][ww]);\\n }\\n }\\n if(wall.size()!=0)sort(wall.begin(),wall.end());\\n if(lake.size()!=0){\\n sort(lake.begin(),lake.end());\\n reverse(lake.begin(),lake.end());\\n }\\n int temp=0;\\n for(int pl=0;pl<lake.size();pl++)temp+=(wall[0]-lake[pl]);\\n if(wall[0]<=lake[0])temp=0;\\n ans=max(ans,temp);\\n }\\n }\\n }\\n }\\n cout << ans <<endl;\\n }\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3100,\n \"score_of_the_acc\": -0.181,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1618_3677912\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint solve(int d, int w) {\\n int e[d][w];\\n for (int i = 0; i < d; i++) {\\n for (int j = 0; j < w; j++) {\\n cin >> e[i][j];\\n }\\n }\\n int ans = 0;\\n for (int x1 = 0; x1 < d; x1++) {\\n for (int x2 = 0; x2 < d; x2++) {\\n if (x2 - x1 < 2) continue;\\n for (int y1 = 0; y1 < w; y1++) {\\n for (int y2 = 0; y2 < w; y2++) {\\n if (y2 - y1 < 2) continue;\\n int inner_height = 0;\\n int surround_height = 100;\\n int inner_sum = 0;\\n int counter = 0;\\n for (int i = 0; i < d; i++) {\\n for (int j = 0; j < w; j++) {\\n if (x1 < i && i < x2 && y1 < j && j < y2) {\\n inner_height = max(inner_height, e[i][j]);\\n inner_sum += e[i][j];\\n counter++;\\n }\\n if (x1 <= i && i <= x2 && (j == y1 || j == y2)) {\\n surround_height = min(surround_height, e[i][j]);\\n }\\n if (y1 <= j && j <= y2 && (i == x1 || i == x2)) {\\n surround_height = min(surround_height, e[i][j]);\\n }\\n }\\n }\\n if (surround_height > inner_height) {\\n int tmp = counter * surround_height - inner_sum;\\n ans = max(ans, tmp);\\n }\\n }\\n }\\n }\\n }\\n return ans;\\n}\\n\\nint main() {\\n int d, w;\\n while (true) {\\n cin >> d >> w;\\n if (!d && !w) return 0;\\n cout << solve(d, w) << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3024,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1618_3342793\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = int64_t;\\nusing P = pair<ll, ll>;\\n\\nconst ll INF = 5e15;\\n\\nint main(){\\n while(1){\\n ll H, W;\\n ll ans = 0;\\n cin >> H >> W;\\n if(!H && !W) break;\\n vector<vector<ll>> V(H, vector<ll>(W));\\n for(auto &v : V) for(auto &e : v) cin >> e;\\n for(ll up = 0; up < H; up++){\\n for(ll down = up + 2; down < H; down++){\\n for(ll left = 0; left < W; left++){\\n for(ll right = left + 2; right < W; right++){\\n ll mine = INF, maxl = 0;\\n ll suml = 0;\\n for(ll h = 0; h < H; h++){\\n for(ll w = 0; w < W; w++){\\n if(!(left <= w && w <= right &&\\n up <= h && h <= down)) continue;\\n if(h == up || \\n h == down ||\\n w == left || \\n w == right){\\n mine = min(mine, V[h][w]);\\n }else{\\n maxl = max(maxl, V[h][w]);\\n suml += V[h][w];\\n }\\n }\\n }\\n if(mine <= maxl) continue;\\n ll lenh = down - up + 1;\\n ll lenw = right - left + 1;\\n ll area = lenh * lenw - 2 * lenh - 2 * lenw + 4;\\n ans = max(ans, area * mine - suml);\\n }\\n }\\n }\\n }\\n cout << ans << '\\\\n';\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3156,\n \"score_of_the_acc\": -0.3143,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1618_2883107\",\n \"code_snippet\": \"#include<iostream>\\n#include<algorithm>\\n#include<vector>\\n\\nusing namespace std;\\n\\nstruct Pond\\n{\\n int up,down,left,right;\\n vector<int> canal;\\n vector<int> moat;\\n int min,max;\\n void make(int up,int down,int left,int right,vector<int> canal,vector<int>moat)\\n {\\n this->up=up; this->down=down; this->left=left; this->right=right;\\n this->canal=canal; this->moat=moat;\\n }\\n void setVals(){\\n max= *max_element(canal.begin(),canal.end());\\n min= *min_element(moat.begin(),moat.end());\\n }\\n bool isMake()\\n {\\n return (max<min);\\n }\\n};\\n\\nint calc(Pond pond)\\n{\\n int sum=0;\\n for(int i=0;i<pond.canal.size();i++){\\n sum+=pond.min-pond.canal[i];\\n }\\n return sum;\\n}\\nvoid print(vector<int> list){\\n for(int x:list) cout<<x<<\\\" \\\";\\n cout<<endl;\\n}\\nint main()\\n{\\n while(1){\\n int depth,width;\\n vector<int> canal(0),moat(0);\\n cin>>depth>>width;\\n int stage[depth][width];\\n if((depth==0)and(width==0)) return 0;\\n \\n for(int i=0;i<depth;i++){\\n for(int j=0;j<width;j++){\\n\\tcin>>stage[i][j];\\n }\\n }\\n int mx=0;\\n for(int up=0;up<depth-1;up++){\\n for(int left=0;left<width-1;left++){\\n\\tfor(int down=up+2;down<depth;down++){\\n\\t for(int right=left+2;right<width;right++){\\n\\t //cout<<\\\"up=\\\"<<up<<\\\" down=\\\"<<down<<endl;\\n\\t //cout<<\\\"left=\\\"<<left<<\\\" right=\\\"<<right<<endl;\\n\\t canal.resize(0);\\n\\t moat.resize(0);\\n\\t for(int s=up;s<=down;s++){\\n\\t for(int t=left;t<=right;t++){\\n\\t\\t//cout<<\\\"s=\\\"<<s<<\\\" t=\\\"<<t<<endl;\\n\\t\\tif((s!=up and s!=down)and(t!=left and t!=right)){\\n\\t\\t //cout<<\\\"canal.push(\\\"<<stage[s][t]<<\\\")\\\"<<endl;\\n\\t\\t canal.push_back(stage[s][t]);\\n\\t\\t}else{\\n\\t\\t //cout<<\\\"moat.push(\\\"<<stage[s][t]<<\\\")\\\"<<endl;\\n\\t\\t moat.push_back(stage[s][t]);\\n\\t\\t}\\n\\t }\\n\\t }\\n\\t //print(canal);\\n\\t //print(moat);\\n\\t Pond pond;\\n\\t pond.make(up,down,left,right,canal,moat);\\n\\t pond.setVals();\\n\\t //cout<<\\\"make pond:\\\"<<endl;\\n\\t if(pond.isMake()){\\n\\t //cout<<\\\"judge=YES\\\"<<endl;\\n\\t mx=max(mx,calc(pond));\\n\\t }else{\\n\\t //cout<<\\\"judge=NO\\\"<<endl;\\n\\t }\\n\\t }\\n\\t}\\n }\\n }\\n //cout<<\\\"count=\\\"<<count<<endl;\\n cout<<mx<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3140,\n \"score_of_the_acc\": -0.2762,\n \"final_rank\": 6\n }\n]","isConversational":false}}},{"rowIdx":990,"cells":{"group_id":{"kind":"string","value":"aoj_1624_cpp"},"problem_description":{"kind":"string","value":"Income Inequality\nWe often compute the average as the first step\nin processing statistical data.\nYes, the average is a good tendency measure of data,\nbut it is not always the best.\nIn some cases, the average may hinder the understanding\nof the data.\nFor example, consider the national income of a country.\nAs the term\nincome inequality\nsuggests,\na small number of people earn a good portion of the gross national income\nin many countries.\nIn such cases, the average income computes much higher than the\nincome of the vast majority.\nIt is not appropriate to regard the average as the income of typical people.\nLet us observe the above-mentioned phenomenon in some concrete data.\nIncomes of\nn\npeople,\na\n1\n, ... ,\na\nn\n, are given.\nYou are asked to write a program that reports the number of people\nwhose incomes are less than or equal to the average\n(\na\n1\n+ ... +\na\nn\n) /\nn\n.\nInput\nThe input consists of multiple datasets, each in the following format.\nn\na\n1\na\n2\n...\na\nn\nA dataset consists of two lines.\nIn the first line, the number of people\nn\nis given.\nn\nis an integer satisfying 2 ≤\nn\n≤ 10 000.\nIn the second line, incomes of\nn\npeople are given.\na\ni\n(1 ≤\ni\n≤\nn\n) is the income\nof the\ni\n-th person.\nThis value is an integer greater than or equal to 1 and\nless than or equal to 100 000.\nThe end of the input is indicated by a line containing a zero.\nThe sum of\nn\n's of all the datasets does not exceed 50 000.\nOutput\nFor each dataset, output the number of people whose incomes are\nless than or equal to the average.\nSample Input\n7\n15 15 15 15 15 15 15\n4\n10 20 30 60\n10\n1 1 1 1 1 1 1 1 1 100\n7\n90 90 90 90 90 90 10\n7\n2 7 1 8 2 8 4\n0\nOutput for the Sample Input\n7\n3\n9\n1\n4"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1624_9210748","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n vector<int>ans(0);\n while(true){\n double n;\n cin >> n;\n if(n==0){\n break;\n }\n vector<double>A(n);\n for(int i=0;i<n;i++){\n cin >> A[i];\n }\n double sum = accumulate(A.begin(),A.end(),0);\n // cout << sum << endl;\n double ave = sum/n;\n // cout << ave << endl;\n\n int cnt=0;\n for(int i=0;i<n;i++){\n if(A[i]<=ave)cnt++;\n }\n ans.push_back(cnt); \n }\n for(int i=0;i<ans.size();i++){\n cout << ans[i] << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3284,"score_of_the_acc":-0.0036,"final_rank":2},{"submission_id":"aoj_1624_6731269","code_snippet":"#include <bits/stdc++.h> \nusing namespace std;\ntypedef long long ll;\ntypedef vector<int> vi;\ntypedef queue<int> qi;\ntypedef priority_queue<int> pqi;\ntypedef priority_queue<int, vector<int>, greater<int>> mpqi;\ntypedef pair<int, int> pi;\ntypedef vector<ll> vl;\n#define mp make_pair\n#define pb push_back\n#define MAX_N 200005\nll INF = 1e18;\n#define md107 1000000007\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)(a); i >= (int)(b); i--)\ntypedef vector<vector<int>> vvi;\nint n;\nvoid solve(){\n while (true)\n {\n int n; cin >> n;\n if (n == 0) {\n break;\n }\n vi vc(MAX_N, 0);\n ll sum = 0;\n int cnt = 0;\n rep(i, 1, n) {\n cin >> vc[i];\n sum += vc[i];\n }\n float aver = sum / n;\n rep(i, 1, n) {\n if (vc[i] <= aver) cnt++;\n }\n cout << cnt << endl;\n }\n \n}\nint main()\n{\n ios_base::sync_with_stdio(false);\n cin.tie(NULL);\n solve();\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":4144,"score_of_the_acc":-0.0583,"final_rank":3},{"submission_id":"aoj_1624_6207359","code_snippet":"#include <iostream> // cout, endl, cin\n#include <string> // string, to_string, stoi\n#include <vector> // vector\n#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound\n#include <utility> // pair, make_pair\n#include <tuple> // tuple, make_tuple\n#include <cstdint> // int64_t, int*_t\n#include <cstdio> // printf\n#include <map> // map\n#include <queue> // queue, priority_queue\n#include <set> // set\n#include <stack> // stack\n#include <deque> // deque\n#include <unordered_map> // unordered_map\n#include <unordered_set> // unordered_set\n#include <bitset> // bitset\n#include <cctype> // isupper, islower, isdigit, toupper, tolower\n#include<math.h>\n#include <iomanip>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\nusing namespace std;\ntypedef long long ll;\n\n\n\n\n//const long long mod=1000000007;\n//const long long mod2=998244353;\nusing ll=long long;\n\nconst ll inf=1e18;\nusing P= pair<ll, ll>;\n\nconst int MAX = 200005;\n// 今回採用する大きい素数\nconst int MOD = 1e9+7;\n\n// メモを保管する場所\nll fact[MAX], inv_fact[MAX], inv[MAX];\n\n// メモを計算する\nvoid init() {\n // 初期値設定と1はじまりインデックスに直す\n fact[0] = 1;\n fact[1] = 1;\n inv[0] = 1;\n inv[1] = 1;\n inv_fact[0] = 1;\n inv_fact[1] = 1;\n // メモの計算\n repi(i, 2, MAX){\n // 階乗\n fact[i] = fact[i - 1] * i % MOD;\n // 逆元\n inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;\n // 逆元の階乗\n inv_fact[i] = inv_fact[i - 1] * inv[i] % MOD;\n }\n}\n\n// 二項係数の実体\nll nCk(int n, int k) {\n ll x = fact[n]; // n!の計算\n ll y = inv_fact[n-k]; // (n-k)!の計算\n ll z = inv_fact[k]; // k!の計算\n if (n < k) return 0; // 例外処理\n if (n < 0 || k < 0) return 0; // 例外処理\n return x * ((y * z) % MOD) % MOD; //二項係数の計算\n}\n\n\nll pow_pow(ll x,ll n,ll mod){\n if(n==0) return 1;\n x%=mod;\n \n ll res=pow_pow(x*x%mod,n/2,mod);\n if(n&1)res=res*x%mod;\n return res;\n}\n\n\n\nint extgcd(int a,int b,int &x,int &y){\n int d=a;\n if(b!=0){\n d=extgcd(b,a%b,y,x);\n y-=(a/b)*x;\n }else{\n x=1;y=0;\n }\n return d;\n}\nint mod_inverse(int a,int m){\n int x,y;\n extgcd(a,m,x,y);\n return (m+x%m)%m;\n}\n\nstruct UnionFind {\n vector<int> par, siz;\n\n UnionFind(int n) : par(n, -1) , siz(n, 1) { }\n\n // 根を求める\n int root(int x) {\n if (par[x] == -1) return x;\n else return par[x] = root(par[x]);\n }\n\n // x と y が同じグループに属するかどうか (根が一致するかどうか)\n bool issame(int x, int y) {\n return root(x) == root(y);\n }\n\n // x を含むグループと y を含むグループとを併合する\n bool unite(int x, int y) {\n x = root(x), y = root(y);\n if (x == y) return false; \n if (siz[x] < siz[y]) swap(x, y);\n par[y] = x;\n siz[x] += siz[y];\n return true;\n }\n\n // x を含むグループのサイズ\n int size(int x) {\n return siz[root(x)];\n }\n};\n \n //min(x,y)が0以下の場合はmax(x,y)が返される\n//ユークリッドの互除法を元に実装\nll gcd(ll x,ll y){\n if(y==0)return x;\n return gcd(y,x%y);\n}\n\n//オーバフローしないようにかける順番を気を付ける\nll lcm(ll x,ll y){\n return ll(x/gcd(x,y))*y;\n}\n\n\n\n\ntemplate<class T> bool chmin(T& a, T b) {\n if (a > b) {\n a = b;\n return true;\n }\n else return false;\n}\ntemplate<class T> bool chmax(T& a, T b) {\n if (a < b) {\n a = b;\n return true;\n }\n else return false;\n}\n\n//using Graph1=vector<vector<Edge> >;\n//using Graph=vector<vector<int> >;\n\n// auto mod int\n// https://youtu.be/L8grWxBlIZ4?t=9858\n// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize\n// https://youtu.be/8uowVvQ_-Mo?t=1329 : division\nconst int mod = 1e9+7;\nstruct mint {\n ll x; // typedef long long ll;\n mint(ll x=0):x((x%mod+mod)%mod){}\n mint operator-() const { return mint(-x);}\n mint& operator+=(const mint a) {\n if ((x += a.x) >= mod) x -= mod;\n return *this;\n }\n mint& operator-=(const mint a) {\n if ((x += mod-a.x) >= mod) x -= mod;\n return *this;\n }\n mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}\n mint operator+(const mint a) const { return mint(*this) += a;}\n mint operator-(const mint a) const { return mint(*this) -= a;}\n mint operator*(const mint a) const { return mint(*this) *= a;}\n mint pow(ll t) const {\n if (!t) return 1;\n mint a = pow(t>>1);\n a *= a;\n if (t&1) a *= *this;\n return a;\n }\n \n // for prime mod\n mint inv() const { return pow(mod-2);}\n mint& operator/=(const mint a) { return *this *= a.inv();}\n mint operator/(const mint a) const { return mint(*this) /= a;}\n};\nistream& operator>>(istream& is, const mint& a) { return is >> a.x;}\nostream& operator<<(ostream& os, const mint& a) { return os << a.x;}\n// combination mod prime\n// https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619\nstruct combination {\n vector<mint> fact, ifact;\n combination(int n):fact(n+1),ifact(n+1) {\n //assert(n < mod);\n fact[0] = 1;\n for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;\n ifact[n] = fact[n].inv();\n for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;\n }\n mint operator()(int n, int k) {\n if (k < 0 || k > n) return 0;\n return fact[n]*ifact[k]*ifact[n-k];\n }\n mint p(int n, int k) {\n return fact[n]*ifact[n-k];\n }\n} c(1000005);\n \n\n\n\n//const ll INF=1e18;\n\n\nclass segment_tree {\nprivate:\n\tint sz;\n\tstd::vector<int> seg;\n\tstd::vector<int> lazy;\n\tvoid push(int k) {\n\t\tif (k < sz) {\n\t\t\tlazy[k * 2] = max(lazy[k * 2], lazy[k]);\n\t\t\tlazy[k * 2 + 1] = max(lazy[k * 2 + 1], lazy[k]);\n\t\t}\n\t\tseg[k] = max(seg[k], lazy[k]);\n\t\tlazy[k] = 0;\n\t}\n\tvoid update(int a, int b, int x, int k, int l, int r) {\n\t\tpush(k);\n\t\tif (r <= a || b <= l) return;\n\t\tif (a <= l && r <= b) {\n\t\t\tlazy[k] = x;\n\t\t\tpush(k);\n\t\t\treturn;\n\t\t}\n\t\tupdate(a, b, x, k * 2, l, (l + r) >> 1);\n\t\tupdate(a, b, x, k * 2 + 1, (l + r) >> 1, r);\n\t\tseg[k] = max(seg[k * 2], seg[k * 2 + 1]);\n\t}\n\tint range_max(int a, int b, int k, int l, int r) {\n\t\tpush(k);\n\t\tif (r <= a || b <= l) return 0;\n\t\tif (a <= l && r <= b) return seg[k];\n\t\tint lc = range_max(a, b, k * 2, l, (l + r) >> 1);\n\t\tint rc = range_max(a, b, k * 2 + 1, (l + r) >> 1, r);\n\t\treturn max(lc, rc);\n\t}\npublic:\n\tsegment_tree() : sz(0), seg(), lazy() {};\n\tsegment_tree(int N) {\n\t\tsz = 1;\n\t\twhile (sz < N) {\n\t\t\tsz *= 2;\n\t\t}\n\t\tseg = std::vector<int>(sz * 2, 0);\n\t\tlazy = std::vector<int>(sz * 2, 0);\n\t}\n\tvoid update(int l, int r, int x) {\n\t\tupdate(l, r, x, 1, 0, sz);\n\t}\n\tint range_max(int l, int r) {\n\t\treturn range_max(l, r, 1, 0, sz);\n\t}\n //cin.tie(0);\n //ios_base::sync_with_stdio(false); これらをmain関数の先頭に\n};\n\nconst ll seg_size=100005;\nll seg[seg_size*2];\n\nvoid seg_set(int ind,ll v){\n ind+=seg_size;\n seg[ind]=max(seg[ind],v);\n while(true){\n if(ind==0)break;\n ind/=2;\n seg[ind]=max(seg[ind*2],seg[ind*2+1]);\n }\n}\n\nll seg_take(int l,int r){\n l+=seg_size;\n r+=seg_size;\n ll ans=0;\n while(l<r){\n if(l%2==1){\n ans=max(ans,seg[l]);\n l++;\n }\n l/=2;\n if(r%2==1){\n ans=max(ans,seg[r-1]);\n r--;\n }\n r/=2;\n\n }\n return ans;\n}\nstruct Edge{\n int to;ll w;\n Edge(int to,ll w):to(to),w(w){}\n};\n\nvoid comp(vector<int>&a){\n set<int>s(a.begin(),a.end());\n map<int,int>d;\n int cnt=0;\n for(auto x:s)d[x]=cnt++;\n for(auto&x:a)x=d[x];\n}\n\nusing graph = vector<vector<ll> > ;\n\nint main(){\n vector<ll> ans;\n while(1){\n int n; cin >> n;\n if(n==0)break;\n vector<ll> a(n);\n ll tot=0;\n rep(i,n){\n cin >> a[i];\n tot+=a[i];\n }\n int cnt=0;\n rep(i,n)if(n*a[i]<=tot)cnt++;\n ans.push_back(cnt);\n }\n for(auto u: ans)cout << u << endl;\n \n}","accuracy":1,"time_ms":10,"memory_kb":18932,"score_of_the_acc":-1,"final_rank":4},{"submission_id":"aoj_1624_6029003","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/////////////////////////////////////////\n\nint main(void) {\n /////////////////////////////////////////////////////\n\n double n;\n while (cin >> n) {\n if (!n) break;\n\n vd a(n);\n double sum = 0;\n rep(i, n) {\n cin >> a[i];\n sum += a[i];\n }\n\n int count = 0;\n rep(i, n) {\n if (a[i] <= sum / n) count++;\n }\n cout << count << endl;\n }\n\n //////////////////////////////////////////////////////\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3228,"score_of_the_acc":0,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_1624_9210748\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nint main(){\\n vector<int>ans(0);\\n while(true){\\n double n;\\n cin >> n;\\n if(n==0){\\n break;\\n }\\n vector<double>A(n);\\n for(int i=0;i<n;i++){\\n cin >> A[i];\\n }\\n double sum = accumulate(A.begin(),A.end(),0);\\n // cout << sum << endl;\\n double ave = sum/n;\\n // cout << ave << endl;\\n\\n int cnt=0;\\n for(int i=0;i<n;i++){\\n if(A[i]<=ave)cnt++;\\n }\\n ans.push_back(cnt); \\n }\\n for(int i=0;i<ans.size();i++){\\n cout << ans[i] << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3284,\n \"score_of_the_acc\": -0.0036,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1624_6731269\",\n \"code_snippet\": \"#include <bits/stdc++.h> \\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<int> vi;\\ntypedef queue<int> qi;\\ntypedef priority_queue<int> pqi;\\ntypedef priority_queue<int, vector<int>, greater<int>> mpqi;\\ntypedef pair<int, int> pi;\\ntypedef vector<ll> vl;\\n#define mp make_pair\\n#define pb push_back\\n#define MAX_N 200005\\nll INF = 1e18;\\n#define md107 1000000007\\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)(a); i >= (int)(b); i--)\\ntypedef vector<vector<int>> vvi;\\nint n;\\nvoid solve(){\\n while (true)\\n {\\n int n; cin >> n;\\n if (n == 0) {\\n break;\\n }\\n vi vc(MAX_N, 0);\\n ll sum = 0;\\n int cnt = 0;\\n rep(i, 1, n) {\\n cin >> vc[i];\\n sum += vc[i];\\n }\\n float aver = sum / n;\\n rep(i, 1, n) {\\n if (vc[i] <= aver) cnt++;\\n }\\n cout << cnt << endl;\\n }\\n \\n}\\nint main()\\n{\\n ios_base::sync_with_stdio(false);\\n cin.tie(NULL);\\n solve();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4144,\n \"score_of_the_acc\": -0.0583,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1624_6207359\",\n \"code_snippet\": \"#include <iostream> // cout, endl, cin\\n#include <string> // string, to_string, stoi\\n#include <vector> // vector\\n#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound\\n#include <utility> // pair, make_pair\\n#include <tuple> // tuple, make_tuple\\n#include <cstdint> // int64_t, int*_t\\n#include <cstdio> // printf\\n#include <map> // map\\n#include <queue> // queue, priority_queue\\n#include <set> // set\\n#include <stack> // stack\\n#include <deque> // deque\\n#include <unordered_map> // unordered_map\\n#include <unordered_set> // unordered_set\\n#include <bitset> // bitset\\n#include <cctype> // isupper, islower, isdigit, toupper, tolower\\n#include<math.h>\\n#include <iomanip>\\nusing namespace std;\\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\\n#define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++)\\nusing namespace std;\\ntypedef long long ll;\\n\\n\\n\\n\\n//const long long mod=1000000007;\\n//const long long mod2=998244353;\\nusing ll=long long;\\n\\nconst ll inf=1e18;\\nusing P= pair<ll, ll>;\\n\\nconst int MAX = 200005;\\n// 今回採用する大きい素数\\nconst int MOD = 1e9+7;\\n\\n// メモを保管する場所\\nll fact[MAX], inv_fact[MAX], inv[MAX];\\n\\n// メモを計算する\\nvoid init() {\\n // 初期値設定と1はじまりインデックスに直す\\n fact[0] = 1;\\n fact[1] = 1;\\n inv[0] = 1;\\n inv[1] = 1;\\n inv_fact[0] = 1;\\n inv_fact[1] = 1;\\n // メモの計算\\n repi(i, 2, MAX){\\n // 階乗\\n fact[i] = fact[i - 1] * i % MOD;\\n // 逆元\\n inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;\\n // 逆元の階乗\\n inv_fact[i] = inv_fact[i - 1] * inv[i] % MOD;\\n }\\n}\\n\\n// 二項係数の実体\\nll nCk(int n, int k) {\\n ll x = fact[n]; // n!の計算\\n ll y = inv_fact[n-k]; // (n-k)!の計算\\n ll z = inv_fact[k]; // k!の計算\\n if (n < k) return 0; // 例外処理\\n if (n < 0 || k < 0) return 0; // 例外処理\\n return x * ((y * z) % MOD) % MOD; //二項係数の計算\\n}\\n\\n\\nll pow_pow(ll x,ll n,ll mod){\\n if(n==0) return 1;\\n x%=mod;\\n \\n ll res=pow_pow(x*x%mod,n/2,mod);\\n if(n&1)res=res*x%mod;\\n return res;\\n}\\n\\n\\n\\nint extgcd(int a,int b,int &x,int &y){\\n int d=a;\\n if(b!=0){\\n d=extgcd(b,a%b,y,x);\\n y-=(a/b)*x;\\n }else{\\n x=1;y=0;\\n }\\n return d;\\n}\\nint mod_inverse(int a,int m){\\n int x,y;\\n extgcd(a,m,x,y);\\n return (m+x%m)%m;\\n}\\n\\nstruct UnionFind {\\n vector<int> par, siz;\\n\\n UnionFind(int n) : par(n, -1) , siz(n, 1) { }\\n\\n // 根を求める\\n int root(int x) {\\n if (par[x] == -1) return x;\\n else return par[x] = root(par[x]);\\n }\\n\\n // x と y が同じグループに属するかどうか (根が一致するかどうか)\\n bool issame(int x, int y) {\\n return root(x) == root(y);\\n }\\n\\n // x を含むグループと y を含むグループとを併合する\\n bool unite(int x, int y) {\\n x = root(x), y = root(y);\\n if (x == y) return false; \\n if (siz[x] < siz[y]) swap(x, y);\\n par[y] = x;\\n siz[x] += siz[y];\\n return true;\\n }\\n\\n // x を含むグループのサイズ\\n int size(int x) {\\n return siz[root(x)];\\n }\\n};\\n \\n //min(x,y)が0以下の場合はmax(x,y)が返される\\n//ユークリッドの互除法を元に実装\\nll gcd(ll x,ll y){\\n if(y==0)return x;\\n return gcd(y,x%y);\\n}\\n\\n//オーバフローしないようにかける順番を気を付ける\\nll lcm(ll x,ll y){\\n return ll(x/gcd(x,y))*y;\\n}\\n\\n\\n\\n\\ntemplate<class T> bool chmin(T& a, T b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n else return false;\\n}\\ntemplate<class T> bool chmax(T& a, T b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n else return false;\\n}\\n\\n//using Graph1=vector<vector<Edge> >;\\n//using Graph=vector<vector<int> >;\\n\\n// auto mod int\\n// https://youtu.be/L8grWxBlIZ4?t=9858\\n// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize\\n// https://youtu.be/8uowVvQ_-Mo?t=1329 : division\\nconst int mod = 1e9+7;\\nstruct mint {\\n ll x; // typedef long long ll;\\n mint(ll x=0):x((x%mod+mod)%mod){}\\n mint operator-() const { return mint(-x);}\\n mint& operator+=(const mint a) {\\n if ((x += a.x) >= mod) x -= mod;\\n return *this;\\n }\\n mint& operator-=(const mint a) {\\n if ((x += mod-a.x) >= mod) x -= mod;\\n return *this;\\n }\\n mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}\\n mint operator+(const mint a) const { return mint(*this) += a;}\\n mint operator-(const mint a) const { return mint(*this) -= a;}\\n mint operator*(const mint a) const { return mint(*this) *= a;}\\n mint pow(ll t) const {\\n if (!t) return 1;\\n mint a = pow(t>>1);\\n a *= a;\\n if (t&1) a *= *this;\\n return a;\\n }\\n \\n // for prime mod\\n mint inv() const { return pow(mod-2);}\\n mint& operator/=(const mint a) { return *this *= a.inv();}\\n mint operator/(const mint a) const { return mint(*this) /= a;}\\n};\\nistream& operator>>(istream& is, const mint& a) { return is >> a.x;}\\nostream& operator<<(ostream& os, const mint& a) { return os << a.x;}\\n// combination mod prime\\n// https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619\\nstruct combination {\\n vector<mint> fact, ifact;\\n combination(int n):fact(n+1),ifact(n+1) {\\n //assert(n < mod);\\n fact[0] = 1;\\n for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;\\n ifact[n] = fact[n].inv();\\n for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;\\n }\\n mint operator()(int n, int k) {\\n if (k < 0 || k > n) return 0;\\n return fact[n]*ifact[k]*ifact[n-k];\\n }\\n mint p(int n, int k) {\\n return fact[n]*ifact[n-k];\\n }\\n} c(1000005);\\n \\n\\n\\n\\n//const ll INF=1e18;\\n\\n\\nclass segment_tree {\\nprivate:\\n\\tint sz;\\n\\tstd::vector<int> seg;\\n\\tstd::vector<int> lazy;\\n\\tvoid push(int k) {\\n\\t\\tif (k < sz) {\\n\\t\\t\\tlazy[k * 2] = max(lazy[k * 2], lazy[k]);\\n\\t\\t\\tlazy[k * 2 + 1] = max(lazy[k * 2 + 1], lazy[k]);\\n\\t\\t}\\n\\t\\tseg[k] = max(seg[k], lazy[k]);\\n\\t\\tlazy[k] = 0;\\n\\t}\\n\\tvoid update(int a, int b, int x, int k, int l, int r) {\\n\\t\\tpush(k);\\n\\t\\tif (r <= a || b <= l) return;\\n\\t\\tif (a <= l && r <= b) {\\n\\t\\t\\tlazy[k] = x;\\n\\t\\t\\tpush(k);\\n\\t\\t\\treturn;\\n\\t\\t}\\n\\t\\tupdate(a, b, x, k * 2, l, (l + r) >> 1);\\n\\t\\tupdate(a, b, x, k * 2 + 1, (l + r) >> 1, r);\\n\\t\\tseg[k] = max(seg[k * 2], seg[k * 2 + 1]);\\n\\t}\\n\\tint range_max(int a, int b, int k, int l, int r) {\\n\\t\\tpush(k);\\n\\t\\tif (r <= a || b <= l) return 0;\\n\\t\\tif (a <= l && r <= b) return seg[k];\\n\\t\\tint lc = range_max(a, b, k * 2, l, (l + r) >> 1);\\n\\t\\tint rc = range_max(a, b, k * 2 + 1, (l + r) >> 1, r);\\n\\t\\treturn max(lc, rc);\\n\\t}\\npublic:\\n\\tsegment_tree() : sz(0), seg(), lazy() {};\\n\\tsegment_tree(int N) {\\n\\t\\tsz = 1;\\n\\t\\twhile (sz < N) {\\n\\t\\t\\tsz *= 2;\\n\\t\\t}\\n\\t\\tseg = std::vector<int>(sz * 2, 0);\\n\\t\\tlazy = std::vector<int>(sz * 2, 0);\\n\\t}\\n\\tvoid update(int l, int r, int x) {\\n\\t\\tupdate(l, r, x, 1, 0, sz);\\n\\t}\\n\\tint range_max(int l, int r) {\\n\\t\\treturn range_max(l, r, 1, 0, sz);\\n\\t}\\n //cin.tie(0);\\n //ios_base::sync_with_stdio(false); これらをmain関数の先頭に\\n};\\n\\nconst ll seg_size=100005;\\nll seg[seg_size*2];\\n\\nvoid seg_set(int ind,ll v){\\n ind+=seg_size;\\n seg[ind]=max(seg[ind],v);\\n while(true){\\n if(ind==0)break;\\n ind/=2;\\n seg[ind]=max(seg[ind*2],seg[ind*2+1]);\\n }\\n}\\n\\nll seg_take(int l,int r){\\n l+=seg_size;\\n r+=seg_size;\\n ll ans=0;\\n while(l<r){\\n if(l%2==1){\\n ans=max(ans,seg[l]);\\n l++;\\n }\\n l/=2;\\n if(r%2==1){\\n ans=max(ans,seg[r-1]);\\n r--;\\n }\\n r/=2;\\n\\n }\\n return ans;\\n}\\nstruct Edge{\\n int to;ll w;\\n Edge(int to,ll w):to(to),w(w){}\\n};\\n\\nvoid comp(vector<int>&a){\\n set<int>s(a.begin(),a.end());\\n map<int,int>d;\\n int cnt=0;\\n for(auto x:s)d[x]=cnt++;\\n for(auto&x:a)x=d[x];\\n}\\n\\nusing graph = vector<vector<ll> > ;\\n\\nint main(){\\n vector<ll> ans;\\n while(1){\\n int n; cin >> n;\\n if(n==0)break;\\n vector<ll> a(n);\\n ll tot=0;\\n rep(i,n){\\n cin >> a[i];\\n tot+=a[i];\\n }\\n int cnt=0;\\n rep(i,n)if(n*a[i]<=tot)cnt++;\\n ans.push_back(cnt);\\n }\\n for(auto u: ans)cout << u << endl;\\n \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 18932,\n \"score_of_the_acc\": -1,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1624_6029003\",\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/////////////////////////////////////////\\n\\nint main(void) {\\n /////////////////////////////////////////////////////\\n\\n double n;\\n while (cin >> n) {\\n if (!n) break;\\n\\n vd a(n);\\n double sum = 0;\\n rep(i, n) {\\n cin >> a[i];\\n sum += a[i];\\n }\\n\\n int count = 0;\\n rep(i, n) {\\n if (a[i] <= sum / n) count++;\\n }\\n cout << count << endl;\\n }\\n\\n //////////////////////////////////////////////////////\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3228,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":991,"cells":{"group_id":{"kind":"string","value":"aoj_1616_cpp"},"problem_description":{"kind":"string","value":"Taro's Shopping\nMammy decided to give Taro his first shopping experience.\nMammy tells him to choose any two items he wants from those\nlisted in the shopping catalogue,\nbut Taro cannot decide which two, as all the items look attractive.\nThus he plans to buy the pair of two items with\nthe highest price sum, not exceeding the amount Mammy allows.\nAs getting two of the same item is boring, he wants two different items.\nYou are asked to help Taro select the two items.\nThe price list for all of the items is given.\nAmong pairs of two items in the list,\nfind the pair with the highest price sum\nnot exceeding the allowed amount,\nand report the sum.\nTaro is buying two items, not one, nor three, nor more.\nNote that, two or more items in the list may be priced equally.\nInput\nThe input consists of multiple datasets, each in the following format.\nn\nm\na\n1\na\n2\n...\na\nn\nA dataset consists of two lines.\nIn the first line, the number of items\nn\nand the maximum\npayment allowed\nm\nare given.\nn\nis an integer satisfying 2 ≤\nn\n≤ 1000.\nm\nis an integer satisfying 2 ≤\nm\n≤ 2,000,000.\nIn the second line, prices of\nn\nitems are given.\na\ni\n(1 ≤\ni\n≤\nn\n) is the price\nof the\ni\n-th item.\nThis value is an integer greater than or equal to 1 and\nless than or equal to 1,000,000.\nThe end of the input is indicated by a line containing two zeros.\nThe sum of\nn\n's of all the datasets does not exceed 50,000.\nOutput\nFor each dataset, find the pair with the highest price sum\nnot exceeding the allowed amount\nm\nand output the sum in a line.\nIf the price sum of every pair of items exceeds\nm\n,\noutput\nNONE\ninstead.\nSample Input\n3 45\n10 20 30\n6 10\n1 2 5 8 9 11\n7 100\n11 34 83 47 59 29 70\n4 100\n80 70 60 50\n4 20\n10 5 10 16\n0 0\nOutput for the Sample Input\n40\n10\n99\nNONE\n20"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1616_10840723","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main(){\n while(true){\n int n, m;\n cin >> n >> m;\n if(!n) break;\n\n vector<int> price(n);\n for(auto& i:price) cin >> i;\n\n int ans = -1;\n\n for(int i=0;i<n;i++){\n for(int j=i+1;j<n;j++){\n if(price[i] + price[j] > m) continue;\n if(price[i] + price[j] > ans) ans = price[i] + price[j];\n }\n }\n \n if(ans == -1) cout << \"NONE\" << endl;\n else cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3368,"score_of_the_acc":-0.0801,"final_rank":12},{"submission_id":"aoj_1616_10600934","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing a2 = array<ll, 2>;\nusing a3 = array<ll, 3>;\n\ntemplate <typename A>\nvoid chmin(A &l, const A &r) {\n if (r < l)\n l = r;\n}\ntemplate <typename A>\nvoid chmax(A &l, const A &r) {\n if (l < r)\n l = r;\n}\n\nll mod = 998244353;\n\nll n, m;\nvector<ll> v;\nvoid input() {\n cin >> n >> m;\n v.resize(n);\n for (auto &x : v) cin >> x;\n}\n\nvoid solve() {\n ll ans = 0;\n for (int i = 0; i < n; i++) {\n for (int j = i + 1; j < n; j++) {\n if (v[i] + v[j] <= m) {\n chmax(ans, v[i] + v[j]);\n }\n }\n }\n\n if (ans == 0)\n cout << \"NONE\" << endl;\n else\n cout << ans << endl;\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n\n while (1) {\n input();\n if (n == 0)\n break;\n solve();\n }\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3408,"score_of_the_acc":-0.0903,"final_rank":16},{"submission_id":"aoj_1616_9614596","code_snippet":"#include <iostream>\n#include <vector>\nusing namespace std;\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n\nint main()\n{\n\twhile (true)\n\t{\n\t\tint n, m;\n\t\tcin >> n >> m;\n\n\t\tif (n == 0 && m == 0)\n\t\t\tbreak;\n\n\t\tvector<int> a(n);\n\t\trep(i, n) cin >> a[i];\n\n\t\tint ans = 0;\n\t\tfor (int i = 0; i < n - 1; i++)\n\t\t{\n\t\t\tfor (int j = i+1; j < n; j++)\n\t\t\t{\n\t\t\t\tif (a[i] + a[j] <= m)\n\t\t\t\t{\n\t\t\t\t\tans = max(ans, a[i] + a[j]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tif (ans == 0)\n\t\t\tcout << \"NONE\" << endl;\n\t\telse\n\t\t\tcout << ans << endl;\n\n\t}\n\n\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3056,"score_of_the_acc":-0.001,"final_rank":2},{"submission_id":"aoj_1616_9494418","code_snippet":"#include <iostream>\n#include <cmath>\nusing namespace std;\n\nconst int MAX_N = 1000;\nint n, m, ans;\nint a[MAX_N];\n\nint main() {\n while (cin >> n >> m) {\n if (n == 0 && m == 0)\n break;\n ans = 0;\n for (int i = 0; i < n; i++)\n cin >> a[i];\n for (int i = 0; i < n; i++) {\n for (int j = i + 1; j < n; j++) {\n if (a[i] + a[j] <= m)\n ans = max(ans, a[i] + a[j]);\n }\n }\n if (ans)\n cout << ans << endl;\n else\n cout << \"NONE\" << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3100,"score_of_the_acc":-0.0122,"final_rank":6},{"submission_id":"aoj_1616_9419021","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n using ll=long long;\n using vl=vector<ll>;\n using vll=vector<vl>;\n int n=1,m;\n while(n!=0){\n cin>>n>>m;\n if(n==0 && m==0){\n break;\n }\n vl s(n);\n for(int i=0;i<n;i++){\n cin>>s.at(i);\n }\n int r=0;\n for(int i=0;i<n-1;i++){\n for(int j=i+1;j<n;j++){\n if(s.at(i)+s.at(j)<=m){\n if(s.at(i)+s.at(j)>r){\n r=s.at(i)+s.at(j);\n }\n }\n }\n }\n if(r==0){\n cout << \"NONE\" <<endl;\n }\n else{\n cout<<r<<endl;\n }\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3312,"score_of_the_acc":-0.0659,"final_rank":10},{"submission_id":"aoj_1616_9416414","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define rep(i,N) for(i=0;i<N;i++)\n#define ll long long\n\nint main(void){\n vector<ll>ans;\n ll i,j,k;\n\n for(;;){\n ll N,M;\n ll A[1009];\n cin>>N>>M;\n if(N==0&&M==0)break;\n rep(i,N)cin>>A[i];\n ll a=-1;\n rep(i,N){\n for(j=i+1;j<N;j++){\n ll sum=A[i]+A[j];\n if(M<sum)continue;\n a=max(a,sum);\n }\n }\n ans.push_back(a);\n }\n\n rep(i,ans.size()){\n if(ans[i]==-1){\n cout<<\"NONE\"<<endl;\n continue;\n }\n cout<<ans[i]<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3164,"score_of_the_acc":-0.0284,"final_rank":8},{"submission_id":"aoj_1616_9411118","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nusing ll = long long;\nusing ull = unsigned long long;\nconst int INF = 2001001001;\nconst ll LINF = 9001001001001001001;\n\n#define rep(i, n) for (int i = 0; (i) < (n); (i)++)\n#define rep1(i, n) for (int i = 1; (i) < (n + 1); (i)++)\n#define all(a) (a).begin(), (a).end()\n\nint main(){\n while(true){\n int n, m;\n cin >> n >> m;\n\n if(!n && !m) break; \n\n int a[n];\n rep(i,n) cin >> a[i];\n\n int ans = 0;\n rep(i,n){\n for(int j = i+1; j < n; j++){\n if(a[i] + a[j] <= m) ans = max(ans, a[i] + a[j]);\n }\n }\n if(ans) cout << ans << endl;\n else cout << \"NONE\" << endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3436,"score_of_the_acc":-0.0974,"final_rank":17},{"submission_id":"aoj_1616_9394615","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, n) for (ll i = 0; i < (n); ++i)\nint main() {\n\n int n,m,l;\n bool end = false;\n int q = 0;\n vector<string> result(1000);\n while(end == false){\n l = 0;\n cin >> n >> m;\n if(n==0 && m== 0){\n /*rep(i,q){\n cout << result[i] << endl;\n }*/\n end = true;\n }else{\n vector<int> a(n);\n for(ll i = 0; i < n ;i++){\n //cout<< i << endl;\n cin >> a.at(i);\n //cout<< i << endl;\n }\n //cout<< \"終わり\" << endl;\n for (ll i = 0; i < n; i++)\n {\n //cout<< i << endl;\n for(int j = 0; j < n; j++)\n {\n if(l < a[i] + a[j] ){\n if(a[i] + a[j] <= m){\n if(i!=j){\n l = a[i] + a[j];\n }\n\n\n }\n }\n\n }\n\n }\n if(l != 0 && l <= m){\n //result[q]=to_string(l);\n cout << l << endl;\n }\n if(l == 0){\n // result[q]=\"NONE\";\n cout << \"NONE\" << endl;\n }\n q++;\n \n\n }\n\n}\n}","accuracy":1,"time_ms":10,"memory_kb":3376,"score_of_the_acc":-0.0822,"final_rank":14},{"submission_id":"aoj_1616_9394605","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, n) for (ll i = 0; i < (n); ++i)\nint main() {\n\n int n,m,l;\n bool end = false;\n int q = 0;\n vector<string> result(1000);\n while(end == false){\n l = 0;\n cin >> n >> m;\n if(n==0 && m== 0){\n rep(i,q){\n cout << result[i] << endl;\n }\n end = true;\n }else{\n vector<int> a(n);\n for(ll i = 0; i < n ;i++){\n //cout<< i << endl;\n cin >> a.at(i);\n //cout<< i << endl;\n }\n //cout<< \"終わり\" << endl;\n for (ll i = 0; i < n; i++)\n {\n //cout<< i << endl;\n for(int j = 0; j < n; j++)\n {\n if(l < a[i] + a[j] ){\n if(a[i] + a[j] <= m){\n if(i!=j){\n l = a[i] + a[j];\n }\n\n\n }\n }\n\n }\n\n }\n if(l != 0 && l <= m){\n result[q]=to_string(l);\n\n }\n if(l == 0){\n result[q]=\"NONE\";\n }\n q++;\n \n\n }\n\n}\n}","accuracy":1,"time_ms":10,"memory_kb":3236,"score_of_the_acc":-0.0467,"final_rank":9},{"submission_id":"aoj_1616_9381277","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nint main() {\n int n,m;\n cin>>n>>m;\n while(n||m){\n vector<int> a(n);\n for(int i=0;i<n;i++)cin>>a[i];\n int ans=0;\n for(int i=0;i<n-1;i++) for(int j=i+1;j<n;j++){\n if(a[i]+a[j]<=m) ans=max(ans,a[i]+a[j]);\n }\n if(ans==0) cout<<\"NONE\"<<endl;\n else cout<<ans<<endl;\n cin>>n>>m;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3052,"score_of_the_acc":0,"final_rank":1},{"submission_id":"aoj_1616_9377498","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)\n\nint main() {\n\twhile (1)\n\t{\n\t\tint\tn, m;\n\t\tcin >> n >> m;\n\t\tif (!n && !m)\n\t\t\tbreak ;\n\t\tvector<int> a(n);\n\t\trep(i, 0, n) cin >> a[i];\n\n\t\tint\tmax = 0;\n\t\trep(i, 0, n - 1)\n\t\t{\n\t\t\trep(j, i + 1, n)\n\t\t\t{\n\t\t\t\tif (a[i] + a[j] <= m && a[i] + a[j] > max)\n\t\t\t\t\tmax = a[i] + a[j];\n\t\t\t}\n\t\t}\n\t\tif (!max)\n\t\t\tcout << \"NONE\" << endl;\n\t\telse\n\t\t\tcout << max << endl;\n\t}\n\treturn (0);\n}","accuracy":1,"time_ms":10,"memory_kb":3352,"score_of_the_acc":-0.0761,"final_rank":11},{"submission_id":"aoj_1616_9377403","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for (int i = 1; i <= n; i++)\n#define rep2(i,n) for (int i = 0; i < n; i++)\n\nint main(){\n vector<int> vec;\nwhile(true){\n int n, m;\n if(n == 0 && m == 0){\n break;\n }\n cin >> n >> m;\n int a[n];\n rep(i,n) cin >> a[i];\n int ans = -1;\n rep(i,n){\n rep(j,n){\n if(i != j && a[i] + a[j] <= m){\n ans = max(a[i] + a[j] , ans);\n }\n }\n } \n vec.push_back(ans);\n}\n int k = vec.size();\n rep2(i,k-1){\n if(vec[i] == -1) cout << \"NONE\" << endl;\n else cout << vec[i] << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3060,"score_of_the_acc":-0.002,"final_rank":3},{"submission_id":"aoj_1616_9377306","code_snippet":"#include <bits/stdc++.h>\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\n#define rep2(i, s, n) for (int i = (int)s; i < (int)(n); i++)\nusing namespace std;\nusing ll = long long;\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\n\nint main() {\n while (true) {\n int n, m;\n cin >> n >> m;\n if (n == 0 && m == 0) break;\n \n vector<int> a(n);\n rep(i, n) {\n cin >> a[i];\n }\n\n int ans = 0;\n rep(i, n) {\n rep(j, n) {\n if (i == j) continue;\n int sum = a[i] + a[j];\n if (sum <= m) chmax(ans, sum);\n }\n }\n\n if (ans == 0) {\n cout << \"NONE\" << endl;\n } else {\n cout << ans << endl;\n }\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3448,"score_of_the_acc":-0.1004,"final_rank":18},{"submission_id":"aoj_1616_9377280","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define rep(i, n) for(int i=0; i<(int)(n); i++)\n#define ll long long\n#define Graph vector<vector<int>>\n#define pii pair<int, int>\n\nint main(){\n\n while(true){\n int n, m;\n cin >> n >> m;\n if(n == 0 && m == 0) break;\n vector<int> vec(n);\n rep(i, n){\n cin >> vec[i];\n }\n int ans=0;\n rep(i, n){\n rep(j, n){\n if(i == j) continue;\n if(vec[i]+vec[j] <= m){\n ans = max(ans, vec[i]+vec[j]);\n }\n }\n }\n if(ans == 0){\n cout << \"NONE\" << endl;\n }else{\n cout << ans << endl;\n }\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3096,"score_of_the_acc":-0.0112,"final_rank":5},{"submission_id":"aoj_1616_9371103","code_snippet":"#include <bits/stdc++.h>\n//#include \"atcoder/all\"\nusing namespace std;\n//using namespace atcoder;\nusing ll = long long;\nusing ld = long double;\nusing uint = unsigned int;\nusing ull = unsigned long long;\n#define all(x) (x).begin(), (x).end()\n#define rep1(a) for(ll i = 0; i < a; i++)\n#define rep2(i, a) for(ll i = 0; i < a; i++)\n#define rep3(i, a, b) for(ll i = a; i < b; i++)\n#define rep4(i, a, b, c) for(ll i = a; i < b; i += c)\n#define overload4(a, b, c, d, e, ...) e\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\n#define rrep(i, a, b) for (ll i = a; i >= b; i--)\n#define fore(i, a) for (auto &i : a)\n#define vvl(a,b,c) vector<vector<ll>>(a,vector<ll>(b,c))\n#define vvvl(a,b,c,d) vector<vector<vector<ll>>>(a,vvl(b,c,d))\n#define enld endl\n#define fix(n) cout << fixed << setprecision(n);\n#define yesno(b) cout << (b ? \"Yes\":\"No\") << endl\n#define debug(var) do{std::cout << #var << \" : \";view(var);}while(0)\ntemplate<typename T> void view(T e){std::cout << e << std::endl;}\ntemplate<typename T> void view(const std::vector<T>& v){for(const auto& e : v){ std::cout << e << \" \"; } std::cout << std::endl;}\ntemplate<typename T> void view(const std::vector<std::vector<T> >& vv){ for(const auto& v : vv){ view(v); } }\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }\ntemplate<class T>using rp_queue=priority_queue<T,vector<T>,greater<T>>;\nvoid fast_io(){cin.tie(nullptr);ios_base::sync_with_stdio(false);}\nconst int inf = INT_MAX / 2;\nconst ll infl = 1LL<<60;\nconst ll mod = 1000000007;\nconst ll mod2 = 998244353;\nconst int dx[8] = {0, 1, 0,-1, 1, 1,-1,-1};\nconst int dy[8] = {1, 0,-1, 0, 1,-1, 1,-1};\n\nint main() {\n fast_io();\n for(;;) {\n int N,M; cin >> N >> M;\n if(N==0) break;\n vector<ll>A(N); rep(N) cin >> A[i];\n ll ans = 0;\n rep(i,N) rep(j,N) if(i!=j && A[i]+A[j]<=M) chmax(ans,A[i]+A[j]);\n if(ans==0) cout << \"NONE\" << enld;\n else cout << ans << endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3476,"score_of_the_acc":-0.1075,"final_rank":19},{"submission_id":"aoj_1616_9367152","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n while(true){\n int n,m;\n cin >> n >> m;\n if(n==0&&m==0)break;\n vector<int>a(n);\n for(int i=0;i<n;i++){\n cin >> a[i];\n }\n\n vector<int>sum(0);\n for(int i=0;i<n-1;i++){\n for(int j=i+1;j<n;j++){\n sum.push_back(a[i]+a[j]);\n }\n }\n sort(sum.begin(),sum.end());\n\n // for(int i=0;i<sum.size();i++){\n // cout << sum[i] << \" \";\n // }\n // cout << endl;\n auto it = upper_bound(sum.begin(),sum.end(),m);\n // cout << it-sum.begin() << endl;\n if(it-sum.begin()==0){\n cout << \"NONE\" << endl;\n }else{\n cout << sum[it-sum.begin()-1] << endl;\n }\n }\n}","accuracy":1,"time_ms":190,"memory_kb":6996,"score_of_the_acc":-2,"final_rank":20},{"submission_id":"aoj_1616_9347900","code_snippet":"#include <bits/extc++.h>\nusing namespace std;\n\nbool solve();\n\nint main() {\n while(solve());\n return 0;\n}\n\nbool solve() {\n int n, m;\n cin >> n >> m;\n if (n == 0 && m == 0) return false;\n vector<int> a(n);\n for (int i = 0; i < n; i++) cin >> a[i];\n\n int ans = -1;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n if (i == j) continue;\n if (a[i] + a[j] <= m) ans = max(ans, a[i] + a[j]);\n }\n }\n\n if (ans == -1) puts(\"NONE\");\n else cout << ans << endl;\n return true;\n}","accuracy":1,"time_ms":10,"memory_kb":3092,"score_of_the_acc":-0.0101,"final_rank":4},{"submission_id":"aoj_1616_9238122","code_snippet":"#include<iostream>\nusing namespace std;\n\nint main(){\n int n,m,sum,x;\n int ans;\n while(true){\n cin >> n >> m;\n ans=0;\n if(n==0 && m==0){\n break;\n }\n int array[n];\n for(int i=0;i<n;i++) cin >> array[i];\n for(int i=0;i<n;i++){\n for(int j=0;j<n; j++){\n sum=array[i] + array[j];\n if(\n sum<=m && ans<sum && i!=j)ans=sum;\n }\n }\n if(ans!=0){\n cout << ans << endl;\n }else{\n cout << \"NONE\" << endl;\n }\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3120,"score_of_the_acc":-0.0172,"final_rank":7},{"submission_id":"aoj_1616_9237712","code_snippet":"#include <iostream>\n#include <algorithm>\n\nusing namespace std;\nint main() {\n while (true){\n int n, m;\n cin >> n >> m;\n if (n == 0 && m == 0) break;\n int a[n];\n for (int i = 0; i < n; i++) cin >> a[i];\n int ans = -1;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n int current = a[i] + a[j];\n if (i == j) continue;\n if (ans < current && current <= m) {\n ans = current;\n }\n }\n }\n if (ans == -1) cout << \"NONE\" << endl;\n else cout << ans << endl;\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3368,"score_of_the_acc":-0.0801,"final_rank":12},{"submission_id":"aoj_1616_9221818","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define rep(i,n) for (int i = 0; i < (n); ++i)\nusing ll = long long;\nint ctoi(char c){return c-'0';}\nll ctoll(char c){return c-'0';}\n\nvoid solve(int n,int m){\n vector<int>a(n);\n int ans = -1;\n rep(i,n)cin >> a[i];\n rep(i,n)rep(j,n){\n if(i==j)continue;\n if(ans < a[i]+a[j]){\n if(a[i]+a[j]<=m)ans = a[i]+a[j];\n }\n }\n if(ans == -1)cout << \"NONE\" << endl;\n else cout << ans << endl;\n}\n\nint main(){\n while(true){\n int n,m;\n cin >> n >> m;\n if(n==0&&m==0)break;\n solve(n,m);\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3380,"score_of_the_acc":-0.0832,"final_rank":15}],"string":"[\n {\n \"submission_id\": \"aoj_1616_10840723\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\nint main(){\\n while(true){\\n int n, m;\\n cin >> n >> m;\\n if(!n) break;\\n\\n vector<int> price(n);\\n for(auto& i:price) cin >> i;\\n\\n int ans = -1;\\n\\n for(int i=0;i<n;i++){\\n for(int j=i+1;j<n;j++){\\n if(price[i] + price[j] > m) continue;\\n if(price[i] + price[j] > ans) ans = price[i] + price[j];\\n }\\n }\\n \\n if(ans == -1) cout << \\\"NONE\\\" << endl;\\n else cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3368,\n \"score_of_the_acc\": -0.0801,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1616_10600934\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing a2 = array<ll, 2>;\\nusing a3 = array<ll, 3>;\\n\\ntemplate <typename A>\\nvoid chmin(A &l, const A &r) {\\n if (r < l)\\n l = r;\\n}\\ntemplate <typename A>\\nvoid chmax(A &l, const A &r) {\\n if (l < r)\\n l = r;\\n}\\n\\nll mod = 998244353;\\n\\nll n, m;\\nvector<ll> v;\\nvoid input() {\\n cin >> n >> m;\\n v.resize(n);\\n for (auto &x : v) cin >> x;\\n}\\n\\nvoid solve() {\\n ll ans = 0;\\n for (int i = 0; i < n; i++) {\\n for (int j = i + 1; j < n; j++) {\\n if (v[i] + v[j] <= m) {\\n chmax(ans, v[i] + v[j]);\\n }\\n }\\n }\\n\\n if (ans == 0)\\n cout << \\\"NONE\\\" << endl;\\n else\\n cout << ans << endl;\\n}\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n\\n while (1) {\\n input();\\n if (n == 0)\\n break;\\n solve();\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3408,\n \"score_of_the_acc\": -0.0903,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1616_9614596\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\nusing namespace std;\\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\\n\\nint main()\\n{\\n\\twhile (true)\\n\\t{\\n\\t\\tint n, m;\\n\\t\\tcin >> n >> m;\\n\\n\\t\\tif (n == 0 && m == 0)\\n\\t\\t\\tbreak;\\n\\n\\t\\tvector<int> a(n);\\n\\t\\trep(i, n) cin >> a[i];\\n\\n\\t\\tint ans = 0;\\n\\t\\tfor (int i = 0; i < n - 1; i++)\\n\\t\\t{\\n\\t\\t\\tfor (int j = i+1; j < n; j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif (a[i] + a[j] <= m)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tans = max(ans, a[i] + a[j]);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (ans == 0)\\n\\t\\t\\tcout << \\\"NONE\\\" << endl;\\n\\t\\telse\\n\\t\\t\\tcout << ans << endl;\\n\\n\\t}\\n\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3056,\n \"score_of_the_acc\": -0.001,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1616_9494418\",\n \"code_snippet\": \"#include <iostream>\\n#include <cmath>\\nusing namespace std;\\n\\nconst int MAX_N = 1000;\\nint n, m, ans;\\nint a[MAX_N];\\n\\nint main() {\\n while (cin >> n >> m) {\\n if (n == 0 && m == 0)\\n break;\\n ans = 0;\\n for (int i = 0; i < n; i++)\\n cin >> a[i];\\n for (int i = 0; i < n; i++) {\\n for (int j = i + 1; j < n; j++) {\\n if (a[i] + a[j] <= m)\\n ans = max(ans, a[i] + a[j]);\\n }\\n }\\n if (ans)\\n cout << ans << endl;\\n else\\n cout << \\\"NONE\\\" << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3100,\n \"score_of_the_acc\": -0.0122,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1616_9419021\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nint main(){\\n using ll=long long;\\n using vl=vector<ll>;\\n using vll=vector<vl>;\\n int n=1,m;\\n while(n!=0){\\n cin>>n>>m;\\n if(n==0 && m==0){\\n break;\\n }\\n vl s(n);\\n for(int i=0;i<n;i++){\\n cin>>s.at(i);\\n }\\n int r=0;\\n for(int i=0;i<n-1;i++){\\n for(int j=i+1;j<n;j++){\\n if(s.at(i)+s.at(j)<=m){\\n if(s.at(i)+s.at(j)>r){\\n r=s.at(i)+s.at(j);\\n }\\n }\\n }\\n }\\n if(r==0){\\n cout << \\\"NONE\\\" <<endl;\\n }\\n else{\\n cout<<r<<endl;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3312,\n \"score_of_the_acc\": -0.0659,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1616_9416414\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define rep(i,N) for(i=0;i<N;i++)\\n#define ll long long\\n\\nint main(void){\\n vector<ll>ans;\\n ll i,j,k;\\n\\n for(;;){\\n ll N,M;\\n ll A[1009];\\n cin>>N>>M;\\n if(N==0&&M==0)break;\\n rep(i,N)cin>>A[i];\\n ll a=-1;\\n rep(i,N){\\n for(j=i+1;j<N;j++){\\n ll sum=A[i]+A[j];\\n if(M<sum)continue;\\n a=max(a,sum);\\n }\\n }\\n ans.push_back(a);\\n }\\n\\n rep(i,ans.size()){\\n if(ans[i]==-1){\\n cout<<\\\"NONE\\\"<<endl;\\n continue;\\n }\\n cout<<ans[i]<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3164,\n \"score_of_the_acc\": -0.0284,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1616_9411118\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nusing ll = long long;\\nusing ull = unsigned long long;\\nconst int INF = 2001001001;\\nconst ll LINF = 9001001001001001001;\\n\\n#define rep(i, n) for (int i = 0; (i) < (n); (i)++)\\n#define rep1(i, n) for (int i = 1; (i) < (n + 1); (i)++)\\n#define all(a) (a).begin(), (a).end()\\n\\nint main(){\\n while(true){\\n int n, m;\\n cin >> n >> m;\\n\\n if(!n && !m) break; \\n\\n int a[n];\\n rep(i,n) cin >> a[i];\\n\\n int ans = 0;\\n rep(i,n){\\n for(int j = i+1; j < n; j++){\\n if(a[i] + a[j] <= m) ans = max(ans, a[i] + a[j]);\\n }\\n }\\n if(ans) cout << ans << endl;\\n else cout << \\\"NONE\\\" << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3436,\n \"score_of_the_acc\": -0.0974,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1616_9394615\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i, n) for (ll i = 0; i < (n); ++i)\\nint main() {\\n\\n int n,m,l;\\n bool end = false;\\n int q = 0;\\n vector<string> result(1000);\\n while(end == false){\\n l = 0;\\n cin >> n >> m;\\n if(n==0 && m== 0){\\n /*rep(i,q){\\n cout << result[i] << endl;\\n }*/\\n end = true;\\n }else{\\n vector<int> a(n);\\n for(ll i = 0; i < n ;i++){\\n //cout<< i << endl;\\n cin >> a.at(i);\\n //cout<< i << endl;\\n }\\n //cout<< \\\"終わり\\\" << endl;\\n for (ll i = 0; i < n; i++)\\n {\\n //cout<< i << endl;\\n for(int j = 0; j < n; j++)\\n {\\n if(l < a[i] + a[j] ){\\n if(a[i] + a[j] <= m){\\n if(i!=j){\\n l = a[i] + a[j];\\n }\\n\\n\\n }\\n }\\n\\n }\\n\\n }\\n if(l != 0 && l <= m){\\n //result[q]=to_string(l);\\n cout << l << endl;\\n }\\n if(l == 0){\\n // result[q]=\\\"NONE\\\";\\n cout << \\\"NONE\\\" << endl;\\n }\\n q++;\\n \\n\\n }\\n\\n}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3376,\n \"score_of_the_acc\": -0.0822,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1616_9394605\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i, n) for (ll i = 0; i < (n); ++i)\\nint main() {\\n\\n int n,m,l;\\n bool end = false;\\n int q = 0;\\n vector<string> result(1000);\\n while(end == false){\\n l = 0;\\n cin >> n >> m;\\n if(n==0 && m== 0){\\n rep(i,q){\\n cout << result[i] << endl;\\n }\\n end = true;\\n }else{\\n vector<int> a(n);\\n for(ll i = 0; i < n ;i++){\\n //cout<< i << endl;\\n cin >> a.at(i);\\n //cout<< i << endl;\\n }\\n //cout<< \\\"終わり\\\" << endl;\\n for (ll i = 0; i < n; i++)\\n {\\n //cout<< i << endl;\\n for(int j = 0; j < n; j++)\\n {\\n if(l < a[i] + a[j] ){\\n if(a[i] + a[j] <= m){\\n if(i!=j){\\n l = a[i] + a[j];\\n }\\n\\n\\n }\\n }\\n\\n }\\n\\n }\\n if(l != 0 && l <= m){\\n result[q]=to_string(l);\\n\\n }\\n if(l == 0){\\n result[q]=\\\"NONE\\\";\\n }\\n q++;\\n \\n\\n }\\n\\n}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3236,\n \"score_of_the_acc\": -0.0467,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1616_9381277\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nint main() {\\n int n,m;\\n cin>>n>>m;\\n while(n||m){\\n vector<int> a(n);\\n for(int i=0;i<n;i++)cin>>a[i];\\n int ans=0;\\n for(int i=0;i<n-1;i++) for(int j=i+1;j<n;j++){\\n if(a[i]+a[j]<=m) ans=max(ans,a[i]+a[j]);\\n }\\n if(ans==0) cout<<\\\"NONE\\\"<<endl;\\n else cout<<ans<<endl;\\n cin>>n>>m;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3052,\n \"score_of_the_acc\": 0,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1616_9377498\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)\\n\\nint main() {\\n\\twhile (1)\\n\\t{\\n\\t\\tint\\tn, m;\\n\\t\\tcin >> n >> m;\\n\\t\\tif (!n && !m)\\n\\t\\t\\tbreak ;\\n\\t\\tvector<int> a(n);\\n\\t\\trep(i, 0, n) cin >> a[i];\\n\\n\\t\\tint\\tmax = 0;\\n\\t\\trep(i, 0, n - 1)\\n\\t\\t{\\n\\t\\t\\trep(j, i + 1, n)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif (a[i] + a[j] <= m && a[i] + a[j] > max)\\n\\t\\t\\t\\t\\tmax = a[i] + a[j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (!max)\\n\\t\\t\\tcout << \\\"NONE\\\" << endl;\\n\\t\\telse\\n\\t\\t\\tcout << max << endl;\\n\\t}\\n\\treturn (0);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3352,\n \"score_of_the_acc\": -0.0761,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1616_9377403\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define rep(i,n) for (int i = 1; i <= n; i++)\\n#define rep2(i,n) for (int i = 0; i < n; i++)\\n\\nint main(){\\n vector<int> vec;\\nwhile(true){\\n int n, m;\\n if(n == 0 && m == 0){\\n break;\\n }\\n cin >> n >> m;\\n int a[n];\\n rep(i,n) cin >> a[i];\\n int ans = -1;\\n rep(i,n){\\n rep(j,n){\\n if(i != j && a[i] + a[j] <= m){\\n ans = max(a[i] + a[j] , ans);\\n }\\n }\\n } \\n vec.push_back(ans);\\n}\\n int k = vec.size();\\n rep2(i,k-1){\\n if(vec[i] == -1) cout << \\\"NONE\\\" << endl;\\n else cout << vec[i] << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3060,\n \"score_of_the_acc\": -0.002,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1616_9377306\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define rep(i, n) for (int i = 0; i < (int)(n); i++)\\n#define rep2(i, s, n) for (int i = (int)s; i < (int)(n); i++)\\nusing namespace std;\\nusing ll = long long;\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }\\n\\nint main() {\\n while (true) {\\n int n, m;\\n cin >> n >> m;\\n if (n == 0 && m == 0) break;\\n \\n vector<int> a(n);\\n rep(i, n) {\\n cin >> a[i];\\n }\\n\\n int ans = 0;\\n rep(i, n) {\\n rep(j, n) {\\n if (i == j) continue;\\n int sum = a[i] + a[j];\\n if (sum <= m) chmax(ans, sum);\\n }\\n }\\n\\n if (ans == 0) {\\n cout << \\\"NONE\\\" << endl;\\n } else {\\n cout << ans << endl;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3448,\n \"score_of_the_acc\": -0.1004,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1616_9377280\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define rep(i, n) for(int i=0; i<(int)(n); i++)\\n#define ll long long\\n#define Graph vector<vector<int>>\\n#define pii pair<int, int>\\n\\nint main(){\\n\\n while(true){\\n int n, m;\\n cin >> n >> m;\\n if(n == 0 && m == 0) break;\\n vector<int> vec(n);\\n rep(i, n){\\n cin >> vec[i];\\n }\\n int ans=0;\\n rep(i, n){\\n rep(j, n){\\n if(i == j) continue;\\n if(vec[i]+vec[j] <= m){\\n ans = max(ans, vec[i]+vec[j]);\\n }\\n }\\n }\\n if(ans == 0){\\n cout << \\\"NONE\\\" << endl;\\n }else{\\n cout << ans << endl;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3096,\n \"score_of_the_acc\": -0.0112,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1616_9371103\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n//#include \\\"atcoder/all\\\"\\nusing namespace std;\\n//using namespace atcoder;\\nusing ll = long long;\\nusing ld = long double;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\n#define all(x) (x).begin(), (x).end()\\n#define rep1(a) for(ll i = 0; i < a; i++)\\n#define rep2(i, a) for(ll i = 0; i < a; i++)\\n#define rep3(i, a, b) for(ll i = a; i < b; i++)\\n#define rep4(i, a, b, c) for(ll i = a; i < b; i += c)\\n#define overload4(a, b, c, d, e, ...) e\\n#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)\\n#define rrep(i, a, b) for (ll i = a; i >= b; i--)\\n#define fore(i, a) for (auto &i : a)\\n#define vvl(a,b,c) vector<vector<ll>>(a,vector<ll>(b,c))\\n#define vvvl(a,b,c,d) vector<vector<vector<ll>>>(a,vvl(b,c,d))\\n#define enld endl\\n#define fix(n) cout << fixed << setprecision(n);\\n#define yesno(b) cout << (b ? \\\"Yes\\\":\\\"No\\\") << endl\\n#define debug(var) do{std::cout << #var << \\\" : \\\";view(var);}while(0)\\ntemplate<typename T> void view(T e){std::cout << e << std::endl;}\\ntemplate<typename T> void view(const std::vector<T>& v){for(const auto& e : v){ std::cout << e << \\\" \\\"; } std::cout << std::endl;}\\ntemplate<typename T> void view(const std::vector<std::vector<T> >& vv){ for(const auto& v : vv){ view(v); } }\\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }\\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }\\ntemplate<class T>using rp_queue=priority_queue<T,vector<T>,greater<T>>;\\nvoid fast_io(){cin.tie(nullptr);ios_base::sync_with_stdio(false);}\\nconst int inf = INT_MAX / 2;\\nconst ll infl = 1LL<<60;\\nconst ll mod = 1000000007;\\nconst ll mod2 = 998244353;\\nconst int dx[8] = {0, 1, 0,-1, 1, 1,-1,-1};\\nconst int dy[8] = {1, 0,-1, 0, 1,-1, 1,-1};\\n\\nint main() {\\n fast_io();\\n for(;;) {\\n int N,M; cin >> N >> M;\\n if(N==0) break;\\n vector<ll>A(N); rep(N) cin >> A[i];\\n ll ans = 0;\\n rep(i,N) rep(j,N) if(i!=j && A[i]+A[j]<=M) chmax(ans,A[i]+A[j]);\\n if(ans==0) cout << \\\"NONE\\\" << enld;\\n else cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3476,\n \"score_of_the_acc\": -0.1075,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1616_9367152\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nint main(){\\n while(true){\\n int n,m;\\n cin >> n >> m;\\n if(n==0&&m==0)break;\\n vector<int>a(n);\\n for(int i=0;i<n;i++){\\n cin >> a[i];\\n }\\n\\n vector<int>sum(0);\\n for(int i=0;i<n-1;i++){\\n for(int j=i+1;j<n;j++){\\n sum.push_back(a[i]+a[j]);\\n }\\n }\\n sort(sum.begin(),sum.end());\\n\\n // for(int i=0;i<sum.size();i++){\\n // cout << sum[i] << \\\" \\\";\\n // }\\n // cout << endl;\\n auto it = upper_bound(sum.begin(),sum.end(),m);\\n // cout << it-sum.begin() << endl;\\n if(it-sum.begin()==0){\\n cout << \\\"NONE\\\" << endl;\\n }else{\\n cout << sum[it-sum.begin()-1] << endl;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 6996,\n \"score_of_the_acc\": -2,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1616_9347900\",\n \"code_snippet\": \"#include <bits/extc++.h>\\nusing namespace std;\\n\\nbool solve();\\n\\nint main() {\\n while(solve());\\n return 0;\\n}\\n\\nbool solve() {\\n int n, m;\\n cin >> n >> m;\\n if (n == 0 && m == 0) return false;\\n vector<int> a(n);\\n for (int i = 0; i < n; i++) cin >> a[i];\\n\\n int ans = -1;\\n for (int i = 0; i < n; i++) {\\n for (int j = 0; j < n; j++) {\\n if (i == j) continue;\\n if (a[i] + a[j] <= m) ans = max(ans, a[i] + a[j]);\\n }\\n }\\n\\n if (ans == -1) puts(\\\"NONE\\\");\\n else cout << ans << endl;\\n return true;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3092,\n \"score_of_the_acc\": -0.0101,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1616_9238122\",\n \"code_snippet\": \"#include<iostream>\\nusing namespace std;\\n\\nint main(){\\n int n,m,sum,x;\\n int ans;\\n while(true){\\n cin >> n >> m;\\n ans=0;\\n if(n==0 && m==0){\\n break;\\n }\\n int array[n];\\n for(int i=0;i<n;i++) cin >> array[i];\\n for(int i=0;i<n;i++){\\n for(int j=0;j<n; j++){\\n sum=array[i] + array[j];\\n if(\\n sum<=m && ans<sum && i!=j)ans=sum;\\n }\\n }\\n if(ans!=0){\\n cout << ans << endl;\\n }else{\\n cout << \\\"NONE\\\" << endl;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3120,\n \"score_of_the_acc\": -0.0172,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1616_9237712\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n\\nusing namespace std;\\nint main() {\\n while (true){\\n int n, m;\\n cin >> n >> m;\\n if (n == 0 && m == 0) break;\\n int a[n];\\n for (int i = 0; i < n; i++) cin >> a[i];\\n int ans = -1;\\n for (int i = 0; i < n; i++) {\\n for (int j = 0; j < n; j++) {\\n int current = a[i] + a[j];\\n if (i == j) continue;\\n if (ans < current && current <= m) {\\n ans = current;\\n }\\n }\\n }\\n if (ans == -1) cout << \\\"NONE\\\" << endl;\\n else cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3368,\n \"score_of_the_acc\": -0.0801,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1616_9221818\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define rep(i,n) for (int i = 0; i < (n); ++i)\\nusing ll = long long;\\nint ctoi(char c){return c-'0';}\\nll ctoll(char c){return c-'0';}\\n\\nvoid solve(int n,int m){\\n vector<int>a(n);\\n int ans = -1;\\n rep(i,n)cin >> a[i];\\n rep(i,n)rep(j,n){\\n if(i==j)continue;\\n if(ans < a[i]+a[j]){\\n if(a[i]+a[j]<=m)ans = a[i]+a[j];\\n }\\n }\\n if(ans == -1)cout << \\\"NONE\\\" << endl;\\n else cout << ans << endl;\\n}\\n\\nint main(){\\n while(true){\\n int n,m;\\n cin >> n >> m;\\n if(n==0&&m==0)break;\\n solve(n,m);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3380,\n \"score_of_the_acc\": -0.0832,\n \"final_rank\": 15\n }\n]","isConversational":false}}},{"rowIdx":992,"cells":{"group_id":{"kind":"string","value":"aoj_1622_cpp"},"problem_description":{"kind":"string","value":"Go around the Labyrinth\nExplorer Taro got a floor plan of a labyrinth.\nThe floor of this labyrinth is in the form of a two-dimensional grid.\nEach of the cells on the floor plan corresponds to a room and is indicated whether it can be entered or not.\nThe labyrinth has only one entrance located at the northwest corner, which is upper left on the floor plan.\nThere is a treasure chest in each of the rooms at other three corners, southwest, southeast, and northeast.\nTo get a treasure chest, Taro must move onto the room where the treasure chest is placed.\nTaro starts from the entrance room and repeats moving to one of the enterable adjacent rooms in the four directions, north, south, east, or west.\nHe wants to collect all the three treasure chests and come back to the entrance room.\nA bad news for Taro is that, the labyrinth is quite dilapidated and even for its enterable rooms except for the entrance room, floors are so fragile that, once passed over, it will collapse and the room becomes not enterable.\nDetermine whether it is possible to collect all the treasure chests and return to the entrance.\nInput\nThe input consists of at most 100 datasets, each in the following format.\nN\nM\nc\n1,1\n...\nc\n1,\nM\n...\nc\nN\n,1\n...\nc\nN\n,\nM\nThe first line contains\nN\n, which is the number of rooms in the north-south direction, and\nM\n, which is the number of rooms in the east-west direction.\nN\nand\nM\nare integers satisfying 2 ≤\nN\n≤ 50 and 2 ≤\nM\n≤ 50.\nEach of the following\nN\nlines contains a string of length\nM\n.\nThe\nj\n-th character\nc\ni,j\nof the\ni\n-th string represents the state of the room (\ni,j\n),\ni\n-th from the northernmost and\nj\n-th from the westernmost;\nthe character is the period ('\n.\n') if the room is enterable and the number sign ('\n#\n') if the room is not enterable.\nThe entrance is located at (1,1), and the treasure chests are placed at (\nN,\n1), (\nN,M\n) and (1,\nM\n).\nAll of these four rooms are enterable.\nTaro cannot go outside the given\nN\n×\nM\nrooms.\nThe end of the input is indicated by a line containing two zeros.\nOutput\nFor each dataset, output\nYES\nif it is possible to collect all the treasure chests and return to the entrance room, and otherwise, output\nNO\nin a single line.\nSample Input\n3 3\n...\n.#.\n...\n5 5\n..#..\n.....\n#....\n.....\n.....\n3 8\n..#.....\n........\n.....#..\n3 5\n..#..\n.....\n..#..\n4 4\n....\n....\n..##\n..#.\n0 0\nOutput for the Sample Input\nYES\nNO\nYES\nNO\nNO"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1622_10703013","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nconst int INF = 1e9;\n\ntemplate<typename flow>\nstruct max_flow {\n struct edge {\n int to;\n flow cap;\n int rev;\n };\n int V;\n vector<vector<edge> > G;\n vector<int> itr, level;\n max_flow(int V) : V(V) {G.assign(V, vector<edge>()); }\n\n void add_edge(int from, int to, flow cap) {\n G[from].push_back((edge){to, cap, (int)G[to].size()});\n G[to].push_back((edge) {from, 0, (int)G[from].size()-1});\n }\n\n void bfs(int s) {\n level.assign(V, -1);\n queue<int> q;\n level[s] = 0;\n q.push(s);\n while(!q.empty()) {\n int v = q.front();\n q.pop();\n for(auto &e : G[v]) {\n if(e.cap > 0 && level[e.to] < 0) {\n level[e.to] = level[v] + 1;\n q.push(e.to);\n }\n }\n }\n }\n\n flow dfs(int v, int t, flow f) {\n if(v == t) return f;\n for(int& i = itr[v]; i < (int)G[v].size(); ++i) {\n edge &e = G[v][i];\n if(e.cap > 0 && level[v] < level[e.to]) {\n flow d = dfs(e.to, t, min(f, e.cap));\n if(d > 0) {\n e.cap -= d;\n G[e.to][e.rev].cap += d;\n return d;\n }\n }\n }\n return 0;\n }\n\n flow run(int s, int t) {\n flow ret = 0, f;\n while(bfs(s), level[t] >= 0) {\n itr.assign(V, 0);\n while((f = dfs(s, t, INF)) > 0) ret += f;\n }\n return ret;\n }\n};\n\nint H, W;\nstring field[55];\nint dh[4] = {1, -1, 0, 0};\nint dw[4] = {0, 0, 1, -1};\nmax_flow<int> init() {\n max_flow<int> graph(10001);\n graph.add_edge(1*W+1, 1*W+1+5000, 1);\n graph.add_edge(H*W+1, H*W+1+5000, 1);\n graph.add_edge(H*W+W-1, H*W+W-1+5000, 1);\n graph.add_edge(1*W+W-1, 1*W+W-1+5000, 1);\n for(int h = 1; h <= H; h++) {\n for(int w = 1; w <= W; w++) {\n if(field[h][w] == '#') continue;\n graph.add_edge(h*W + w, h*W + w + 5000, 1);\n for(int k = 0; k <= 3; k++) {\n int newh = h + dh[k];\n int neww = w + dw[k];\n if(newh <= 0 || newh > H || neww <= 0 || neww > W) continue;\n if(field[newh][neww] == '#') continue;\n graph.add_edge(h*W+w + 5000, newh*W+neww, 1);\n }\n }\n }\n return graph;\n}\n\nint TARGET = 10000;\n\nint main() {\n while(true) {\n cin >> H >> W;\n if(H == 0 && W == 0) break;\n for(int i = 1; i <= H; i++) {\n cin >> field[i];\n field[i] = \"&\" + field[i];\n }\n bool clear = true;\n max_flow<int> graph = init();\n graph.add_edge(0, 1*W+1, 1);\n graph.add_edge(0, H*W+1, 1);\n graph.add_edge(1*W+W-1 + 5000, TARGET, 1);\n graph.add_edge(H*W+W-1 + 5000, TARGET, 1);\n if(graph.run(0, TARGET) < 2) clear = false;\n graph = init();\n graph.add_edge(0, 1*W+1, 1);\n graph.add_edge(0, 1*W+W-1, 1);\n graph.add_edge(H*W+1 + 5000, TARGET, 1);\n graph.add_edge(H*W+W-1 + 5000, TARGET, 1);\n if(graph.run(0, TARGET) < 2) clear = false;\n graph = init();\n graph.add_edge(0, 1*W+1, 2);\n graph.add_edge(0, H*W+W-1, 2);\n graph.add_edge(1*W+W-1 + 5000, TARGET, 2);\n graph.add_edge(H*W+1 + 5000, TARGET, 2);\n if(graph.run(0, TARGET) < 4) clear = false;\n if(clear) cout << \"YES\" << endl;\n else cout << \"NO\" << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":50,"memory_kb":4748,"score_of_the_acc":-0.3387,"final_rank":7},{"submission_id":"aoj_1622_10636878","code_snippet":"#include <bits/stdc++.h>\n\n#include <algorithm>\n#include <cassert>\n#include <vector>\n\nnamespace atcoder {\n\nstruct dsu {\n public:\n dsu() : _n(0) {}\n explicit dsu(int n) : _n(n), parent_or_size(n, -1) {}\n\n int merge(int a, int b) {\n assert(0 <= a && a < _n);\n assert(0 <= b && b < _n);\n int x = leader(a), y = leader(b);\n if (x == y) return x;\n if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);\n parent_or_size[x] += parent_or_size[y];\n parent_or_size[y] = x;\n return x;\n }\n\n bool same(int a, int b) {\n assert(0 <= a && a < _n);\n assert(0 <= b && b < _n);\n return leader(a) == leader(b);\n }\n\n int leader(int a) {\n assert(0 <= a && a < _n);\n return _leader(a);\n }\n\n int size(int a) {\n assert(0 <= a && a < _n);\n return -parent_or_size[leader(a)];\n }\n\n std::vector<std::vector<int>> groups() {\n std::vector<int> leader_buf(_n), group_size(_n);\n for (int i = 0; i < _n; i++) {\n leader_buf[i] = leader(i);\n group_size[leader_buf[i]]++;\n }\n std::vector<std::vector<int>> result(_n);\n for (int i = 0; i < _n; i++) {\n result[i].reserve(group_size[i]);\n }\n for (int i = 0; i < _n; i++) {\n result[leader_buf[i]].push_back(i);\n }\n result.erase(\n std::remove_if(result.begin(), result.end(),\n [&](const std::vector<int>& v) { return v.empty(); }),\n result.end());\n return result;\n }\n\n private:\n int _n;\n std::vector<int> parent_or_size;\n\n int _leader(int a) {\n if (parent_or_size[a] < 0) return a;\n return parent_or_size[a] = _leader(parent_or_size[a]);\n }\n};\n\n} // namespace atcoder\n\nusing namespace std;\nusing namespace atcoder; \ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef long double ld;\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\n#define rrep(i,start,end) for (ll i = start;i >= (ll)(end);i--)\n#define repn(i,end) for(ll i = 0; i <= (ll)(end); i++)\n#define reps(i,start,end) for(ll i = start; i < (ll)(end); i++)\n#define repsn(i,start,end) for(ll i = start; i <= (ll)(end); i++)\n#define each(p,a) for(auto &p:a)\ntypedef vector<ll> vll;\ntypedef vector<pair<ll ,ll>> vpll;\ntypedef vector<vector<ll>> vvll;\ntypedef set<ll> sll;\ntypedef map<ll , ll> mpll;\ntypedef pair<ll ,ll> pll;\ntypedef tuple<ll , ll , ll> tpl3;\n#define LL(...) ll __VA_ARGS__; input(__VA_ARGS__)\n#define LD(...) ld __VA_ARGS__; input(__VA_ARGS__)\n#define Str(...) string __VA_ARGS__; input(__VA_ARGS__)\n#define Ch(...) char __VA_ARGS__; input(__VA_ARGS__)\n#define all(a) (a).begin(),(a).end()\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\n#define sz(x) (ll)x.size()\n// << std::fixed << std::setprecision(10)\nconst ll INF = 1LL << 60;\nconst ld EPS = 1e-9;\n \nll lceil(ll a,ll b){if(a%b==0){return a/b;}if(a>=0){return (a/b)+1;}else{return -((-a)/b);}}\nll lfloor(ll a,ll b){if(a%b==0){return a/b;}if(a>=0){return (a/b);}else{return -((-a)/b)-1;}}\ninline ll positive_mod(ll a,ll m){return (a % m + m)%m;}\ninline ll popcnt(ull a){ return __builtin_popcountll(a);}\n//0indexed\ninline ll topbit(ll a){assert(a != 0);return 63 - __builtin_clzll(a);}\ninline ll smlbit(ll a){assert(a != 0);return __builtin_ctzll(a);}\ntemplate<class T> bool chmin(T& a, T b){if(a > b){a = b;return true;}return false;}\ntemplate<class T> bool chmax(T& a, T b){if(a < b){a = b;return true;}return false;}\ntemplate<typename T> std::istream &operator>>(std::istream&is,std::vector<T>&v){for(T &in:v){is>>in;}return is;}\ntemplate<typename T> std::ostream &operator<<(std::ostream&os,const std::vector<T>&v){for(auto it=std::begin(v);it!=std::end(v);){os<<*it<<((++it)!=std::end(v)?\" \":\"\");}return os;}\ntemplate<typename T1, typename T2>std::ostream &operator<< (std::ostream &os, std::pair<T1,T2> p){os << \"{\" << p.first << \",\" << p.second << \"}\";return os;}\ntemplate<class... T>void input(T&... a){(cin >> ... >> a);}\nvoid print(){cout << endl;}\ntemplate<class T, class... Ts>void print(const T& a, const Ts&... b){cout << a;((cout << ' ' << b), ...);cout << endl;}\ntemplate<class T> void pspace(const T& a){ cout << a << ' ';}\nvoid perr(){cerr << endl;}\ntemplate<class T, class... Ts>void perr(const T& a, const Ts&... b){cerr << a;((cerr << ' ' << b), ...);cerr << endl;}\nvoid yes(bool i = true){ return print(i?\"yes\":\"no\"); }\nvoid Yes(bool i = true){ return print(i?\"Yes\":\"No\"); }\nvoid YES(bool i = true){ return print(i?\"YES\":\"NO\"); }\ntemplate <class T> vector<T> &operator++(vector<T> &v) {for(auto &e : v) e++;return v;}\ntemplate <class T> vector<T> operator++(vector<T> &v, signed) {auto res = v;for(auto &e : v) e++;return res;}\ntemplate <class T> vector<T> &operator--(vector<T> &v) {for(auto &e : v) e--;return v;}\ntemplate <class T> vector<T> operator--(vector<T> &v, signed) {auto res = v;for(auto &e : v) e--;return res;}\n//grid探索用\nvector<ll> _ta = {0,0,1,-1,1,1,-1,-1};\nvector<ll> _yo = {1,-1,0,0,1,-1,1,-1};\nbool isin(ll now_i,ll now_j,ll h,ll w){return (0<=now_i && now_i < h && 0 <= now_j && now_j < w);}\n \nll lpow(ll x,ll n){ll ans = 1;while(n >0){if(n & 1)ans *= x;x *= x;n >>= 1;}return ans;}\nll Modlpow(ll x,ll n,ll m){ll ans = 1;ll a = x%m;while(n >0){if(n & 1){ans *= a;ans%= m;}a *= a;a %= m;n >>= 1;}return ans;} \nconst ll MOD9 = 998244353LL;\nconst ll MOD10 = 1000000007LL;\n\nstruct Lowlink{\n ll n;\n vector<ll> ord;\n vector<ll>low;\n vector<ll>articulation,bridge;//atriculation 関節点,bridgeは橋になる辺の番号を格納 \n vector<vector<pll>> g;\n vector<ll>found;\n vector<ll> c;//二重辺連結分解で使用\n ll m;//辺の数\n \n Lowlink(ll _n):n(_n),m(0){\n ord.resize(n,INF);\n low.resize(n);\n g.resize(n);\n found.resize(n);\n }\n \n ll add_edge(ll u, ll v){\n g[u].push_back({v,m});\n g[v].push_back({u,m});\n return m++;\n }\n \n ll dfs(ll v,ll par, ll num){\n ord[v] = num;\n low[v] = num;\n found[v] =1;\n bool isa = false; //関節点かどうか\n ll cnt = 0;//ｖが根のときに関節点かどうか判定に使用\n for(auto &p:g[v]){\n auto[to,id] = p;\n if(to == par){continue;}\n if(found[to] != 0){\n //発見済みだったから今見ている辺は後退辺\n chmin(low[v],ord[to]);\n }else{\n //未発見\n cnt++;\n num = dfs(to,v,num+1);\n if(par != -1 && low[to] >= ord[v]){\n isa = true;\n }\n chmin(low[v],low[to]);\n if(ord[v] < low[to]){\n //子のlowが子で終わってたらbridge\n bridge.push_back(id);\n }\n }\n }\n if(par == -1 && cnt >= 2)isa = true;\n if(isa)articulation.push_back(v);//関節点だった\n return num + 1;\n }\n //構築して連結成分数を返す \n ll build(){\n ll k = 0;\n ll cnt = 0;//シンプルに連結成分数\n rep(i,n){\n if(found[i] == 0){\n k = dfs(i,-1,k);\n cnt++;\n }\n }\n return cnt; //シンプルに連結成分数を返しておく\n }\n \n vector<vector<ll>> bc;\n vector<ll> bc_id;\n //二重頂点連結分解\n void bcc(){\n bc_id = vector<ll>(m,-1);\n vector<ll> used(n);\n auto add = [&](ll id,ll num){\n bc[num].push_back(id);\n bc_id[id] = num;\n };\n auto dfs = [&](auto dfs,ll v,ll par,ll num)->void{\n used[v] = 1;\n for(auto &[to,id]:g[v]){\n if(to == par){continue;}\n if(used[to] == 0 ){\n ll nownum = num;\n if(low[to] >= ord[v]){\n nownum = bc.size();\n bc.push_back({});//新しくグループ作る\n }\n add(id,nownum);\n dfs(dfs,to,v,nownum);\n }else if(ord[to] < ord[v]){\n add(id,num);//後退辺は同じグループ\n }\n }\n };\n rep(i,n){\n if(used[i] == 0){\n dfs(dfs,i,-1,-1);\n }\n }\n }\n\n \n\n //二重辺連結分解 build()した後\n //cに各頂点がどのグループに属するか格納される\n //グラフから橋を全て削除したときの連結成分\n ll two_edge_connect_component(){\n //~~~~~~二重辺連結分解~~~~~~~~~~~\n // 計算量 O(n+m)\n c.resize(n,-1);\n ll ccnt = 0;\n rep(i,n){\n if(c[i] == -1){\n auto dfs2 = [&](auto dfs2, ll v,ll par,ll num)->ll{\n if(par != -1 && ord[par] >= low[v]){\n c[v] = c[par];\n }else{\n c[v] = num++;\n }\n for(auto &[to,id]:g[v]){\n if(c[to] == -1){\n num = dfs2(dfs2,to,v,num);\n }\n }\n return num;\n };\n ccnt = dfs2(dfs2,i,-1,ccnt);\n }\n }\n return ccnt;\n }\n};\n\n\nvoid solve(ll n,ll m){\n vector<string > s(n);\n rep(i,n){\n cin >> s[i];\n }\n // vvll g(n *m);\n auto clc = [&](ll i,ll j){\n return i * m + j;\n };\n\n set<pll> kado ={{0,0},{n-1,m-1},{n-1,0},{0,m-1}};\n \n rep(I,n)rep(J,m)if(!kado.contains({I,J})){\n dsu uf(n*m);\n rep(i,n){\n rep(j,m)if(s[i][j] != '#' && (i != I or j != J)){\n rep(k,4){\n ll ny = i + _ta[k];\n ll nx = j + _yo[k];\n if(isin(ny,nx,n,m)&& s[ny][nx] != '#'&& (ny !=I or nx != J)){\n uf.merge(clc(i,j),clc(ny,nx));\n }\n }\n }\n }\n // bool ok = true;\n if(!uf.same(clc(0,0),clc(0,m-1))){\n cout <<\"NO\" << endl;\n return ;\n }\n if(!uf.same(clc(0,0),clc(n-1,m-1))){\n cout << \"NO\" << endl;\n return ;\n }\n if(!uf.same(clc(0,0),clc(n-1,0))){\n cout << \"NO\" << endl;\n return ;\n }\n }\n \n cout << \"YES\" << endl;\n\n}\n \nint main(){\n ios::sync_with_stdio(false);cin.tie(nullptr);\n while(true){\n LL(n,m);\n if(n == 0 && m == 0)break;\n solve(n,m);\n }\n}","accuracy":1,"time_ms":520,"memory_kb":3712,"score_of_the_acc":-0.6887,"final_rank":14},{"submission_id":"aoj_1622_10630779","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#include <atcoder/all>\nusing namespace atcoder;\n\nusing ll = long long;\nusing mint = modint998244353;\n\nbool solve() {\n int N, M;\n cin >> N >> M;\n if(N == 0) return false;\n vector<string> S(N);\n for(int i = 0; i < N; i++) {\n cin >> S[i];\n }\n if(S[0][1] == '#' || S[1][0] == '#') {\n cout << \"NO\" << endl;\n return true;\n }\n if(S[0][M - 2] == '#' || S[1][M - 1] == '#') {\n cout << \"NO\" << endl;\n return true;\n }\n if(S[N - 1][1] == '#' || S[N - 2][0] == '#') {\n cout << \"NO\" << endl;\n return true;\n }\n if(S[N - 1][M - 2] == '#' || S[N - 2][M - 1] == '#') {\n cout << \"NO\" << endl;\n return true;\n }\n if(N <= 3 && M <= 3) {\n cout << \"YES\" << endl;\n return true;\n }\n auto ID = [&](int i, int j) -> int {\n return i * M + j;\n };\n // cout << \"non-trivial\" << endl;\n vector<pair<int, int>> dirs = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};\n mf_graph<int> g(2 * N * M + 2);\n for(int i = 0; i < N; i++) {\n for(int j = 0; j < M; j++) {\n if(S[i][j] == '#') continue;\n int x = ID(i, j);\n g.add_edge(2 * x, 2 * x + 1, 1);\n for(auto [di, dj] : dirs) {\n int ii = i + di, jj = j + dj;\n if(!(0 <= ii && ii < N && 0 <= jj && jj < M && S[ii][jj] == '.')) continue;\n // cout << i << \" \" << j << \" \" << ii << \" \" << jj << endl;\n int y = ID(ii, jj);\n g.add_edge(2 * x + 1, 2 * y, 1);\n g.add_edge(2 * y + 1, 2 * x, 1);\n }\n }\n }\n mf_graph<int> ga = g;\n mf_graph<int> gb = g;\n mf_graph<int> gc = g;\n const int SRC = 2 * N * M;\n const int DST = 2 * N * M + 1;\n {\n ga.add_edge(SRC, 2 * ID(0, 1), 1);\n ga.add_edge(SRC, 2 * ID(1, 0), 1);\n ga.add_edge(2 * ID(N - 1, M - 2) + 1, DST, 1);\n ga.add_edge(2 * ID(N - 2, M - 1) + 1, DST, 1);\n int f = ga.flow(SRC, DST);\n // vector ma(N, vector<int>(M));\n // for(auto e : ga.edges()) {\n // int p = e.from;\n // int q = e.to;\n // if(p != SRC && q != DST && p % 2 == 0 && q % 2 == 1 && p + 1 == q) {\n // int i = (p / 2) / M;\n // int j = (p / 2) % M;\n // ma[i][j] = e.flow;\n // }\n // }\n // for(int i = 0; i < N; i++) {\n // for(int j = 0; j < M; j++) {\n // cout << ma[i][j] << \" \\n\"[j == M - 1];\n // }\n // }\n if(f < 2) {\n // cout << \"type1\" << \" \" << f << endl;\n cout << \"NO\" << endl;\n return true;\n }\n }\n {\n gb.add_edge(SRC, 2 * ID(N - 2, 0), 1);\n gb.add_edge(SRC, 2 * ID(N - 1, 1), 1);\n gb.add_edge(2 * ID(1, 0) + 1, DST, 1);\n gb.add_edge(2 * ID(N - 1, M - 2) + 1, DST, 1);\n int f = gb.flow(SRC, DST);\n if(f < 2) {\n // cout << \"type2\" << \" \" << f << endl;\n cout << \"NO\" << endl;\n return true;\n }\n }\n {\n gc.add_edge(SRC, 2 * ID(0, M - 2), 1);\n gc.add_edge(SRC, 2 * ID(1, M - 1), 1);\n gc.add_edge(2 * ID(0, 1) + 1, DST, 1);\n gc.add_edge(2 * ID(N - 2, M - 1) + 1, DST, 1);\n int f = gc.flow(SRC, DST);\n if(f < 2) {\n // cout << \"type3\" << \" \" << f << endl;\n cout << \"NO\" << endl;\n return true;\n }\n }\n cout << \"YES\" << endl;\n return true;\n}\n\nint main() {\n while(solve());\n}","accuracy":1,"time_ms":20,"memory_kb":8148,"score_of_the_acc":-1.012,"final_rank":18},{"submission_id":"aoj_1622_9933475","code_snippet":"#include <bits/stdc++.h>\n\n\nusing namespace std;\n//make -f ../makefile SRC=\n/*\nad hoc => WA\nmax flow WA:\nvertex cannot be transversed more than once\nedge <-> vertex OR multiple layers of grid (2 layer !)\n\n*/\n\n\n//------------------------------------------------------------------------------\nbool DEBUG = false;\nconst int INF = 2147483647;\n\nconst int MAX_N = 50;\nstatic bool G[MAX_N][MAX_N];\n\ntypedef pair<int,int> PA;\ntypedef vector<PA> PAS;\nstatic PAS action = {{-1,0}, {0,1}, {1,0}, {0,-1}};\n\ntypedef vector<int> States;\n//------------------------------------------------------------------------------\nconst int MAX_NN = 2*MAX_N*MAX_N + 2;\nstatic int level[MAX_NN];\nstatic int start[MAX_NN];\n\n//------------------------------------------------------------------------------\nstruct Edge\n{\n int w, f, c, j;\n\n bool operator<(const Edge& other) const\n {\n return f < other.f;\n }\n\n Edge(): w(-1), f(0), c(0), j(-1) {}\n Edge(int v2, int flow, int capacity, int reverse_edge): w(v2), f(flow), c(capacity), j(reverse_edge) {}\n void debug() const { printf(\"(%d, %d, %d, %d)\\n\", w, f, c, j); }\n};\n\ntypedef vector<Edge> Edges;\ntypedef vector<Edges> GRAPH;\n\n//------------------------------------------------------------------------------\nvoid add_edge(int N, GRAPH& G, int v, int w, int c)\n{\n // forward edge:\n Edge e1(w, 0, c, G[w].size());\n\n // backward edge:\n Edge e2(v, 0, 0, G[v].size());\n\n G[v].push_back( e1 );\n G[w].push_back( e2 );\n}\n\n//------------------------------------------------------------------------------\nbool bfs(int NN, GRAPH& GG, int src, int dest)\n{\n //--------------------------------------------------------------------------\n // setup params:\n for (int v=0; v<NN; ++v) level[v] = -1;\n\n queue<int> Q;\n Q.push(src);\n level[src] = 0;\n\n //--------------------------------------------------------------------------\n // search:\n while (!Q.empty())\n {\n int v = Q.front(); Q.pop();\n for (Edge e: GG[v])\n {\n if (level[e.w] < 0 && e.f < e.c)\n {\n level[e.w] = level[v] + 1;\n Q.push(e.w);\n }\n }\n }\n\n //--------------------------------------------------------------------------\n // is dest reachable from src?\n return level[dest] >= 0;\n}\n\nint send_flow(int NN, GRAPH& GG, int v, int dest, int flow)\n{\n if (v == dest) return flow;\n for (; start[v]<GG[v].size(); start[v]++)\n { \n Edge& e = GG[v][start[v]];\n if (level[e.w] == level[v] + 1 && e.f < e.c)\n {\n int min_flow = min(flow, e.c-e.f);\n int new_flow = send_flow(NN, GG, e.w, dest, min_flow);\n \n if (new_flow)\n { \n e.f += new_flow;\n GG[e.w][e.j].f -= new_flow;\n return new_flow; \n }\n }\n }\n return 0;\n}\n\n\n//------------------------------------------------------------------------------\nint dinic(int NN, GRAPH& GG, int src, int dest)\n{\n //if (DEBUG) {for (int v=0; v<NN; ++v) for (Edge e: GG[v]) { printf(\"%d -> \", v); e.debug(); }}\n\n //--------------------------------------------------------------------------\n // base cases:\n if (dest == src) return 0;\n\n //--------------------------------------------------------------------------\n // init params:\n int res = 0;\n\n //--------------------------------------------------------------------------\n // compute:\n while (bfs(NN, GG, src, dest))\n {\n for (int v=0; v<NN; ++v) start[v] = 0;\n while (int flow = send_flow(NN, GG, src, dest, INF)) res += flow;\n }\n\n //--------------------------------------------------------------------------\n // report:\n return res;\n}\n\n//------------------------------------------------------------------------------\nvoid debug_grid(int M, int N)\n{\n printf(\"grid:\\n\");\n for (int m=0; m<M; ++m) { for (int n=0; n<N; ++n) printf(\"%d \",G[m][n]); printf(\"\\n\"); }\n printf(\"\\n\");\n}\n\n\nStates neighbors(int M, int N, int v)\n{\n States SS;\n int m1 = v/N;\n int n1 = v%N;\n if (!G[m1][n1]) return SS;\n\n int m2, n2, w;\n //--------------------------------------------------------------------------\n for (PA p: action)\n {\n m2 = m1 + p.first;\n n2 = n1 + p.second;\n if (m2 < 0 || m2 >= M || n2 < 0 || n2 >= N || !G[m2][n2]) continue;\n w = m2*N + n2;\n SS.push_back( w );\n }\n\n //--------------------------------------------------------------------------\n return SS;\n}\n\n//------------------------------------------------------------------------------\nbool ok(int M, int N)\n{\n for (int m=0; m<M; ++m)\n for (int n=0; n<N; ++n)\n if (!G[m][n])\n return false;\n return true;\n}\n\nbool feasible(int M, int N)\n{\n int v;\n v = 0;\n if (neighbors(M, N, v).size() < 2) return false;\n\n v = N-1;\n if (neighbors(M, N, v).size() < 2) return false;\n\n v = M*N-1;\n if (neighbors(M, N, v).size() < 2) return false;\n\n v = M*N-N;\n if (neighbors(M, N, v).size() < 2) return false;\n\n return true;\n}\n\n\nGRAPH setup(int M, int N)\n{\n int NN = 2*M*N+2;\n int src = NN-2;\n\n GRAPH GG(NN);\n add_edge(NN, GG, src, 0, 2);\n\n for (int v=0; v<M*N; ++v)\n {\n if (!G[v/N][v%N]) continue;\n\n add_edge(NN, GG, M*N+v, v, 1); //<----------\n\n for (int w: neighbors(M, N, v))\n add_edge(NN, GG, v, w+M*N, 1);\n }\n\n return GG;\n}\n\n//------------------------------------------------------------------------------\nbool solve(int M, int N)\n{\n if (DEBUG) debug_grid(M, N);\n //--------------------------------------------------------------------------\n // base cases:\n if (M == 2 || N == 2) return ok(M, N);\n if (!feasible(M, N)) return false;\n //--------------------------------------------------------------------------\n // init:\n //--------------------------------------------------------------------------\n // compute:\n int NN = 2*M*N+2;\n int src = NN-2;\n\n vector<int> dests = {N-1 + M*N, M*N-1 + M*N, M*N-N + M*N};\n for (int dest: dests)\n {\n GRAPH GG = setup(M, N);\n int flow = dinic(NN, GG, src, dest);\n if (flow != 2) return false;\n }\n //--------------------------------------------------------------------------\n // report:\n return true;\n}\n\n//------------------------------------------------------------------------------\nvoid test()\n{\n\n}\n\n//------------------------------------------------------------------------------\nint main()\n{\n //test(); return 0;\n //DEBUG = true;\n //--------------------------------------------------------------------------\n int M, N, num;\n char c;\n while (true)\n {\n num = scanf(\"%d %d \", &M, &N);\n if (M == 0 && N == 0) break;\n for (int m=0; m<M; ++m)\n for (int n=0; n<N; ++n)\n { num = scanf(\"%c \", &c); if (c == '.') G[m][n] = true; else G[m][n] = false; }\n if (solve(M, N)) printf(\"YES\\n\");\n else printf(\"NO\\n\");\n }\n //--------------------------------------------------------------------------\n return 0;\n}\n//------------------------------------------------------------------------------","accuracy":1,"time_ms":30,"memory_kb":3784,"score_of_the_acc":-0.1134,"final_rank":1},{"submission_id":"aoj_1622_9409072","code_snippet":"#ifndef _GLIBCXX_NO_ASSERT\n#include <cassert>\n#endif\n#include <cctype>\n#include <cerrno>\n#include <cfloat>\n#include <ciso646>\n#include <climits>\n#include <clocale>\n#include <cmath>\n#include <csetjmp>\n#include <csignal>\n#include <cstdarg>\n#include <cstddef>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#if __cplusplus >= 201103L\n#include <ccomplex>\n#include <cfenv>\n#include <cinttypes>\n#include <cstdbool>\n#include <cstdint>\n#include <ctgmath>\n#include <cwchar>\n#include <cwctype>\n#endif\n// C++\n#include <algorithm>\n#include <bitset>\n#include <complex>\n#include <deque>\n#include <exception>\n#include <fstream>\n#include <functional>\n#include <iomanip>\n#include <ios>\n#include <iosfwd>\n#include <iostream>\n#include <istream>\n#include <iterator>\n#include <limits>\n#include <list>\n#include <locale>\n#include <map>\n#include <memory>\n#include <new>\n#include <numeric>\n#include <ostream>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <stdexcept>\n#include <streambuf>\n#include <string>\n#include <typeinfo>\n#include <utility>\n#include <valarray>\n#include <vector>\n#if __cplusplus >= 201103L\n#include <array>\n#include <atomic>\n#include <chrono>\n#include <condition_variable>\n#include <forward_list>\n#include <future>\n#include <initializer_list>\n#include <mutex>\n#include <random>\n#include <ratio>\n#include <regex>\n#include <scoped_allocator>\n#include <system_error>\n#include <thread>\n#include <tuple>\n#include <type_traits>\n#include <typeindex>\n#include <unordered_map>\n#include <unordered_set>\n\n#endif\nusing namespace std;\nusing ll = long long;\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define all(v) v.begin(), v.end()\ntemplate <class T, class U>\ninline bool chmax(T& a, U b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T, class U>\ninline bool chmin(T& a, U b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\nconstexpr int INF = 1001001001;\nconstexpr int64_t llINF = 3000000000000000000;\n\n#include <algorithm>\n#include <vector>\n\nnamespace atcoder {\n\nnamespace internal {\n\ntemplate <class T>\nstruct simple_queue {\n std::vector<T> payload;\n int pos = 0;\n void reserve(int n) { payload.reserve(n); }\n int size() const { return int(payload.size()) - pos; }\n bool empty() const { return pos == int(payload.size()); }\n void push(const T& t) { payload.push_back(t); }\n T& front() { return payload[pos]; }\n void clear() {\n payload.clear();\n pos = 0;\n }\n void pop() { pos++; }\n};\n\n} // namespace internal\n\n} // namespace atcoder\n\n#include <cassert>\n#include <limits>\n#include <queue>\n#include <vector>\n\nnamespace atcoder {\n\ntemplate <class Cap>\nstruct mf_graph {\n public:\n mf_graph() : _n(0) {}\n mf_graph(int n) : _n(n), g(n) {}\n\n int add_edge(int from, int to, Cap cap) {\n assert(0 <= from && from < _n);\n assert(0 <= to && to < _n);\n assert(0 <= cap);\n int m = int(pos.size());\n pos.push_back({from, int(g[from].size())});\n int from_id = int(g[from].size());\n int to_id = int(g[to].size());\n if (from == to) to_id++;\n g[from].push_back(_edge{to, to_id, cap});\n g[to].push_back(_edge{from, from_id, 0});\n return m;\n }\n\n struct edge {\n int from, to;\n Cap cap, flow;\n };\n\n edge get_edge(int i) {\n int m = int(pos.size());\n assert(0 <= i && i < m);\n auto _e = g[pos[i].first][pos[i].second];\n auto _re = g[_e.to][_e.rev];\n return edge{pos[i].first, _e.to, _e.cap + _re.cap, _re.cap};\n }\n std::vector<edge> edges() {\n int m = int(pos.size());\n std::vector<edge> result;\n for (int i = 0; i < m; i++) {\n result.push_back(get_edge(i));\n }\n return result;\n }\n void change_edge(int i, Cap new_cap, Cap new_flow) {\n int m = int(pos.size());\n assert(0 <= i && i < m);\n assert(0 <= new_flow && new_flow <= new_cap);\n auto& _e = g[pos[i].first][pos[i].second];\n auto& _re = g[_e.to][_e.rev];\n _e.cap = new_cap - new_flow;\n _re.cap = new_flow;\n }\n\n Cap flow(int s, int t) { return flow(s, t, std::numeric_limits<Cap>::max()); }\n Cap flow(int s, int t, Cap flow_limit) {\n assert(0 <= s && s < _n);\n assert(0 <= t && t < _n);\n assert(s != t);\n\n std::vector<int> level(_n), iter(_n);\n internal::simple_queue<int> que;\n\n auto bfs = [&]() {\n std::fill(level.begin(), level.end(), -1);\n level[s] = 0;\n que.clear();\n que.push(s);\n while (!que.empty()) {\n int v = que.front();\n que.pop();\n for (auto e : g[v]) {\n if (e.cap == 0 || level[e.to] >= 0) continue;\n level[e.to] = level[v] + 1;\n if (e.to == t) return;\n que.push(e.to);\n }\n }\n };\n auto dfs = [&](auto self, int v, Cap up) {\n if (v == s) return up;\n Cap res = 0;\n int level_v = level[v];\n for (int& i = iter[v]; i < int(g[v].size()); i++) {\n _edge& e = g[v][i];\n if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0) continue;\n Cap d = self(self, e.to, std::min(up - res, g[e.to][e.rev].cap));\n if (d <= 0) continue;\n g[v][i].cap += d;\n g[e.to][e.rev].cap -= d;\n res += d;\n if (res == up) break;\n }\n return res;\n };\n\n Cap flow = 0;\n while (flow < flow_limit) {\n bfs();\n if (level[t] == -1) break;\n std::fill(iter.begin(), iter.end(), 0);\n while (flow < flow_limit) {\n Cap f = dfs(dfs, t, flow_limit - flow);\n if (!f) break;\n flow += f;\n }\n }\n return flow;\n }\n\n std::vector<bool> min_cut(int s) {\n std::vector<bool> visited(_n);\n internal::simple_queue<int> que;\n que.push(s);\n while (!que.empty()) {\n int p = que.front();\n que.pop();\n visited[p] = true;\n for (auto e : g[p]) {\n if (e.cap && !visited[e.to]) {\n visited[e.to] = true;\n que.push(e.to);\n }\n }\n }\n return visited;\n }\n\n private:\n int _n;\n struct _edge {\n int to, rev;\n Cap cap;\n };\n std::vector<std::pair<int, int>> pos;\n std::vector<std::vector<_edge>> g;\n};\n\n} // namespace atcoder\n\nvoid solve() {\n int n, m;\n cin >> n >> m;\n if (n == 0 && m == 0) exit(0);\n vector<string> s(n);\n rep(i, n) cin >> s[i];\n atcoder::mf_graph<int> mf(n * m * 2 + 2);\n vector<vector<int>> id(n, vector<int>(m));\n {\n int t = 0;\n rep(i, n) rep(j, m) id[i][j] = t++;\n }\n rep(i, n) {\n rep(j, m) {\n if (s[i][j] == '#') continue;\n mf.add_edge(id[i][j], id[i][j] + n * m, 1);\n\n if (i + 1 < n && s[i + 1][j] == '.') mf.add_edge(id[i][j] + n * m, id[i + 1][j], 1);\n if (j + 1 < m && s[i][j + 1] == '.') mf.add_edge(id[i][j] + n * m, id[i][j + 1], 1);\n if (i && s[i - 1][j] == '.') mf.add_edge(id[i][j] + n * m, id[i - 1][j], 1);\n if (j && s[i][j - 1] == '.') mf.add_edge(id[i][j] + n * m, id[i][j - 1], 1);\n }\n }\n auto mf2 = mf;\n cout << (mf.flow(n * m, id[n - 1][m - 1], 2) == 2 && mf2.flow(id[n - 1][0] + n * m, id[0][m - 1], 2) == 2 ? \"YES\" : \"NO\") << endl;\n}\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n /*int t;\n cin >> t;\n while (t--) */\n while (1) solve();\n}","accuracy":1,"time_ms":10,"memory_kb":4704,"score_of_the_acc":-0.2813,"final_rank":6},{"submission_id":"aoj_1622_9381828","code_snippet":"#include<iostream>\n#include<vector>\n\n#include <algorithm>\n#include <cassert>\n#include <limits>\n#include <queue>\n#include <vector>\n\n\n#include <vector>\n\nnamespace atcoder {\n\nnamespace internal {\n\ntemplate <class T> struct simple_queue {\n std::vector<T> payload;\n int pos = 0;\n void reserve(int n) { payload.reserve(n); }\n int size() const { return int(payload.size()) - pos; }\n bool empty() const { return pos == int(payload.size()); }\n void push(const T& t) { payload.push_back(t); }\n T& front() { return payload[pos]; }\n void clear() {\n payload.clear();\n pos = 0;\n }\n void pop() { pos++; }\n};\n\n} // namespace internal\n\n} // namespace atcoder\n\n\nnamespace atcoder {\n\ntemplate <class Cap> struct mf_graph {\n public:\n mf_graph() : _n(0) {}\n explicit mf_graph(int n) : _n(n), g(n) {}\n\n int add_edge(int from, int to, Cap cap) {\n assert(0 <= from && from < _n);\n assert(0 <= to && to < _n);\n assert(0 <= cap);\n int m = int(pos.size());\n pos.push_back({from, int(g[from].size())});\n int from_id = int(g[from].size());\n int to_id = int(g[to].size());\n if (from == to) to_id++;\n g[from].push_back(_edge{to, to_id, cap});\n g[to].push_back(_edge{from, from_id, 0});\n return m;\n }\n\n struct edge {\n int from, to;\n Cap cap, flow;\n };\n\n edge get_edge(int i) {\n int m = int(pos.size());\n assert(0 <= i && i < m);\n auto _e = g[pos[i].first][pos[i].second];\n auto _re = g[_e.to][_e.rev];\n return edge{pos[i].first, _e.to, _e.cap + _re.cap, _re.cap};\n }\n std::vector<edge> edges() {\n int m = int(pos.size());\n std::vector<edge> result;\n for (int i = 0; i < m; i++) {\n result.push_back(get_edge(i));\n }\n return result;\n }\n void change_edge(int i, Cap new_cap, Cap new_flow) {\n int m = int(pos.size());\n assert(0 <= i && i < m);\n assert(0 <= new_flow && new_flow <= new_cap);\n auto& _e = g[pos[i].first][pos[i].second];\n auto& _re = g[_e.to][_e.rev];\n _e.cap = new_cap - new_flow;\n _re.cap = new_flow;\n }\n\n Cap flow(int s, int t) {\n return flow(s, t, std::numeric_limits<Cap>::max());\n }\n Cap flow(int s, int t, Cap flow_limit) {\n assert(0 <= s && s < _n);\n assert(0 <= t && t < _n);\n assert(s != t);\n\n std::vector<int> level(_n), iter(_n);\n internal::simple_queue<int> que;\n\n auto bfs = [&]() {\n std::fill(level.begin(), level.end(), -1);\n level[s] = 0;\n que.clear();\n que.push(s);\n while (!que.empty()) {\n int v = que.front();\n que.pop();\n for (auto e : g[v]) {\n if (e.cap == 0 || level[e.to] >= 0) continue;\n level[e.to] = level[v] + 1;\n if (e.to == t) return;\n que.push(e.to);\n }\n }\n };\n auto dfs = [&](auto self, int v, Cap up) {\n if (v == s) return up;\n Cap res = 0;\n int level_v = level[v];\n for (int& i = iter[v]; i < int(g[v].size()); i++) {\n _edge& e = g[v][i];\n if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0) continue;\n Cap d =\n self(self, e.to, std::min(up - res, g[e.to][e.rev].cap));\n if (d <= 0) continue;\n g[v][i].cap += d;\n g[e.to][e.rev].cap -= d;\n res += d;\n if (res == up) return res;\n }\n level[v] = _n;\n return res;\n };\n\n Cap flow = 0;\n while (flow < flow_limit) {\n bfs();\n if (level[t] == -1) break;\n std::fill(iter.begin(), iter.end(), 0);\n Cap f = dfs(dfs, t, flow_limit - flow);\n if (!f) break;\n flow += f;\n }\n return flow;\n }\n\n std::vector<bool> min_cut(int s) {\n std::vector<bool> visited(_n);\n internal::simple_queue<int> que;\n que.push(s);\n while (!que.empty()) {\n int p = que.front();\n que.pop();\n visited[p] = true;\n for (auto e : g[p]) {\n if (e.cap && !visited[e.to]) {\n visited[e.to] = true;\n que.push(e.to);\n }\n }\n }\n return visited;\n }\n\n private:\n int _n;\n struct _edge {\n int to, rev;\n Cap cap;\n };\n std::vector<std::pair<int, int>> pos;\n std::vector<std::vector<_edge>> g;\n};\n\n} // namespace atcoder\n\nusing namespace std;\nconst vector<pair<int,int>>D={{1,0},{-1,0},{0,1},{0,-1}};\nbool solve()\n{\n int H,W;\n cin>>H>>W;\n if(H==0&&W==0)return false;\n vector<string>S(H);\n for(int i=0;i<H;i++)cin>>S[i];\n const int N=H*W;\n atcoder::mf_graph<long long>G(2*N);\n G.add_edge(0,N,1);\n for(int r=0;r<H;r++)for(int c=0;c<W;c++)G.add_edge(r*W+c,r*W+c+N,1);\n for(int r=0;r<H;r++)for(int c=0;c<W;c++)if(S[r][c]=='.')\n {\n for(auto[dr,dc]:D)\n {\n int tr=r+dr,tc=c+dc;\n if(0<=tr&&tr<H&&0<=tc&&tc<W&&S[tr][tc]=='.')G.add_edge(r*W+c+N,tr*W+tc,1);\n }\n }\n auto GG=G,GGG=G;\n cout<<(G.flow(0,W-1)==2&&GG.flow(0,N-W)==2&&GGG.flow(0,N-1)==2?\"YES\":\"NO\")<<'\\n';\n return true;\n}\nint main(){while(solve()){}}","accuracy":1,"time_ms":20,"memory_kb":5584,"score_of_the_acc":-0.477,"final_rank":8},{"submission_id":"aoj_1622_9351399","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nstruct dsu {\n vector<int> p, sz;\n dsu(int n) : p(n), sz(n) {\n iota(p.begin(), p.end(), 0);\n }\n int find(int x) {\n return (p[x] == x ? x : p[x] = find(p[x]));\n }\n bool same(int x, int y) {\n return find(x) == find(y);\n }\n void merge(int x, int y) {\n x = find(x), y = find(y);\n if (sz[x] < sz[y]) swap(x, y);\n p[y] = x;\n sz[x] += sz[y];\n }\n};\n\nbool solve() {\n int N, M; cin >> N >> M;\n if (!N) return false;\n vector S(N, string());\n for (auto& s : S) cin >> s;\n vector<vector<bool>> G(N, vector(M, false));\n for (int i = 0 ; i < N ; i++) {\n for (int j = 0 ; j < M ; j++) {\n G[i][j] = S[i][j] == '.';\n }\n }\n auto valid = [&](int y, int x) -> bool {\n return 0 <= y and y < N and 0 <= x and x < M and G[y][x];\n };\n auto f = [&](int y, int x) -> int {\n return y * M + x;\n };\n array<int, 4> dy = { 1, 0, -1, 0 };\n array<int, 4> dx = { 0, 1, 0, -1 };\n for (int i = 0 ; i < N ; i++) {\n for (int j = 0 ; j < M ; j++) {\n if (not G[i][j]) continue;\n if (i == 0 and j == 0) continue;\n if (i == N - 1 and j == 0) continue;\n if (i == 0 and j == M - 1) continue;\n if (i == N - 1 and j == M - 1) continue;\n dsu uf(N * M);\n for (int y = 0 ; y < N ; y++) {\n for (int x = 0 ; x < M ; x++) {\n if (y == i and x == j) continue;\n if (not G[y][x]) continue;\n for (int d = 0 ; d < 4 ; d++) {\n int ny = y + dy[d], nx = x + dx[d];\n if (not valid(ny, nx)) continue;\n if (ny == i and nx == j) continue;\n uf.merge(f(y, x), f(ny, nx));\n }\n }\n }\n bool ok = true;\n ok &= uf.same(f(0, 0), f(N - 1, 0));\n ok &= uf.same(f(N - 1, 0), f(N - 1, M - 1));\n ok &= uf.same(f(N - 1, M - 1), f(0, M - 1));\n if (not ok) {\n // cout << i << ' ' << j << endl;\n cout << \"NO\" << endl;\n return true;\n }\n }\n }\n dsu uf(N * M);\n for (int y = 0 ; y < N ; y++) {\n for (int x = 0 ; x < M ; x++) {\n if (not G[y][x]) continue;\n for (int d = 0 ; d < 4 ; d++) {\n int ny = y + dy[d], nx = x + dx[d];\n if (not valid(ny, nx)) continue;\n uf.merge(f(y, x), f(ny, nx));\n }\n }\n }\n bool ok = true;\n ok &= uf.same(f(0, 0), f(N - 1, 0));\n ok &= uf.same(f(N - 1, 0), f(N - 1, M - 1));\n ok &= uf.same(f(N - 1, M - 1), f(0, M - 1));\n if (not ok) {\n // cout << i << ' ' << j << endl;\n cout << \"NO\" << endl;\n return true;\n }\n cout << \"YES\" << endl;\n return true;\n}\n\nint main() {\n while (solve()) ;\n}","accuracy":1,"time_ms":780,"memory_kb":3516,"score_of_the_acc":-0.9611,"final_rank":17},{"submission_id":"aoj_1622_9293575","code_snippet":"#include <bits/stdc++.h>\n\n#include <algorithm>\n\n#include <vector>\n\nnamespace atcoder {\n\nnamespace internal {\n\ntemplate <class T> struct simple_queue {\n std::vector<T> payload;\n int pos = 0;\n void reserve(int n) { payload.reserve(n); }\n int size() const { return int(payload.size()) - pos; }\n bool empty() const { return pos == int(payload.size()); }\n void push(const T& t) { payload.push_back(t); }\n T& front() { return payload[pos]; }\n void clear() {\n payload.clear();\n pos = 0;\n }\n void pop() { pos++; }\n};\n\n} // namespace internal\n\n} // namespace atcoder\n\n#include <cassert>\n#include <limits>\n#include <queue>\n#include <vector>\n\nnamespace atcoder {\n\ntemplate <class Cap> struct mf_graph {\n public:\n mf_graph() : _n(0) {}\n mf_graph(int n) : _n(n), g(n) {}\n\n int add_edge(int from, int to, Cap cap) {\n assert(0 <= from && from < _n);\n assert(0 <= to && to < _n);\n assert(0 <= cap);\n int m = int(pos.size());\n pos.push_back({from, int(g[from].size())});\n int from_id = int(g[from].size());\n int to_id = int(g[to].size());\n if (from == to) to_id++;\n g[from].push_back(_edge{to, to_id, cap});\n g[to].push_back(_edge{from, from_id, 0});\n return m;\n }\n\n struct edge {\n int from, to;\n Cap cap, flow;\n };\n\n edge get_edge(int i) {\n int m = int(pos.size());\n assert(0 <= i && i < m);\n auto _e = g[pos[i].first][pos[i].second];\n auto _re = g[_e.to][_e.rev];\n return edge{pos[i].first, _e.to, _e.cap + _re.cap, _re.cap};\n }\n std::vector<edge> edges() {\n int m = int(pos.size());\n std::vector<edge> result;\n for (int i = 0; i < m; i++) {\n result.push_back(get_edge(i));\n }\n return result;\n }\n void change_edge(int i, Cap new_cap, Cap new_flow) {\n int m = int(pos.size());\n assert(0 <= i && i < m);\n assert(0 <= new_flow && new_flow <= new_cap);\n auto& _e = g[pos[i].first][pos[i].second];\n auto& _re = g[_e.to][_e.rev];\n _e.cap = new_cap - new_flow;\n _re.cap = new_flow;\n }\n\n Cap flow(int s, int t) {\n return flow(s, t, std::numeric_limits<Cap>::max());\n }\n Cap flow(int s, int t, Cap flow_limit) {\n assert(0 <= s && s < _n);\n assert(0 <= t && t < _n);\n assert(s != t);\n\n std::vector<int> level(_n), iter(_n);\n internal::simple_queue<int> que;\n\n auto bfs = [&]() {\n std::fill(level.begin(), level.end(), -1);\n level[s] = 0;\n que.clear();\n que.push(s);\n while (!que.empty()) {\n int v = que.front();\n que.pop();\n for (auto e : g[v]) {\n if (e.cap == 0 || level[e.to] >= 0) continue;\n level[e.to] = level[v] + 1;\n if (e.to == t) return;\n que.push(e.to);\n }\n }\n };\n auto dfs = [&](auto self, int v, Cap up) {\n if (v == s) return up;\n Cap res = 0;\n int level_v = level[v];\n for (int& i = iter[v]; i < int(g[v].size()); i++) {\n _edge& e = g[v][i];\n if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0) continue;\n Cap d =\n self(self, e.to, std::min(up - res, g[e.to][e.rev].cap));\n if (d <= 0) continue;\n g[v][i].cap += d;\n g[e.to][e.rev].cap -= d;\n res += d;\n if (res == up) break;\n }\n return res;\n };\n\n Cap flow = 0;\n while (flow < flow_limit) {\n bfs();\n if (level[t] == -1) break;\n std::fill(iter.begin(), iter.end(), 0);\n while (flow < flow_limit) {\n Cap f = dfs(dfs, t, flow_limit - flow);\n if (!f) break;\n flow += f;\n }\n }\n return flow;\n }\n\n std::vector<bool> min_cut(int s) {\n std::vector<bool> visited(_n);\n internal::simple_queue<int> que;\n que.push(s);\n while (!que.empty()) {\n int p = que.front();\n que.pop();\n visited[p] = true;\n for (auto e : g[p]) {\n if (e.cap && !visited[e.to]) {\n visited[e.to] = true;\n que.push(e.to);\n }\n }\n }\n return visited;\n }\n\n private:\n int _n;\n struct _edge {\n int to, rev;\n Cap cap;\n };\n std::vector<std::pair<int, int>> pos;\n std::vector<std::vector<_edge>> g;\n};\n\n} // namespace atcoder\n\nusing namespace atcoder;\nusing namespace std;\nusing ll = long long;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\n#define all(A) A.begin(),A.end()\n#define rep(i, n) for (int i = 0; i < (int) (n); i++)\n\nvoid solve(ll H,ll W) {\n vector<string> S(H);\n rep(h,H)cin>>S[h];\n mf_graph<ll> G(H*W*2);\n vll dx={1,-1,0,0};\n vll dy={0,0,1,-1};\n rep(h,H)rep(w,W){\n if(S[h][w]=='#')continue;\n G.add_edge(h*W+w,h*W+w+H*W,1);\n rep(d,4){\n ll nh=h+dy[d];\n ll nw=w+dx[d];\n if(nh<0||nw<0||nh>=H||nw>=W)continue;\n if(S[nh][nw]=='#')continue;\n G.add_edge(h*W+w+H*W,nh*W+nw,1);\n }\n }\n G.add_edge(0,H*W,1);\n auto G2=G,G3=G;\n ll an=min({G.flow(0,(H-1)*W),G2.flow(0,W-1),G3.flow(0,(H-1)*W+W-1)});\n cout<<(an==2?\"YES\":\"NO\")<<endl;\n}\n\nint main() {\n\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n ll H,W;\n while (cin >> H>>W) {\n if (H == 0)return 0;\n solve(H,W);\n }\n\n\n}","accuracy":1,"time_ms":20,"memory_kb":5812,"score_of_the_acc":-0.5246,"final_rank":10},{"submission_id":"aoj_1622_9126959","code_snippet":"#include <bits/stdc++.h>\n\nstruct Edge {\n int from;\n int to;\n int cap;\n int rev;\n Edge(int from, int to, int cap, int rev): from(from), to(to), cap(cap), rev(rev) {}\n};\n\nstruct Flow {\n std::vector<std::vector<Edge>> graph;\n Flow(int n): graph(n) {}\n void add_edge(int from, int to, int cap) {\n int id = graph[from].size();\n int rev = graph[to].size();\n graph[from].emplace_back(from, to, cap, rev);\n graph[to].emplace_back(to, from, 0, id);\n }\n\n std::vector<bool> used;\n int dfs(int u, const int sink, int cur_flow) {\n if (u == sink) return cur_flow;\n used[u] = true;\n for (auto& e: graph[u]) {\n if (e.cap == 0) continue;\n if (used[e.to]) continue;\n int res = dfs(e.to, sink, std::min(cur_flow, e.cap));\n if (res != 0) {\n e.cap -= res;\n graph[e.to][e.rev].cap += res;\n return res;\n }\n }\n return 0;\n }\n\n int max_flow(int source, int sink) {\n int ans = 0;\n while (true) {\n used.assign(graph.size(), false);\n int res = dfs(source, sink, 1e9);\n if (res == 0) {\n break;\n }\n ans += res;\n }\n return ans;\n }\n};\n\nint solve() {\n int n, m;\n std::cin >> n >> m;\n if (n == 0) return 1;\n\n std::vector<std::string> board(n);\n for (int i = 0; i < n; i++) std::cin >> board[i];\n\n int offset = 0;\n std::vector in(n, std::vector<int>(m));\n std::vector mid(n, std::vector<int>(m));\n std::vector out(n, std::vector<int>(m));\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n in[i][j] = offset++;\n mid[i][j] = offset++;\n out[i][j] = offset++;\n }\n }\n const int source = out[0][0];\n Flow flow(offset);\n\n // in -> out\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n flow.add_edge(in[i][j], out[i][j], 1);\n }\n }\n\n const int DI[] = {0, 1, 0, -1};\n const int DJ[] = {1, 0, -1, 0};\n // out -> in\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n if (board[i][j] == '#') continue;\n for (int d = 0; d < 4; d++) {\n int ni = i + DI[d];\n int nj = j + DJ[d];\n if (ni < 0 || nj < 0 || ni >= n || nj >= m) continue;\n if (board[ni][nj] == '#') continue;\n flow.add_edge(out[i][j], in[ni][nj], 1);\n }\n }\n }\n\n Flow f1 = flow;\n Flow f2 = flow;\n Flow f3 = flow;\n int ff1 = f1.max_flow(source, in[0][m - 1]);\n int ff2 = f2.max_flow(source, in[n - 1][0]);\n int ff3 = f3.max_flow(source, in[n - 1][m - 1]);\n // std::cerr << ff1 << ' ' << ff2 << ' ' << ff3 << std::endl;\n if (ff1 == ff2 && ff2 == ff3 && ff3 == 2) {\n std::cout << \"YES\" << '\\n';\n } else {\n std::cout << \"NO\" << '\\n';\n }\n\n return 0;\n}\n\nint main() {\n while (!solve());\n}","accuracy":1,"time_ms":30,"memory_kb":6368,"score_of_the_acc":-0.6526,"final_rank":11},{"submission_id":"aoj_1622_7785140","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nbool connected(int n, int m, vector<vector<char>> &c){\n\tvector<vector<bool>> dp(n, vector<bool>(m));\n\tdp[0][0] = true;\n\tvector<pair<int,int>> mada = {pair(0, 0)};\n\tvector<pair<int,int>> go = {pair(-1, 0), pair(1, 0), pair(0, 1), pair(0, -1)};\n\twhile (!mada.empty()){\n\t\tint i = mada.back().first;\n\t\tint j = mada.back().second;\n\t\tmada.pop_back();\n\t\tfor (auto [xx, yy]: go){\n\t\t\tint x = i + xx;\n\t\t\tint y = j + yy;\n\t\t\tif (0 <= x && x < n && 0 <= y && y < m){\n\t\t\t\tif (c[x][y] == '.' && !dp[x][y]){\n\t\t\t\t\tmada.push_back(pair(x, y));\n\t\t\t\t\tdp[x][y] = true;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tif (!dp[n-1][m-1]) return false;\n\tif (!dp[0][m-1]) return false;\n\tif (!dp[n-1][0]) return false;\n\treturn true;\n}\n\nint main(){\n\twhile(true){\n\t\tint n, m; cin >> n >> m;\n\t\tif (n == 0) break;\n\n\t\tvector<vector<char>> c(n, vector<char>(m));\n\t\tfor (int i=0; i<n; i++){\n\t\t\tfor (int j=0; j<m; j++){\n\t\t\t\tcin >> c[i][j];\n\t\t\t}\n\t\t}\n\n\t\tif (!connected(n, m, c)){\n\t\t\tcout << \"NO\" << endl;\n\t\t\tcontinue;\n\t\t}\n\n\t\tbool mode = true;\n\t\tfor (int i=0; i<n; i++){\n\t\t\tfor (int j=0; j<m; j++){\n\t\t\t\tif (i == 0 && j == 0) continue;\n\t\t\t\tif (i == n-1 && j == 0) continue;\n\t\t\t\tif (i == 0 && j == m-1) continue;\n\t\t\t\tif (i == n-1 && j == m-1) continue;\n\t\t\t\tif (c[i][j] == '.'){\n\t\t\t\t\tc[i][j] = '#';\n\t\t\t\t\tif (!connected(n, m, c)) mode = false;\n\t\t\t\t\tc[i][j] = '.';\n\t\t\t\t}\n\t\t\t\tif (!mode) break;\n\t\t\t}\n\t\t\tif (!mode) break;\n\t\t}\n\n\n\t\tif (mode) cout << \"YES\" << endl;\n\t\telse cout << \"NO\" << endl;\n\t}\n}","accuracy":1,"time_ms":530,"memory_kb":3504,"score_of_the_acc":-0.6574,"final_rank":12},{"submission_id":"aoj_1622_7111607","code_snippet":"#include <bits/stdc++.h>\n\nint ri() {\n\tint n;\n\tscanf(\"%d\", &n);\n\treturn n;\n}\nconst std::vector<std::pair<int, int> > dd = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};\n\nbool solve() {\n\tint n = ri();\n\tint m = ri();\n\t\n\tif (!n && !m) return false;\n\t\n\tauto in = [&] (int i, int j) { return i >= 0 && i < n && j >= 0 && j < m; };\n\t\n\tstd::string a[n];\n\tfor (auto &i : a) std::cin >> i;\n\t\n\tstd::vector<std::vector<bool> > used(n, std::vector<bool>(m));\n\t\n\tauto bfs = [&] (int sx, int sy) {\n\t\tstd::vector<std::vector<bool> > reachable(n, std::vector<bool>(m));\n\t\tstd::queue<std::pair<int, int> > que;\n\t\treachable[sx][sy] = true;\n\t\tque.push({sx, sy});\n\t\twhile (que.size()) {\n\t\t\tauto i = que.front();\n\t\t\tque.pop();\n\t\t\t\n\t\t\tauto go = [&] (int nx, int ny) {\n\t\t\t\tif (in(nx, ny) && a[nx][ny] == '.' && !used[nx][ny] && !reachable[nx][ny]) {\n\t\t\t\t\treachable[nx][ny] = true;\n\t\t\t\t\tque.push({nx, ny});\n\t\t\t\t}\n\t\t\t};\n\t\t\tfor (auto d : dd) go(i.first + d.first, i.second + d.second);\n\t\t}\n\t\treturn reachable;\n\t};\n\tint x = 1;\n\tint y = 0;\n\tint last_dx = 1;\n\tint last_dy = 0;\n\t\n\tstd::vector<std::pair<int, int> > route;\n\tauto go = [&] (int gx, int gy) {\n\t\twhile (x != gx || y != gy) {\n\t\t\tused[x][y] = true;\n\t\t\t\n\t\t\tauto reachable = bfs(gx, gy);\n\t\t\t\n\t\t\tint dx = last_dy;\n\t\t\tint dy = -last_dx;\n\t\t\tbool ok = false;\n\t\t\tfor (int i = 0; i < 4; i++) {\n\t\t\t\tif (in(x + dx, y + dy) && reachable[x + dx][y + dy]) { ok = true; break; }\n\t\t\t\tstd::swap(dx, dy);\n\t\t\t\tdx *= -1;\n\t\t\t}\n\t\t\tif (!ok) return false;\n\t\t\tx += dx;\n\t\t\ty += dy;\n\t\t\t// std::cerr << x << \" \" << y << std::endl;\n\t\t\tlast_dx = dx;\n\t\t\tlast_dy = dy;\n\t\t\troute.push_back({x, y});\n\t\t}\n\t\treturn true;\n\t};\n\tbool ok = a[1][0] == '.';\n\tok = ok && go(n - 1, 0);\n\tok = ok && go(n - 1, m - 1);\n\tok = ok && go(0, m - 1);\n\tok = ok && go(0, 0);\n\tputs(ok ? \"YES\" : \"NO\");\n\t\n\treturn true;\n}\n\nint main() {\n\twhile (solve());\n\treturn 0;\n}","accuracy":1,"time_ms":90,"memory_kb":3448,"score_of_the_acc":-0.1156,"final_rank":2},{"submission_id":"aoj_1622_6710847","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\nusing vl = vector<ll>;\ntemplate<class T> using vc = vector<T>;\ntemplate<class T> using vvc = vector<vector<T>>;\n\n#define eb emplace_back\n#define all(x) (x).begin(), (x).end()\n#define rep(i, n) for (ll i = 0; i < (n); i++)\n#define repr(i, n) for (ll i = (n)-1; i >= 0; i--)\n#define repe(i, l, r) for (ll i = (l); i < (r); i++)\n#define reper(i, l, r) for (ll i = (r)-1; i >= (l); i--)\n#define repa(i,n) for (auto& i: n)\n\ntemplate<class T1, class T2> inline bool chmax(T1 &a, const T2 &b) {if (a<b) { a=b; return 1;} return 0;}\ntemplate<class T1, class T2> inline bool chmin(T1 &a, const T2 &b) {if (b<a) { a=b; return 1;} return 0;}\n\nstruct init{init(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);cerr<<fixed<<setprecision(15);}}init_;\n\ntemplate <typename T, typename U> ostream& operator<<(ostream&out,const pair<T, U>&a){return out<<a.first<<' '<<a.second;}\ntemplate <typename T> ostream& operator<<(ostream&out, const vector<T>&a){for(auto it=a.begin();it!= a.end();){out<<*it;if(++it!=a.end())out<<' ';}return out;}\ntemplate <typename T, size_t N> ostream& operator<<(ostream&out, const array<T, N>&a){for(auto it=a.begin();it!= a.end();){out<<*it;if(++it!=a.end())out<<' ';}return out;}\ntemplate <typename T> ostream& operator<<(ostream&out, const set<T>&a){for(auto it=a.begin();it!=a.end();){out<<*it;if(++it!=a.end())out<<' ';}return out;}\ntemplate <typename T, typename U> ostream& operator<<(ostream&out, const map<T, U>&a){for(auto it=a.begin();it!=a.end();){out<<*it;if(++it!=a.end())out<<'\\n';}return out;}\n\n#ifdef DEBUG\ntemplate <class T, class N> void verr(const vector<T>& a, const N& n) { rep(i, n) cerr << a[i] << \" \"; cerr << endl; }\ntemplate <class T, class N, size_t AN> void verr(const array<T, AN>& a, const N& n) { rep(i, n) cerr << a[i] << \" \"; cerr << endl; }\nll dbgt = 1; void err() { cerr << \"passed \" << dbgt++ << endl; }\ntemplate<class H, class... T> void err(H&& h,T&&... t){ cerr<< h << (sizeof...(t)?\" \":\"\\n\") << flush; if(sizeof...(t)>0) err(forward<T>(t)...); }\n#else\nvoid err(){}\ntemplate <class H, class... T>\nvoid err(H &&h, T &&...t) {}\ntemplate <class H, class... T>\nvoid verr(H &&h, T &&...t) {}\n#endif\n\nconst ll INF = 4e18;\nconst ld EPS = 1e-11;\nconst ld PI = acos(-1.0L);\n// const ll MOD = 1e9 + 7;\nconst ll MOD = 998244353;\n//--------------------------------------------------------------------------------//\narray<int, 4> di = {0, 1, 0, -1}, dj = {1, 0, -1, 0};\n\nstruct UnionFind {\nprivate:\n vector<int> par;\n vector<int> count;\n vector<int> rank;\npublic:\n UnionFind(int N) {\n count.assign(N, 1);\n rank.assign(N, 0);\n par.assign(N, 0);\n rep(i, N) par[i] = i;\n }\n\n int root(int x) {\n if (par[x] == x)\n return x;\n else {\n par[x] = root(par[x]);\n return par[x];\n }\n }\n\n void unite(int x, int y) {\n x = root(x), y = root(y);\n if (x == y) return;\n if (rank[x] < rank[y])\n swap(x, y);\n else if (rank[x] == rank[y])\n rank[y]++;\n par[y] = x;\n count[x] += count[y];\n return;\n }\n\n int size(int x) {\n return count[root(x)];\n }\n\n bool issame(int x, int y) {\n return root(x) == root(y);\n }\n};\nusing UF = struct UnionFind;\n\n\nvoid solve(int H, int W){\n vc<string> C(H);\n rep(i, H) cin >> C[i];\n vvc<int> used(H, vc<int>(W));\n rep(i, H) rep(j, W) {\n if (C[i][j] == '#') used[i][j] = true;\n }\n\n queue<pair<int, int>> q;\n auto padding1 = [&]() -> void {\n queue<pair<int, int>> tmpq;\n rep(i, H) rep(j, W) tmpq.emplace(i, j);\n while (!tmpq.empty()) {\n auto [i, j] = tmpq.front();\n tmpq.pop();\n int can = 0, li, lj;\n rep(d, 4) {\n int ti = i + di[d], tj = j + dj[d];\n if (ti < 0 or ti >= H or tj < 0 or tj >= W) continue;\n if (used[ti][tj]) continue;\n can++;\n li = ti, lj = tj;\n }\n if (can == 0) used[i][j] = true;\n if (can == 1) {\n used[i][j] = true;\n tmpq.emplace(li, lj);\n }\n }\n };\n\n padding1();\n\n auto cango = [&](int i, int j) -> bool {\n if (i < 0 or i >= H or j < 0 or j >= W) return false;\n if (used[i][j]) return false;\n return true;\n };\n rep(i, H) rep(j, W) {\n int can = 0;\n if (used[i][j]) continue;\n rep(d, 4) {\n int ti = i + di[d], tj = j + dj[d];\n if (!cango(ti, tj)) continue;\n can++;\n }\n if (can == 2) q.emplace(i, j);\n }\n rep(i, H) rep(j, W) {\n int can = 0;\n if (used[i][j]) continue;\n rep(d, 4) {\n int ti = i + di[d], tj = j + dj[d];\n if (!cango(ti, tj)) continue;\n can++;\n }\n if (can == 3) q.emplace(i, j);\n }\n rep(i, H) rep(j, W) {\n int can = 0;\n if (used[i][j]) continue;\n rep(d, 4) {\n int ti = i + di[d], tj = j + dj[d];\n if (!cango(ti, tj)) continue;\n can++;\n }\n if (can == 4) q.emplace(i, j);\n }\n while(!q.empty()) {\n auto [ci, cj] = q.front();\n q.pop();\n if (used[ci][cj]) continue;\n UF tuf(H * W);\n rep(i, H) rep(j, W) {\n if (i == ci and j == cj) continue;\n if (used[i][j]) continue;\n rep(d, 4) {\n int ti = i + di[d], tj = j + dj[d];\n if (ti == ci and tj == cj) continue;\n if (!cango(ti, tj)) continue;\n tuf.unite(i * W + j, ti * W + tj);\n }\n }\n bool closed = false;\n vc<pair<int, int>> ads;\n rep(d, 4) {\n int ti = ci + di[d], tj = cj + dj[d];\n if (!cango(ti, tj)) continue;\n ads.eb(ti, tj);\n }\n if (ads.size() <= 1) continue;\n set<int> st;\n for (auto [i, j] : ads) {\n st.emplace(tuf.root(i * W + j));\n }\n if (st.size() != 2) continue;\n int cli, clj;\n for (auto [i, j] : ads) {\n int id = i * W + j;\n if (tuf.issame(id, 0) or tuf.issame(id, H * W - 1) or tuf.issame(id, (H - 1) * W) or tuf.issame(id, W - 1))\n continue;\n closed = true;\n cli = i, clj = j;\n }\n if (closed) {\n // err(\"closed\", ci, cj);\n // used[ci][cj] = true;\n rep(i, H) rep(j, W) {\n if (tuf.issame(cli * W + clj, i * W + j)) used[i][j] = true;\n }\n padding1();\n // rep(i, H) {\n // cerr << setfill('0') << right << setw(2) << i << setfill(' ') << \" \";\n // cerr << C[i] << \" \";\n // rep(j, W) cerr << (used[i][j] ? '#' : '.');\n // cerr << endl;\n // }\n }\n }\n\n padding1();\n\n UF uf(H * W);\n rep(i, H) rep(j, W) {\n if (used[i][j]) continue;\n rep(d, 2) {\n int ti = i + di[d], tj = j + dj[d];\n if (ti >= H or tj >= W or used[ti][tj]) continue;\n uf.unite(i * W + j, ti * W + tj);\n }\n }\n\n if (used[0][0] or used[0][W - 1] or used[H - 1][0] or used[H - 1][W - 1]) {\n cout << \"NO\" << endl;\n return;\n }\n\n if(!(uf.issame(0, W - 1) and uf.issame(0, (H - 1) * W) and uf.issame(0, H * W - 1))) {\n cout << \"NO\" << endl;\n return;\n }\n\n // rep(i, H) {\n // cerr << setfill('0') << right << setw(2) << i << setfill(' ') << \" \";\n // cerr << C[i] << \" \";\n // rep(j, W) cerr << (used[i][j] ? '#' : '.');\n // cerr << endl;\n // }\n\n vvc<int> arrived(H, vc<int>(W));\n int ci = 0, cj = 0, cd = 0;\n do {\n // err(ci, cj);\n int ld = (cd + 3) % 4;\n int li = ci + di[ld], lj = cj + dj[ld];\n if(cango(li, lj)) {\n ci = li, cj = lj, cd = ld;\n arrived[ci][cj] = true, used[ci][cj] = true;\n continue;\n }\n int fd = cd;\n int fi = ci + di[fd], fj = cj + dj[fd];\n if(cango(fi, fj)) {\n ci = fi, cj = fj, cd = fd;\n arrived[ci][cj] = true, used[ci][cj] = true;\n continue;\n }\n\n int rd = (cd + 1) % 4;\n int ri = ci + di[rd], rj = cj + dj[rd];\n if(cango(ri, rj)) {\n ci = ri, cj = rj, cd = rd;\n arrived[ci][cj] = true, used[ci][cj] = true;\n continue;\n }\n\n cout << \"NO\" << endl;\n return;\n } while (!(ci == 0 and cj == 0));\n\n if(arrived[0][0] and arrived[0][W - 1] and arrived[H - 1][0] and arrived[H - 1][W - 1]) {\n cout << \"YES\" << endl;\n }else{\n cout << \"NO\" << endl;\n }\n}\n\nint main() {\n while(true){\n int H, W;\n cin >> H >> W;\n if (H == 0) break;\n solve(H, W);\n }\n}","accuracy":1,"time_ms":760,"memory_kb":3512,"score_of_the_acc":-0.9362,"final_rank":16},{"submission_id":"aoj_1622_6027761","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()\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;\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-9;\n//const int mod = 1e9 + 7;\nconst int mod = 998244353;\n\nstruct Dinic{\n\tstruct edge{\n\t\tll to, cap, rev;\n\t};\n\tvector<vector<edge>> G;\n\tvector<int> level, itr;\n\tll n;\n\tconst ll INF = 1<<30;\n \n\tDinic(ll n) : n(n){\n\t\tG.resize(n);\n\t\tlevel.resize(n);\n\t\titr.resize(n);\n\t}\n \n\tvoid add_edge(ll from, ll to, ll cap){\n\t\tG[from].push_back({to,cap,(ll)G[to].size()});\n\t\tG[to].push_back({from,0,(ll)G[from].size()-1});\n\t}\n \n\tvoid bfs(int s){\n\t\tfill(level.begin(), level.end(), -1);\n\t\tqueue<int> q;\n\t\tlevel[s] = 0;\n\t\tq.push(s);\n\t\twhile(!q.empty()){\n\t\t\tint u = q.front(); q.pop();\n\t\t\tfor(auto &e : G[u]){\n\t\t\t\tif(e.cap > 0 && level[e.to] < 0){\n\t\t\t\t\tlevel[e.to] = level[u] + 1;\n\t\t\t\t\tq.push(e.to);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\tll dfs(int u, int t, ll f){\n\t\tif(u == t) return f;\n\t\tfor(int &i = itr[u]; i < G[u].size(); i++){\n\t\t\tedge &e = G[u][i];\n\t\t\tif(e.cap > 0 && level[u] < level[e.to]){\n\t\t\t\tll d = dfs(e.to, t, min(f, e.cap));\n\t\t\t\tif(d > 0){\n\t\t\t\t\te.cap -= d;\n\t\t\t\t\tG[e.to][e.rev].cap += d;\n\t\t\t\t\treturn d;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn 0;\n\t}\n \n\tll max_flow(ll s, ll t){\n\t\tll flow = 0;\n\t\twhile(1){\n\t\t\tbfs(s);\n\t\t\tif(level[t] < 0) return flow;\n\t\t\tfill(itr.begin(), itr.end(), 0);\n\t\t\tll f;\n\t\t\twhile((f = dfs(s, t, INF)) > 0){\n\t\t\t\tflow += f;\n\t\t\t}\n\t\t}\n\t}\n};\n\nbool in(ll y, ll x, ll h, ll w){\n\treturn 0 <= y && y < h && 0 <= x && x < w;\n}\n\nint main(){\n\twhile(1){\n\t\tint n,m; cin >> n >> m;\n\t\tif(!n) break; \n\t\tvs s(n); rep(i,n) cin >> s[i];\n\t\tDinic a(n*m*2),b(n*m*2);\n\t\tint sa = 0, sb = (n-1)*m, ta = n*m*2-1, tb = m-1+n*m;\n\t\trep(i,n) rep(j,m){\n\t\t\tif(s[i][j] == '#') continue;\n\t\t\trep(k,4){\n\t\t\t\tint ny = i + dy[k];\n\t\t\t\tint nx = j + dx[k];\n\t\t\t\tif(!in(ny,nx,n,m) || s[ny][nx] == '#') continue;\n\t\t\t\ta.add_edge(i*m+j+n*m,ny*m+nx,1);\n\t\t\t\tb.add_edge(i*m+j+n*m,ny*m+nx,1);\n\t\t\t}\n\t\t\tint u = i*m+j, v = i*m+j+n*m;\n\t\t\tif(i==0&&j==0||i==0&&j==m-1||i==n-1&&j==0||i==n-1&&j==m-1){\n\t\t\t\ta.add_edge(u,v,2);\n\t\t\t\tb.add_edge(u,v,2);\n\t\t\t}else{\n\t\t\t\ta.add_edge(u,v,1);\n\t\t\t\tb.add_edge(u,v,1);\n\t\t\t}\n\t\t}\n\t\tif(a.max_flow(sa,ta) >= 2 && b.max_flow(sb,tb) >= 2){\n\t\t\tcout << \"YES\\n\";\n\t\t}else{\n\t\t\tcout << \"NO\\n\";\n\t\t}\n\t}\n}","accuracy":1,"time_ms":20,"memory_kb":5588,"score_of_the_acc":-0.4778,"final_rank":9},{"submission_id":"aoj_1622_6025942","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <utility>\n#include <string>\n#include <vector>\n#include <set>\n#include <stack>\n#include <queue>\n#include <map>\n#include <math.h>\n#include <string.h>\n#include <iomanip>\n#include <numeric>\n#include <cstdlib>\n#include <cstdint>\n#include <cmath>\n#include <functional>\n#include <limits>\n#include <cassert>\n#include <bitset>\n#include <chrono>\n#include <random>\n#include <memory>\n \n/* macro */\n \n#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)\n#define rrep(i, a, n) for (int i = ((int)(n-1)); i >= (int)(a); i--)\n#define Rep(i, a, n) for (i64 i = (i64)(a); i< (i64)(n); i++)\n#define RRep(i, a, n) for (i64 i = ((i64)(n-i64(1))); i>=(i64)(a); i--)\n#define all(v) (v).begin(),(v).end()\n#define rall(v) (v).rbegin(),(v).rend()\n#define Bit(n) (1LL<<(n))\n \n/* macro end */\n \n/* template */\n \nnamespace ebi {\n \n#ifdef LOCAL\n#define debug(...) \\\n std::cerr << \"LINE: \" << __LINE__ << \" [\" << #__VA_ARGS__ << \"]:\", \\\n debug_out(__VA_ARGS__)\n#else\n#define debug(...)\n#endif\n \nvoid debug_out() { std::cerr << std::endl; }\n \ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head h, Tail... t) {\n std::cerr << \" \" << h;\n if (sizeof...(t) > 0) std::cout << \" :\";\n debug_out(t...);\n}\n \ntemplate <typename T1, typename T2>\nstd::ostream& operator<<(std::ostream& os, std::pair<T1, T2> pa) {\n return os << pa.first << \" \" << pa.second;\n}\n \ntemplate <typename T>\nstd::ostream& operator<<(std::ostream& os, std::vector<T> vec) {\n for (std::size_t i = 0; i < vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? \"\" : \" \");\n return os;\n}\n \nusing size_t = std::size_t;\nusing i64 = std::int64_t;\nusing u64 = std::uint64_t;\nusing ld = long double;\n \ntemplate<class T> void fill(std::vector<T> &v) { for(T &e: v) std::cin >> e; }\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 \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>\nT gcd(T a, T b){\n if( b==0 ) return a;\n else return gcd(b, a%b);\n}\n \ntemplate <class T>\nT lcm(T a, T b) {\n a /= gcd(a, b);\n return a*b;\n}\n \ntemplate<class T>\nT Pow(T x, i64 n) {\n T res = 1;\n while(n>0){\n if(n&1) res = res *x;\n x = x*x;\n n>>=1;\n }\n return res;\n}\n \ntemplate<class T>\nT scan() {\n T val;\n std::cin >> val;\n return val;\n}\n \nconstexpr i64 LNF = std::numeric_limits<i64>::max()/4;\n \nconstexpr int INF = std::numeric_limits<int>::max();\n \nconst std::vector<int> dy = {1,0,-1,0,1,1,-1,-1};\nconst std::vector<int> dx = {0,1,0,-1,1,-1,1,-1};\n \n}\n \n/* template end */\n\nnamespace ebi {\n\nvoid main_() {\n int n,m;\n while(std::cin >> n >> m, !(n == 0 && m == 0)) {\n std::vector<std::string> c(n);\n rep(i,0,n) {\n std::cin >> c[i];\n }\n std::vector seen(n, std::vector<int>(m, -1));\n int by = -1, bx = -1;\n auto dfs = [&](auto &&self, int y, int x) -> void {\n seen[y][x] = 1;\n rep(i,0,4) {\n int ny = y + dy[i];\n int nx = x + dx[i];\n if(0 <= ny && ny < n && 0 <= nx && nx < m && (!(ny == by && nx == bx)) && seen[ny][nx] < 0 && c[ny][nx] != '#') {\n self(self, ny, nx);\n }\n }\n };\n int flag = true;\n rep(i,0,n) {\n rep(j,0,m) {\n by = i;\n bx = j;\n if((by == 0 && bx == 0) || (by == 0 && bx == m-1) || (by == n-1 && bx == m-1) || (by == n-1 && bx == 0)) {\n continue;\n }\n seen = std::vector(n, std::vector<int>(m, -1));\n dfs(dfs, 0, 0);\n if(seen[0][0] > 0 && seen[0][m-1] > 0 && seen[n-1][0] > 0 && seen[n-1][m-1] > 0) {\n flag &= true;\n }\n else {\n flag = false;\n }\n }\n }\n if(flag) {\n std::cout << \"YES\\n\";\n } \n else {\n std::cout << \"NO\\n\";\n }\n }\n}\n\n}\n \nint main() {\n std::cout << std::fixed << std::setprecision(15);\n std::cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n int t = 1;\n // std::cin >> t;\n while(t--) {\n ebi::main_();\n }\n return 0;\n}","accuracy":1,"time_ms":830,"memory_kb":3564,"score_of_the_acc":-1.0314,"final_rank":19},{"submission_id":"aoj_1622_6021393","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-34;\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<long double, long double> pd;\ntypedef pair<ll, string> pls;\ntypedef pair<string, ll> psl;\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\n\nll H, W;\nstring S[100] = {};\nvoid Search(bool gone[51][51], bool gone2[51][51], ll h, ll w) {\n\n\tgone[h][w] = true;\n\tll offset[4][2] = { {0,-1}, {1,0},{0,1},{-1,0} };\n\tlp(i, 4) {\n\t\tll next_h = h + offset[i][0];\n\t\tll next_w = w + offset[i][1];\n\t\tif (next_h < 0 || H <= next_h)continue;\n\t\tif (next_w < 0 || W <= next_w)continue;\n\t\tif (gone[next_h][next_w])continue;\n\t\tif (S[next_h][next_w] == '#')continue;\n\t\tSearch(gone, gone2, next_h, next_w);\n\t}\n\n}\n\n\nint main() {\n\twhile (true) {\n\t\tcin >> H>> W;\n\t\tif (H == 0)break;\n\n\t\tlp(i, 100)S[i].clear();\n\t\tlp(i, H)cin >> S[i];\n\t\tstring ans = \"YES\";\n\t\tlp(i, H) {\n\t\t\tlp(j, W) {\n\t\t\t\tbool gone[51][51] = {};\n\t\t\t\tbool gone2[51][51] = {};\n\t\t\t\tif (i == 0 && j == 0)continue;\n\t\t\t\tif (i == 0 && j == W-1)continue;\n\t\t\t\tif (i == H-1 && j == 0)continue;\n\t\t\t\tif (i == H-1 && j == W-1)continue;\n\t\t\t\tif (S[i][j] == '#')continue;\n\t\t\t\tS[i][j] = '#';\n\t\t\t\tSearch(gone, gone2, 0, 0);\n\t\t\t\tif ((!gone[0][0]) || (!gone[H - 1][0]) || (!gone[0][W - 1]) || (!gone[H - 1][W - 1]))ans = \"NO\";\n\t\t\t\tS[i][j] = '.';\n\t\t\t}\n\t\t}\n\t\tbool gone[51][51] = {};\n\t\tbool gone2[51][51] = {};\n\t\tSearch(gone, gone2, 0, 0);\n\t\tif ((!gone[0][0]) || (!gone[H - 1][0]) || (!gone[0][W - 1]) || (!gone[H - 1][W - 1]))ans = \"NO\";\n\t\tcout << ans << endl;\n\t}\n\n\t//cout << fixed << setprecision(12) << bb << endl;\n\treturn 0;\n}\n\n/*\n10\n10 9 8 7 6 5 4 3 2 1\n\n*/","accuracy":1,"time_ms":500,"memory_kb":3684,"score_of_the_acc":-0.6588,"final_rank":13},{"submission_id":"aoj_1622_6012765","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll, ll> P;\n#define fi first\n#define se second\n#define N 214514\n#define all(x) (x).begin(), (x).end()\n// const ll mod = 1000000007;\nconst ll mod = 998244353;\nconst ll inf = 1000000000000000000;\nll n, m;\nchar c[55][55];\nll dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};\nbool func() {\n ll cnt = 0;\n vector<vector<bool>> used(n, vector<bool>(m));\n queue<P> que;\n que.push({0, 0});\n used[0][0] = 1;\n while (!que.empty()) {\n P p = que.front();\n que.pop();\n if ((p.fi == 0 || p.fi == n - 1) && (p.se == 0 || p.se == m - 1)) cnt++;\n for (int k = 0; k < 4; k++) {\n ll ny = p.fi + dy[k], nx = p.se + dx[k];\n if (!(0 <= ny && ny < n && 0 <= nx && nx < m)) continue;\n if (used[ny][nx]) continue;\n if (c[ny][nx] == '#') continue;\n used[ny][nx] = 1;\n que.push({ny, nx});\n }\n }\n return (cnt == 4);\n}\nvoid solve() {\n cin >> n >> m;\n if (!n) exit(0);\n for (int i = 0; i < n; i++)\n for (int j = 0; j < m; j++) cin >> c[i][j];\n bool ok = func();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n if ((i == 0 || i == n - 1) && (j == 0 || j == m - 1)) continue;\n if (c[i][j] == '.') {\n c[i][j] = '#';\n if (!func()) ok = 0;\n c[i][j] = '.';\n }\n }\n }\n cout << (ok ? \"YES\\n\" : \"NO\\n\");\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n ll t = 1;\n // cin >> t;\n while (1) solve();\n return 0;\n}","accuracy":1,"time_ms":650,"memory_kb":3356,"score_of_the_acc":-0.7711,"final_rank":15},{"submission_id":"aoj_1622_5975059","code_snippet":"#pragma GCC optimize(\"Ofast\")\n#include <bits/stdc++.h>\n#define rep(i,n) for(int i=0;i<n;i++)\n#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];\n#define ft first\n#define sc second\n#define pb push_back\n#define lb lower_bound\n#define ub upper_bound\n#define all(v) (v).begin(),(v).end()\n#define LB(a,x) lb(all(a),x)-a.begin()\n#define UB(a,x) ub(all(a),x)-a.begin()\n#define mod 1000000007\n//#define mod 998244353\n#define FS fixed<<setprecision(15)\nusing namespace std;\ntypedef long long ll;\nconst double pi=3.141592653589793;\ntemplate<class T> using V=vector<T>;\nusing P=pair<ll,ll>;\ntypedef unsigned long long ull;\ntypedef long double ldouble;\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }\ntemplate<class T> inline void out(T a){ cout << a << '\\n'; }\nvoid YN(bool ok){if(ok) cout << \"Yes\" << endl; else cout << \"No\" << endl;}\n//void YN(bool ok){if(ok) cout << \"YES\" << endl; else cout << \"NO\" << endl;}\n\n\nconst ll INF=1e18;\nconst int mx=200005;\n\nint seen[55][55];\n\nint check(int i,int j,int n,int m){\n return 0<=i&&i<n&&0<=j&&j<m;\n}\n\nint main(){\n //オーバーフローは大丈夫ですか？？\n cin.tie(0);ios::sync_with_stdio(false);\n while(true){\n int n,m;\n cin>>n>>m;\n if(n==0&&m==0) break;\n V<string> s(n);\n cinf(n,s);\n int ok=1;\n rep(I,n){\n rep(J,m){\n if(I==0&&J==0) continue;\n if(I==0&&J==m-1) continue;\n if(I==n-1&&J==0) continue;\n if(I==n-1&&J==m-1) continue;\n rep(i,n)rep(j,m)seen[i][j]=0;\n //seen[0][0]=1;\n V<int> dx={-1,1,0,0};\n V<int> dy={0,0,1,-1};\n function<void(int,int)> dfs=[&](int i,int j){\n seen[i][j]=1;\n rep(k,4){\n int x=i+dx[k];\n int y=j+dy[k];\n if(!check(x,y,n,m)||(x==I&&y==J)) continue;\n if(s[x][y]!='#'&&!seen[x][y])dfs(x,y);\n }\n };\n dfs(0,0);\n int f=0;\n if(!seen[n-1][0]) f=1;\n if(!seen[n-1][m-1]) f=1;\n if(!seen[0][m-1]) f=1;\n if(f) ok=0;\n }\n }\n if(ok) out(\"YES\");\n else out(\"NO\");\n }\n}","accuracy":1,"time_ms":840,"memory_kb":3636,"score_of_the_acc":-1.0584,"final_rank":20},{"submission_id":"aoj_1622_5974338","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\ntemplate <typename Cap, bool directed> struct Dinic {\n Dinic(int n) : n(n), G(n), level(n), iter(n) {}\n\n int add_edge(int from, int to, Cap cap) {\n assert(0 <= from && from < n);\n assert(0 <= to && to < n);\n assert(0 <= cap);\n assert(from != to);\n int m = pos.size(), from_id = G[from].size(), to_id = G[to].size();\n pos.emplace_back(from, G[from].size());\n G[from].emplace_back(to, cap, to_id);\n G[to].emplace_back(from, directed ? 0 : cap, from_id);\n return m;\n }\n\n int add_vertex() {\n G.emplace_back();\n level.emplace_back();\n iter.emplace_back();\n return n++;\n }\n\n std::tuple<int, int, Cap, Cap> get_edge(int i) {\n assert(0 <= i && i < (int)pos.size());\n auto e = G[pos[i].first][pos[i].second];\n auto re = G[e.to][e.rev];\n return {pos[i].first, e.to, e.cap + re.cap, re.cap};\n }\n\n std::vector<std::tuple<int, int, Cap, Cap>> edges() {\n std::vector<std::tuple<int, int, Cap, Cap>> res;\n for (size_t i = 0; i < pos.size(); i++) res.emplace_back(get_edge(i));\n return res;\n }\n\n void change_edge(int i, Cap new_cap, Cap new_flow) {\n assert(0 <= i && i < (int)pos.size());\n assert(0 <= new_flow && new_flow <= new_cap);\n auto& e = G[pos[i].first][pos[i].second];\n auto& re = G[e.to][e.rev];\n e.cap = new_cap - new_flow;\n re.cap = (directed ? new_flow : new_cap + new_flow);\n }\n\n Cap max_flow(int s, int t) { return max_flow(s, t, std::numeric_limits<Cap>::max()); }\n\n Cap max_flow(int s, int t, Cap flow_limit) {\n assert(0 <= s && s < n);\n assert(0 <= t && t < n);\n if (s == t) return 0;\n Cap flow = 0;\n while (flow < flow_limit) {\n bfs(s, t);\n if (level[t] < 0) break;\n std::fill(iter.begin(), iter.end(), 0);\n while (flow < flow_limit) {\n Cap f = dfs(s, t, flow_limit - flow);\n if (f == 0) break;\n flow += f;\n }\n }\n return flow;\n }\n\n std::vector<bool> min_cut(int s) {\n assert(0 <= s && s < n);\n std::vector<bool> visited(n);\n std::queue<int> que;\n visited[s] = true;\n que.emplace(s);\n while (!que.empty()) {\n int v = que.front();\n que.pop();\n for (const auto& e : G[v]) {\n if (e.cap && !visited[e.to]) {\n visited[e.to] = true;\n que.emplace(e.to);\n }\n }\n }\n return visited;\n }\n\nprivate:\n struct edge {\n int to;\n Cap cap;\n int rev;\n edge(int to, Cap cap, int rev) : to(to), cap(cap), rev(rev) {}\n };\n\n int n;\n std::vector<std::vector<edge>> G;\n std::vector<std::pair<int, int>> pos;\n std::vector<int> level, iter;\n\n void bfs(int s, int t) {\n std::fill(level.begin(), level.end(), -1);\n std::queue<int> que;\n level[s] = 0;\n que.emplace(s);\n while (!que.empty()) {\n int v = que.front();\n que.pop();\n for (const auto& e : G[v]) {\n if (e.cap > 0 && level[e.to] < 0) {\n level[e.to] = level[v] + 1;\n if (e.to == t) return;\n que.emplace(e.to);\n }\n }\n }\n }\n\n Cap dfs(int v, int t, Cap f) {\n if (v == t) return f;\n for (int& i = iter[v]; i < (int)G[v].size(); i++) {\n auto& e = G[v][i];\n if (e.cap <= 0 || level[v] >= level[e.to]) continue;\n Cap d = dfs(e.to, t, min(f, e.cap));\n if (d <= 0) continue;\n e.cap -= d;\n G[e.to][e.rev].cap += d;\n return d;\n }\n return 0;\n }\n};\n\n/**\n * @brief Dinic (Maximum flow)\n * @docs docs/flow/Dinic.md\n */\n\nconst int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};\n\nvoid solve(int N, int M) {\n vector<string> S(N);\n for (auto& s : S) cin >> s;\n\n Dinic<int, true> D(N * M * 2);\n auto IN = [&](int x, int y) { return x * M + y; };\n auto OUT = [&](int x, int y) { return IN(x, y) + N * M; };\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < M; j++) {\n if (S[i][j] == '#') continue;\n D.add_edge(IN(i, j), OUT(i, j), 1);\n for (int k = 0; k < 4; k++) {\n int ni = i + dx[k], nj = j + dy[k];\n if (ni < 0 or N <= ni or nj < 0 or M <= nj) continue;\n if (S[ni][nj] == '#') continue;\n D.add_edge(OUT(i, j), IN(ni, nj), 1);\n }\n }\n }\n\n auto D2 = D;\n int a = D.max_flow(OUT(0, 0), IN(N - 1, M - 1), 2), b = D2.max_flow(OUT(N - 1, 0), IN(0, M - 1), 2);\n cout << (a == 2 and b == 2 ? \"YES\" : \"NO\") << '\\n';\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n int N, M;\n while (cin >> N >> M, N) solve(N, M);\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":4536,"score_of_the_acc":-0.2462,"final_rank":4},{"submission_id":"aoj_1622_5974336","code_snippet":"#define LOCAL\n#include <bits/stdc++.h>\nusing namespace std;\n#pragma region Macros\ntypedef long long ll;\ntypedef __int128_t i128;\ntypedef unsigned int uint;\ntypedef unsigned long long ull;\n#define ALL(x) (x).begin(), (x).end()\n\ntemplate <typename T> istream& operator>>(istream& is, vector<T>& v) {\n for (T& x : v) is >> x;\n return is;\n}\ntemplate <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {\n for (int i = 0; i < (int)v.size(); i++) {\n os << v[i] << (i + 1 == (int)v.size() ? \"\" : \" \");\n }\n return os;\n}\ntemplate <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {\n os << '(' << p.first << ',' << p.second << ')';\n return os;\n}\ntemplate <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {\n os << '{';\n for (auto itr = m.begin(); itr != m.end();) {\n os << '(' << itr->first << ',' << itr->second << ')';\n if (++itr != m.end()) os << ',';\n }\n os << '}';\n return os;\n}\ntemplate <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {\n os << '{';\n for (auto itr = m.begin(); itr != m.end();) {\n os << '(' << itr->first << ',' << itr->second << ')';\n if (++itr != m.end()) os << ',';\n }\n os << '}';\n return os;\n}\ntemplate <typename T> ostream& operator<<(ostream& os, const set<T>& s) {\n os << '{';\n for (auto itr = s.begin(); itr != s.end();) {\n os << *itr;\n if (++itr != s.end()) os << ',';\n }\n os << '}';\n return os;\n}\ntemplate <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {\n os << '{';\n for (auto itr = s.begin(); itr != s.end();) {\n os << *itr;\n if (++itr != s.end()) os << ',';\n }\n os << '}';\n return os;\n}\ntemplate <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {\n os << '{';\n for (auto itr = s.begin(); itr != s.end();) {\n os << *itr;\n if (++itr != s.end()) os << ',';\n }\n os << '}';\n return os;\n}\ntemplate <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {\n for (int i = 0; i < (int)v.size(); i++) {\n os << v[i] << (i + 1 == (int)v.size() ? \"\" : \" \");\n }\n return os;\n}\n\ntemplate <int i, typename T> void print_tuple(ostream&, const T&) {}\ntemplate <int i, typename T, typename H, class... Args> void print_tuple(ostream& os, const T& t) {\n if (i) os << ',';\n os << get<i>(t);\n print_tuple<i + 1, T, Args...>(os, t);\n}\ntemplate <typename... Args> ostream& operator<<(ostream& os, const tuple<Args...>& t) {\n os << '{';\n print_tuple<0, tuple<Args...>, Args...>(os, t);\n return os << '}';\n}\n\nvoid debug_out() { cerr << '\\n'; }\ntemplate <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {\n cerr << head;\n if (sizeof...(Tail) > 0) cerr << \", \";\n debug_out(move(tail)...);\n}\n#ifdef LOCAL\n#define debug(...) \\\n cerr << \" \"; \\\n cerr << #__VA_ARGS__ << \" :[\" << __LINE__ << \":\" << __FUNCTION__ << \"]\" << '\\n'; \\\n cerr << \" \"; \\\n debug_out(__VA_ARGS__)\n#else\n#define debug(...) 42\n#endif\n\ntemplate <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }\ntemplate <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }\n\nint topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }\nint topbit(long long t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }\nint botbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }\nint botbit(long long a) { return a == 0 ? 64 : __builtin_ctzll(a); }\nint popcount(signed t) { return __builtin_popcount(t); }\nint popcount(long long t) { return __builtin_popcountll(t); }\nbool ispow2(int i) { return i && (i & -i) == i; }\n\ntemplate <class T> T ceil(T x, T y) {\n assert(y >= 1);\n return (x > 0 ? (x + y - 1) / y : x / y);\n}\ntemplate <class T> T floor(T x, T y) {\n assert(y >= 1);\n return (x > 0 ? x / y : (x - y + 1) / y);\n}\n\ntemplate <class T1, class T2> inline bool chmin(T1& a, T2 b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T1, class T2> inline bool chmax(T1& a, T2 b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\n#pragma endregion\n\n#include <cassert>\n#include <limits>\n#include <queue>\n#include <vector>\n\ntemplate <typename Cap, bool directed> struct Dinic {\n Dinic(int n) : n(n), G(n), level(n), iter(n) {}\n\n int add_edge(int from, int to, Cap cap) {\n assert(0 <= from && from < n);\n assert(0 <= to && to < n);\n assert(0 <= cap);\n assert(from != to);\n int m = pos.size(), from_id = G[from].size(), to_id = G[to].size();\n pos.emplace_back(from, G[from].size());\n G[from].emplace_back(to, cap, to_id);\n G[to].emplace_back(from, directed ? 0 : cap, from_id);\n return m;\n }\n\n int add_vertex() {\n G.emplace_back();\n level.emplace_back();\n iter.emplace_back();\n return n++;\n }\n\n std::tuple<int, int, Cap, Cap> get_edge(int i) {\n assert(0 <= i && i < (int)pos.size());\n auto e = G[pos[i].first][pos[i].second];\n auto re = G[e.to][e.rev];\n return {pos[i].first, e.to, e.cap + re.cap, re.cap};\n }\n\n std::vector<std::tuple<int, int, Cap, Cap>> edges() {\n std::vector<std::tuple<int, int, Cap, Cap>> res;\n for (size_t i = 0; i < pos.size(); i++) res.emplace_back(get_edge(i));\n return res;\n }\n\n void change_edge(int i, Cap new_cap, Cap new_flow) {\n assert(0 <= i && i < (int)pos.size());\n assert(0 <= new_flow && new_flow <= new_cap);\n auto& e = G[pos[i].first][pos[i].second];\n auto& re = G[e.to][e.rev];\n e.cap = new_cap - new_flow;\n re.cap = (directed ? new_flow : new_cap + new_flow);\n }\n\n Cap max_flow(int s, int t) { return max_flow(s, t, std::numeric_limits<Cap>::max()); }\n\n Cap max_flow(int s, int t, Cap flow_limit) {\n assert(0 <= s && s < n);\n assert(0 <= t && t < n);\n if (s == t) return 0;\n Cap flow = 0;\n while (flow < flow_limit) {\n bfs(s, t);\n if (level[t] < 0) break;\n std::fill(iter.begin(), iter.end(), 0);\n while (flow < flow_limit) {\n Cap f = dfs(s, t, flow_limit - flow);\n if (f == 0) break;\n flow += f;\n }\n }\n return flow;\n }\n\n std::vector<bool> min_cut(int s) {\n assert(0 <= s && s < n);\n std::vector<bool> visited(n);\n std::queue<int> que;\n visited[s] = true;\n que.emplace(s);\n while (!que.empty()) {\n int v = que.front();\n que.pop();\n for (const auto& e : G[v]) {\n if (e.cap && !visited[e.to]) {\n visited[e.to] = true;\n que.emplace(e.to);\n }\n }\n }\n return visited;\n }\n\nprivate:\n struct edge {\n int to;\n Cap cap;\n int rev;\n edge(int to, Cap cap, int rev) : to(to), cap(cap), rev(rev) {}\n };\n\n int n;\n std::vector<std::vector<edge>> G;\n std::vector<std::pair<int, int>> pos;\n std::vector<int> level, iter;\n\n void bfs(int s, int t) {\n std::fill(level.begin(), level.end(), -1);\n std::queue<int> que;\n level[s] = 0;\n que.emplace(s);\n while (!que.empty()) {\n int v = que.front();\n que.pop();\n for (const auto& e : G[v]) {\n if (e.cap > 0 && level[e.to] < 0) {\n level[e.to] = level[v] + 1;\n if (e.to == t) return;\n que.emplace(e.to);\n }\n }\n }\n }\n\n Cap dfs(int v, int t, Cap f) {\n if (v == t) return f;\n for (int& i = iter[v]; i < (int)G[v].size(); i++) {\n auto& e = G[v][i];\n if (e.cap <= 0 || level[v] >= level[e.to]) continue;\n Cap d = dfs(e.to, t, min(f, e.cap));\n if (d <= 0) continue;\n e.cap -= d;\n G[e.to][e.rev].cap += d;\n return d;\n }\n return 0;\n }\n};\n\n/**\n * @brief Dinic (Maximum flow)\n * @docs docs/flow/Dinic.md\n */\n\nconst int INF = 1e9;\nconst long long IINF = 1e18;\nconst int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};\nconst char dir[4] = {'D', 'R', 'U', 'L'};\nconst long long MOD = 1000000007;\n// const long long MOD = 998244353;\n\nvoid solve(int N, int M) {\n vector<string> S(N);\n for (auto& s : S) cin >> s;\n\n Dinic<int, true> D(N * M * 2);\n auto IN = [&](int x, int y) { return x * M + y; };\n auto OUT = [&](int x, int y) { return IN(x, y) + N * M; };\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < M; j++) {\n if (S[i][j] == '#') continue;\n D.add_edge(IN(i, j), OUT(i, j), 1);\n for (int k = 0; k < 4; k++) {\n int ni = i + dx[k], nj = j + dy[k];\n if (ni < 0 or N <= ni or nj < 0 or M <= nj) continue;\n if (S[ni][nj] == '#') continue;\n D.add_edge(OUT(i, j), IN(ni, nj), 1);\n }\n }\n }\n\n auto D2 = D;\n int a = D.max_flow(OUT(0, 0), IN(N - 1, M - 1), 2), b = D2.max_flow(OUT(N - 1, 0), IN(0, M - 1), 2);\n cout << (a == 2 and b == 2 ? \"YES\" : \"NO\") << '\\n';\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n int N, M;\n while (cin >> N >> M, N) solve(N, M);\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":4632,"score_of_the_acc":-0.2783,"final_rank":5},{"submission_id":"aoj_1622_5968721","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>\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}\n\nstruct Edge{\n int to,rev; ll cap;\n Edge(int to,ll cap,int rev):to(to),cap(cap),rev(rev){}\n};\n// ここの値に注意！！\nconst int N=5200;\nconst ll INF=1e9;\nvector<Edge> g[N];\nint level[N]; \nint iter[N];\nvoid add_edge(int s,int t,ll c){\n g[s].push_back(Edge(t,c,g[t].size()));\n g[t].push_back(Edge(s,0,g[s].size()-1));\n}\nvoid bfs(int s){\n memset(level,-1,sizeof(level));\n queue<int> q;\n level[s]=0;\n q.push(s);\n while(q.size()){\n int v=q.front(); q.pop();\n for(auto &e:g[v]){\n if(e.cap>0&&level[e.to]<0){\n level[e.to]=level[v]+1;\n q.push(e.to);\n }\n }\n }\n}\nll dfs(int v,int t,ll f){\n if(v==t)return f;\n for(int &i=iter[v];i<g[v].size();i++){\n Edge &e=g[v][i];\n if(e.cap>0&&level[v]<level[e.to]){\n int d=dfs(e.to,t,min(f,e.cap));\n if(d>0){\n e.cap-=d;\n g[e.to][e.rev].cap+=d;\n return d;\n }\n }\n }\n return 0;\n}\nll max_flow(int s,int t){\n ll flow=0;\n while(1){\n bfs(s);\n if(level[t]<0)return flow;\n memset(iter,0,sizeof(iter));\n int f;\n while((f=dfs(s,t,INF))>0){\n flow+=f;\n }\n }\n}\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n int h,w;\n while(cin >> h >> w,h){\n vector<string> s(h);\n for(int i=0;i<h;i++){\n cin >> s[i];\n }\n int S = 2*h*w;\n int t[3]={w-1,(h-1)*w,h*w-1};\n int T = 2*h*w+1;\n bool ok = true;\n for(int _=0;_<3;_++){\n for(int i=0;i<=T;i++){\n g[i].clear();\n }\n add_edge(S,0,2);\n for(int i=0;i<h;i++){\n for(int j=0;j<w;j++){\n if(s[i][j] == '.'){\n if(i+1<h and s[i+1][j] == '.'){\n add_edge(i*w+j+h*w,(i+1)*w+j,1);\n add_edge((i+1)*w+j+h*w, i*w+j, 1);\n }\n if(j+1<w and s[i][j+1] == '.'){\n add_edge(i*w+j+h*w,i*w+j+1,1);\n add_edge(i*w+j+1+h*w, i*w+j, 1);\n }\n }\n if(i+j == 0 or i*w+j == t[_]){\n add_edge(i*w+j, i*w+j+w*h, 2);\n }\n else{\n add_edge(i*w+j, i*w+j+w*h, 1);\n }\n }\n }\n add_edge(t[_]+h*w, T, 2);\n if(max_flow(S, T)<2){\n ok = false;\n }\n }\n if(ok){\n cout << \"YES\" << \"\\n\";\n }\n else{\n cout << \"NO\" << \"\\n\";\n }\n }\n}","accuracy":1,"time_ms":10,"memory_kb":4252,"score_of_the_acc":-0.187,"final_rank":3}],"string":"[\n {\n \"submission_id\": \"aoj_1622_10703013\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nconst int INF = 1e9;\\n\\ntemplate<typename flow>\\nstruct max_flow {\\n struct edge {\\n int to;\\n flow cap;\\n int rev;\\n };\\n int V;\\n vector<vector<edge> > G;\\n vector<int> itr, level;\\n max_flow(int V) : V(V) {G.assign(V, vector<edge>()); }\\n\\n void add_edge(int from, int to, flow cap) {\\n G[from].push_back((edge){to, cap, (int)G[to].size()});\\n G[to].push_back((edge) {from, 0, (int)G[from].size()-1});\\n }\\n\\n void bfs(int s) {\\n level.assign(V, -1);\\n queue<int> q;\\n level[s] = 0;\\n q.push(s);\\n while(!q.empty()) {\\n int v = q.front();\\n q.pop();\\n for(auto &e : G[v]) {\\n if(e.cap > 0 && level[e.to] < 0) {\\n level[e.to] = level[v] + 1;\\n q.push(e.to);\\n }\\n }\\n }\\n }\\n\\n flow dfs(int v, int t, flow f) {\\n if(v == t) return f;\\n for(int& i = itr[v]; i < (int)G[v].size(); ++i) {\\n edge &e = G[v][i];\\n if(e.cap > 0 && level[v] < level[e.to]) {\\n flow d = dfs(e.to, t, min(f, e.cap));\\n if(d > 0) {\\n e.cap -= d;\\n G[e.to][e.rev].cap += d;\\n return d;\\n }\\n }\\n }\\n return 0;\\n }\\n\\n flow run(int s, int t) {\\n flow ret = 0, f;\\n while(bfs(s), level[t] >= 0) {\\n itr.assign(V, 0);\\n while((f = dfs(s, t, INF)) > 0) ret += f;\\n }\\n return ret;\\n }\\n};\\n\\nint H, W;\\nstring field[55];\\nint dh[4] = {1, -1, 0, 0};\\nint dw[4] = {0, 0, 1, -1};\\nmax_flow<int> init() {\\n max_flow<int> graph(10001);\\n graph.add_edge(1*W+1, 1*W+1+5000, 1);\\n graph.add_edge(H*W+1, H*W+1+5000, 1);\\n graph.add_edge(H*W+W-1, H*W+W-1+5000, 1);\\n graph.add_edge(1*W+W-1, 1*W+W-1+5000, 1);\\n for(int h = 1; h <= H; h++) {\\n for(int w = 1; w <= W; w++) {\\n if(field[h][w] == '#') continue;\\n graph.add_edge(h*W + w, h*W + w + 5000, 1);\\n for(int k = 0; k <= 3; k++) {\\n int newh = h + dh[k];\\n int neww = w + dw[k];\\n if(newh <= 0 || newh > H || neww <= 0 || neww > W) continue;\\n if(field[newh][neww] == '#') continue;\\n graph.add_edge(h*W+w + 5000, newh*W+neww, 1);\\n }\\n }\\n }\\n return graph;\\n}\\n\\nint TARGET = 10000;\\n\\nint main() {\\n while(true) {\\n cin >> H >> W;\\n if(H == 0 && W == 0) break;\\n for(int i = 1; i <= H; i++) {\\n cin >> field[i];\\n field[i] = \\\"&\\\" + field[i];\\n }\\n bool clear = true;\\n max_flow<int> graph = init();\\n graph.add_edge(0, 1*W+1, 1);\\n graph.add_edge(0, H*W+1, 1);\\n graph.add_edge(1*W+W-1 + 5000, TARGET, 1);\\n graph.add_edge(H*W+W-1 + 5000, TARGET, 1);\\n if(graph.run(0, TARGET) < 2) clear = false;\\n graph = init();\\n graph.add_edge(0, 1*W+1, 1);\\n graph.add_edge(0, 1*W+W-1, 1);\\n graph.add_edge(H*W+1 + 5000, TARGET, 1);\\n graph.add_edge(H*W+W-1 + 5000, TARGET, 1);\\n if(graph.run(0, TARGET) < 2) clear = false;\\n graph = init();\\n graph.add_edge(0, 1*W+1, 2);\\n graph.add_edge(0, H*W+W-1, 2);\\n graph.add_edge(1*W+W-1 + 5000, TARGET, 2);\\n graph.add_edge(H*W+1 + 5000, TARGET, 2);\\n if(graph.run(0, TARGET) < 4) clear = false;\\n if(clear) cout << \\\"YES\\\" << endl;\\n else cout << \\\"NO\\\" << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 4748,\n \"score_of_the_acc\": -0.3387,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1622_10636878\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n#include <algorithm>\\n#include <cassert>\\n#include <vector>\\n\\nnamespace atcoder {\\n\\nstruct dsu {\\n public:\\n dsu() : _n(0) {}\\n explicit dsu(int n) : _n(n), parent_or_size(n, -1) {}\\n\\n int merge(int a, int b) {\\n assert(0 <= a && a < _n);\\n assert(0 <= b && b < _n);\\n int x = leader(a), y = leader(b);\\n if (x == y) return x;\\n if (-parent_or_size[x] < -parent_or_size[y]) std::swap(x, y);\\n parent_or_size[x] += parent_or_size[y];\\n parent_or_size[y] = x;\\n return x;\\n }\\n\\n bool same(int a, int b) {\\n assert(0 <= a && a < _n);\\n assert(0 <= b && b < _n);\\n return leader(a) == leader(b);\\n }\\n\\n int leader(int a) {\\n assert(0 <= a && a < _n);\\n return _leader(a);\\n }\\n\\n int size(int a) {\\n assert(0 <= a && a < _n);\\n return -parent_or_size[leader(a)];\\n }\\n\\n std::vector<std::vector<int>> groups() {\\n std::vector<int> leader_buf(_n), group_size(_n);\\n for (int i = 0; i < _n; i++) {\\n leader_buf[i] = leader(i);\\n group_size[leader_buf[i]]++;\\n }\\n std::vector<std::vector<int>> result(_n);\\n for (int i = 0; i < _n; i++) {\\n result[i].reserve(group_size[i]);\\n }\\n for (int i = 0; i < _n; i++) {\\n result[leader_buf[i]].push_back(i);\\n }\\n result.erase(\\n std::remove_if(result.begin(), result.end(),\\n [&](const std::vector<int>& v) { return v.empty(); }),\\n result.end());\\n return result;\\n }\\n\\n private:\\n int _n;\\n std::vector<int> parent_or_size;\\n\\n int _leader(int a) {\\n if (parent_or_size[a] < 0) return a;\\n return parent_or_size[a] = _leader(parent_or_size[a]);\\n }\\n};\\n\\n} // namespace atcoder\\n\\nusing namespace std;\\nusing namespace atcoder; \\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef long double ld;\\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\\n#define rrep(i,start,end) for (ll i = start;i >= (ll)(end);i--)\\n#define repn(i,end) for(ll i = 0; i <= (ll)(end); i++)\\n#define reps(i,start,end) for(ll i = start; i < (ll)(end); i++)\\n#define repsn(i,start,end) for(ll i = start; i <= (ll)(end); i++)\\n#define each(p,a) for(auto &p:a)\\ntypedef vector<ll> vll;\\ntypedef vector<pair<ll ,ll>> vpll;\\ntypedef vector<vector<ll>> vvll;\\ntypedef set<ll> sll;\\ntypedef map<ll , ll> mpll;\\ntypedef pair<ll ,ll> pll;\\ntypedef tuple<ll , ll , ll> tpl3;\\n#define LL(...) ll __VA_ARGS__; input(__VA_ARGS__)\\n#define LD(...) ld __VA_ARGS__; input(__VA_ARGS__)\\n#define Str(...) string __VA_ARGS__; input(__VA_ARGS__)\\n#define Ch(...) char __VA_ARGS__; input(__VA_ARGS__)\\n#define all(a) (a).begin(),(a).end()\\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\\n#define sz(x) (ll)x.size()\\n// << std::fixed << std::setprecision(10)\\nconst ll INF = 1LL << 60;\\nconst ld EPS = 1e-9;\\n \\nll lceil(ll a,ll b){if(a%b==0){return a/b;}if(a>=0){return (a/b)+1;}else{return -((-a)/b);}}\\nll lfloor(ll a,ll b){if(a%b==0){return a/b;}if(a>=0){return (a/b);}else{return -((-a)/b)-1;}}\\ninline ll positive_mod(ll a,ll m){return (a % m + m)%m;}\\ninline ll popcnt(ull a){ return __builtin_popcountll(a);}\\n//0indexed\\ninline ll topbit(ll a){assert(a != 0);return 63 - __builtin_clzll(a);}\\ninline ll smlbit(ll a){assert(a != 0);return __builtin_ctzll(a);}\\ntemplate<class T> bool chmin(T& a, T b){if(a > b){a = b;return true;}return false;}\\ntemplate<class T> bool chmax(T& a, T b){if(a < b){a = b;return true;}return false;}\\ntemplate<typename T> std::istream &operator>>(std::istream&is,std::vector<T>&v){for(T &in:v){is>>in;}return is;}\\ntemplate<typename T> std::ostream &operator<<(std::ostream&os,const std::vector<T>&v){for(auto it=std::begin(v);it!=std::end(v);){os<<*it<<((++it)!=std::end(v)?\\\" \\\":\\\"\\\");}return os;}\\ntemplate<typename T1, typename T2>std::ostream &operator<< (std::ostream &os, std::pair<T1,T2> p){os << \\\"{\\\" << p.first << \\\",\\\" << p.second << \\\"}\\\";return os;}\\ntemplate<class... T>void input(T&... a){(cin >> ... >> a);}\\nvoid print(){cout << endl;}\\ntemplate<class T, class... Ts>void print(const T& a, const Ts&... b){cout << a;((cout << ' ' << b), ...);cout << endl;}\\ntemplate<class T> void pspace(const T& a){ cout << a << ' ';}\\nvoid perr(){cerr << endl;}\\ntemplate<class T, class... Ts>void perr(const T& a, const Ts&... b){cerr << a;((cerr << ' ' << b), ...);cerr << endl;}\\nvoid yes(bool i = true){ return print(i?\\\"yes\\\":\\\"no\\\"); }\\nvoid Yes(bool i = true){ return print(i?\\\"Yes\\\":\\\"No\\\"); }\\nvoid YES(bool i = true){ return print(i?\\\"YES\\\":\\\"NO\\\"); }\\ntemplate <class T> vector<T> &operator++(vector<T> &v) {for(auto &e : v) e++;return v;}\\ntemplate <class T> vector<T> operator++(vector<T> &v, signed) {auto res = v;for(auto &e : v) e++;return res;}\\ntemplate <class T> vector<T> &operator--(vector<T> &v) {for(auto &e : v) e--;return v;}\\ntemplate <class T> vector<T> operator--(vector<T> &v, signed) {auto res = v;for(auto &e : v) e--;return res;}\\n//grid探索用\\nvector<ll> _ta = {0,0,1,-1,1,1,-1,-1};\\nvector<ll> _yo = {1,-1,0,0,1,-1,1,-1};\\nbool isin(ll now_i,ll now_j,ll h,ll w){return (0<=now_i && now_i < h && 0 <= now_j && now_j < w);}\\n \\nll lpow(ll x,ll n){ll ans = 1;while(n >0){if(n & 1)ans *= x;x *= x;n >>= 1;}return ans;}\\nll Modlpow(ll x,ll n,ll m){ll ans = 1;ll a = x%m;while(n >0){if(n & 1){ans *= a;ans%= m;}a *= a;a %= m;n >>= 1;}return ans;} \\nconst ll MOD9 = 998244353LL;\\nconst ll MOD10 = 1000000007LL;\\n\\nstruct Lowlink{\\n ll n;\\n vector<ll> ord;\\n vector<ll>low;\\n vector<ll>articulation,bridge;//atriculation 関節点,bridgeは橋になる辺の番号を格納 \\n vector<vector<pll>> g;\\n vector<ll>found;\\n vector<ll> c;//二重辺連結分解で使用\\n ll m;//辺の数\\n \\n Lowlink(ll _n):n(_n),m(0){\\n ord.resize(n,INF);\\n low.resize(n);\\n g.resize(n);\\n found.resize(n);\\n }\\n \\n ll add_edge(ll u, ll v){\\n g[u].push_back({v,m});\\n g[v].push_back({u,m});\\n return m++;\\n }\\n \\n ll dfs(ll v,ll par, ll num){\\n ord[v] = num;\\n low[v] = num;\\n found[v] =1;\\n bool isa = false; //関節点かどうか\\n ll cnt = 0;//ｖが根のときに関節点かどうか判定に使用\\n for(auto &p:g[v]){\\n auto[to,id] = p;\\n if(to == par){continue;}\\n if(found[to] != 0){\\n //発見済みだったから今見ている辺は後退辺\\n chmin(low[v],ord[to]);\\n }else{\\n //未発見\\n cnt++;\\n num = dfs(to,v,num+1);\\n if(par != -1 && low[to] >= ord[v]){\\n isa = true;\\n }\\n chmin(low[v],low[to]);\\n if(ord[v] < low[to]){\\n //子のlowが子で終わってたらbridge\\n bridge.push_back(id);\\n }\\n }\\n }\\n if(par == -1 && cnt >= 2)isa = true;\\n if(isa)articulation.push_back(v);//関節点だった\\n return num + 1;\\n }\\n //構築して連結成分数を返す \\n ll build(){\\n ll k = 0;\\n ll cnt = 0;//シンプルに連結成分数\\n rep(i,n){\\n if(found[i] == 0){\\n k = dfs(i,-1,k);\\n cnt++;\\n }\\n }\\n return cnt; //シンプルに連結成分数を返しておく\\n }\\n \\n vector<vector<ll>> bc;\\n vector<ll> bc_id;\\n //二重頂点連結分解\\n void bcc(){\\n bc_id = vector<ll>(m,-1);\\n vector<ll> used(n);\\n auto add = [&](ll id,ll num){\\n bc[num].push_back(id);\\n bc_id[id] = num;\\n };\\n auto dfs = [&](auto dfs,ll v,ll par,ll num)->void{\\n used[v] = 1;\\n for(auto &[to,id]:g[v]){\\n if(to == par){continue;}\\n if(used[to] == 0 ){\\n ll nownum = num;\\n if(low[to] >= ord[v]){\\n nownum = bc.size();\\n bc.push_back({});//新しくグループ作る\\n }\\n add(id,nownum);\\n dfs(dfs,to,v,nownum);\\n }else if(ord[to] < ord[v]){\\n add(id,num);//後退辺は同じグループ\\n }\\n }\\n };\\n rep(i,n){\\n if(used[i] == 0){\\n dfs(dfs,i,-1,-1);\\n }\\n }\\n }\\n\\n \\n\\n //二重辺連結分解 build()した後\\n //cに各頂点がどのグループに属するか格納される\\n //グラフから橋を全て削除したときの連結成分\\n ll two_edge_connect_component(){\\n //~~~~~~二重辺連結分解~~~~~~~~~~~\\n // 計算量 O(n+m)\\n c.resize(n,-1);\\n ll ccnt = 0;\\n rep(i,n){\\n if(c[i] == -1){\\n auto dfs2 = [&](auto dfs2, ll v,ll par,ll num)->ll{\\n if(par != -1 && ord[par] >= low[v]){\\n c[v] = c[par];\\n }else{\\n c[v] = num++;\\n }\\n for(auto &[to,id]:g[v]){\\n if(c[to] == -1){\\n num = dfs2(dfs2,to,v,num);\\n }\\n }\\n return num;\\n };\\n ccnt = dfs2(dfs2,i,-1,ccnt);\\n }\\n }\\n return ccnt;\\n }\\n};\\n\\n\\nvoid solve(ll n,ll m){\\n vector<string > s(n);\\n rep(i,n){\\n cin >> s[i];\\n }\\n // vvll g(n *m);\\n auto clc = [&](ll i,ll j){\\n return i * m + j;\\n };\\n\\n set<pll> kado ={{0,0},{n-1,m-1},{n-1,0},{0,m-1}};\\n \\n rep(I,n)rep(J,m)if(!kado.contains({I,J})){\\n dsu uf(n*m);\\n rep(i,n){\\n rep(j,m)if(s[i][j] != '#' && (i != I or j != J)){\\n rep(k,4){\\n ll ny = i + _ta[k];\\n ll nx = j + _yo[k];\\n if(isin(ny,nx,n,m)&& s[ny][nx] != '#'&& (ny !=I or nx != J)){\\n uf.merge(clc(i,j),clc(ny,nx));\\n }\\n }\\n }\\n }\\n // bool ok = true;\\n if(!uf.same(clc(0,0),clc(0,m-1))){\\n cout <<\\\"NO\\\" << endl;\\n return ;\\n }\\n if(!uf.same(clc(0,0),clc(n-1,m-1))){\\n cout << \\\"NO\\\" << endl;\\n return ;\\n }\\n if(!uf.same(clc(0,0),clc(n-1,0))){\\n cout << \\\"NO\\\" << endl;\\n return ;\\n }\\n }\\n \\n cout << \\\"YES\\\" << endl;\\n\\n}\\n \\nint main(){\\n ios::sync_with_stdio(false);cin.tie(nullptr);\\n while(true){\\n LL(n,m);\\n if(n == 0 && m == 0)break;\\n solve(n,m);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 520,\n \"memory_kb\": 3712,\n \"score_of_the_acc\": -0.6887,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1622_10630779\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#include <atcoder/all>\\nusing namespace atcoder;\\n\\nusing ll = long long;\\nusing mint = modint998244353;\\n\\nbool solve() {\\n int N, M;\\n cin >> N >> M;\\n if(N == 0) return false;\\n vector<string> S(N);\\n for(int i = 0; i < N; i++) {\\n cin >> S[i];\\n }\\n if(S[0][1] == '#' || S[1][0] == '#') {\\n cout << \\\"NO\\\" << endl;\\n return true;\\n }\\n if(S[0][M - 2] == '#' || S[1][M - 1] == '#') {\\n cout << \\\"NO\\\" << endl;\\n return true;\\n }\\n if(S[N - 1][1] == '#' || S[N - 2][0] == '#') {\\n cout << \\\"NO\\\" << endl;\\n return true;\\n }\\n if(S[N - 1][M - 2] == '#' || S[N - 2][M - 1] == '#') {\\n cout << \\\"NO\\\" << endl;\\n return true;\\n }\\n if(N <= 3 && M <= 3) {\\n cout << \\\"YES\\\" << endl;\\n return true;\\n }\\n auto ID = [&](int i, int j) -> int {\\n return i * M + j;\\n };\\n // cout << \\\"non-trivial\\\" << endl;\\n vector<pair<int, int>> dirs = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};\\n mf_graph<int> g(2 * N * M + 2);\\n for(int i = 0; i < N; i++) {\\n for(int j = 0; j < M; j++) {\\n if(S[i][j] == '#') continue;\\n int x = ID(i, j);\\n g.add_edge(2 * x, 2 * x + 1, 1);\\n for(auto [di, dj] : dirs) {\\n int ii = i + di, jj = j + dj;\\n if(!(0 <= ii && ii < N && 0 <= jj && jj < M && S[ii][jj] == '.')) continue;\\n // cout << i << \\\" \\\" << j << \\\" \\\" << ii << \\\" \\\" << jj << endl;\\n int y = ID(ii, jj);\\n g.add_edge(2 * x + 1, 2 * y, 1);\\n g.add_edge(2 * y + 1, 2 * x, 1);\\n }\\n }\\n }\\n mf_graph<int> ga = g;\\n mf_graph<int> gb = g;\\n mf_graph<int> gc = g;\\n const int SRC = 2 * N * M;\\n const int DST = 2 * N * M + 1;\\n {\\n ga.add_edge(SRC, 2 * ID(0, 1), 1);\\n ga.add_edge(SRC, 2 * ID(1, 0), 1);\\n ga.add_edge(2 * ID(N - 1, M - 2) + 1, DST, 1);\\n ga.add_edge(2 * ID(N - 2, M - 1) + 1, DST, 1);\\n int f = ga.flow(SRC, DST);\\n // vector ma(N, vector<int>(M));\\n // for(auto e : ga.edges()) {\\n // int p = e.from;\\n // int q = e.to;\\n // if(p != SRC && q != DST && p % 2 == 0 && q % 2 == 1 && p + 1 == q) {\\n // int i = (p / 2) / M;\\n // int j = (p / 2) % M;\\n // ma[i][j] = e.flow;\\n // }\\n // }\\n // for(int i = 0; i < N; i++) {\\n // for(int j = 0; j < M; j++) {\\n // cout << ma[i][j] << \\\" \\\\n\\\"[j == M - 1];\\n // }\\n // }\\n if(f < 2) {\\n // cout << \\\"type1\\\" << \\\" \\\" << f << endl;\\n cout << \\\"NO\\\" << endl;\\n return true;\\n }\\n }\\n {\\n gb.add_edge(SRC, 2 * ID(N - 2, 0), 1);\\n gb.add_edge(SRC, 2 * ID(N - 1, 1), 1);\\n gb.add_edge(2 * ID(1, 0) + 1, DST, 1);\\n gb.add_edge(2 * ID(N - 1, M - 2) + 1, DST, 1);\\n int f = gb.flow(SRC, DST);\\n if(f < 2) {\\n // cout << \\\"type2\\\" << \\\" \\\" << f << endl;\\n cout << \\\"NO\\\" << endl;\\n return true;\\n }\\n }\\n {\\n gc.add_edge(SRC, 2 * ID(0, M - 2), 1);\\n gc.add_edge(SRC, 2 * ID(1, M - 1), 1);\\n gc.add_edge(2 * ID(0, 1) + 1, DST, 1);\\n gc.add_edge(2 * ID(N - 2, M - 1) + 1, DST, 1);\\n int f = gc.flow(SRC, DST);\\n if(f < 2) {\\n // cout << \\\"type3\\\" << \\\" \\\" << f << endl;\\n cout << \\\"NO\\\" << endl;\\n return true;\\n }\\n }\\n cout << \\\"YES\\\" << endl;\\n return true;\\n}\\n\\nint main() {\\n while(solve());\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 8148,\n \"score_of_the_acc\": -1.012,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1622_9933475\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n\\nusing namespace std;\\n//make -f ../makefile SRC=\\n/*\\nad hoc => WA\\nmax flow WA:\\nvertex cannot be transversed more than once\\nedge <-> vertex OR multiple layers of grid (2 layer !)\\n\\n*/\\n\\n\\n//------------------------------------------------------------------------------\\nbool DEBUG = false;\\nconst int INF = 2147483647;\\n\\nconst int MAX_N = 50;\\nstatic bool G[MAX_N][MAX_N];\\n\\ntypedef pair<int,int> PA;\\ntypedef vector<PA> PAS;\\nstatic PAS action = {{-1,0}, {0,1}, {1,0}, {0,-1}};\\n\\ntypedef vector<int> States;\\n//------------------------------------------------------------------------------\\nconst int MAX_NN = 2*MAX_N*MAX_N + 2;\\nstatic int level[MAX_NN];\\nstatic int start[MAX_NN];\\n\\n//------------------------------------------------------------------------------\\nstruct Edge\\n{\\n int w, f, c, j;\\n\\n bool operator<(const Edge& other) const\\n {\\n return f < other.f;\\n }\\n\\n Edge(): w(-1), f(0), c(0), j(-1) {}\\n Edge(int v2, int flow, int capacity, int reverse_edge): w(v2), f(flow), c(capacity), j(reverse_edge) {}\\n void debug() const { printf(\\\"(%d, %d, %d, %d)\\\\n\\\", w, f, c, j); }\\n};\\n\\ntypedef vector<Edge> Edges;\\ntypedef vector<Edges> GRAPH;\\n\\n//------------------------------------------------------------------------------\\nvoid add_edge(int N, GRAPH& G, int v, int w, int c)\\n{\\n // forward edge:\\n Edge e1(w, 0, c, G[w].size());\\n\\n // backward edge:\\n Edge e2(v, 0, 0, G[v].size());\\n\\n G[v].push_back( e1 );\\n G[w].push_back( e2 );\\n}\\n\\n//------------------------------------------------------------------------------\\nbool bfs(int NN, GRAPH& GG, int src, int dest)\\n{\\n //--------------------------------------------------------------------------\\n // setup params:\\n for (int v=0; v<NN; ++v) level[v] = -1;\\n\\n queue<int> Q;\\n Q.push(src);\\n level[src] = 0;\\n\\n //--------------------------------------------------------------------------\\n // search:\\n while (!Q.empty())\\n {\\n int v = Q.front(); Q.pop();\\n for (Edge e: GG[v])\\n {\\n if (level[e.w] < 0 && e.f < e.c)\\n {\\n level[e.w] = level[v] + 1;\\n Q.push(e.w);\\n }\\n }\\n }\\n\\n //--------------------------------------------------------------------------\\n // is dest reachable from src?\\n return level[dest] >= 0;\\n}\\n\\nint send_flow(int NN, GRAPH& GG, int v, int dest, int flow)\\n{\\n if (v == dest) return flow;\\n for (; start[v]<GG[v].size(); start[v]++)\\n { \\n Edge& e = GG[v][start[v]];\\n if (level[e.w] == level[v] + 1 && e.f < e.c)\\n {\\n int min_flow = min(flow, e.c-e.f);\\n int new_flow = send_flow(NN, GG, e.w, dest, min_flow);\\n \\n if (new_flow)\\n { \\n e.f += new_flow;\\n GG[e.w][e.j].f -= new_flow;\\n return new_flow; \\n }\\n }\\n }\\n return 0;\\n}\\n\\n\\n//------------------------------------------------------------------------------\\nint dinic(int NN, GRAPH& GG, int src, int dest)\\n{\\n //if (DEBUG) {for (int v=0; v<NN; ++v) for (Edge e: GG[v]) { printf(\\\"%d -> \\\", v); e.debug(); }}\\n\\n //--------------------------------------------------------------------------\\n // base cases:\\n if (dest == src) return 0;\\n\\n //--------------------------------------------------------------------------\\n // init params:\\n int res = 0;\\n\\n //--------------------------------------------------------------------------\\n // compute:\\n while (bfs(NN, GG, src, dest))\\n {\\n for (int v=0; v<NN; ++v) start[v] = 0;\\n while (int flow = send_flow(NN, GG, src, dest, INF)) res += flow;\\n }\\n\\n //--------------------------------------------------------------------------\\n // report:\\n return res;\\n}\\n\\n//------------------------------------------------------------------------------\\nvoid debug_grid(int M, int N)\\n{\\n printf(\\\"grid:\\\\n\\\");\\n for (int m=0; m<M; ++m) { for (int n=0; n<N; ++n) printf(\\\"%d \\\",G[m][n]); printf(\\\"\\\\n\\\"); }\\n printf(\\\"\\\\n\\\");\\n}\\n\\n\\nStates neighbors(int M, int N, int v)\\n{\\n States SS;\\n int m1 = v/N;\\n int n1 = v%N;\\n if (!G[m1][n1]) return SS;\\n\\n int m2, n2, w;\\n //--------------------------------------------------------------------------\\n for (PA p: action)\\n {\\n m2 = m1 + p.first;\\n n2 = n1 + p.second;\\n if (m2 < 0 || m2 >= M || n2 < 0 || n2 >= N || !G[m2][n2]) continue;\\n w = m2*N + n2;\\n SS.push_back( w );\\n }\\n\\n //--------------------------------------------------------------------------\\n return SS;\\n}\\n\\n//------------------------------------------------------------------------------\\nbool ok(int M, int N)\\n{\\n for (int m=0; m<M; ++m)\\n for (int n=0; n<N; ++n)\\n if (!G[m][n])\\n return false;\\n return true;\\n}\\n\\nbool feasible(int M, int N)\\n{\\n int v;\\n v = 0;\\n if (neighbors(M, N, v).size() < 2) return false;\\n\\n v = N-1;\\n if (neighbors(M, N, v).size() < 2) return false;\\n\\n v = M*N-1;\\n if (neighbors(M, N, v).size() < 2) return false;\\n\\n v = M*N-N;\\n if (neighbors(M, N, v).size() < 2) return false;\\n\\n return true;\\n}\\n\\n\\nGRAPH setup(int M, int N)\\n{\\n int NN = 2*M*N+2;\\n int src = NN-2;\\n\\n GRAPH GG(NN);\\n add_edge(NN, GG, src, 0, 2);\\n\\n for (int v=0; v<M*N; ++v)\\n {\\n if (!G[v/N][v%N]) continue;\\n\\n add_edge(NN, GG, M*N+v, v, 1); //<----------\\n\\n for (int w: neighbors(M, N, v))\\n add_edge(NN, GG, v, w+M*N, 1);\\n }\\n\\n return GG;\\n}\\n\\n//------------------------------------------------------------------------------\\nbool solve(int M, int N)\\n{\\n if (DEBUG) debug_grid(M, N);\\n //--------------------------------------------------------------------------\\n // base cases:\\n if (M == 2 || N == 2) return ok(M, N);\\n if (!feasible(M, N)) return false;\\n //--------------------------------------------------------------------------\\n // init:\\n //--------------------------------------------------------------------------\\n // compute:\\n int NN = 2*M*N+2;\\n int src = NN-2;\\n\\n vector<int> dests = {N-1 + M*N, M*N-1 + M*N, M*N-N + M*N};\\n for (int dest: dests)\\n {\\n GRAPH GG = setup(M, N);\\n int flow = dinic(NN, GG, src, dest);\\n if (flow != 2) return false;\\n }\\n //--------------------------------------------------------------------------\\n // report:\\n return true;\\n}\\n\\n//------------------------------------------------------------------------------\\nvoid test()\\n{\\n\\n}\\n\\n//------------------------------------------------------------------------------\\nint main()\\n{\\n //test(); return 0;\\n //DEBUG = true;\\n //--------------------------------------------------------------------------\\n int M, N, num;\\n char c;\\n while (true)\\n {\\n num = scanf(\\\"%d %d \\\", &M, &N);\\n if (M == 0 && N == 0) break;\\n for (int m=0; m<M; ++m)\\n for (int n=0; n<N; ++n)\\n { num = scanf(\\\"%c \\\", &c); if (c == '.') G[m][n] = true; else G[m][n] = false; }\\n if (solve(M, N)) printf(\\\"YES\\\\n\\\");\\n else printf(\\\"NO\\\\n\\\");\\n }\\n //--------------------------------------------------------------------------\\n return 0;\\n}\\n//------------------------------------------------------------------------------\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3784,\n \"score_of_the_acc\": -0.1134,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1622_9409072\",\n \"code_snippet\": \"#ifndef _GLIBCXX_NO_ASSERT\\n#include <cassert>\\n#endif\\n#include <cctype>\\n#include <cerrno>\\n#include <cfloat>\\n#include <ciso646>\\n#include <climits>\\n#include <clocale>\\n#include <cmath>\\n#include <csetjmp>\\n#include <csignal>\\n#include <cstdarg>\\n#include <cstddef>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <ctime>\\n#if __cplusplus >= 201103L\\n#include <ccomplex>\\n#include <cfenv>\\n#include <cinttypes>\\n#include <cstdbool>\\n#include <cstdint>\\n#include <ctgmath>\\n#include <cwchar>\\n#include <cwctype>\\n#endif\\n// C++\\n#include <algorithm>\\n#include <bitset>\\n#include <complex>\\n#include <deque>\\n#include <exception>\\n#include <fstream>\\n#include <functional>\\n#include <iomanip>\\n#include <ios>\\n#include <iosfwd>\\n#include <iostream>\\n#include <istream>\\n#include <iterator>\\n#include <limits>\\n#include <list>\\n#include <locale>\\n#include <map>\\n#include <memory>\\n#include <new>\\n#include <numeric>\\n#include <ostream>\\n#include <queue>\\n#include <set>\\n#include <sstream>\\n#include <stack>\\n#include <stdexcept>\\n#include <streambuf>\\n#include <string>\\n#include <typeinfo>\\n#include <utility>\\n#include <valarray>\\n#include <vector>\\n#if __cplusplus >= 201103L\\n#include <array>\\n#include <atomic>\\n#include <chrono>\\n#include <condition_variable>\\n#include <forward_list>\\n#include <future>\\n#include <initializer_list>\\n#include <mutex>\\n#include <random>\\n#include <ratio>\\n#include <regex>\\n#include <scoped_allocator>\\n#include <system_error>\\n#include <thread>\\n#include <tuple>\\n#include <type_traits>\\n#include <typeindex>\\n#include <unordered_map>\\n#include <unordered_set>\\n\\n#endif\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i, n) for (int i = 0; i < n; i++)\\n#define all(v) v.begin(), v.end()\\ntemplate <class T, class U>\\ninline bool chmax(T& a, U b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <class T, class U>\\ninline bool chmin(T& a, U b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\nconstexpr int INF = 1001001001;\\nconstexpr int64_t llINF = 3000000000000000000;\\n\\n#include <algorithm>\\n#include <vector>\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\ntemplate <class T>\\nstruct simple_queue {\\n std::vector<T> payload;\\n int pos = 0;\\n void reserve(int n) { payload.reserve(n); }\\n int size() const { return int(payload.size()) - pos; }\\n bool empty() const { return pos == int(payload.size()); }\\n void push(const T& t) { payload.push_back(t); }\\n T& front() { return payload[pos]; }\\n void clear() {\\n payload.clear();\\n pos = 0;\\n }\\n void pop() { pos++; }\\n};\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n#include <cassert>\\n#include <limits>\\n#include <queue>\\n#include <vector>\\n\\nnamespace atcoder {\\n\\ntemplate <class Cap>\\nstruct mf_graph {\\n public:\\n mf_graph() : _n(0) {}\\n mf_graph(int n) : _n(n), g(n) {}\\n\\n int add_edge(int from, int to, Cap cap) {\\n assert(0 <= from && from < _n);\\n assert(0 <= to && to < _n);\\n assert(0 <= cap);\\n int m = int(pos.size());\\n pos.push_back({from, int(g[from].size())});\\n int from_id = int(g[from].size());\\n int to_id = int(g[to].size());\\n if (from == to) to_id++;\\n g[from].push_back(_edge{to, to_id, cap});\\n g[to].push_back(_edge{from, from_id, 0});\\n return m;\\n }\\n\\n struct edge {\\n int from, to;\\n Cap cap, flow;\\n };\\n\\n edge get_edge(int i) {\\n int m = int(pos.size());\\n assert(0 <= i && i < m);\\n auto _e = g[pos[i].first][pos[i].second];\\n auto _re = g[_e.to][_e.rev];\\n return edge{pos[i].first, _e.to, _e.cap + _re.cap, _re.cap};\\n }\\n std::vector<edge> edges() {\\n int m = int(pos.size());\\n std::vector<edge> result;\\n for (int i = 0; i < m; i++) {\\n result.push_back(get_edge(i));\\n }\\n return result;\\n }\\n void change_edge(int i, Cap new_cap, Cap new_flow) {\\n int m = int(pos.size());\\n assert(0 <= i && i < m);\\n assert(0 <= new_flow && new_flow <= new_cap);\\n auto& _e = g[pos[i].first][pos[i].second];\\n auto& _re = g[_e.to][_e.rev];\\n _e.cap = new_cap - new_flow;\\n _re.cap = new_flow;\\n }\\n\\n Cap flow(int s, int t) { return flow(s, t, std::numeric_limits<Cap>::max()); }\\n Cap flow(int s, int t, Cap flow_limit) {\\n assert(0 <= s && s < _n);\\n assert(0 <= t && t < _n);\\n assert(s != t);\\n\\n std::vector<int> level(_n), iter(_n);\\n internal::simple_queue<int> que;\\n\\n auto bfs = [&]() {\\n std::fill(level.begin(), level.end(), -1);\\n level[s] = 0;\\n que.clear();\\n que.push(s);\\n while (!que.empty()) {\\n int v = que.front();\\n que.pop();\\n for (auto e : g[v]) {\\n if (e.cap == 0 || level[e.to] >= 0) continue;\\n level[e.to] = level[v] + 1;\\n if (e.to == t) return;\\n que.push(e.to);\\n }\\n }\\n };\\n auto dfs = [&](auto self, int v, Cap up) {\\n if (v == s) return up;\\n Cap res = 0;\\n int level_v = level[v];\\n for (int& i = iter[v]; i < int(g[v].size()); i++) {\\n _edge& e = g[v][i];\\n if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0) continue;\\n Cap d = self(self, e.to, std::min(up - res, g[e.to][e.rev].cap));\\n if (d <= 0) continue;\\n g[v][i].cap += d;\\n g[e.to][e.rev].cap -= d;\\n res += d;\\n if (res == up) break;\\n }\\n return res;\\n };\\n\\n Cap flow = 0;\\n while (flow < flow_limit) {\\n bfs();\\n if (level[t] == -1) break;\\n std::fill(iter.begin(), iter.end(), 0);\\n while (flow < flow_limit) {\\n Cap f = dfs(dfs, t, flow_limit - flow);\\n if (!f) break;\\n flow += f;\\n }\\n }\\n return flow;\\n }\\n\\n std::vector<bool> min_cut(int s) {\\n std::vector<bool> visited(_n);\\n internal::simple_queue<int> que;\\n que.push(s);\\n while (!que.empty()) {\\n int p = que.front();\\n que.pop();\\n visited[p] = true;\\n for (auto e : g[p]) {\\n if (e.cap && !visited[e.to]) {\\n visited[e.to] = true;\\n que.push(e.to);\\n }\\n }\\n }\\n return visited;\\n }\\n\\n private:\\n int _n;\\n struct _edge {\\n int to, rev;\\n Cap cap;\\n };\\n std::vector<std::pair<int, int>> pos;\\n std::vector<std::vector<_edge>> g;\\n};\\n\\n} // namespace atcoder\\n\\nvoid solve() {\\n int n, m;\\n cin >> n >> m;\\n if (n == 0 && m == 0) exit(0);\\n vector<string> s(n);\\n rep(i, n) cin >> s[i];\\n atcoder::mf_graph<int> mf(n * m * 2 + 2);\\n vector<vector<int>> id(n, vector<int>(m));\\n {\\n int t = 0;\\n rep(i, n) rep(j, m) id[i][j] = t++;\\n }\\n rep(i, n) {\\n rep(j, m) {\\n if (s[i][j] == '#') continue;\\n mf.add_edge(id[i][j], id[i][j] + n * m, 1);\\n\\n if (i + 1 < n && s[i + 1][j] == '.') mf.add_edge(id[i][j] + n * m, id[i + 1][j], 1);\\n if (j + 1 < m && s[i][j + 1] == '.') mf.add_edge(id[i][j] + n * m, id[i][j + 1], 1);\\n if (i && s[i - 1][j] == '.') mf.add_edge(id[i][j] + n * m, id[i - 1][j], 1);\\n if (j && s[i][j - 1] == '.') mf.add_edge(id[i][j] + n * m, id[i][j - 1], 1);\\n }\\n }\\n auto mf2 = mf;\\n cout << (mf.flow(n * m, id[n - 1][m - 1], 2) == 2 && mf2.flow(id[n - 1][0] + n * m, id[0][m - 1], 2) == 2 ? \\\"YES\\\" : \\\"NO\\\") << endl;\\n}\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n /*int t;\\n cin >> t;\\n while (t--) */\\n while (1) solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4704,\n \"score_of_the_acc\": -0.2813,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1622_9381828\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\n\\n#include <algorithm>\\n#include <cassert>\\n#include <limits>\\n#include <queue>\\n#include <vector>\\n\\n\\n#include <vector>\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\ntemplate <class T> struct simple_queue {\\n std::vector<T> payload;\\n int pos = 0;\\n void reserve(int n) { payload.reserve(n); }\\n int size() const { return int(payload.size()) - pos; }\\n bool empty() const { return pos == int(payload.size()); }\\n void push(const T& t) { payload.push_back(t); }\\n T& front() { return payload[pos]; }\\n void clear() {\\n payload.clear();\\n pos = 0;\\n }\\n void pop() { pos++; }\\n};\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n\\nnamespace atcoder {\\n\\ntemplate <class Cap> struct mf_graph {\\n public:\\n mf_graph() : _n(0) {}\\n explicit mf_graph(int n) : _n(n), g(n) {}\\n\\n int add_edge(int from, int to, Cap cap) {\\n assert(0 <= from && from < _n);\\n assert(0 <= to && to < _n);\\n assert(0 <= cap);\\n int m = int(pos.size());\\n pos.push_back({from, int(g[from].size())});\\n int from_id = int(g[from].size());\\n int to_id = int(g[to].size());\\n if (from == to) to_id++;\\n g[from].push_back(_edge{to, to_id, cap});\\n g[to].push_back(_edge{from, from_id, 0});\\n return m;\\n }\\n\\n struct edge {\\n int from, to;\\n Cap cap, flow;\\n };\\n\\n edge get_edge(int i) {\\n int m = int(pos.size());\\n assert(0 <= i && i < m);\\n auto _e = g[pos[i].first][pos[i].second];\\n auto _re = g[_e.to][_e.rev];\\n return edge{pos[i].first, _e.to, _e.cap + _re.cap, _re.cap};\\n }\\n std::vector<edge> edges() {\\n int m = int(pos.size());\\n std::vector<edge> result;\\n for (int i = 0; i < m; i++) {\\n result.push_back(get_edge(i));\\n }\\n return result;\\n }\\n void change_edge(int i, Cap new_cap, Cap new_flow) {\\n int m = int(pos.size());\\n assert(0 <= i && i < m);\\n assert(0 <= new_flow && new_flow <= new_cap);\\n auto& _e = g[pos[i].first][pos[i].second];\\n auto& _re = g[_e.to][_e.rev];\\n _e.cap = new_cap - new_flow;\\n _re.cap = new_flow;\\n }\\n\\n Cap flow(int s, int t) {\\n return flow(s, t, std::numeric_limits<Cap>::max());\\n }\\n Cap flow(int s, int t, Cap flow_limit) {\\n assert(0 <= s && s < _n);\\n assert(0 <= t && t < _n);\\n assert(s != t);\\n\\n std::vector<int> level(_n), iter(_n);\\n internal::simple_queue<int> que;\\n\\n auto bfs = [&]() {\\n std::fill(level.begin(), level.end(), -1);\\n level[s] = 0;\\n que.clear();\\n que.push(s);\\n while (!que.empty()) {\\n int v = que.front();\\n que.pop();\\n for (auto e : g[v]) {\\n if (e.cap == 0 || level[e.to] >= 0) continue;\\n level[e.to] = level[v] + 1;\\n if (e.to == t) return;\\n que.push(e.to);\\n }\\n }\\n };\\n auto dfs = [&](auto self, int v, Cap up) {\\n if (v == s) return up;\\n Cap res = 0;\\n int level_v = level[v];\\n for (int& i = iter[v]; i < int(g[v].size()); i++) {\\n _edge& e = g[v][i];\\n if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0) continue;\\n Cap d =\\n self(self, e.to, std::min(up - res, g[e.to][e.rev].cap));\\n if (d <= 0) continue;\\n g[v][i].cap += d;\\n g[e.to][e.rev].cap -= d;\\n res += d;\\n if (res == up) return res;\\n }\\n level[v] = _n;\\n return res;\\n };\\n\\n Cap flow = 0;\\n while (flow < flow_limit) {\\n bfs();\\n if (level[t] == -1) break;\\n std::fill(iter.begin(), iter.end(), 0);\\n Cap f = dfs(dfs, t, flow_limit - flow);\\n if (!f) break;\\n flow += f;\\n }\\n return flow;\\n }\\n\\n std::vector<bool> min_cut(int s) {\\n std::vector<bool> visited(_n);\\n internal::simple_queue<int> que;\\n que.push(s);\\n while (!que.empty()) {\\n int p = que.front();\\n que.pop();\\n visited[p] = true;\\n for (auto e : g[p]) {\\n if (e.cap && !visited[e.to]) {\\n visited[e.to] = true;\\n que.push(e.to);\\n }\\n }\\n }\\n return visited;\\n }\\n\\n private:\\n int _n;\\n struct _edge {\\n int to, rev;\\n Cap cap;\\n };\\n std::vector<std::pair<int, int>> pos;\\n std::vector<std::vector<_edge>> g;\\n};\\n\\n} // namespace atcoder\\n\\nusing namespace std;\\nconst vector<pair<int,int>>D={{1,0},{-1,0},{0,1},{0,-1}};\\nbool solve()\\n{\\n int H,W;\\n cin>>H>>W;\\n if(H==0&&W==0)return false;\\n vector<string>S(H);\\n for(int i=0;i<H;i++)cin>>S[i];\\n const int N=H*W;\\n atcoder::mf_graph<long long>G(2*N);\\n G.add_edge(0,N,1);\\n for(int r=0;r<H;r++)for(int c=0;c<W;c++)G.add_edge(r*W+c,r*W+c+N,1);\\n for(int r=0;r<H;r++)for(int c=0;c<W;c++)if(S[r][c]=='.')\\n {\\n for(auto[dr,dc]:D)\\n {\\n int tr=r+dr,tc=c+dc;\\n if(0<=tr&&tr<H&&0<=tc&&tc<W&&S[tr][tc]=='.')G.add_edge(r*W+c+N,tr*W+tc,1);\\n }\\n }\\n auto GG=G,GGG=G;\\n cout<<(G.flow(0,W-1)==2&&GG.flow(0,N-W)==2&&GGG.flow(0,N-1)==2?\\\"YES\\\":\\\"NO\\\")<<'\\\\n';\\n return true;\\n}\\nint main(){while(solve()){}}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 5584,\n \"score_of_the_acc\": -0.477,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1622_9351399\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nstruct dsu {\\n vector<int> p, sz;\\n dsu(int n) : p(n), sz(n) {\\n iota(p.begin(), p.end(), 0);\\n }\\n int find(int x) {\\n return (p[x] == x ? x : p[x] = find(p[x]));\\n }\\n bool same(int x, int y) {\\n return find(x) == find(y);\\n }\\n void merge(int x, int y) {\\n x = find(x), y = find(y);\\n if (sz[x] < sz[y]) swap(x, y);\\n p[y] = x;\\n sz[x] += sz[y];\\n }\\n};\\n\\nbool solve() {\\n int N, M; cin >> N >> M;\\n if (!N) return false;\\n vector S(N, string());\\n for (auto& s : S) cin >> s;\\n vector<vector<bool>> G(N, vector(M, false));\\n for (int i = 0 ; i < N ; i++) {\\n for (int j = 0 ; j < M ; j++) {\\n G[i][j] = S[i][j] == '.';\\n }\\n }\\n auto valid = [&](int y, int x) -> bool {\\n return 0 <= y and y < N and 0 <= x and x < M and G[y][x];\\n };\\n auto f = [&](int y, int x) -> int {\\n return y * M + x;\\n };\\n array<int, 4> dy = { 1, 0, -1, 0 };\\n array<int, 4> dx = { 0, 1, 0, -1 };\\n for (int i = 0 ; i < N ; i++) {\\n for (int j = 0 ; j < M ; j++) {\\n if (not G[i][j]) continue;\\n if (i == 0 and j == 0) continue;\\n if (i == N - 1 and j == 0) continue;\\n if (i == 0 and j == M - 1) continue;\\n if (i == N - 1 and j == M - 1) continue;\\n dsu uf(N * M);\\n for (int y = 0 ; y < N ; y++) {\\n for (int x = 0 ; x < M ; x++) {\\n if (y == i and x == j) continue;\\n if (not G[y][x]) continue;\\n for (int d = 0 ; d < 4 ; d++) {\\n int ny = y + dy[d], nx = x + dx[d];\\n if (not valid(ny, nx)) continue;\\n if (ny == i and nx == j) continue;\\n uf.merge(f(y, x), f(ny, nx));\\n }\\n }\\n }\\n bool ok = true;\\n ok &= uf.same(f(0, 0), f(N - 1, 0));\\n ok &= uf.same(f(N - 1, 0), f(N - 1, M - 1));\\n ok &= uf.same(f(N - 1, M - 1), f(0, M - 1));\\n if (not ok) {\\n // cout << i << ' ' << j << endl;\\n cout << \\\"NO\\\" << endl;\\n return true;\\n }\\n }\\n }\\n dsu uf(N * M);\\n for (int y = 0 ; y < N ; y++) {\\n for (int x = 0 ; x < M ; x++) {\\n if (not G[y][x]) continue;\\n for (int d = 0 ; d < 4 ; d++) {\\n int ny = y + dy[d], nx = x + dx[d];\\n if (not valid(ny, nx)) continue;\\n uf.merge(f(y, x), f(ny, nx));\\n }\\n }\\n }\\n bool ok = true;\\n ok &= uf.same(f(0, 0), f(N - 1, 0));\\n ok &= uf.same(f(N - 1, 0), f(N - 1, M - 1));\\n ok &= uf.same(f(N - 1, M - 1), f(0, M - 1));\\n if (not ok) {\\n // cout << i << ' ' << j << endl;\\n cout << \\\"NO\\\" << endl;\\n return true;\\n }\\n cout << \\\"YES\\\" << endl;\\n return true;\\n}\\n\\nint main() {\\n while (solve()) ;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 780,\n \"memory_kb\": 3516,\n \"score_of_the_acc\": -0.9611,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1622_9293575\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n#include <algorithm>\\n\\n#include <vector>\\n\\nnamespace atcoder {\\n\\nnamespace internal {\\n\\ntemplate <class T> struct simple_queue {\\n std::vector<T> payload;\\n int pos = 0;\\n void reserve(int n) { payload.reserve(n); }\\n int size() const { return int(payload.size()) - pos; }\\n bool empty() const { return pos == int(payload.size()); }\\n void push(const T& t) { payload.push_back(t); }\\n T& front() { return payload[pos]; }\\n void clear() {\\n payload.clear();\\n pos = 0;\\n }\\n void pop() { pos++; }\\n};\\n\\n} // namespace internal\\n\\n} // namespace atcoder\\n\\n#include <cassert>\\n#include <limits>\\n#include <queue>\\n#include <vector>\\n\\nnamespace atcoder {\\n\\ntemplate <class Cap> struct mf_graph {\\n public:\\n mf_graph() : _n(0) {}\\n mf_graph(int n) : _n(n), g(n) {}\\n\\n int add_edge(int from, int to, Cap cap) {\\n assert(0 <= from && from < _n);\\n assert(0 <= to && to < _n);\\n assert(0 <= cap);\\n int m = int(pos.size());\\n pos.push_back({from, int(g[from].size())});\\n int from_id = int(g[from].size());\\n int to_id = int(g[to].size());\\n if (from == to) to_id++;\\n g[from].push_back(_edge{to, to_id, cap});\\n g[to].push_back(_edge{from, from_id, 0});\\n return m;\\n }\\n\\n struct edge {\\n int from, to;\\n Cap cap, flow;\\n };\\n\\n edge get_edge(int i) {\\n int m = int(pos.size());\\n assert(0 <= i && i < m);\\n auto _e = g[pos[i].first][pos[i].second];\\n auto _re = g[_e.to][_e.rev];\\n return edge{pos[i].first, _e.to, _e.cap + _re.cap, _re.cap};\\n }\\n std::vector<edge> edges() {\\n int m = int(pos.size());\\n std::vector<edge> result;\\n for (int i = 0; i < m; i++) {\\n result.push_back(get_edge(i));\\n }\\n return result;\\n }\\n void change_edge(int i, Cap new_cap, Cap new_flow) {\\n int m = int(pos.size());\\n assert(0 <= i && i < m);\\n assert(0 <= new_flow && new_flow <= new_cap);\\n auto& _e = g[pos[i].first][pos[i].second];\\n auto& _re = g[_e.to][_e.rev];\\n _e.cap = new_cap - new_flow;\\n _re.cap = new_flow;\\n }\\n\\n Cap flow(int s, int t) {\\n return flow(s, t, std::numeric_limits<Cap>::max());\\n }\\n Cap flow(int s, int t, Cap flow_limit) {\\n assert(0 <= s && s < _n);\\n assert(0 <= t && t < _n);\\n assert(s != t);\\n\\n std::vector<int> level(_n), iter(_n);\\n internal::simple_queue<int> que;\\n\\n auto bfs = [&]() {\\n std::fill(level.begin(), level.end(), -1);\\n level[s] = 0;\\n que.clear();\\n que.push(s);\\n while (!que.empty()) {\\n int v = que.front();\\n que.pop();\\n for (auto e : g[v]) {\\n if (e.cap == 0 || level[e.to] >= 0) continue;\\n level[e.to] = level[v] + 1;\\n if (e.to == t) return;\\n que.push(e.to);\\n }\\n }\\n };\\n auto dfs = [&](auto self, int v, Cap up) {\\n if (v == s) return up;\\n Cap res = 0;\\n int level_v = level[v];\\n for (int& i = iter[v]; i < int(g[v].size()); i++) {\\n _edge& e = g[v][i];\\n if (level_v <= level[e.to] || g[e.to][e.rev].cap == 0) continue;\\n Cap d =\\n self(self, e.to, std::min(up - res, g[e.to][e.rev].cap));\\n if (d <= 0) continue;\\n g[v][i].cap += d;\\n g[e.to][e.rev].cap -= d;\\n res += d;\\n if (res == up) break;\\n }\\n return res;\\n };\\n\\n Cap flow = 0;\\n while (flow < flow_limit) {\\n bfs();\\n if (level[t] == -1) break;\\n std::fill(iter.begin(), iter.end(), 0);\\n while (flow < flow_limit) {\\n Cap f = dfs(dfs, t, flow_limit - flow);\\n if (!f) break;\\n flow += f;\\n }\\n }\\n return flow;\\n }\\n\\n std::vector<bool> min_cut(int s) {\\n std::vector<bool> visited(_n);\\n internal::simple_queue<int> que;\\n que.push(s);\\n while (!que.empty()) {\\n int p = que.front();\\n que.pop();\\n visited[p] = true;\\n for (auto e : g[p]) {\\n if (e.cap && !visited[e.to]) {\\n visited[e.to] = true;\\n que.push(e.to);\\n }\\n }\\n }\\n return visited;\\n }\\n\\n private:\\n int _n;\\n struct _edge {\\n int to, rev;\\n Cap cap;\\n };\\n std::vector<std::pair<int, int>> pos;\\n std::vector<std::vector<_edge>> g;\\n};\\n\\n} // namespace atcoder\\n\\nusing namespace atcoder;\\nusing namespace std;\\nusing ll = long long;\\nusing vll = vector<ll>;\\nusing vvll = vector<vll>;\\n#define all(A) A.begin(),A.end()\\n#define rep(i, n) for (int i = 0; i < (int) (n); i++)\\n\\nvoid solve(ll H,ll W) {\\n vector<string> S(H);\\n rep(h,H)cin>>S[h];\\n mf_graph<ll> G(H*W*2);\\n vll dx={1,-1,0,0};\\n vll dy={0,0,1,-1};\\n rep(h,H)rep(w,W){\\n if(S[h][w]=='#')continue;\\n G.add_edge(h*W+w,h*W+w+H*W,1);\\n rep(d,4){\\n ll nh=h+dy[d];\\n ll nw=w+dx[d];\\n if(nh<0||nw<0||nh>=H||nw>=W)continue;\\n if(S[nh][nw]=='#')continue;\\n G.add_edge(h*W+w+H*W,nh*W+nw,1);\\n }\\n }\\n G.add_edge(0,H*W,1);\\n auto G2=G,G3=G;\\n ll an=min({G.flow(0,(H-1)*W),G2.flow(0,W-1),G3.flow(0,(H-1)*W+W-1)});\\n cout<<(an==2?\\\"YES\\\":\\\"NO\\\")<<endl;\\n}\\n\\nint main() {\\n\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n\\n ll H,W;\\n while (cin >> H>>W) {\\n if (H == 0)return 0;\\n solve(H,W);\\n }\\n\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 5812,\n \"score_of_the_acc\": -0.5246,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1622_9126959\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nstruct Edge {\\n int from;\\n int to;\\n int cap;\\n int rev;\\n Edge(int from, int to, int cap, int rev): from(from), to(to), cap(cap), rev(rev) {}\\n};\\n\\nstruct Flow {\\n std::vector<std::vector<Edge>> graph;\\n Flow(int n): graph(n) {}\\n void add_edge(int from, int to, int cap) {\\n int id = graph[from].size();\\n int rev = graph[to].size();\\n graph[from].emplace_back(from, to, cap, rev);\\n graph[to].emplace_back(to, from, 0, id);\\n }\\n\\n std::vector<bool> used;\\n int dfs(int u, const int sink, int cur_flow) {\\n if (u == sink) return cur_flow;\\n used[u] = true;\\n for (auto& e: graph[u]) {\\n if (e.cap == 0) continue;\\n if (used[e.to]) continue;\\n int res = dfs(e.to, sink, std::min(cur_flow, e.cap));\\n if (res != 0) {\\n e.cap -= res;\\n graph[e.to][e.rev].cap += res;\\n return res;\\n }\\n }\\n return 0;\\n }\\n\\n int max_flow(int source, int sink) {\\n int ans = 0;\\n while (true) {\\n used.assign(graph.size(), false);\\n int res = dfs(source, sink, 1e9);\\n if (res == 0) {\\n break;\\n }\\n ans += res;\\n }\\n return ans;\\n }\\n};\\n\\nint solve() {\\n int n, m;\\n std::cin >> n >> m;\\n if (n == 0) return 1;\\n\\n std::vector<std::string> board(n);\\n for (int i = 0; i < n; i++) std::cin >> board[i];\\n\\n int offset = 0;\\n std::vector in(n, std::vector<int>(m));\\n std::vector mid(n, std::vector<int>(m));\\n std::vector out(n, std::vector<int>(m));\\n for (int i = 0; i < n; i++) {\\n for (int j = 0; j < m; j++) {\\n in[i][j] = offset++;\\n mid[i][j] = offset++;\\n out[i][j] = offset++;\\n }\\n }\\n const int source = out[0][0];\\n Flow flow(offset);\\n\\n // in -> out\\n for (int i = 0; i < n; i++) {\\n for (int j = 0; j < m; j++) {\\n flow.add_edge(in[i][j], out[i][j], 1);\\n }\\n }\\n\\n const int DI[] = {0, 1, 0, -1};\\n const int DJ[] = {1, 0, -1, 0};\\n // out -> in\\n for (int i = 0; i < n; i++) {\\n for (int j = 0; j < m; j++) {\\n if (board[i][j] == '#') continue;\\n for (int d = 0; d < 4; d++) {\\n int ni = i + DI[d];\\n int nj = j + DJ[d];\\n if (ni < 0 || nj < 0 || ni >= n || nj >= m) continue;\\n if (board[ni][nj] == '#') continue;\\n flow.add_edge(out[i][j], in[ni][nj], 1);\\n }\\n }\\n }\\n\\n Flow f1 = flow;\\n Flow f2 = flow;\\n Flow f3 = flow;\\n int ff1 = f1.max_flow(source, in[0][m - 1]);\\n int ff2 = f2.max_flow(source, in[n - 1][0]);\\n int ff3 = f3.max_flow(source, in[n - 1][m - 1]);\\n // std::cerr << ff1 << ' ' << ff2 << ' ' << ff3 << std::endl;\\n if (ff1 == ff2 && ff2 == ff3 && ff3 == 2) {\\n std::cout << \\\"YES\\\" << '\\\\n';\\n } else {\\n std::cout << \\\"NO\\\" << '\\\\n';\\n }\\n\\n return 0;\\n}\\n\\nint main() {\\n while (!solve());\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 6368,\n \"score_of_the_acc\": -0.6526,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1622_7785140\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nbool connected(int n, int m, vector<vector<char>> &c){\\n\\tvector<vector<bool>> dp(n, vector<bool>(m));\\n\\tdp[0][0] = true;\\n\\tvector<pair<int,int>> mada = {pair(0, 0)};\\n\\tvector<pair<int,int>> go = {pair(-1, 0), pair(1, 0), pair(0, 1), pair(0, -1)};\\n\\twhile (!mada.empty()){\\n\\t\\tint i = mada.back().first;\\n\\t\\tint j = mada.back().second;\\n\\t\\tmada.pop_back();\\n\\t\\tfor (auto [xx, yy]: go){\\n\\t\\t\\tint x = i + xx;\\n\\t\\t\\tint y = j + yy;\\n\\t\\t\\tif (0 <= x && x < n && 0 <= y && y < m){\\n\\t\\t\\t\\tif (c[x][y] == '.' && !dp[x][y]){\\n\\t\\t\\t\\t\\tmada.push_back(pair(x, y));\\n\\t\\t\\t\\t\\tdp[x][y] = true;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tif (!dp[n-1][m-1]) return false;\\n\\tif (!dp[0][m-1]) return false;\\n\\tif (!dp[n-1][0]) return false;\\n\\treturn true;\\n}\\n\\nint main(){\\n\\twhile(true){\\n\\t\\tint n, m; cin >> n >> m;\\n\\t\\tif (n == 0) break;\\n\\n\\t\\tvector<vector<char>> c(n, vector<char>(m));\\n\\t\\tfor (int i=0; i<n; i++){\\n\\t\\t\\tfor (int j=0; j<m; j++){\\n\\t\\t\\t\\tcin >> c[i][j];\\n\\t\\t\\t}\\n\\t\\t}\\n\\n\\t\\tif (!connected(n, m, c)){\\n\\t\\t\\tcout << \\\"NO\\\" << endl;\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\n\\t\\tbool mode = true;\\n\\t\\tfor (int i=0; i<n; i++){\\n\\t\\t\\tfor (int j=0; j<m; j++){\\n\\t\\t\\t\\tif (i == 0 && j == 0) continue;\\n\\t\\t\\t\\tif (i == n-1 && j == 0) continue;\\n\\t\\t\\t\\tif (i == 0 && j == m-1) continue;\\n\\t\\t\\t\\tif (i == n-1 && j == m-1) continue;\\n\\t\\t\\t\\tif (c[i][j] == '.'){\\n\\t\\t\\t\\t\\tc[i][j] = '#';\\n\\t\\t\\t\\t\\tif (!connected(n, m, c)) mode = false;\\n\\t\\t\\t\\t\\tc[i][j] = '.';\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (!mode) break;\\n\\t\\t\\t}\\n\\t\\t\\tif (!mode) break;\\n\\t\\t}\\n\\n\\n\\t\\tif (mode) cout << \\\"YES\\\" << endl;\\n\\t\\telse cout << \\\"NO\\\" << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 530,\n \"memory_kb\": 3504,\n \"score_of_the_acc\": -0.6574,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1622_7111607\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nint ri() {\\n\\tint n;\\n\\tscanf(\\\"%d\\\", &n);\\n\\treturn n;\\n}\\nconst std::vector<std::pair<int, int> > dd = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};\\n\\nbool solve() {\\n\\tint n = ri();\\n\\tint m = ri();\\n\\t\\n\\tif (!n && !m) return false;\\n\\t\\n\\tauto in = [&] (int i, int j) { return i >= 0 && i < n && j >= 0 && j < m; };\\n\\t\\n\\tstd::string a[n];\\n\\tfor (auto &i : a) std::cin >> i;\\n\\t\\n\\tstd::vector<std::vector<bool> > used(n, std::vector<bool>(m));\\n\\t\\n\\tauto bfs = [&] (int sx, int sy) {\\n\\t\\tstd::vector<std::vector<bool> > reachable(n, std::vector<bool>(m));\\n\\t\\tstd::queue<std::pair<int, int> > que;\\n\\t\\treachable[sx][sy] = true;\\n\\t\\tque.push({sx, sy});\\n\\t\\twhile (que.size()) {\\n\\t\\t\\tauto i = que.front();\\n\\t\\t\\tque.pop();\\n\\t\\t\\t\\n\\t\\t\\tauto go = [&] (int nx, int ny) {\\n\\t\\t\\t\\tif (in(nx, ny) && a[nx][ny] == '.' && !used[nx][ny] && !reachable[nx][ny]) {\\n\\t\\t\\t\\t\\treachable[nx][ny] = true;\\n\\t\\t\\t\\t\\tque.push({nx, ny});\\n\\t\\t\\t\\t}\\n\\t\\t\\t};\\n\\t\\t\\tfor (auto d : dd) go(i.first + d.first, i.second + d.second);\\n\\t\\t}\\n\\t\\treturn reachable;\\n\\t};\\n\\tint x = 1;\\n\\tint y = 0;\\n\\tint last_dx = 1;\\n\\tint last_dy = 0;\\n\\t\\n\\tstd::vector<std::pair<int, int> > route;\\n\\tauto go = [&] (int gx, int gy) {\\n\\t\\twhile (x != gx || y != gy) {\\n\\t\\t\\tused[x][y] = true;\\n\\t\\t\\t\\n\\t\\t\\tauto reachable = bfs(gx, gy);\\n\\t\\t\\t\\n\\t\\t\\tint dx = last_dy;\\n\\t\\t\\tint dy = -last_dx;\\n\\t\\t\\tbool ok = false;\\n\\t\\t\\tfor (int i = 0; i < 4; i++) {\\n\\t\\t\\t\\tif (in(x + dx, y + dy) && reachable[x + dx][y + dy]) { ok = true; break; }\\n\\t\\t\\t\\tstd::swap(dx, dy);\\n\\t\\t\\t\\tdx *= -1;\\n\\t\\t\\t}\\n\\t\\t\\tif (!ok) return false;\\n\\t\\t\\tx += dx;\\n\\t\\t\\ty += dy;\\n\\t\\t\\t// std::cerr << x << \\\" \\\" << y << std::endl;\\n\\t\\t\\tlast_dx = dx;\\n\\t\\t\\tlast_dy = dy;\\n\\t\\t\\troute.push_back({x, y});\\n\\t\\t}\\n\\t\\treturn true;\\n\\t};\\n\\tbool ok = a[1][0] == '.';\\n\\tok = ok && go(n - 1, 0);\\n\\tok = ok && go(n - 1, m - 1);\\n\\tok = ok && go(0, m - 1);\\n\\tok = ok && go(0, 0);\\n\\tputs(ok ? \\\"YES\\\" : \\\"NO\\\");\\n\\t\\n\\treturn true;\\n}\\n\\nint main() {\\n\\twhile (solve());\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 3448,\n \"score_of_the_acc\": -0.1156,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1622_6710847\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing ld = long double;\\nusing vl = vector<ll>;\\ntemplate<class T> using vc = vector<T>;\\ntemplate<class T> using vvc = vector<vector<T>>;\\n\\n#define eb emplace_back\\n#define all(x) (x).begin(), (x).end()\\n#define rep(i, n) for (ll i = 0; i < (n); i++)\\n#define repr(i, n) for (ll i = (n)-1; i >= 0; i--)\\n#define repe(i, l, r) for (ll i = (l); i < (r); i++)\\n#define reper(i, l, r) for (ll i = (r)-1; i >= (l); i--)\\n#define repa(i,n) for (auto& i: n)\\n\\ntemplate<class T1, class T2> inline bool chmax(T1 &a, const T2 &b) {if (a<b) { a=b; return 1;} return 0;}\\ntemplate<class T1, class T2> inline bool chmin(T1 &a, const T2 &b) {if (b<a) { a=b; return 1;} return 0;}\\n\\nstruct init{init(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);cerr<<fixed<<setprecision(15);}}init_;\\n\\ntemplate <typename T, typename U> ostream& operator<<(ostream&out,const pair<T, U>&a){return out<<a.first<<' '<<a.second;}\\ntemplate <typename T> ostream& operator<<(ostream&out, const vector<T>&a){for(auto it=a.begin();it!= a.end();){out<<*it;if(++it!=a.end())out<<' ';}return out;}\\ntemplate <typename T, size_t N> ostream& operator<<(ostream&out, const array<T, N>&a){for(auto it=a.begin();it!= a.end();){out<<*it;if(++it!=a.end())out<<' ';}return out;}\\ntemplate <typename T> ostream& operator<<(ostream&out, const set<T>&a){for(auto it=a.begin();it!=a.end();){out<<*it;if(++it!=a.end())out<<' ';}return out;}\\ntemplate <typename T, typename U> ostream& operator<<(ostream&out, const map<T, U>&a){for(auto it=a.begin();it!=a.end();){out<<*it;if(++it!=a.end())out<<'\\\\n';}return out;}\\n\\n#ifdef DEBUG\\ntemplate <class T, class N> void verr(const vector<T>& a, const N& n) { rep(i, n) cerr << a[i] << \\\" \\\"; cerr << endl; }\\ntemplate <class T, class N, size_t AN> void verr(const array<T, AN>& a, const N& n) { rep(i, n) cerr << a[i] << \\\" \\\"; cerr << endl; }\\nll dbgt = 1; void err() { cerr << \\\"passed \\\" << dbgt++ << endl; }\\ntemplate<class H, class... T> void err(H&& h,T&&... t){ cerr<< h << (sizeof...(t)?\\\" \\\":\\\"\\\\n\\\") << flush; if(sizeof...(t)>0) err(forward<T>(t)...); }\\n#else\\nvoid err(){}\\ntemplate <class H, class... T>\\nvoid err(H &&h, T &&...t) {}\\ntemplate <class H, class... T>\\nvoid verr(H &&h, T &&...t) {}\\n#endif\\n\\nconst ll INF = 4e18;\\nconst ld EPS = 1e-11;\\nconst ld PI = acos(-1.0L);\\n// const ll MOD = 1e9 + 7;\\nconst ll MOD = 998244353;\\n//--------------------------------------------------------------------------------//\\narray<int, 4> di = {0, 1, 0, -1}, dj = {1, 0, -1, 0};\\n\\nstruct UnionFind {\\nprivate:\\n vector<int> par;\\n vector<int> count;\\n vector<int> rank;\\npublic:\\n UnionFind(int N) {\\n count.assign(N, 1);\\n rank.assign(N, 0);\\n par.assign(N, 0);\\n rep(i, N) par[i] = i;\\n }\\n\\n int root(int x) {\\n if (par[x] == x)\\n return x;\\n else {\\n par[x] = root(par[x]);\\n return par[x];\\n }\\n }\\n\\n void unite(int x, int y) {\\n x = root(x), y = root(y);\\n if (x == y) return;\\n if (rank[x] < rank[y])\\n swap(x, y);\\n else if (rank[x] == rank[y])\\n rank[y]++;\\n par[y] = x;\\n count[x] += count[y];\\n return;\\n }\\n\\n int size(int x) {\\n return count[root(x)];\\n }\\n\\n bool issame(int x, int y) {\\n return root(x) == root(y);\\n }\\n};\\nusing UF = struct UnionFind;\\n\\n\\nvoid solve(int H, int W){\\n vc<string> C(H);\\n rep(i, H) cin >> C[i];\\n vvc<int> used(H, vc<int>(W));\\n rep(i, H) rep(j, W) {\\n if (C[i][j] == '#') used[i][j] = true;\\n }\\n\\n queue<pair<int, int>> q;\\n auto padding1 = [&]() -> void {\\n queue<pair<int, int>> tmpq;\\n rep(i, H) rep(j, W) tmpq.emplace(i, j);\\n while (!tmpq.empty()) {\\n auto [i, j] = tmpq.front();\\n tmpq.pop();\\n int can = 0, li, lj;\\n rep(d, 4) {\\n int ti = i + di[d], tj = j + dj[d];\\n if (ti < 0 or ti >= H or tj < 0 or tj >= W) continue;\\n if (used[ti][tj]) continue;\\n can++;\\n li = ti, lj = tj;\\n }\\n if (can == 0) used[i][j] = true;\\n if (can == 1) {\\n used[i][j] = true;\\n tmpq.emplace(li, lj);\\n }\\n }\\n };\\n\\n padding1();\\n\\n auto cango = [&](int i, int j) -> bool {\\n if (i < 0 or i >= H or j < 0 or j >= W) return false;\\n if (used[i][j]) return false;\\n return true;\\n };\\n rep(i, H) rep(j, W) {\\n int can = 0;\\n if (used[i][j]) continue;\\n rep(d, 4) {\\n int ti = i + di[d], tj = j + dj[d];\\n if (!cango(ti, tj)) continue;\\n can++;\\n }\\n if (can == 2) q.emplace(i, j);\\n }\\n rep(i, H) rep(j, W) {\\n int can = 0;\\n if (used[i][j]) continue;\\n rep(d, 4) {\\n int ti = i + di[d], tj = j + dj[d];\\n if (!cango(ti, tj)) continue;\\n can++;\\n }\\n if (can == 3) q.emplace(i, j);\\n }\\n rep(i, H) rep(j, W) {\\n int can = 0;\\n if (used[i][j]) continue;\\n rep(d, 4) {\\n int ti = i + di[d], tj = j + dj[d];\\n if (!cango(ti, tj)) continue;\\n can++;\\n }\\n if (can == 4) q.emplace(i, j);\\n }\\n while(!q.empty()) {\\n auto [ci, cj] = q.front();\\n q.pop();\\n if (used[ci][cj]) continue;\\n UF tuf(H * W);\\n rep(i, H) rep(j, W) {\\n if (i == ci and j == cj) continue;\\n if (used[i][j]) continue;\\n rep(d, 4) {\\n int ti = i + di[d], tj = j + dj[d];\\n if (ti == ci and tj == cj) continue;\\n if (!cango(ti, tj)) continue;\\n tuf.unite(i * W + j, ti * W + tj);\\n }\\n }\\n bool closed = false;\\n vc<pair<int, int>> ads;\\n rep(d, 4) {\\n int ti = ci + di[d], tj = cj + dj[d];\\n if (!cango(ti, tj)) continue;\\n ads.eb(ti, tj);\\n }\\n if (ads.size() <= 1) continue;\\n set<int> st;\\n for (auto [i, j] : ads) {\\n st.emplace(tuf.root(i * W + j));\\n }\\n if (st.size() != 2) continue;\\n int cli, clj;\\n for (auto [i, j] : ads) {\\n int id = i * W + j;\\n if (tuf.issame(id, 0) or tuf.issame(id, H * W - 1) or tuf.issame(id, (H - 1) * W) or tuf.issame(id, W - 1))\\n continue;\\n closed = true;\\n cli = i, clj = j;\\n }\\n if (closed) {\\n // err(\\\"closed\\\", ci, cj);\\n // used[ci][cj] = true;\\n rep(i, H) rep(j, W) {\\n if (tuf.issame(cli * W + clj, i * W + j)) used[i][j] = true;\\n }\\n padding1();\\n // rep(i, H) {\\n // cerr << setfill('0') << right << setw(2) << i << setfill(' ') << \\\" \\\";\\n // cerr << C[i] << \\\" \\\";\\n // rep(j, W) cerr << (used[i][j] ? '#' : '.');\\n // cerr << endl;\\n // }\\n }\\n }\\n\\n padding1();\\n\\n UF uf(H * W);\\n rep(i, H) rep(j, W) {\\n if (used[i][j]) continue;\\n rep(d, 2) {\\n int ti = i + di[d], tj = j + dj[d];\\n if (ti >= H or tj >= W or used[ti][tj]) continue;\\n uf.unite(i * W + j, ti * W + tj);\\n }\\n }\\n\\n if (used[0][0] or used[0][W - 1] or used[H - 1][0] or used[H - 1][W - 1]) {\\n cout << \\\"NO\\\" << endl;\\n return;\\n }\\n\\n if(!(uf.issame(0, W - 1) and uf.issame(0, (H - 1) * W) and uf.issame(0, H * W - 1))) {\\n cout << \\\"NO\\\" << endl;\\n return;\\n }\\n\\n // rep(i, H) {\\n // cerr << setfill('0') << right << setw(2) << i << setfill(' ') << \\\" \\\";\\n // cerr << C[i] << \\\" \\\";\\n // rep(j, W) cerr << (used[i][j] ? '#' : '.');\\n // cerr << endl;\\n // }\\n\\n vvc<int> arrived(H, vc<int>(W));\\n int ci = 0, cj = 0, cd = 0;\\n do {\\n // err(ci, cj);\\n int ld = (cd + 3) % 4;\\n int li = ci + di[ld], lj = cj + dj[ld];\\n if(cango(li, lj)) {\\n ci = li, cj = lj, cd = ld;\\n arrived[ci][cj] = true, used[ci][cj] = true;\\n continue;\\n }\\n int fd = cd;\\n int fi = ci + di[fd], fj = cj + dj[fd];\\n if(cango(fi, fj)) {\\n ci = fi, cj = fj, cd = fd;\\n arrived[ci][cj] = true, used[ci][cj] = true;\\n continue;\\n }\\n\\n int rd = (cd + 1) % 4;\\n int ri = ci + di[rd], rj = cj + dj[rd];\\n if(cango(ri, rj)) {\\n ci = ri, cj = rj, cd = rd;\\n arrived[ci][cj] = true, used[ci][cj] = true;\\n continue;\\n }\\n\\n cout << \\\"NO\\\" << endl;\\n return;\\n } while (!(ci == 0 and cj == 0));\\n\\n if(arrived[0][0] and arrived[0][W - 1] and arrived[H - 1][0] and arrived[H - 1][W - 1]) {\\n cout << \\\"YES\\\" << endl;\\n }else{\\n cout << \\\"NO\\\" << endl;\\n }\\n}\\n\\nint main() {\\n while(true){\\n int H, W;\\n cin >> H >> W;\\n if (H == 0) break;\\n solve(H, W);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 760,\n \"memory_kb\": 3512,\n \"score_of_the_acc\": -0.9362,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1622_6027761\",\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()\\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;\\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-9;\\n//const int mod = 1e9 + 7;\\nconst int mod = 998244353;\\n\\nstruct Dinic{\\n\\tstruct edge{\\n\\t\\tll to, cap, rev;\\n\\t};\\n\\tvector<vector<edge>> G;\\n\\tvector<int> level, itr;\\n\\tll n;\\n\\tconst ll INF = 1<<30;\\n \\n\\tDinic(ll n) : n(n){\\n\\t\\tG.resize(n);\\n\\t\\tlevel.resize(n);\\n\\t\\titr.resize(n);\\n\\t}\\n \\n\\tvoid add_edge(ll from, ll to, ll cap){\\n\\t\\tG[from].push_back({to,cap,(ll)G[to].size()});\\n\\t\\tG[to].push_back({from,0,(ll)G[from].size()-1});\\n\\t}\\n \\n\\tvoid bfs(int s){\\n\\t\\tfill(level.begin(), level.end(), -1);\\n\\t\\tqueue<int> q;\\n\\t\\tlevel[s] = 0;\\n\\t\\tq.push(s);\\n\\t\\twhile(!q.empty()){\\n\\t\\t\\tint u = q.front(); q.pop();\\n\\t\\t\\tfor(auto &e : G[u]){\\n\\t\\t\\t\\tif(e.cap > 0 && level[e.to] < 0){\\n\\t\\t\\t\\t\\tlevel[e.to] = level[u] + 1;\\n\\t\\t\\t\\t\\tq.push(e.to);\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\n\\tll dfs(int u, int t, ll f){\\n\\t\\tif(u == t) return f;\\n\\t\\tfor(int &i = itr[u]; i < G[u].size(); i++){\\n\\t\\t\\tedge &e = G[u][i];\\n\\t\\t\\tif(e.cap > 0 && level[u] < level[e.to]){\\n\\t\\t\\t\\tll d = dfs(e.to, t, min(f, e.cap));\\n\\t\\t\\t\\tif(d > 0){\\n\\t\\t\\t\\t\\te.cap -= d;\\n\\t\\t\\t\\t\\tG[e.to][e.rev].cap += d;\\n\\t\\t\\t\\t\\treturn d;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\treturn 0;\\n\\t}\\n \\n\\tll max_flow(ll s, ll t){\\n\\t\\tll flow = 0;\\n\\t\\twhile(1){\\n\\t\\t\\tbfs(s);\\n\\t\\t\\tif(level[t] < 0) return flow;\\n\\t\\t\\tfill(itr.begin(), itr.end(), 0);\\n\\t\\t\\tll f;\\n\\t\\t\\twhile((f = dfs(s, t, INF)) > 0){\\n\\t\\t\\t\\tflow += f;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n};\\n\\nbool in(ll y, ll x, ll h, ll w){\\n\\treturn 0 <= y && y < h && 0 <= x && x < w;\\n}\\n\\nint main(){\\n\\twhile(1){\\n\\t\\tint n,m; cin >> n >> m;\\n\\t\\tif(!n) break; \\n\\t\\tvs s(n); rep(i,n) cin >> s[i];\\n\\t\\tDinic a(n*m*2),b(n*m*2);\\n\\t\\tint sa = 0, sb = (n-1)*m, ta = n*m*2-1, tb = m-1+n*m;\\n\\t\\trep(i,n) rep(j,m){\\n\\t\\t\\tif(s[i][j] == '#') continue;\\n\\t\\t\\trep(k,4){\\n\\t\\t\\t\\tint ny = i + dy[k];\\n\\t\\t\\t\\tint nx = j + dx[k];\\n\\t\\t\\t\\tif(!in(ny,nx,n,m) || s[ny][nx] == '#') continue;\\n\\t\\t\\t\\ta.add_edge(i*m+j+n*m,ny*m+nx,1);\\n\\t\\t\\t\\tb.add_edge(i*m+j+n*m,ny*m+nx,1);\\n\\t\\t\\t}\\n\\t\\t\\tint u = i*m+j, v = i*m+j+n*m;\\n\\t\\t\\tif(i==0&&j==0||i==0&&j==m-1||i==n-1&&j==0||i==n-1&&j==m-1){\\n\\t\\t\\t\\ta.add_edge(u,v,2);\\n\\t\\t\\t\\tb.add_edge(u,v,2);\\n\\t\\t\\t}else{\\n\\t\\t\\t\\ta.add_edge(u,v,1);\\n\\t\\t\\t\\tb.add_edge(u,v,1);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif(a.max_flow(sa,ta) >= 2 && b.max_flow(sb,tb) >= 2){\\n\\t\\t\\tcout << \\\"YES\\\\n\\\";\\n\\t\\t}else{\\n\\t\\t\\tcout << \\\"NO\\\\n\\\";\\n\\t\\t}\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 5588,\n \"score_of_the_acc\": -0.4778,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1622_6025942\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <utility>\\n#include <string>\\n#include <vector>\\n#include <set>\\n#include <stack>\\n#include <queue>\\n#include <map>\\n#include <math.h>\\n#include <string.h>\\n#include <iomanip>\\n#include <numeric>\\n#include <cstdlib>\\n#include <cstdint>\\n#include <cmath>\\n#include <functional>\\n#include <limits>\\n#include <cassert>\\n#include <bitset>\\n#include <chrono>\\n#include <random>\\n#include <memory>\\n \\n/* macro */\\n \\n#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)\\n#define rrep(i, a, n) for (int i = ((int)(n-1)); i >= (int)(a); i--)\\n#define Rep(i, a, n) for (i64 i = (i64)(a); i< (i64)(n); i++)\\n#define RRep(i, a, n) for (i64 i = ((i64)(n-i64(1))); i>=(i64)(a); i--)\\n#define all(v) (v).begin(),(v).end()\\n#define rall(v) (v).rbegin(),(v).rend()\\n#define Bit(n) (1LL<<(n))\\n \\n/* macro end */\\n \\n/* template */\\n \\nnamespace ebi {\\n \\n#ifdef LOCAL\\n#define debug(...) \\\\\\n std::cerr << \\\"LINE: \\\" << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"]:\\\", \\\\\\n debug_out(__VA_ARGS__)\\n#else\\n#define debug(...)\\n#endif\\n \\nvoid debug_out() { std::cerr << std::endl; }\\n \\ntemplate <typename Head, typename... Tail>\\nvoid debug_out(Head h, Tail... t) {\\n std::cerr << \\\" \\\" << h;\\n if (sizeof...(t) > 0) std::cout << \\\" :\\\";\\n debug_out(t...);\\n}\\n \\ntemplate <typename T1, typename T2>\\nstd::ostream& operator<<(std::ostream& os, std::pair<T1, T2> pa) {\\n return os << pa.first << \\\" \\\" << pa.second;\\n}\\n \\ntemplate <typename T>\\nstd::ostream& operator<<(std::ostream& os, std::vector<T> vec) {\\n for (std::size_t i = 0; i < vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\" \\\");\\n return os;\\n}\\n \\nusing size_t = std::size_t;\\nusing i64 = std::int64_t;\\nusing u64 = std::uint64_t;\\nusing ld = long double;\\n \\ntemplate<class T> void fill(std::vector<T> &v) { for(T &e: v) std::cin >> e; }\\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 \\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>\\nT gcd(T a, T b){\\n if( b==0 ) return a;\\n else return gcd(b, a%b);\\n}\\n \\ntemplate <class T>\\nT lcm(T a, T b) {\\n a /= gcd(a, b);\\n return a*b;\\n}\\n \\ntemplate<class T>\\nT Pow(T x, i64 n) {\\n T res = 1;\\n while(n>0){\\n if(n&1) res = res *x;\\n x = x*x;\\n n>>=1;\\n }\\n return res;\\n}\\n \\ntemplate<class T>\\nT scan() {\\n T val;\\n std::cin >> val;\\n return val;\\n}\\n \\nconstexpr i64 LNF = std::numeric_limits<i64>::max()/4;\\n \\nconstexpr int INF = std::numeric_limits<int>::max();\\n \\nconst std::vector<int> dy = {1,0,-1,0,1,1,-1,-1};\\nconst std::vector<int> dx = {0,1,0,-1,1,-1,1,-1};\\n \\n}\\n \\n/* template end */\\n\\nnamespace ebi {\\n\\nvoid main_() {\\n int n,m;\\n while(std::cin >> n >> m, !(n == 0 && m == 0)) {\\n std::vector<std::string> c(n);\\n rep(i,0,n) {\\n std::cin >> c[i];\\n }\\n std::vector seen(n, std::vector<int>(m, -1));\\n int by = -1, bx = -1;\\n auto dfs = [&](auto &&self, int y, int x) -> void {\\n seen[y][x] = 1;\\n rep(i,0,4) {\\n int ny = y + dy[i];\\n int nx = x + dx[i];\\n if(0 <= ny && ny < n && 0 <= nx && nx < m && (!(ny == by && nx == bx)) && seen[ny][nx] < 0 && c[ny][nx] != '#') {\\n self(self, ny, nx);\\n }\\n }\\n };\\n int flag = true;\\n rep(i,0,n) {\\n rep(j,0,m) {\\n by = i;\\n bx = j;\\n if((by == 0 && bx == 0) || (by == 0 && bx == m-1) || (by == n-1 && bx == m-1) || (by == n-1 && bx == 0)) {\\n continue;\\n }\\n seen = std::vector(n, std::vector<int>(m, -1));\\n dfs(dfs, 0, 0);\\n if(seen[0][0] > 0 && seen[0][m-1] > 0 && seen[n-1][0] > 0 && seen[n-1][m-1] > 0) {\\n flag &= true;\\n }\\n else {\\n flag = false;\\n }\\n }\\n }\\n if(flag) {\\n std::cout << \\\"YES\\\\n\\\";\\n } \\n else {\\n std::cout << \\\"NO\\\\n\\\";\\n }\\n }\\n}\\n\\n}\\n \\nint main() {\\n std::cout << std::fixed << std::setprecision(15);\\n std::cin.tie(nullptr);\\n std::ios::sync_with_stdio(false);\\n int t = 1;\\n // std::cin >> t;\\n while(t--) {\\n ebi::main_();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 830,\n \"memory_kb\": 3564,\n \"score_of_the_acc\": -1.0314,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1622_6021393\",\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-34;\\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<long double, long double> pd;\\ntypedef pair<ll, string> pls;\\ntypedef pair<string, ll> psl;\\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\\n\\nll H, W;\\nstring S[100] = {};\\nvoid Search(bool gone[51][51], bool gone2[51][51], ll h, ll w) {\\n\\n\\tgone[h][w] = true;\\n\\tll offset[4][2] = { {0,-1}, {1,0},{0,1},{-1,0} };\\n\\tlp(i, 4) {\\n\\t\\tll next_h = h + offset[i][0];\\n\\t\\tll next_w = w + offset[i][1];\\n\\t\\tif (next_h < 0 || H <= next_h)continue;\\n\\t\\tif (next_w < 0 || W <= next_w)continue;\\n\\t\\tif (gone[next_h][next_w])continue;\\n\\t\\tif (S[next_h][next_w] == '#')continue;\\n\\t\\tSearch(gone, gone2, next_h, next_w);\\n\\t}\\n\\n}\\n\\n\\nint main() {\\n\\twhile (true) {\\n\\t\\tcin >> H>> W;\\n\\t\\tif (H == 0)break;\\n\\n\\t\\tlp(i, 100)S[i].clear();\\n\\t\\tlp(i, H)cin >> S[i];\\n\\t\\tstring ans = \\\"YES\\\";\\n\\t\\tlp(i, H) {\\n\\t\\t\\tlp(j, W) {\\n\\t\\t\\t\\tbool gone[51][51] = {};\\n\\t\\t\\t\\tbool gone2[51][51] = {};\\n\\t\\t\\t\\tif (i == 0 && j == 0)continue;\\n\\t\\t\\t\\tif (i == 0 && j == W-1)continue;\\n\\t\\t\\t\\tif (i == H-1 && j == 0)continue;\\n\\t\\t\\t\\tif (i == H-1 && j == W-1)continue;\\n\\t\\t\\t\\tif (S[i][j] == '#')continue;\\n\\t\\t\\t\\tS[i][j] = '#';\\n\\t\\t\\t\\tSearch(gone, gone2, 0, 0);\\n\\t\\t\\t\\tif ((!gone[0][0]) || (!gone[H - 1][0]) || (!gone[0][W - 1]) || (!gone[H - 1][W - 1]))ans = \\\"NO\\\";\\n\\t\\t\\t\\tS[i][j] = '.';\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tbool gone[51][51] = {};\\n\\t\\tbool gone2[51][51] = {};\\n\\t\\tSearch(gone, gone2, 0, 0);\\n\\t\\tif ((!gone[0][0]) || (!gone[H - 1][0]) || (!gone[0][W - 1]) || (!gone[H - 1][W - 1]))ans = \\\"NO\\\";\\n\\t\\tcout << ans << endl;\\n\\t}\\n\\n\\t//cout << fixed << setprecision(12) << bb << endl;\\n\\treturn 0;\\n}\\n\\n/*\\n10\\n10 9 8 7 6 5 4 3 2 1\\n\\n*/\",\n \"accuracy\": 1,\n \"time_ms\": 500,\n \"memory_kb\": 3684,\n \"score_of_the_acc\": -0.6588,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1622_6012765\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\ntypedef long long ll;\\ntypedef pair<ll, ll> P;\\n#define fi first\\n#define se second\\n#define N 214514\\n#define all(x) (x).begin(), (x).end()\\n// const ll mod = 1000000007;\\nconst ll mod = 998244353;\\nconst ll inf = 1000000000000000000;\\nll n, m;\\nchar c[55][55];\\nll dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};\\nbool func() {\\n ll cnt = 0;\\n vector<vector<bool>> used(n, vector<bool>(m));\\n queue<P> que;\\n que.push({0, 0});\\n used[0][0] = 1;\\n while (!que.empty()) {\\n P p = que.front();\\n que.pop();\\n if ((p.fi == 0 || p.fi == n - 1) && (p.se == 0 || p.se == m - 1)) cnt++;\\n for (int k = 0; k < 4; k++) {\\n ll ny = p.fi + dy[k], nx = p.se + dx[k];\\n if (!(0 <= ny && ny < n && 0 <= nx && nx < m)) continue;\\n if (used[ny][nx]) continue;\\n if (c[ny][nx] == '#') continue;\\n used[ny][nx] = 1;\\n que.push({ny, nx});\\n }\\n }\\n return (cnt == 4);\\n}\\nvoid solve() {\\n cin >> n >> m;\\n if (!n) exit(0);\\n for (int i = 0; i < n; i++)\\n for (int j = 0; j < m; j++) cin >> c[i][j];\\n bool ok = func();\\n for (int i = 0; i < n; i++) {\\n for (int j = 0; j < m; j++) {\\n if ((i == 0 || i == n - 1) && (j == 0 || j == m - 1)) continue;\\n if (c[i][j] == '.') {\\n c[i][j] = '#';\\n if (!func()) ok = 0;\\n c[i][j] = '.';\\n }\\n }\\n }\\n cout << (ok ? \\\"YES\\\\n\\\" : \\\"NO\\\\n\\\");\\n}\\n\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n ll t = 1;\\n // cin >> t;\\n while (1) solve();\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 650,\n \"memory_kb\": 3356,\n \"score_of_the_acc\": -0.7711,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1622_5975059\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"Ofast\\\")\\n#include <bits/stdc++.h>\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define cinf(n,x) for(int i=0;i<(n);i++)cin>>x[i];\\n#define ft first\\n#define sc second\\n#define pb push_back\\n#define lb lower_bound\\n#define ub upper_bound\\n#define all(v) (v).begin(),(v).end()\\n#define LB(a,x) lb(all(a),x)-a.begin()\\n#define UB(a,x) ub(all(a),x)-a.begin()\\n#define mod 1000000007\\n//#define mod 998244353\\n#define FS fixed<<setprecision(15)\\nusing namespace std;\\ntypedef long long ll;\\nconst double pi=3.141592653589793;\\ntemplate<class T> using V=vector<T>;\\nusing P=pair<ll,ll>;\\ntypedef unsigned long long ull;\\ntypedef long double ldouble;\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }\\ntemplate<class T> inline void out(T a){ cout << a << '\\\\n'; }\\nvoid YN(bool ok){if(ok) cout << \\\"Yes\\\" << endl; else cout << \\\"No\\\" << endl;}\\n//void YN(bool ok){if(ok) cout << \\\"YES\\\" << endl; else cout << \\\"NO\\\" << endl;}\\n\\n\\nconst ll INF=1e18;\\nconst int mx=200005;\\n\\nint seen[55][55];\\n\\nint check(int i,int j,int n,int m){\\n return 0<=i&&i<n&&0<=j&&j<m;\\n}\\n\\nint main(){\\n //オーバーフローは大丈夫ですか？？\\n cin.tie(0);ios::sync_with_stdio(false);\\n while(true){\\n int n,m;\\n cin>>n>>m;\\n if(n==0&&m==0) break;\\n V<string> s(n);\\n cinf(n,s);\\n int ok=1;\\n rep(I,n){\\n rep(J,m){\\n if(I==0&&J==0) continue;\\n if(I==0&&J==m-1) continue;\\n if(I==n-1&&J==0) continue;\\n if(I==n-1&&J==m-1) continue;\\n rep(i,n)rep(j,m)seen[i][j]=0;\\n //seen[0][0]=1;\\n V<int> dx={-1,1,0,0};\\n V<int> dy={0,0,1,-1};\\n function<void(int,int)> dfs=[&](int i,int j){\\n seen[i][j]=1;\\n rep(k,4){\\n int x=i+dx[k];\\n int y=j+dy[k];\\n if(!check(x,y,n,m)||(x==I&&y==J)) continue;\\n if(s[x][y]!='#'&&!seen[x][y])dfs(x,y);\\n }\\n };\\n dfs(0,0);\\n int f=0;\\n if(!seen[n-1][0]) f=1;\\n if(!seen[n-1][m-1]) f=1;\\n if(!seen[0][m-1]) f=1;\\n if(f) ok=0;\\n }\\n }\\n if(ok) out(\\\"YES\\\");\\n else out(\\\"NO\\\");\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 840,\n \"memory_kb\": 3636,\n \"score_of_the_acc\": -1.0584,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1622_5974338\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\ntemplate <typename Cap, bool directed> struct Dinic {\\n Dinic(int n) : n(n), G(n), level(n), iter(n) {}\\n\\n int add_edge(int from, int to, Cap cap) {\\n assert(0 <= from && from < n);\\n assert(0 <= to && to < n);\\n assert(0 <= cap);\\n assert(from != to);\\n int m = pos.size(), from_id = G[from].size(), to_id = G[to].size();\\n pos.emplace_back(from, G[from].size());\\n G[from].emplace_back(to, cap, to_id);\\n G[to].emplace_back(from, directed ? 0 : cap, from_id);\\n return m;\\n }\\n\\n int add_vertex() {\\n G.emplace_back();\\n level.emplace_back();\\n iter.emplace_back();\\n return n++;\\n }\\n\\n std::tuple<int, int, Cap, Cap> get_edge(int i) {\\n assert(0 <= i && i < (int)pos.size());\\n auto e = G[pos[i].first][pos[i].second];\\n auto re = G[e.to][e.rev];\\n return {pos[i].first, e.to, e.cap + re.cap, re.cap};\\n }\\n\\n std::vector<std::tuple<int, int, Cap, Cap>> edges() {\\n std::vector<std::tuple<int, int, Cap, Cap>> res;\\n for (size_t i = 0; i < pos.size(); i++) res.emplace_back(get_edge(i));\\n return res;\\n }\\n\\n void change_edge(int i, Cap new_cap, Cap new_flow) {\\n assert(0 <= i && i < (int)pos.size());\\n assert(0 <= new_flow && new_flow <= new_cap);\\n auto& e = G[pos[i].first][pos[i].second];\\n auto& re = G[e.to][e.rev];\\n e.cap = new_cap - new_flow;\\n re.cap = (directed ? new_flow : new_cap + new_flow);\\n }\\n\\n Cap max_flow(int s, int t) { return max_flow(s, t, std::numeric_limits<Cap>::max()); }\\n\\n Cap max_flow(int s, int t, Cap flow_limit) {\\n assert(0 <= s && s < n);\\n assert(0 <= t && t < n);\\n if (s == t) return 0;\\n Cap flow = 0;\\n while (flow < flow_limit) {\\n bfs(s, t);\\n if (level[t] < 0) break;\\n std::fill(iter.begin(), iter.end(), 0);\\n while (flow < flow_limit) {\\n Cap f = dfs(s, t, flow_limit - flow);\\n if (f == 0) break;\\n flow += f;\\n }\\n }\\n return flow;\\n }\\n\\n std::vector<bool> min_cut(int s) {\\n assert(0 <= s && s < n);\\n std::vector<bool> visited(n);\\n std::queue<int> que;\\n visited[s] = true;\\n que.emplace(s);\\n while (!que.empty()) {\\n int v = que.front();\\n que.pop();\\n for (const auto& e : G[v]) {\\n if (e.cap && !visited[e.to]) {\\n visited[e.to] = true;\\n que.emplace(e.to);\\n }\\n }\\n }\\n return visited;\\n }\\n\\nprivate:\\n struct edge {\\n int to;\\n Cap cap;\\n int rev;\\n edge(int to, Cap cap, int rev) : to(to), cap(cap), rev(rev) {}\\n };\\n\\n int n;\\n std::vector<std::vector<edge>> G;\\n std::vector<std::pair<int, int>> pos;\\n std::vector<int> level, iter;\\n\\n void bfs(int s, int t) {\\n std::fill(level.begin(), level.end(), -1);\\n std::queue<int> que;\\n level[s] = 0;\\n que.emplace(s);\\n while (!que.empty()) {\\n int v = que.front();\\n que.pop();\\n for (const auto& e : G[v]) {\\n if (e.cap > 0 && level[e.to] < 0) {\\n level[e.to] = level[v] + 1;\\n if (e.to == t) return;\\n que.emplace(e.to);\\n }\\n }\\n }\\n }\\n\\n Cap dfs(int v, int t, Cap f) {\\n if (v == t) return f;\\n for (int& i = iter[v]; i < (int)G[v].size(); i++) {\\n auto& e = G[v][i];\\n if (e.cap <= 0 || level[v] >= level[e.to]) continue;\\n Cap d = dfs(e.to, t, min(f, e.cap));\\n if (d <= 0) continue;\\n e.cap -= d;\\n G[e.to][e.rev].cap += d;\\n return d;\\n }\\n return 0;\\n }\\n};\\n\\n/**\\n * @brief Dinic (Maximum flow)\\n * @docs docs/flow/Dinic.md\\n */\\n\\nconst int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};\\n\\nvoid solve(int N, int M) {\\n vector<string> S(N);\\n for (auto& s : S) cin >> s;\\n\\n Dinic<int, true> D(N * M * 2);\\n auto IN = [&](int x, int y) { return x * M + y; };\\n auto OUT = [&](int x, int y) { return IN(x, y) + N * M; };\\n for (int i = 0; i < N; i++) {\\n for (int j = 0; j < M; j++) {\\n if (S[i][j] == '#') continue;\\n D.add_edge(IN(i, j), OUT(i, j), 1);\\n for (int k = 0; k < 4; k++) {\\n int ni = i + dx[k], nj = j + dy[k];\\n if (ni < 0 or N <= ni or nj < 0 or M <= nj) continue;\\n if (S[ni][nj] == '#') continue;\\n D.add_edge(OUT(i, j), IN(ni, nj), 1);\\n }\\n }\\n }\\n\\n auto D2 = D;\\n int a = D.max_flow(OUT(0, 0), IN(N - 1, M - 1), 2), b = D2.max_flow(OUT(N - 1, 0), IN(0, M - 1), 2);\\n cout << (a == 2 and b == 2 ? \\\"YES\\\" : \\\"NO\\\") << '\\\\n';\\n}\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int N, M;\\n while (cin >> N >> M, N) solve(N, M);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4536,\n \"score_of_the_acc\": -0.2462,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1622_5974336\",\n \"code_snippet\": \"#define LOCAL\\n#include <bits/stdc++.h>\\nusing namespace std;\\n#pragma region Macros\\ntypedef long long ll;\\ntypedef __int128_t i128;\\ntypedef unsigned int uint;\\ntypedef unsigned long long ull;\\n#define ALL(x) (x).begin(), (x).end()\\n\\ntemplate <typename T> istream& operator>>(istream& is, vector<T>& v) {\\n for (T& x : v) is >> x;\\n return is;\\n}\\ntemplate <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {\\n for (int i = 0; i < (int)v.size(); i++) {\\n os << v[i] << (i + 1 == (int)v.size() ? \\\"\\\" : \\\" \\\");\\n }\\n return os;\\n}\\ntemplate <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {\\n os << '(' << p.first << ',' << p.second << ')';\\n return os;\\n}\\ntemplate <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {\\n os << '{';\\n for (auto itr = m.begin(); itr != m.end();) {\\n os << '(' << itr->first << ',' << itr->second << ')';\\n if (++itr != m.end()) os << ',';\\n }\\n os << '}';\\n return os;\\n}\\ntemplate <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {\\n os << '{';\\n for (auto itr = m.begin(); itr != m.end();) {\\n os << '(' << itr->first << ',' << itr->second << ')';\\n if (++itr != m.end()) os << ',';\\n }\\n os << '}';\\n return os;\\n}\\ntemplate <typename T> ostream& operator<<(ostream& os, const set<T>& s) {\\n os << '{';\\n for (auto itr = s.begin(); itr != s.end();) {\\n os << *itr;\\n if (++itr != s.end()) os << ',';\\n }\\n os << '}';\\n return os;\\n}\\ntemplate <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {\\n os << '{';\\n for (auto itr = s.begin(); itr != s.end();) {\\n os << *itr;\\n if (++itr != s.end()) os << ',';\\n }\\n os << '}';\\n return os;\\n}\\ntemplate <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {\\n os << '{';\\n for (auto itr = s.begin(); itr != s.end();) {\\n os << *itr;\\n if (++itr != s.end()) os << ',';\\n }\\n os << '}';\\n return os;\\n}\\ntemplate <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {\\n for (int i = 0; i < (int)v.size(); i++) {\\n os << v[i] << (i + 1 == (int)v.size() ? \\\"\\\" : \\\" \\\");\\n }\\n return os;\\n}\\n\\ntemplate <int i, typename T> void print_tuple(ostream&, const T&) {}\\ntemplate <int i, typename T, typename H, class... Args> void print_tuple(ostream& os, const T& t) {\\n if (i) os << ',';\\n os << get<i>(t);\\n print_tuple<i + 1, T, Args...>(os, t);\\n}\\ntemplate <typename... Args> ostream& operator<<(ostream& os, const tuple<Args...>& t) {\\n os << '{';\\n print_tuple<0, tuple<Args...>, Args...>(os, t);\\n return os << '}';\\n}\\n\\nvoid debug_out() { cerr << '\\\\n'; }\\ntemplate <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {\\n cerr << head;\\n if (sizeof...(Tail) > 0) cerr << \\\", \\\";\\n debug_out(move(tail)...);\\n}\\n#ifdef LOCAL\\n#define debug(...) \\\\\\n cerr << \\\" \\\"; \\\\\\n cerr << #__VA_ARGS__ << \\\" :[\\\" << __LINE__ << \\\":\\\" << __FUNCTION__ << \\\"]\\\" << '\\\\n'; \\\\\\n cerr << \\\" \\\"; \\\\\\n debug_out(__VA_ARGS__)\\n#else\\n#define debug(...) 42\\n#endif\\n\\ntemplate <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }\\ntemplate <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }\\n\\nint topbit(signed t) { return t == 0 ? -1 : 31 - __builtin_clz(t); }\\nint topbit(long long t) { return t == 0 ? -1 : 63 - __builtin_clzll(t); }\\nint botbit(signed a) { return a == 0 ? 32 : __builtin_ctz(a); }\\nint botbit(long long a) { return a == 0 ? 64 : __builtin_ctzll(a); }\\nint popcount(signed t) { return __builtin_popcount(t); }\\nint popcount(long long t) { return __builtin_popcountll(t); }\\nbool ispow2(int i) { return i && (i & -i) == i; }\\n\\ntemplate <class T> T ceil(T x, T y) {\\n assert(y >= 1);\\n return (x > 0 ? (x + y - 1) / y : x / y);\\n}\\ntemplate <class T> T floor(T x, T y) {\\n assert(y >= 1);\\n return (x > 0 ? x / y : (x - y + 1) / y);\\n}\\n\\ntemplate <class T1, class T2> inline bool chmin(T1& a, T2 b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <class T1, class T2> inline bool chmax(T1& a, T2 b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n#pragma endregion\\n\\n#include <cassert>\\n#include <limits>\\n#include <queue>\\n#include <vector>\\n\\ntemplate <typename Cap, bool directed> struct Dinic {\\n Dinic(int n) : n(n), G(n), level(n), iter(n) {}\\n\\n int add_edge(int from, int to, Cap cap) {\\n assert(0 <= from && from < n);\\n assert(0 <= to && to < n);\\n assert(0 <= cap);\\n assert(from != to);\\n int m = pos.size(), from_id = G[from].size(), to_id = G[to].size();\\n pos.emplace_back(from, G[from].size());\\n G[from].emplace_back(to, cap, to_id);\\n G[to].emplace_back(from, directed ? 0 : cap, from_id);\\n return m;\\n }\\n\\n int add_vertex() {\\n G.emplace_back();\\n level.emplace_back();\\n iter.emplace_back();\\n return n++;\\n }\\n\\n std::tuple<int, int, Cap, Cap> get_edge(int i) {\\n assert(0 <= i && i < (int)pos.size());\\n auto e = G[pos[i].first][pos[i].second];\\n auto re = G[e.to][e.rev];\\n return {pos[i].first, e.to, e.cap + re.cap, re.cap};\\n }\\n\\n std::vector<std::tuple<int, int, Cap, Cap>> edges() {\\n std::vector<std::tuple<int, int, Cap, Cap>> res;\\n for (size_t i = 0; i < pos.size(); i++) res.emplace_back(get_edge(i));\\n return res;\\n }\\n\\n void change_edge(int i, Cap new_cap, Cap new_flow) {\\n assert(0 <= i && i < (int)pos.size());\\n assert(0 <= new_flow && new_flow <= new_cap);\\n auto& e = G[pos[i].first][pos[i].second];\\n auto& re = G[e.to][e.rev];\\n e.cap = new_cap - new_flow;\\n re.cap = (directed ? new_flow : new_cap + new_flow);\\n }\\n\\n Cap max_flow(int s, int t) { return max_flow(s, t, std::numeric_limits<Cap>::max()); }\\n\\n Cap max_flow(int s, int t, Cap flow_limit) {\\n assert(0 <= s && s < n);\\n assert(0 <= t && t < n);\\n if (s == t) return 0;\\n Cap flow = 0;\\n while (flow < flow_limit) {\\n bfs(s, t);\\n if (level[t] < 0) break;\\n std::fill(iter.begin(), iter.end(), 0);\\n while (flow < flow_limit) {\\n Cap f = dfs(s, t, flow_limit - flow);\\n if (f == 0) break;\\n flow += f;\\n }\\n }\\n return flow;\\n }\\n\\n std::vector<bool> min_cut(int s) {\\n assert(0 <= s && s < n);\\n std::vector<bool> visited(n);\\n std::queue<int> que;\\n visited[s] = true;\\n que.emplace(s);\\n while (!que.empty()) {\\n int v = que.front();\\n que.pop();\\n for (const auto& e : G[v]) {\\n if (e.cap && !visited[e.to]) {\\n visited[e.to] = true;\\n que.emplace(e.to);\\n }\\n }\\n }\\n return visited;\\n }\\n\\nprivate:\\n struct edge {\\n int to;\\n Cap cap;\\n int rev;\\n edge(int to, Cap cap, int rev) : to(to), cap(cap), rev(rev) {}\\n };\\n\\n int n;\\n std::vector<std::vector<edge>> G;\\n std::vector<std::pair<int, int>> pos;\\n std::vector<int> level, iter;\\n\\n void bfs(int s, int t) {\\n std::fill(level.begin(), level.end(), -1);\\n std::queue<int> que;\\n level[s] = 0;\\n que.emplace(s);\\n while (!que.empty()) {\\n int v = que.front();\\n que.pop();\\n for (const auto& e : G[v]) {\\n if (e.cap > 0 && level[e.to] < 0) {\\n level[e.to] = level[v] + 1;\\n if (e.to == t) return;\\n que.emplace(e.to);\\n }\\n }\\n }\\n }\\n\\n Cap dfs(int v, int t, Cap f) {\\n if (v == t) return f;\\n for (int& i = iter[v]; i < (int)G[v].size(); i++) {\\n auto& e = G[v][i];\\n if (e.cap <= 0 || level[v] >= level[e.to]) continue;\\n Cap d = dfs(e.to, t, min(f, e.cap));\\n if (d <= 0) continue;\\n e.cap -= d;\\n G[e.to][e.rev].cap += d;\\n return d;\\n }\\n return 0;\\n }\\n};\\n\\n/**\\n * @brief Dinic (Maximum flow)\\n * @docs docs/flow/Dinic.md\\n */\\n\\nconst int INF = 1e9;\\nconst long long IINF = 1e18;\\nconst int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};\\nconst char dir[4] = {'D', 'R', 'U', 'L'};\\nconst long long MOD = 1000000007;\\n// const long long MOD = 998244353;\\n\\nvoid solve(int N, int M) {\\n vector<string> S(N);\\n for (auto& s : S) cin >> s;\\n\\n Dinic<int, true> D(N * M * 2);\\n auto IN = [&](int x, int y) { return x * M + y; };\\n auto OUT = [&](int x, int y) { return IN(x, y) + N * M; };\\n for (int i = 0; i < N; i++) {\\n for (int j = 0; j < M; j++) {\\n if (S[i][j] == '#') continue;\\n D.add_edge(IN(i, j), OUT(i, j), 1);\\n for (int k = 0; k < 4; k++) {\\n int ni = i + dx[k], nj = j + dy[k];\\n if (ni < 0 or N <= ni or nj < 0 or M <= nj) continue;\\n if (S[ni][nj] == '#') continue;\\n D.add_edge(OUT(i, j), IN(ni, nj), 1);\\n }\\n }\\n }\\n\\n auto D2 = D;\\n int a = D.max_flow(OUT(0, 0), IN(N - 1, M - 1), 2), b = D2.max_flow(OUT(N - 1, 0), IN(0, M - 1), 2);\\n cout << (a == 2 and b == 2 ? \\\"YES\\\" : \\\"NO\\\") << '\\\\n';\\n}\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int N, M;\\n while (cin >> N >> M, N) solve(N, M);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4632,\n \"score_of_the_acc\": -0.2783,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1622_5968721\",\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>\\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}\\n\\nstruct Edge{\\n int to,rev; ll cap;\\n Edge(int to,ll cap,int rev):to(to),cap(cap),rev(rev){}\\n};\\n// ここの値に注意！！\\nconst int N=5200;\\nconst ll INF=1e9;\\nvector<Edge> g[N];\\nint level[N]; \\nint iter[N];\\nvoid add_edge(int s,int t,ll c){\\n g[s].push_back(Edge(t,c,g[t].size()));\\n g[t].push_back(Edge(s,0,g[s].size()-1));\\n}\\nvoid bfs(int s){\\n memset(level,-1,sizeof(level));\\n queue<int> q;\\n level[s]=0;\\n q.push(s);\\n while(q.size()){\\n int v=q.front(); q.pop();\\n for(auto &e:g[v]){\\n if(e.cap>0&&level[e.to]<0){\\n level[e.to]=level[v]+1;\\n q.push(e.to);\\n }\\n }\\n }\\n}\\nll dfs(int v,int t,ll f){\\n if(v==t)return f;\\n for(int &i=iter[v];i<g[v].size();i++){\\n Edge &e=g[v][i];\\n if(e.cap>0&&level[v]<level[e.to]){\\n int d=dfs(e.to,t,min(f,e.cap));\\n if(d>0){\\n e.cap-=d;\\n g[e.to][e.rev].cap+=d;\\n return d;\\n }\\n }\\n }\\n return 0;\\n}\\nll max_flow(int s,int t){\\n ll flow=0;\\n while(1){\\n bfs(s);\\n if(level[t]<0)return flow;\\n memset(iter,0,sizeof(iter));\\n int f;\\n while((f=dfs(s,t,INF))>0){\\n flow+=f;\\n }\\n }\\n}\\n\\nint main(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n int h,w;\\n while(cin >> h >> w,h){\\n vector<string> s(h);\\n for(int i=0;i<h;i++){\\n cin >> s[i];\\n }\\n int S = 2*h*w;\\n int t[3]={w-1,(h-1)*w,h*w-1};\\n int T = 2*h*w+1;\\n bool ok = true;\\n for(int _=0;_<3;_++){\\n for(int i=0;i<=T;i++){\\n g[i].clear();\\n }\\n add_edge(S,0,2);\\n for(int i=0;i<h;i++){\\n for(int j=0;j<w;j++){\\n if(s[i][j] == '.'){\\n if(i+1<h and s[i+1][j] == '.'){\\n add_edge(i*w+j+h*w,(i+1)*w+j,1);\\n add_edge((i+1)*w+j+h*w, i*w+j, 1);\\n }\\n if(j+1<w and s[i][j+1] == '.'){\\n add_edge(i*w+j+h*w,i*w+j+1,1);\\n add_edge(i*w+j+1+h*w, i*w+j, 1);\\n }\\n }\\n if(i+j == 0 or i*w+j == t[_]){\\n add_edge(i*w+j, i*w+j+w*h, 2);\\n }\\n else{\\n add_edge(i*w+j, i*w+j+w*h, 1);\\n }\\n }\\n }\\n add_edge(t[_]+h*w, T, 2);\\n if(max_flow(S, T)<2){\\n ok = false;\\n }\\n }\\n if(ok){\\n cout << \\\"YES\\\" << \\\"\\\\n\\\";\\n }\\n else{\\n cout << \\\"NO\\\" << \\\"\\\\n\\\";\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 4252,\n \"score_of_the_acc\": -0.187,\n \"final_rank\": 3\n }\n]","isConversational":false}}},{"rowIdx":993,"cells":{"group_id":{"kind":"string","value":"aoj_1619_cpp"},"problem_description":{"kind":"string","value":"Making Lunch Boxes\nTaro has been hooked on making lunch boxes recently.\nTaro has obtained a new lunch box recipe book today, and wants to try as many of the recipes listed in the book as possible.\nEnough of the ingredients for all the recipes are at hand, but they all are in vacuum packs of two.\nIf only one of them is used leaving the other, the leftover will be rotten easily, but making two of the same recipe is not interesting.\nThus he decided to make a set of lunch boxes, each with different recipe, that wouldn't leave any unused ingredients.\nNote that the book may include recipes for different lunch boxes made of the same set of ingredients.\nHow many lunch box recipes can Taro try today at most following his dogma?\nInput\nThe input consists of at most 50 datasets, each in the following format.\nn\nm\nb\n1,1\n...\nb\n1,\nm\n...\nb\nn,\n1\n...\nb\nn,m\nThe first line contains\nn\n, which is the number of recipes listed in the book, and\nm\n, which is the number of ingredients.\nBoth\nn\nand\nm\nare positive integers and satisfy 1 ≤\nn\n≤ 500, 1 ≤\nm\n≤ 500 and\n1 ≤\nn\n×\nm\n≤ 500\n.\nThe following\nn\nlines contain the information for each recipe with the string of length\nm\nconsisting of 0 or 1.\nb\ni,j\nimplies whether the\ni\n-th recipe needs the\nj\n-th ingredient.\n1 means the ingredient is needed for the recipe and 0 means not.\nEach line contains at least one 1.\nThe end of the input is indicated by a line containing two zeros.\nOutput\nFor each dataset, output the maximum number of recipes Taro can try.\nSample Input\n4 3\n110\n101\n011\n110\n7 1\n1\n1\n1\n1\n1\n1\n1\n4 5\n10000\n01000\n00100\n00010\n6 6\n111111\n011000\n100000\n000010\n100001\n100100\n0 0\nOutput for the Sample Input\n3\n6\n0\n6"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1619_10849110","code_snippet":"#include<cstdio>\n#include<iostream>\n#include<map>\n#include<vector>\n#include<string>\n#include<algorithm>\n\nusing namespace std;\n\nstring xx(string a, string b)\n{\n for(int i = 0; i < a.size(); i++)\n a[i] = (a[i]-'0')^(b[i]-'0')+'0';\n return a;\n}\n\nint main()\n{\n int n, m;\n while(cin >> n >> m && n != 0)\n {\n map<string, int> _m;\n vector<string> v(n);\n for(int i = 0; i < n; i++)\n cin >> v[i];\n for(int i = 0; i < v.size(); i++)\n {\n map<string, int> ma = _m;\n map<string, int>::iterator it = _m.begin();\n while(it != _m.end())\n {\n string tmp = xx(v[i], it->first);\n if(ma.count(tmp))\n {\n ma[tmp] = max(it->second + 1, ma[tmp]);\n }\n else\n ma[tmp] = it->second + 1;\n it++;\n }\n _m = ma;\n if(!_m.count(v[i]))\n _m[v[i]] = 1;\n }\n //for(map<string, int>::iterator it = ma.begin(); it != ma.end(); it++)\n string zero;\n for(int i = 0; i < m; i++)\n zero.push_back('0');\n if(_m.count(zero))\n {\n cout << _m[zero] << endl;\n }\n else\n cout << 0 << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":3790,"memory_kb":232696,"score_of_the_acc":-1.4561,"final_rank":16},{"submission_id":"aoj_1619_10717133","code_snippet":"#include<bits/stdc++.h>\n//#include<atcoder/all>\nusing namespace std;\n//using namespace atcoder;\n\nusing ll = long long;\nusing ld = long double;\n\n//using mint = modint998244353;\n//using mint = modint1000000007;\n\ntemplate<class T> using pq = priority_queue<T>; //大きい順\ntemplate<class T> using pq_g = priority_queue<T, vector<T>, greater<T>>; //小さい順\n\n#define vec_unique(v) v.erase(unique(v.begin(), v.end()), v.end()) //重複削除\n#define vec_iota(v) iota(v.begin(), v.end(), 0) //0, 1, 2, 3, ..., n - 1にセット\n\nint dx[4] = {1, -1, 0, 0};\nint dy[4] = {0, 0, 1, -1};\n//int dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};\n//int dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};\n\n#define INF 2e18\n#define INF2 2e9\n\nint main() {\n while(true) {\n int n, m;\n cin >> n >> m;\n if(n == 0 && m == 0) {\n break;\n }\n\n vector<vector<char>> b(n, vector<char>(m));\n for(int i = 0; i < n; i++) {\n for(int j = 0; j < m; j++) {\n cin >> b[i][j];\n }\n }\n\n if(n <= m) {\n int ans = 0;\n for(int i = 0; i < (1 << n); i++) {\n vector<int> ing(m);\n int cnt = 0;\n for(int j = 0; j < n; j++) {\n if(i & (1 << j)) {\n cnt++;\n for(int k = 0; k < m; k++) {\n if(b[j][k] == '1') {\n ing[k]++;\n }\n }\n }\n }\n bool flag = true;\n for(int k = 0; k < m; k++) {\n if(ing[k] % 2 == 1) {\n flag = false;\n }\n }\n\n if(flag) {\n ans = max(ans, cnt);\n }\n }\n\n cout << ans << endl;\n } else {\n vector<int> w(n);\n for(int i = 0; i < n; i++) {\n int d = 1;\n for(int j = m - 1; j >= 0; j--) {\n if(b[i][j] == '1') w[i] += d;\n d *= 2;\n }\n }\n\n vector<vector<int>> dp(n + 1, vector<int>((1 << m), -1));\n dp[0][0] = 0;\n for(int i = 0; i < n; i++) {\n for(int j = 0; j < (1 << m); j++) {\n dp[i + 1][j] = dp[i][j];\n }\n for(int j = 0; j < (1 << m); j++) {\n if(dp[i][j] != -1) dp[i + 1][j ^ w[i]] = max(dp[i + 1][j ^ w[i]], dp[i][j] + 1);\n }\n }\n\n cout << dp[n][0] << endl;\n }\n }\n //cout << fixed << setprecision(15) << << endl;\n return 0;\n}","accuracy":1,"time_ms":7190,"memory_kb":208672,"score_of_the_acc":-1.8288,"final_rank":20},{"submission_id":"aoj_1619_10713609","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint n,m;\nmap<string,int>Table;\n\nchar now[505];\n\nstruct node\n{\n string s;\n int x;\n\n //node(string s,int x):s(s),x(x){}\n};\n\nqueue<node>q;\n\nvoid dp()\n{\n map<string,int>Temp;\n map<string,int>::iterator it;\n\n for (it=Table.begin();it!=Table.end();it++)\n {\n string old=it->first;\n string New=\"\";\n for (int i=0;i<m;i++)\n if (now[i]==old[i]) New+=\"0\";else New+=\"1\";\n\n if (!Table.count(New))\n {\n node t;\n t.s=New;t.x=it->second+1;\n q.push(t);\n }\n else if (Table[New]<it->second+1)\n {\n Temp[New]=max(Temp[New],it->second+1);\n //cout<<old<<\" \"<<New<<\" \"<<Table[New]<<endl;\n }\n }\n\n while (!q.empty())\n {\n node temp=q.front();q.pop();\n Table[temp.s]=max(Table[temp.s],temp.x);\n //cout<<temp.s<<\" \"<<temp.x<<endl;\n }\n\n for (it=Temp.begin();it!=Temp.end();it++)\n {\n string s=it->first;\n Table[s]=Temp[s];\n }\n}\n\nint main()\n{\n //ios_base::sync_with_stdio(false);\n //cin.tie(NULL); cout.tie(NULL);\n while (cin>>n>>m)\n {\n if (n==0 && m==0) break;\n\n string init=\"\";\n for (int i=0;i<m;i++) init+=\"0\";\n Table.clear();\n Table[init]=0;\n\n for (int i=0;i<n;i++)\n {\n //cin>>now;\n scanf(\"%s\",now);\n dp();\n }\n\n printf(\"%d\\n\",Table[init]);\n }\n return 0;\n}","accuracy":1,"time_ms":5030,"memory_kb":120196,"score_of_the_acc":-1.1537,"final_rank":14},{"submission_id":"aoj_1619_10713590","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint rp[505][505],n,m;\nmap<string,int>Table;\nstring now;\n\nstruct node\n{\n string s;\n int x;\n\n //node(string s,int x):s(s),x(x){}\n};\n\nvoid dp()\n{\n queue<node>q;\n map<string,int>Temp;\n\n map<string,int>::iterator it;\n for (it=Table.begin();it!=Table.end();it++)\n {\n string old=it->first;\n string New=\"\";\n for (int i=0;i<m;i++)\n if (now[i]==old[i]) New+=\"0\";else New+=\"1\";\n\n if (!Table.count(New))\n {\n node t;\n t.s=New;t.x=it->second+1;\n q.push(t);\n }\n else if (Table[New]<it->second+1)\n {\n Temp[New]=max(Temp[New],it->second+1);\n //cout<<old<<\" \"<<New<<\" \"<<Table[New]<<endl;\n }\n }\n\n while (!q.empty())\n {\n node temp=q.front();q.pop();\n Table[temp.s]=max(Table[temp.s],temp.x);\n //cout<<temp.s<<\" \"<<temp.x<<endl;\n }\n\n for (it=Temp.begin();it!=Temp.end();it++)\n {\n string s=it->first;\n Table[s]=Temp[s];\n }\n}\n\nint main()\n{\n //std::ios::sync_with_stdio(false);\n while (cin>>n>>m)\n {\n if (n==0 && m==0) break;\n\n string init=\"\";\n for (int i=0;i<m;i++) init+=\"0\";\n Table.clear();\n Table[init]=0;\n\n for (int i=0;i<n;i++)\n {\n cin>>now;\n dp();\n }\n\n cout<<Table[init]<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":4960,"memory_kb":120120,"score_of_the_acc":-1.1436,"final_rank":13},{"submission_id":"aoj_1619_10713579","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint rp[505][505],n,m;\nmap<string,int>Table;\n\nstruct node\n{\n string s;\n int x;\n\n node(string s,int x):s(s),x(x){}\n};\n\nvoid dp(string now)\n{\n queue<node>q;\n map<string,int>Temp;\n for (map<string,int>::iterator it=Table.begin();it!=Table.end();it++)\n {\n string old=it->first;\n string New=\"\";\n for (int i=0;i<m;i++)\n if (now[i]==old[i]) New+=\"0\";else New+=\"1\";\n\n if (!Table.count(New))\n {\n q.push(node(New,Table[old]+1));\n }\n else if (Table[New]<Table[old]+1)\n {\n Temp[New]=max(Temp[New],Table[old]+1);\n //cout<<old<<\" \"<<New<<\" \"<<Table[New]<<endl;\n }\n }\n\n while (!q.empty())\n {\n node temp=q.front();q.pop();\n Table[temp.s]=max(Table[temp.s],temp.x);\n //cout<<temp.s<<\" \"<<temp.x<<endl;\n }\n\n for (map<string,int>::iterator it=Temp.begin();it!=Temp.end();it++)\n {\n string s=it->first;\n Table[s]=Temp[s];\n }\n}\n\nint main()\n{\n std::ios::sync_with_stdio(false);\n while (cin>>n>>m)\n {\n if (n==0 && m==0) break;\n\n string init=\"\";\n for (int i=0;i<m;i++) init+=\"0\";\n Table.clear();\n Table[init]=0;\n\n for (int i=0;i<n;i++)\n {\n string s;\n cin>>s;\n dp(s);\n }\n\n cout<<Table[init]<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":6180,"memory_kb":120204,"score_of_the_acc":-1.3141,"final_rank":15},{"submission_id":"aoj_1619_10713574","code_snippet":"#include <bits/stdc++.h>\n\nusing namespace std;\n\nint rp[505][505],n,m;\nmap<string,int>Table;\n\nstruct node\n{\n string s;\n int x;\n\n node(string s,int x):s(s),x(x){}\n};\n\nvoid dp(string now)\n{\n queue<node>q;\n for (map<string,int>::iterator it=Table.begin();it!=Table.end();it++)\n {\n string old=it->first;\n string New=\"\";\n for (int i=0;i<m;i++)\n if (now[i]==old[i]) New+=\"0\";else New+=\"1\";\n\n if (!Table.count(New))\n {\n q.push(node(New,Table[old]+1));\n }\n else if (Table[New]<Table[old]+1)\n {\n q.push(node(New,Table[old]+1));\n //cout<<old<<\" \"<<New<<\" \"<<Table[New]<<endl;\n }\n }\n\n while (!q.empty())\n {\n node temp=q.front();q.pop();\n Table[temp.s]=temp.x;\n //cout<<temp.s<<\" \"<<temp.x<<endl;\n\n }\n}\n\nint main()\n{\n std::ios::sync_with_stdio(false);\n while (cin>>n>>m)\n {\n if (n==0 && m==0) break;\n\n string init=\"\";\n for (int i=0;i<m;i++) init+=\"0\";\n Table.clear();\n Table[init]=0;\n\n for (int i=0;i<n;i++)\n {\n string s;\n cin>>s;\n dp(s);\n }\n\n cout<<Table[init]<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":4530,"memory_kb":119508,"score_of_the_acc":-1.0811,"final_rank":12},{"submission_id":"aoj_1619_10713567","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint n, m;\nchar b[505][505];\nint dp[1<<24], tmp[1<<24];\nint tb[505];\n\nbool input() {\n cin >> n >> m;\n if (!n && !m) return 0;\n for (int i = 0 ; i < n ; i++ ) {\n cin >> b[i];\n }\n return 1;\n}\n\nvoid solve() {\n int res = 0;\n memset(dp, -1, sizeof(dp));\n if ( n > m ) {\n memset(dp,-1,sizeof(dp));\n dp[0]=0;\n \n for (int i=0; i<n; i++){\n char *pEnd;\n int bb=strtol(b[i],&pEnd,2);\n for (int S=(1<<m)-1; S>=0; S--){\n if (dp[S^bb]!=-1)tmp[S] = dp[S^bb]+1;\n else tmp[S]=-1;\n }\n for (int S=(1<<m)-1; S>=0; S--){\n dp[S] = max(dp[S],tmp[S]);\n }\n res = dp[0];\n }\n } else { // n <= m\n for (int i = 1 ; i < (1<<n) ; i++ ) {\n int val = 0, cnt = 0;\n memset(tb, 0, sizeof(tb));\n for (int j = 0 ; j < n ; j++ ) {\n if ( i & (1 << j) ) {\n for ( int k = 0 ; k < m ; k++ ) {\n tb[k] ^= (b[j][k] - '0');\n }\n cnt++;\n }\n }\n bool flag = true;\n for ( int k = 0 ; k < m ;k++ ) {\n if ( tb[k] ) {\n flag = false;\n break;\n }\n }\n if ( flag ) {\n res = max(res, cnt);\n }\n }\n }\n cout << res << endl;\n}\n\nint main(){\n while(input()) {\n solve();\n }\n}","accuracy":1,"time_ms":5220,"memory_kb":79388,"score_of_the_acc":-1.0078,"final_rank":10},{"submission_id":"aoj_1619_10713520","code_snippet":"#include<cstdio>\n#include<algorithm>\n#include<vector>\n#include<queue>\n#include<map>\n#include<cstring>\nusing namespace std;\n\nconst int N = 500;\n\nint a[N + 2][N + 2], n, m, st[(1 << 22) + 2], st2[(1 << 22) + 2], sum[N + 2], val[N + 2];\n\nint main()\n{\n\tfor (; scanf(\"%d%d\", &n, &m) && (n || m); )\n\t{\n\t\tfor (int i = 0; i < n; i++)\n\t\t\tfor (int j = 0; j < m; j++)\n\t\t\t{\n\t\t\t\tscanf(\"%1d\", &a[i][j]);\n\t\t\t}\n\t\tint ans = 0;\n\t\tif (n <= 22)\n\t\t{\n\t\t\tfor (int k = 1; k < 1 << n; k++)\n\t\t\t{\n\t\t\t\tfor (int i = 0; i < m; i++)\n\t\t\t\t\tsum[i] = 0;\n\t\t\t\tint cnt = 0;\n\t\t\t\tfor (int l = 0; l < n; l++)\n\t\t\t\t\tif (k >> l & 1)\n\t\t\t\t\t{\n\t\t\t\t\t\tcnt++;\n\t\t\t\t\t\tfor (int i = 0; i < m; i++)\n\t\t\t\t\t\t\tsum[i] ^= a[l][i];\n\t\t\t\t\t}\n\t\t\t\tint ok = 1;\n\t\t\t\tfor (int i = 0; i < m; i++)\n\t\t\t\t\tif (sum[i])\n\t\t\t\t\t\tok = 0;\n\t\t\t\tif (ok)\n\t\t\t\t\tans = max(ans, cnt);\n\t\t\t}\n\t\t}\n\t\telse\n\t\t{\n\t\t\tfor (int i = 0; i < 1 << m; i++)\n\t\t\t\tst[i] = st2[i] = 0;\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t{\n\t\t\t\tval[i] = 0;\n\t\t\t\tfor (int j = 0; j < m; j++)\n\t\t\t\t{\n\t\t\t\t\tval[i] = 2 * val[i] + a[i][j];\n\t\t\t\t}\n\t\t\t}\n\t\t\tfor (int i = 0; i < n; i++)\n\t\t\t{\n\t\t\t\tif (st[val[i]] > 0)\n\t\t\t\t\tans = max(ans, st[val[i]] + 1);\n\t\t\t\tfor (int j = 0; j < 1 << m; j++)\n\t\t\t\t\tst2[j^val[i]] = st[j] > 0 ? st[j] + 1 : 0;\n\t\t\t\tst2[val[i]] = max(st2[val[i]], 1);\n\t\t\t\tfor (int j = 0; j < 1 << m; j++)\n\t\t\t\t\tst[j] = max(st[j], st2[j]);\n\t\t\t}\n\t\t}\n\t\tprintf(\"%d\\n\", ans);\n\t}\n}\n\n/*\n\n\n*/","accuracy":1,"time_ms":5310,"memory_kb":24384,"score_of_the_acc":-0.7879,"final_rank":8},{"submission_id":"aoj_1619_10702739","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nmap < unsigned long long , int > dp[505];\nbitset < 505 > a[505];\nint n,m;\nchar s[505];\nhash < bitset < 505 > > H;\n\nint dfs( int pos, bitset < 505 > s ){\n\tif ( pos == n ){\n\t\tif ( s.count() == 0 ) return 0;\n\t\telse return -1e9;\n\t}\n\t\n\thash < bitset < 505 > > H;\n\tif ( dp[pos].find(H(s)) != dp[pos].end() ) return dp[pos][H(s)];\n\tint ans = dfs(pos+1,s);\n\tans = max( ans, dfs(pos+1, s ^ a[pos]) + 1);\n\treturn dp[pos][H(s)] = ans;\n}\n\nint main(){\n\t\n\twhile ( scanf(\"%d%d\",&n,&m) == 2 && n + m > 0 ){\n\t\tfor ( int i = 0; i < n; i++ ){\n\t\t\ta[i].reset();\n\t\t\tscanf(\"%s\",&s);\n\t\t\tint len = strlen(s);\n\t\t\tfor ( int j = 0; j < m; j++ ){\n\t\t\t\tif ( s[j] == '0' ) continue;\n\t\t\t\ta[i].set(j);\n\t\t\t}\n\t\t\tdp[i].clear();\n\t\t}\n\t\t\n\t\tbitset < 505 > bs;\n\t\tprintf(\"%d\\n\",dfs(0,bs));\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":6480,"memory_kb":153228,"score_of_the_acc":-1.4955,"final_rank":17},{"submission_id":"aoj_1619_10685335","code_snippet":"#include <bits/stdc++.h>\n#include <atcoder/all>\nusing namespace std;\nusing namespace atcoder;\n\nusing ll = long long;\nconst int MOD = 1000000007;\nconst int Mod = 998244353;\nconst int MAX = 1000000005;\nconst long long INF = 1000000000000000005LL;\n#define rep(i, n) for (int i = 0; i < (n); i++)\n#define rep2(i, a, b) for (int i = (a); i < (b); i++)\n#define rrep(i, n) for (int i = (n) - 1; i >= 0; i--)\n#define all(x) (x).begin(),(x).end()\ntemplate<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }\n\nbool solve() {\n int n, m;\n cin >> n >> m;\n if (n == 0 && m == 0) return false;\n vector<string> b(n);\n for (int i = 0; i < n; i++) cin >> b[i];\n int ans = 0;\n if (n <= 22) {\n vector<int> s(m);\n for (int bit = 0; bit < (1 << n); bit++) {\n for (int i = 0; i < n; i++) {\n if (bit & (1 << i)) {\n for (int j = 0; j < m; j++) s[j] ^= (int)(b[i][j] - '0');\n }\n }\n bool ok = true;\n for (int i = 0; i < m; i++) {\n if (s[i]) {\n ok = false;\n s[i] = 0;\n }\n }\n if (ok) ans = max(ans, __builtin_popcount(bit));\n }\n } else {\n vector<vector<int>> dp(n+1, vector<int>(1 << m, -1));\n dp[0][0] = 0;\n for (int i = 0; i < n; i++) {\n int binary = 0;\n for (int j = 0; j < m; j++) binary += (int)(b[i][j] - '0') * (1 << j);\n for (int bit = 0; bit < (1 << m); bit++) {\n dp[i+1][bit] = max(dp[i+1][bit], dp[i][bit]);\n if (dp[i][bit] != -1) {\n int nxtbit = bit ^ binary;\n dp[i+1][nxtbit] = max(dp[i+1][nxtbit], dp[i][bit] + 1);\n }\n }\n }\n ans = dp[n][0];\n }\n cout << ans << endl;\n return true;\n}\n\nint main() {\n while (solve()) {}\n}","accuracy":1,"time_ms":6350,"memory_kb":208976,"score_of_the_acc":-1.7129,"final_rank":19},{"submission_id":"aoj_1619_10668271","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nbool solve(){\n int n,m;cin>>n>>m;\n if(n==0)return 0;\n vector<string>b(n);\n for(auto &x:b)cin>>x;\n\n int ans=0;\n if(n<m){\n for(int s=0;s<(1<<n);s++){\n vector<int>c(m);\n int pc=0;\n for(int i=0;i<n;i++){\n if(s>>i&1){\n pc++;\n for(int j=0;j<m;j++)c[j]^=(b[i][j]-'0');\n }\n }\n bool ng=false;\n for(int j=0;j<m;j++)if(c[j])ng=true;\n if(!ng)ans=max(ans,pc);\n }\n }else{\n vector<int>dp(1<<m,-1e6);\n dp[0]=0;\n //使用材料xorがsのときのmax\n vector<int>c(n);\n for(int i=0;i<n;i++){\n for(int j=0;j<m;j++)c[i]=c[i]*2+int(b[i][j]-'0');\n }\n for(int i=0;i<n;i++){\n vector<int>old(1<<m,-1e6);\n swap(old,dp);\n for(int s=0;s<(1<<m);s++){\n dp[s]=max(dp[s],old[s]);\n dp[s^c[i]]=max(dp[s^c[i]],old[s]+1);\n }\n } \n ans=dp[0];\n }\n cout<<ans<<endl;\n return 1;\n}\nint main(){\n while(solve());\n return 0;\n}","accuracy":1,"time_ms":2960,"memory_kb":36356,"score_of_the_acc":-0.5108,"final_rank":3},{"submission_id":"aoj_1619_10668267","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nbool solve(){\n int n,m;cin>>n>>m;\n if(n==0)return 0;\n vector<string>b(n);\n for(auto &x:b)cin>>x;\n\n int ans=0;\n if(n<m){\n for(int s=0;s<(1<<n);s++){\n vector<int>c(m);\n int pc=0;\n for(int i=0;i<n;i++){\n if(s>>i&1){\n pc++;\n for(int j=0;j<m;j++)c[j]^=(b[i][j]-'0');\n }\n }\n bool ng=false;\n for(int j=0;j<m;j++)if(c[j])ng=true;\n if(!ng)ans=max(ans,pc);\n }\n }else{\n vector<int>dp(1<<m,-1e6);\n dp[0]=0;\n //使用材料xorがsのときのmax\n vector<int>c(n);\n for(int i=0;i<n;i++){\n for(int j=0;j<m;j++)c[i]=c[i]*2+int(b[i][j]-'0');\n }\n for(int i=0;i<n;i++){\n vector<int>old(1<<m,-1e6);\n swap(old,dp);\n for(int s=0;s<(1<<m);s++){\n dp[s]=max(dp[s],old[s]);\n dp[s^c[i]]=max(dp[s^c[i]],old[s]+1);\n }\n } \n ans=dp[0];\n }\n cout<<ans<<endl;\n return 1;\n}\nint main(){\n while(solve());\n\n return 0;\n}","accuracy":1,"time_ms":2960,"memory_kb":36412,"score_of_the_acc":-0.511,"final_rank":4},{"submission_id":"aoj_1619_10658718","code_snippet":"#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\nusing namespace std;\n\n// 数値型\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\nusing P = pair<int,int>;\nusing Pll = pair<ll, ll>;\nusing Pli = pair<ll, int>;\nusing Pil = pair<int, ll>;\n\n// vector関連\nusing vi = vector<int>;\nusing vvi = vector<vi>;\nusing vvvi = vector<vvi>;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\ntemplate<typename T>\nusing vc = vector<T>;\ntemplate<typename T>\nusing vvc = vector<vc<T>>;\ntemplate<typename T>\nusing vvvc = vector<vvc<T>>;\ntemplate<typename T>\nusing vvvvc = vector<vvvc<T>>;\n\n// priority_queue\ntemplate<typename T>\nusing pq = priority_queue<T>;\ntemplate<typename T>\nusing pqg = priority_queue<T, vc<T>, greater<T>>;\n\n#define rep(i, n) for(int i = 0; i < (int)(n); i++)\n#define FOR(i, a, b) for(int i = a; i < (int)(b); i++)\n#define all(a) (a).begin(),(a).end()\n#define rall(a) (a).rbegin(),(a).rend()\n#define MIN(vec) *min_element(vec)\n#define MAX(vec) *max_element(vec)\n#define next_perm(vec) (vec).begin(), (vec).end()\n#define UNIQUE(vec) vec.erase(unique(vec.begin(), vec.end()), vec.end())\n#define el \"\\n\"\n#define Yes cout << \"Yes\" << el\n#define No cout << \"No\" << el\n#define YES cout << \"YES\" << el\n#define NO cout << \"NO\" << el\n#define EPS 1e-8\n#define Equal(a, b) (fabs((a)-(b)) < EPS) \n#define dbg(x) cerr << #x << \"=\" << x << el \n\n// 定数\nconst string abc = \"abcdefghijklmnopqrstuvwxyz\";\nconst string ABC = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconstexpr int INF = 1001001001;\nconstexpr ll LINF = 1001001001001001001ll;\nconstexpr int DX[] = {1, 0, -1, 0};\nconstexpr int DY[] = {0, 1, 0, -1};\nconstexpr int DX8[] = {1, 0, -1, 0, 1, 1, -1, -1};\nconstexpr int DY8[] = {0, 1, 0, -1, 1, -1, 1, -1};\n\ntemplate<typename T1, typename T2>\nostream &operator<< (ostream &os, pair<T1, T2> p) {\n os << \"{\" << p.first << \",\" << p.second << \"}\";\n return os;\n}\ntemplate<typename T>\nostream &operator<< (ostream &os, vc<T> &vec) {\n int sz = vec.size();\n rep(i, sz){\n os << vec[i] << (i==sz-1?\"\":\" \");\n }\n return os;\n}\n\ntemplate<typename T1, typename T2>\nistream &operator>> (istream &is, pair<T1, T2> &p) {\n is >> p.first >> p.second;\n return is;\n}\ntemplate<typename T>\nistream &operator>> (istream &is, vc<T> &vec) {\n int sz = vec.size();\n rep(i, sz) { is >> vec[i]; }\n return is;\n}\n/// @brief aとｂの最大値をaに格納。更新があったかbool値を返す\n/// @tparam T1 \n/// @tparam T2 \n/// @param a \n/// @param b \n/// @return bool\ntemplate<typename T1, typename T2>\ninline bool chmax(T1 &a, T2 b){\n bool ret = a<b;\n if(ret) a = b;\n return ret;\n}\n\n/// @brief aとｂの最小値をaに格納。更新があったかbool値を返す\n/// @tparam T1 \n/// @tparam T2 \n/// @param a \n/// @param b \n/// @return bool\ntemplate<typename T1, typename T2>\ninline bool chmin(T1 &a, T2 b){\n bool ret = a>b;\n if(ret) {a = b;}\n return ret;\n}\n\ninline void YesNo(bool flag){\n if(flag) {Yes;}\n else {No;}\n return;\n}\n\ninline void YESNO(bool flag){\n if(flag) {YES;}\n else {NO;}\n return;\n}\n\ninline bool outof(ll x, ll xlim){\n return (x<0 || x>=xlim);\n}\n\ntemplate<typename T>\ninline T sqnorm(T x, T y){\n return x*x+y*y;\n}\n\n/// @brief char->int\n/// @param c \n/// @return int\ninline int ctoi(char c){\n return c-'0';\n}\n\n/// @brief xを素因数分解\n/// @param x \n/// @return vector<Pli>, 素因数の昇順に {p, cnt}\nvector<Pli> prime_fact(ll x){\n vector<Pli> ret;\n for(ll i=2; i*i<=x; i++){\n if(x%i == 0){\n ret.emplace_back(i, 0);\n while(x%i == 0){\n ret.back().second++;\n x /= i;\n }\n }\n }\n if(x != 1) ret.emplace_back(x, 1);\n return ret;\n}\n\n/// @brief xの約数列挙\n/// @param x \n/// @return vll, 約数の昇順\nvll divisor_enum(ll x){\n vector<ll> ret;\n for(ll i=1; i*i<=x; i++){\n if(x%i == 0){\n ret.push_back(x/i);\n ret.push_back(i);\n }\n }\n sort(all(ret));\n UNIQUE(ret);\n return ret;\n}\n\n/// @brief 繰り返し二乗法。\n/// @tparam T \n/// @param x \n/// @param k \n/// @param op \n/// @param e \n/// @return \ntemplate<typename T>\nT pow_t(T x, ll k, T (*op)(T, T), T (*e)()){\n T ret = e();\n while(k){\n if(k&1) ret *= x;\n x *= x;\n k >>= 1;\n }\n return ret;\n}\n\nll powll(ll x, ll k){\n return pow_t<ll>(x, k, [](ll a, ll b) -> ll{return a*b;}, []() -> ll{return 1;});\n}\n\ninline int pop_cnt(ll x) { return __builtin_popcountll(x); }\ninline int top_bit(ll x) { return (x==0?-1:63-__builtin_clzll(x));}\n\nvoid main2();\n\nint main(){\n ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n main2();\n}\n\nbool solve2(int n, int m){\n if(n == 0) return false;\n vc<string> b(n);\n rep(i, n) cin >> b[i];\n vc<bitset<500>> b2(n, bitset<500>(0));\n rep(i, n){\n rep(j, m){\n if(b[i][j] == '1') b2[i].set(j, 1);\n } \n }\n int ans = 0;\n rep(S, 1<<n){\n bitset<500> bs(0);\n int cnt = pop_cnt(S);\n if(cnt <= ans) continue; \n rep(j, n){\n if(S>>j&1) bs ^= b2[j];\n }\n if(bs.count() == 0) ans = cnt;\n }\n cout << ans << el;\n return true;\n}\nbool solve3(int n, int m){\n vc<string> b(n);\n rep(i, n) cin >> b[i];\n vi dp(1<<m, -INF);\n vi dp2(1<<m, -INF);\n dp[0] = 0;\n rep(i, n){\n int mask = 0;\n rep(j, m) if(b[i][j] == '1') mask |= 1<<j;\n rep(S, 1<<m){\n dp2[S] = max(dp[S], dp[S^mask]+1); \n }\n swap(dp, dp2);\n }\n cout << dp[0] << el;\n return true;\n}\nbool solve(){\n int n, m;\n cin >> n >> m;\n if(n == 0) return false;\n if(n < m){\n return solve2(n, m);\n }\n else{\n return solve3(n, m);\n }\n}\n\nvoid main2(){\n while(solve()){\n ;\n }\n}","accuracy":1,"time_ms":710,"memory_kb":36212,"score_of_the_acc":-0.1964,"final_rank":2},{"submission_id":"aoj_1619_10632212","code_snippet":"#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n\n// #ifndef ONLINE_JUDGE\n// #define _GLIBCXX_DEBUG // 配列外参照のエラー\n// #endif\n\n// スタンダードライブラリ\n#include <bits/stdc++.h>\nusing namespace std;\n\n// 型関連\nusing ll = long long;\nusing lint = long long;\nusing pll = pair<ll, ll>;\nusing plll = tuple<ll, ll, ll>;\nusing pii = pair<int, int>;\nusing piii = tuple<ll, ll, ll>;\ntemplate <class T> using prique = priority_queue<T>;\n\n// 型定数\nconstexpr ll mod = 998244353;\nconstexpr ll MOD = 1000000007;\nint INF32 = 2e9;\nll INF64 = 9e18;\n#define endl '\\n';\n\nint dx[4] = {1, 0, -1, 0};\nint dy[4] = {0, 1, 0, -1};\n\n/////////////////////////// print関連\ntemplate <typename T> void print(vector<T> A);\nvoid print();\ntemplate <class Head, class... Tail> void print(Head &&head, Tail &&...tail);\nvoid print(string S);\ntemplate <typename T> void print(vector<vector<T>> &F);\n\ninline void Yes(bool f);\n\n///////////////////ここから//////////////////////\nbool solve() {\n int N, M;\n cin >> N >> M;\n if (N == 0) {\n return false;\n }\n vector<string> SS;\n vector<int> B(N);\n for (int i = 0; i < N; i++) {\n string S;\n cin >> S;\n SS.push_back(S);\n int val = 0;\n for (int j = 0; j < M; j++) {\n if (S[j] == '1') {\n val += (1 << j);\n }\n }\n B[i] = val;\n }\n if (N <= 22) {\n int ans = 0;\n for (int S = 0; S < (1 << N); S++) {\n int cnt = 0;\n vector<int> V(M);\n for (int i = 0; i < N; i++) {\n if (S & (1 << i)) {\n cnt++;\n for (int j = 0; j < M; j++) {\n if (SS[i][j] == '1') {\n V[j]=1-V[j];\n }\n }\n }\n }\n bool ok = true;\n for (int j = 0; j < M; j++) {\n if (V[j]) {\n ok = false;\n break;\n }\n }\n if (ok) {\n ans=max(ans,cnt);\n }\n }\n print(ans);\n } else {\n vector<int> dp(1 << M, -1);\n dp[0] = 0;\n for (int i = 0; i < N; i++) {\n vector<int> ndp(1 << M, -1);\n for (int S = 0; S < (1 << M); S++) {\n if (dp[S] == -1) {\n continue;\n }\n ndp[S ^ B[i]] = max(ndp[S ^ B[i]], dp[S] + 1);\n ndp[S] = max(ndp[S], dp[S]);\n }\n swap(dp,ndp);\n }\n print(dp[0]);\n }\n\n return true;\n}\n\nint main() {\n ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n while (solve())\n ;\n}\n\n////////////////////print/////////////////////////\n// 1次元ベクトルを出力する\ntemplate <typename T> void print(vector<T> A) {\n if (A.size() == 0) {\n return;\n }\n for (size_t i = 0; i < A.size() - 1; i++) {\n cout << A[i] << ' ';\n }\n cout << A[A.size() - 1] << endl;\n return;\n}\n\n// 2次元ベクトルを出力する\ntemplate <typename T> void print(vector<vector<T>> &F) {\n for (size_t i = 0; i < F.size(); i++) {\n for (size_t j = 0; j < F[i].size(); j++) {\n cout << F[i][j];\n if (j < F[i].size() - 1) {\n cout << ' ';\n }\n }\n cout << endl;\n }\n}\n\n// 空白行を出力するprint\nvoid print() { cout << endl; }\n\n// 数値・文字列を空白区切りで出力する. print(a,b)など\ntemplate <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {\n cout << head;\n if (sizeof...(tail) != 0)\n cout << \" \";\n print(forward<Tail>(tail)...);\n}\n\nvoid print(string S) { cout << S << endl; }\n\n//////////////出力関連\n\ninline void Yes(bool f) {\n if (f) {\n cout << \"Yes\" << endl;\n } else {\n cout << \"No\" << endl;\n }\n}","accuracy":1,"time_ms":4000,"memory_kb":19832,"score_of_the_acc":-0.586,"final_rank":5},{"submission_id":"aoj_1619_10630838","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define ll long long\n\nvector<int> myxor(vector<int> &a,vector<int> &b){\n assert(a.size()==b.size());\n vector<int> ans(a.size(),0);\n for(int i=0;i<(ll)a.size();i++){\n ans.at(i)=a.at(i)^b.at(i);\n }\n return ans;\n}\n\nbool solve(){\n int n,m; cin>>n>>m;\n if(n==0 && m == 0) return 0;\n\n vector<vector<int>> b(n,vector<int>(m));\n vector<ll> recipeint(n,0);\n\n for(int i=0;i<n;i++){\n for(int j=0;j<m;j++){\n char c; cin>>c;\n b[i][j] = c-'0';\n }\n }\n ll ans=0;\n if(n <= 20){\n for(int i=0;i<(1<<n);i++){\n bitset<501> bt(0);\n ll siz=0;\n for(int k=0;k<n;k++){\n if(i&(1<<k)){\n siz++;\n for(int j=0;j<m;j++){\n if(b[k][j]==1)bt.flip(j);\n }\n }\n }\n if((int)bt.count()!=0)continue;\n ans=max(ans,siz);\n }\n }\n else{\n map<vector<int>,ll> mp;\n vector<pair<vector<int>,ll>> t(0);\n for(int i=0;i<n;i++){\n t.clear();\n if(mp.count(b.at(i))==0){\n t.push_back(make_pair(b.at(i),1));\n }\n for(pair<vector<int>,ll> pp:mp){\n t.push_back(make_pair(myxor(pp.first,b.at(i)),pp.second+1));\n }\n for(int i=0;i<(ll)t.size();i++){\n if(mp.count(t.at(i).first)==0){\n mp[t.at(i).first]=t.at(i).second;\n }\n else{\n mp.at(t.at(i).first)=max(mp.at(t.at(i).first),t.at(i).second);\n }\n }\n }\n if(mp.count(vector<int>(m,0))==0){\n ans=0;\n }\n else{\n ans=mp.at(vector<int>(m,0));\n }\n }\n cout<<ans<<endl;\n return 1;\n}\n\nint main(){\n while(solve());\n}","accuracy":1,"time_ms":4070,"memory_kb":249200,"score_of_the_acc":-1.5649,"final_rank":18},{"submission_id":"aoj_1619_10630613","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#pragma GCC optimize(\"Ofast\")\n\n#define rep(i, n) for(ll i = 0; i < (n); ++i)\n#define all(A) A.begin(), A.end()\n\nbool chmin(auto &a, auto b) {return a > b ? a = b, 1 : 0;}\nbool chmax(auto &a, auto b) {return a < b ? a = b, 1 : 0;}\n\nusing ll = long long;\n\nvoid print(auto... vs) {\n ((cout << vs << ' '), ...) << endl;\n}\n\nstruct dsu {\n int n;\n vector<int> par;\n\n dsu(int n) : n(n), par(n, -1){};\n\n int find(int v) {\n if(par[v] < 0) return v;\n return par[v] = find(par[v]);\n }\n\n bool merge(int x, int y) {\n x = find(x);\n y = find(y);\n if(x == y) return false;\n if(par[x] > par[y]) swap(x, y);\n par[x] += par[y];\n par[y] = x;\n return true;\n }\n\n int size(int v) { return -par[find(v)]; }\n\n bool same(int x, int y) { return find(x) == find(y); }\n};\n\nint main() {\n while(1) {\n ll N, M; cin >> N >> M;\n if(N + M == 0) break;\n vector<string> B(N);\n rep(i, N) {\n cin >> B[i];\n }\n \n ll res = 0;\n if(N <= 26) {\n // N < 25\n using bs = bitset<500>;\n vector<bs> b(N);\n rep(i, N) {\n b[i] = 0;\n rep(j, M) {\n if(B[i][j] == '1') b[i][j] = 1;\n }\n }\n // rep(i, N) {\n // print(b[i]);\n // }\n \n for(ll bit = 0; bit < (1LL<<N); ++bit) {\n bs tmp = 0;\n rep(i, N) {\n if(bit & (1LL<<i)) {\n tmp ^= b[i];\n }\n }\n // print(bit, tmp);\n if(tmp == 0) chmax(res, __builtin_popcountll(bit));\n }\n \n \n }\n else {\n // M < 25\n vector<int> b(N);\n rep(i, N) {\n ll now = 0;\n rep(j, M) {\n now *= 2;\n now += (B[i][j] - '0');\n }\n b[i] = now;\n }\n \n vector dp(N+1, vector<int>(1LL<<M, -1));\n dp[0][0] = 0;\n rep(i, N) {\n rep(bit, 1LL<<M) {\n if(dp[i][bit] >= 0) {\n chmax(dp[i+1][bit], dp[i][bit]);\n chmax(dp[i+1][bit ^ b[i]], dp[i][bit] + 1);\n }\n }\n }\n \n // rep(i, N) {\n // rep(bit, 1LL<<M) {\n // print(i, bit, dp[i][bit]);\n // }\n // }\n res = max(dp[N][0], 0);\n }\n \n cout << res << endl;\n \n }\n \n return 0;\n}","accuracy":1,"time_ms":5800,"memory_kb":33256,"score_of_the_acc":-0.8938,"final_rank":9},{"submission_id":"aoj_1619_10630551","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nvoid solve1(int N, int M, vector<string> B) {\n vector<bitset<500>> bit(N);\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < M; j++) {\n if (B[i][j] == '1') bit[i].set(j);\n }\n }\n int ans = 0;\n for (int i = 0; i < 1 << N; i++) {\n bitset<500> b;\n for (int j = 0; j < N; j++) {\n if (i >> j & 1) b ^= bit[j];\n }\n if (b.count() == 0) {\n ans = max(ans, __builtin_popcount(i));\n }\n }\n cout << ans << '\\n';\n}\n\nvoid solve2(int N, int M, vector<string> B) {\n vector<int> dp(1 << M, -1 << 30);\n dp[0] = 0;\n for (int i = 0; i < N; i++) {\n auto ep = dp;\n int bit = 0;\n for (int j = 0; j < M; j++) {\n if (B[i][j] == '1') bit ^= 1 << j;\n }\n for (int j = 0; j < 1 << M; j++) {\n ep[j ^ bit] = max(ep[j ^ bit], dp[j] + 1);\n }\n dp = ep;\n }\n cout << dp[0] << '\\n';\n}\n\nbool solve() {\n int N, M;\n cin >> N >> M;\n if (N == 0 && M == 0) return false;\n vector<string> B(N);\n for (int i = 0; i < N; i++) cin >> B[i];\n if (N <= 23) solve1(N, M, B);\n else solve2(N, M, B);\n return true;\n}\n\nint main() {\n while (solve()) {}\n}","accuracy":1,"time_ms":4710,"memory_kb":12516,"score_of_the_acc":-0.6541,"final_rank":7},{"submission_id":"aoj_1619_10630521","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n#include <atcoder/all>\nusing namespace atcoder;\n\nusing ll = long long;\nusing mint = modint998244353;\n\nunordered_map<string, int> enumerate(vector<string> S, int M) {\n int N = S.size();\n unordered_map<string, int> ret;\n for(int s = 0; s < 1 << N; s++) {\n int cnt = 0;\n string x(M, '0');\n for(int i = 0; i < N; i++) {\n if((~s >> i) & 1) continue;\n cnt++;\n for(int j = 0; j < M; j++) {\n x[j] ^= S[i][j] - '0';\n }\n }\n ret[x] = max(ret[x], cnt);\n }\n return ret;\n}\n\nbool solve() {\n int N, M;\n cin >> N >> M;\n if(N == 0) return false;\n vector<string> S(N);\n for(int i = 0; i < N; i++) {\n cin >> S[i];\n }\n if(N <= 30) {\n vector<string> L, R;\n for(int i = 0; i < N; i++) {\n (i & 1 ? L : R).push_back(S[i]);\n }\n auto mpl = enumerate(L, M);\n auto mpr = enumerate(R, M);\n int ans = 0;\n for(auto [s, c] : mpl) {\n if(mpr.count(s)) ans = max(ans, c + mpr[s]);\n // cout << s << \" \" << c << \" \" << (mpr.count(s) ? mpr[s] : 0) << endl;\n }\n cout << ans << endl;\n }else {\n vector<int> A;\n for(auto s : S) {\n int ret = 0;\n for(char c : s) ret = 2 * ret + (c - '0');\n A.push_back(ret);\n }\n const int INF = 1 << 20;\n vector dp(N + 1, vector<int>(1 << M, -INF));\n dp[0][0] = 0;\n for(int i = 0; i < N; i++) {\n for(int j = 0; j < 1 << M; j++) {\n dp[i + 1][j] = max(dp[i + 1][j], dp[i][j]);\n dp[i + 1][j ^ A[i]] = max(dp[i + 1][j ^ A[i]], dp[i][j] + 1);\n }\n }\n cout << dp[N][0] << endl;\n }\n return true;\n}\n\nint main() {\n while(solve());\n}","accuracy":1,"time_ms":20,"memory_kb":12740,"score_of_the_acc":-0.0009,"final_rank":1},{"submission_id":"aoj_1619_10630473","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nusing ll =long long;\n\nusing BS=bitset<500>;\nvoid solve(ll H,ll W){\n vector<BS> B(H);\n for(int i=0;i<H;i++){\n string S;\n cin>>S;\n B[i]=BS(S);\n }\n unordered_map<BS,ll> M;\n M[0]=0;\n for(int i=0;i<H;i++){\n unordered_map<BS,ll> NM;\n for(auto [m,n]:M){\n NM[m]=max(NM[m],n);\n NM[m^B[i]]=max(NM[m^B[i]],n+1);\n }\n swap(NM,M);\n }\n cout<<M[0]<<endl;\n\n \n}\n\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n ll H,W;\n while(cin>>H>>W,H+W!=0)\n solve(H,W);\n}","accuracy":1,"time_ms":2990,"memory_kb":167704,"score_of_the_acc":-1.0699,"final_rank":11},{"submission_id":"aoj_1619_10604073","code_snippet":"#include <bits/stdc++.h>\n#include <unordered_map>\n#include <stdlib.h>\nusing namespace std;\n#define rep(i, a, n) for(ll i = a; i < n; i++)\n#define rrep(i, a, n) for(ll i = a; i >= n; i--)\n#define ll long long\n#define pii pair<int, int>\n#define pll pair<ll, ll>\n#define all(x) (x).begin(), (x).end()\n//constexpr ll MOD = 1000000007;\nconstexpr ll MOD = 998244353;\nconstexpr int IINF = 1001001001;\nconstexpr ll INF = 1LL<<60;\ntemplate<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}\ntemplate<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}\n\n\nll gcd(ll a, ll b){\n if(a%b == 0){\n return b;\n }else{\n return gcd(b, a%b);\n }\n}\n\nll lcm(ll a, ll b){\n return a*b / gcd(a, b);\n}\n\nll powMod(ll x, ll n) {\n if (n == 0) return 1 % MOD;\n ll val = powMod(x, n / 2);\n val *= val;\n val %= MOD;\n if (n % 2 == 1) val *= x;\n return val % MOD;\n}\n\nint main() {\n while(true){\n ll n, m; cin >> n >> m;\n if(n*m == 0) break;\n if(n < m){\n vector<vector<ll>> b(n,vector<ll>(m));\n rep(i,0,n){\n string s; cin >> s;\n rep(j,0,m) b[i][j] = s[j]-'0';\n }\n ll ans = 0;\n // rep(i,0,n){\n // rep(j,0,m) cout << b[i][j];\n // cout << endl;\n // }\n rep(bit,0,1LL<<n){\n vector<ll> num(m,0);\n rep(i,0,n){\n if(bit>>i&1){\n rep(j,0,m) num[j] ^= b[i][j];\n }\n }\n ll sum = 0;\n rep(j,0,m) sum += num[j];\n if(sum == 0){\n chmax(ans, __popcount(bit));\n // cout << \"bit:\" << bit << endl;\n }\n }\n cout << ans << endl;\n }else{\n vector<ll> b(n);\n rep(i,0,n){\n string s; cin >> s;\n ll num = 0;\n for(auto c: s){\n num *= 2;\n num += c-'0';\n }\n b[i] = num;\n }\n vector<ll> dp(1LL<<m, -INF);\n dp[0] = 0;\n rep(i,0,n){\n vector<ll> ndp(1LL << m, -INF);\n rep(j,0,1LL<<m){\n if(dp[j] == -INF) continue;\n chmax(ndp[j], dp[j]);\n chmax(ndp[j^b[i]], dp[j]+1);\n }\n swap(dp, ndp);\n }\n cout << dp[0] << endl;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":2740,"memory_kb":73064,"score_of_the_acc":-0.6352,"final_rank":6}],"string":"[\n {\n \"submission_id\": \"aoj_1619_10849110\",\n \"code_snippet\": \"#include<cstdio>\\n#include<iostream>\\n#include<map>\\n#include<vector>\\n#include<string>\\n#include<algorithm>\\n\\nusing namespace std;\\n\\nstring xx(string a, string b)\\n{\\n for(int i = 0; i < a.size(); i++)\\n a[i] = (a[i]-'0')^(b[i]-'0')+'0';\\n return a;\\n}\\n\\nint main()\\n{\\n int n, m;\\n while(cin >> n >> m && n != 0)\\n {\\n map<string, int> _m;\\n vector<string> v(n);\\n for(int i = 0; i < n; i++)\\n cin >> v[i];\\n for(int i = 0; i < v.size(); i++)\\n {\\n map<string, int> ma = _m;\\n map<string, int>::iterator it = _m.begin();\\n while(it != _m.end())\\n {\\n string tmp = xx(v[i], it->first);\\n if(ma.count(tmp))\\n {\\n ma[tmp] = max(it->second + 1, ma[tmp]);\\n }\\n else\\n ma[tmp] = it->second + 1;\\n it++;\\n }\\n _m = ma;\\n if(!_m.count(v[i]))\\n _m[v[i]] = 1;\\n }\\n //for(map<string, int>::iterator it = ma.begin(); it != ma.end(); it++)\\n string zero;\\n for(int i = 0; i < m; i++)\\n zero.push_back('0');\\n if(_m.count(zero))\\n {\\n cout << _m[zero] << endl;\\n }\\n else\\n cout << 0 << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3790,\n \"memory_kb\": 232696,\n \"score_of_the_acc\": -1.4561,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1619_10717133\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n//#include<atcoder/all>\\nusing namespace std;\\n//using namespace atcoder;\\n\\nusing ll = long long;\\nusing ld = long double;\\n\\n//using mint = modint998244353;\\n//using mint = modint1000000007;\\n\\ntemplate<class T> using pq = priority_queue<T>; //大きい順\\ntemplate<class T> using pq_g = priority_queue<T, vector<T>, greater<T>>; //小さい順\\n\\n#define vec_unique(v) v.erase(unique(v.begin(), v.end()), v.end()) //重複削除\\n#define vec_iota(v) iota(v.begin(), v.end(), 0) //0, 1, 2, 3, ..., n - 1にセット\\n\\nint dx[4] = {1, -1, 0, 0};\\nint dy[4] = {0, 0, 1, -1};\\n//int dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};\\n//int dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};\\n\\n#define INF 2e18\\n#define INF2 2e9\\n\\nint main() {\\n while(true) {\\n int n, m;\\n cin >> n >> m;\\n if(n == 0 && m == 0) {\\n break;\\n }\\n\\n vector<vector<char>> b(n, vector<char>(m));\\n for(int i = 0; i < n; i++) {\\n for(int j = 0; j < m; j++) {\\n cin >> b[i][j];\\n }\\n }\\n\\n if(n <= m) {\\n int ans = 0;\\n for(int i = 0; i < (1 << n); i++) {\\n vector<int> ing(m);\\n int cnt = 0;\\n for(int j = 0; j < n; j++) {\\n if(i & (1 << j)) {\\n cnt++;\\n for(int k = 0; k < m; k++) {\\n if(b[j][k] == '1') {\\n ing[k]++;\\n }\\n }\\n }\\n }\\n bool flag = true;\\n for(int k = 0; k < m; k++) {\\n if(ing[k] % 2 == 1) {\\n flag = false;\\n }\\n }\\n\\n if(flag) {\\n ans = max(ans, cnt);\\n }\\n }\\n\\n cout << ans << endl;\\n } else {\\n vector<int> w(n);\\n for(int i = 0; i < n; i++) {\\n int d = 1;\\n for(int j = m - 1; j >= 0; j--) {\\n if(b[i][j] == '1') w[i] += d;\\n d *= 2;\\n }\\n }\\n\\n vector<vector<int>> dp(n + 1, vector<int>((1 << m), -1));\\n dp[0][0] = 0;\\n for(int i = 0; i < n; i++) {\\n for(int j = 0; j < (1 << m); j++) {\\n dp[i + 1][j] = dp[i][j];\\n }\\n for(int j = 0; j < (1 << m); j++) {\\n if(dp[i][j] != -1) dp[i + 1][j ^ w[i]] = max(dp[i + 1][j ^ w[i]], dp[i][j] + 1);\\n }\\n }\\n\\n cout << dp[n][0] << endl;\\n }\\n }\\n //cout << fixed << setprecision(15) << << endl;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 7190,\n \"memory_kb\": 208672,\n \"score_of_the_acc\": -1.8288,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1619_10713609\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nint n,m;\\nmap<string,int>Table;\\n\\nchar now[505];\\n\\nstruct node\\n{\\n string s;\\n int x;\\n\\n //node(string s,int x):s(s),x(x){}\\n};\\n\\nqueue<node>q;\\n\\nvoid dp()\\n{\\n map<string,int>Temp;\\n map<string,int>::iterator it;\\n\\n for (it=Table.begin();it!=Table.end();it++)\\n {\\n string old=it->first;\\n string New=\\\"\\\";\\n for (int i=0;i<m;i++)\\n if (now[i]==old[i]) New+=\\\"0\\\";else New+=\\\"1\\\";\\n\\n if (!Table.count(New))\\n {\\n node t;\\n t.s=New;t.x=it->second+1;\\n q.push(t);\\n }\\n else if (Table[New]<it->second+1)\\n {\\n Temp[New]=max(Temp[New],it->second+1);\\n //cout<<old<<\\\" \\\"<<New<<\\\" \\\"<<Table[New]<<endl;\\n }\\n }\\n\\n while (!q.empty())\\n {\\n node temp=q.front();q.pop();\\n Table[temp.s]=max(Table[temp.s],temp.x);\\n //cout<<temp.s<<\\\" \\\"<<temp.x<<endl;\\n }\\n\\n for (it=Temp.begin();it!=Temp.end();it++)\\n {\\n string s=it->first;\\n Table[s]=Temp[s];\\n }\\n}\\n\\nint main()\\n{\\n //ios_base::sync_with_stdio(false);\\n //cin.tie(NULL); cout.tie(NULL);\\n while (cin>>n>>m)\\n {\\n if (n==0 && m==0) break;\\n\\n string init=\\\"\\\";\\n for (int i=0;i<m;i++) init+=\\\"0\\\";\\n Table.clear();\\n Table[init]=0;\\n\\n for (int i=0;i<n;i++)\\n {\\n //cin>>now;\\n scanf(\\\"%s\\\",now);\\n dp();\\n }\\n\\n printf(\\\"%d\\\\n\\\",Table[init]);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5030,\n \"memory_kb\": 120196,\n \"score_of_the_acc\": -1.1537,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1619_10713590\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nint rp[505][505],n,m;\\nmap<string,int>Table;\\nstring now;\\n\\nstruct node\\n{\\n string s;\\n int x;\\n\\n //node(string s,int x):s(s),x(x){}\\n};\\n\\nvoid dp()\\n{\\n queue<node>q;\\n map<string,int>Temp;\\n\\n map<string,int>::iterator it;\\n for (it=Table.begin();it!=Table.end();it++)\\n {\\n string old=it->first;\\n string New=\\\"\\\";\\n for (int i=0;i<m;i++)\\n if (now[i]==old[i]) New+=\\\"0\\\";else New+=\\\"1\\\";\\n\\n if (!Table.count(New))\\n {\\n node t;\\n t.s=New;t.x=it->second+1;\\n q.push(t);\\n }\\n else if (Table[New]<it->second+1)\\n {\\n Temp[New]=max(Temp[New],it->second+1);\\n //cout<<old<<\\\" \\\"<<New<<\\\" \\\"<<Table[New]<<endl;\\n }\\n }\\n\\n while (!q.empty())\\n {\\n node temp=q.front();q.pop();\\n Table[temp.s]=max(Table[temp.s],temp.x);\\n //cout<<temp.s<<\\\" \\\"<<temp.x<<endl;\\n }\\n\\n for (it=Temp.begin();it!=Temp.end();it++)\\n {\\n string s=it->first;\\n Table[s]=Temp[s];\\n }\\n}\\n\\nint main()\\n{\\n //std::ios::sync_with_stdio(false);\\n while (cin>>n>>m)\\n {\\n if (n==0 && m==0) break;\\n\\n string init=\\\"\\\";\\n for (int i=0;i<m;i++) init+=\\\"0\\\";\\n Table.clear();\\n Table[init]=0;\\n\\n for (int i=0;i<n;i++)\\n {\\n cin>>now;\\n dp();\\n }\\n\\n cout<<Table[init]<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4960,\n \"memory_kb\": 120120,\n \"score_of_the_acc\": -1.1436,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1619_10713579\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nint rp[505][505],n,m;\\nmap<string,int>Table;\\n\\nstruct node\\n{\\n string s;\\n int x;\\n\\n node(string s,int x):s(s),x(x){}\\n};\\n\\nvoid dp(string now)\\n{\\n queue<node>q;\\n map<string,int>Temp;\\n for (map<string,int>::iterator it=Table.begin();it!=Table.end();it++)\\n {\\n string old=it->first;\\n string New=\\\"\\\";\\n for (int i=0;i<m;i++)\\n if (now[i]==old[i]) New+=\\\"0\\\";else New+=\\\"1\\\";\\n\\n if (!Table.count(New))\\n {\\n q.push(node(New,Table[old]+1));\\n }\\n else if (Table[New]<Table[old]+1)\\n {\\n Temp[New]=max(Temp[New],Table[old]+1);\\n //cout<<old<<\\\" \\\"<<New<<\\\" \\\"<<Table[New]<<endl;\\n }\\n }\\n\\n while (!q.empty())\\n {\\n node temp=q.front();q.pop();\\n Table[temp.s]=max(Table[temp.s],temp.x);\\n //cout<<temp.s<<\\\" \\\"<<temp.x<<endl;\\n }\\n\\n for (map<string,int>::iterator it=Temp.begin();it!=Temp.end();it++)\\n {\\n string s=it->first;\\n Table[s]=Temp[s];\\n }\\n}\\n\\nint main()\\n{\\n std::ios::sync_with_stdio(false);\\n while (cin>>n>>m)\\n {\\n if (n==0 && m==0) break;\\n\\n string init=\\\"\\\";\\n for (int i=0;i<m;i++) init+=\\\"0\\\";\\n Table.clear();\\n Table[init]=0;\\n\\n for (int i=0;i<n;i++)\\n {\\n string s;\\n cin>>s;\\n dp(s);\\n }\\n\\n cout<<Table[init]<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6180,\n \"memory_kb\": 120204,\n \"score_of_the_acc\": -1.3141,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1619_10713574\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nusing namespace std;\\n\\nint rp[505][505],n,m;\\nmap<string,int>Table;\\n\\nstruct node\\n{\\n string s;\\n int x;\\n\\n node(string s,int x):s(s),x(x){}\\n};\\n\\nvoid dp(string now)\\n{\\n queue<node>q;\\n for (map<string,int>::iterator it=Table.begin();it!=Table.end();it++)\\n {\\n string old=it->first;\\n string New=\\\"\\\";\\n for (int i=0;i<m;i++)\\n if (now[i]==old[i]) New+=\\\"0\\\";else New+=\\\"1\\\";\\n\\n if (!Table.count(New))\\n {\\n q.push(node(New,Table[old]+1));\\n }\\n else if (Table[New]<Table[old]+1)\\n {\\n q.push(node(New,Table[old]+1));\\n //cout<<old<<\\\" \\\"<<New<<\\\" \\\"<<Table[New]<<endl;\\n }\\n }\\n\\n while (!q.empty())\\n {\\n node temp=q.front();q.pop();\\n Table[temp.s]=temp.x;\\n //cout<<temp.s<<\\\" \\\"<<temp.x<<endl;\\n\\n }\\n}\\n\\nint main()\\n{\\n std::ios::sync_with_stdio(false);\\n while (cin>>n>>m)\\n {\\n if (n==0 && m==0) break;\\n\\n string init=\\\"\\\";\\n for (int i=0;i<m;i++) init+=\\\"0\\\";\\n Table.clear();\\n Table[init]=0;\\n\\n for (int i=0;i<n;i++)\\n {\\n string s;\\n cin>>s;\\n dp(s);\\n }\\n\\n cout<<Table[init]<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4530,\n \"memory_kb\": 119508,\n \"score_of_the_acc\": -1.0811,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1619_10713567\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint n, m;\\nchar b[505][505];\\nint dp[1<<24], tmp[1<<24];\\nint tb[505];\\n\\nbool input() {\\n cin >> n >> m;\\n if (!n && !m) return 0;\\n for (int i = 0 ; i < n ; i++ ) {\\n cin >> b[i];\\n }\\n return 1;\\n}\\n\\nvoid solve() {\\n int res = 0;\\n memset(dp, -1, sizeof(dp));\\n if ( n > m ) {\\n memset(dp,-1,sizeof(dp));\\n dp[0]=0;\\n \\n for (int i=0; i<n; i++){\\n char *pEnd;\\n int bb=strtol(b[i],&pEnd,2);\\n for (int S=(1<<m)-1; S>=0; S--){\\n if (dp[S^bb]!=-1)tmp[S] = dp[S^bb]+1;\\n else tmp[S]=-1;\\n }\\n for (int S=(1<<m)-1; S>=0; S--){\\n dp[S] = max(dp[S],tmp[S]);\\n }\\n res = dp[0];\\n }\\n } else { // n <= m\\n for (int i = 1 ; i < (1<<n) ; i++ ) {\\n int val = 0, cnt = 0;\\n memset(tb, 0, sizeof(tb));\\n for (int j = 0 ; j < n ; j++ ) {\\n if ( i & (1 << j) ) {\\n for ( int k = 0 ; k < m ; k++ ) {\\n tb[k] ^= (b[j][k] - '0');\\n }\\n cnt++;\\n }\\n }\\n bool flag = true;\\n for ( int k = 0 ; k < m ;k++ ) {\\n if ( tb[k] ) {\\n flag = false;\\n break;\\n }\\n }\\n if ( flag ) {\\n res = max(res, cnt);\\n }\\n }\\n }\\n cout << res << endl;\\n}\\n\\nint main(){\\n while(input()) {\\n solve();\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5220,\n \"memory_kb\": 79388,\n \"score_of_the_acc\": -1.0078,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1619_10713520\",\n \"code_snippet\": \"#include<cstdio>\\n#include<algorithm>\\n#include<vector>\\n#include<queue>\\n#include<map>\\n#include<cstring>\\nusing namespace std;\\n\\nconst int N = 500;\\n\\nint a[N + 2][N + 2], n, m, st[(1 << 22) + 2], st2[(1 << 22) + 2], sum[N + 2], val[N + 2];\\n\\nint main()\\n{\\n\\tfor (; scanf(\\\"%d%d\\\", &n, &m) && (n || m); )\\n\\t{\\n\\t\\tfor (int i = 0; i < n; i++)\\n\\t\\t\\tfor (int j = 0; j < m; j++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tscanf(\\\"%1d\\\", &a[i][j]);\\n\\t\\t\\t}\\n\\t\\tint ans = 0;\\n\\t\\tif (n <= 22)\\n\\t\\t{\\n\\t\\t\\tfor (int k = 1; k < 1 << n; k++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tfor (int i = 0; i < m; i++)\\n\\t\\t\\t\\t\\tsum[i] = 0;\\n\\t\\t\\t\\tint cnt = 0;\\n\\t\\t\\t\\tfor (int l = 0; l < n; l++)\\n\\t\\t\\t\\t\\tif (k >> l & 1)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tcnt++;\\n\\t\\t\\t\\t\\t\\tfor (int i = 0; i < m; i++)\\n\\t\\t\\t\\t\\t\\t\\tsum[i] ^= a[l][i];\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\tint ok = 1;\\n\\t\\t\\t\\tfor (int i = 0; i < m; i++)\\n\\t\\t\\t\\t\\tif (sum[i])\\n\\t\\t\\t\\t\\t\\tok = 0;\\n\\t\\t\\t\\tif (ok)\\n\\t\\t\\t\\t\\tans = max(ans, cnt);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\telse\\n\\t\\t{\\n\\t\\t\\tfor (int i = 0; i < 1 << m; i++)\\n\\t\\t\\t\\tst[i] = st2[i] = 0;\\n\\t\\t\\tfor (int i = 0; i < n; i++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tval[i] = 0;\\n\\t\\t\\t\\tfor (int j = 0; j < m; j++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tval[i] = 2 * val[i] + a[i][j];\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tfor (int i = 0; i < n; i++)\\n\\t\\t\\t{\\n\\t\\t\\t\\tif (st[val[i]] > 0)\\n\\t\\t\\t\\t\\tans = max(ans, st[val[i]] + 1);\\n\\t\\t\\t\\tfor (int j = 0; j < 1 << m; j++)\\n\\t\\t\\t\\t\\tst2[j^val[i]] = st[j] > 0 ? st[j] + 1 : 0;\\n\\t\\t\\t\\tst2[val[i]] = max(st2[val[i]], 1);\\n\\t\\t\\t\\tfor (int j = 0; j < 1 << m; j++)\\n\\t\\t\\t\\t\\tst[j] = max(st[j], st2[j]);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tprintf(\\\"%d\\\\n\\\", ans);\\n\\t}\\n}\\n\\n/*\\n\\n\\n*/\",\n \"accuracy\": 1,\n \"time_ms\": 5310,\n \"memory_kb\": 24384,\n \"score_of_the_acc\": -0.7879,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1619_10702739\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nmap < unsigned long long , int > dp[505];\\nbitset < 505 > a[505];\\nint n,m;\\nchar s[505];\\nhash < bitset < 505 > > H;\\n\\nint dfs( int pos, bitset < 505 > s ){\\n\\tif ( pos == n ){\\n\\t\\tif ( s.count() == 0 ) return 0;\\n\\t\\telse return -1e9;\\n\\t}\\n\\t\\n\\thash < bitset < 505 > > H;\\n\\tif ( dp[pos].find(H(s)) != dp[pos].end() ) return dp[pos][H(s)];\\n\\tint ans = dfs(pos+1,s);\\n\\tans = max( ans, dfs(pos+1, s ^ a[pos]) + 1);\\n\\treturn dp[pos][H(s)] = ans;\\n}\\n\\nint main(){\\n\\t\\n\\twhile ( scanf(\\\"%d%d\\\",&n,&m) == 2 && n + m > 0 ){\\n\\t\\tfor ( int i = 0; i < n; i++ ){\\n\\t\\t\\ta[i].reset();\\n\\t\\t\\tscanf(\\\"%s\\\",&s);\\n\\t\\t\\tint len = strlen(s);\\n\\t\\t\\tfor ( int j = 0; j < m; j++ ){\\n\\t\\t\\t\\tif ( s[j] == '0' ) continue;\\n\\t\\t\\t\\ta[i].set(j);\\n\\t\\t\\t}\\n\\t\\t\\tdp[i].clear();\\n\\t\\t}\\n\\t\\t\\n\\t\\tbitset < 505 > bs;\\n\\t\\tprintf(\\\"%d\\\\n\\\",dfs(0,bs));\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6480,\n \"memory_kb\": 153228,\n \"score_of_the_acc\": -1.4955,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1619_10685335\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#include <atcoder/all>\\nusing namespace std;\\nusing namespace atcoder;\\n\\nusing ll = long long;\\nconst int MOD = 1000000007;\\nconst int Mod = 998244353;\\nconst int MAX = 1000000005;\\nconst long long INF = 1000000000000000005LL;\\n#define rep(i, n) for (int i = 0; i < (n); i++)\\n#define rep2(i, a, b) for (int i = (a); i < (b); i++)\\n#define rrep(i, n) for (int i = (n) - 1; i >= 0; i--)\\n#define all(x) (x).begin(),(x).end()\\ntemplate<class T>bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate<class T>bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }\\n\\nbool solve() {\\n int n, m;\\n cin >> n >> m;\\n if (n == 0 && m == 0) return false;\\n vector<string> b(n);\\n for (int i = 0; i < n; i++) cin >> b[i];\\n int ans = 0;\\n if (n <= 22) {\\n vector<int> s(m);\\n for (int bit = 0; bit < (1 << n); bit++) {\\n for (int i = 0; i < n; i++) {\\n if (bit & (1 << i)) {\\n for (int j = 0; j < m; j++) s[j] ^= (int)(b[i][j] - '0');\\n }\\n }\\n bool ok = true;\\n for (int i = 0; i < m; i++) {\\n if (s[i]) {\\n ok = false;\\n s[i] = 0;\\n }\\n }\\n if (ok) ans = max(ans, __builtin_popcount(bit));\\n }\\n } else {\\n vector<vector<int>> dp(n+1, vector<int>(1 << m, -1));\\n dp[0][0] = 0;\\n for (int i = 0; i < n; i++) {\\n int binary = 0;\\n for (int j = 0; j < m; j++) binary += (int)(b[i][j] - '0') * (1 << j);\\n for (int bit = 0; bit < (1 << m); bit++) {\\n dp[i+1][bit] = max(dp[i+1][bit], dp[i][bit]);\\n if (dp[i][bit] != -1) {\\n int nxtbit = bit ^ binary;\\n dp[i+1][nxtbit] = max(dp[i+1][nxtbit], dp[i][bit] + 1);\\n }\\n }\\n }\\n ans = dp[n][0];\\n }\\n cout << ans << endl;\\n return true;\\n}\\n\\nint main() {\\n while (solve()) {}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 6350,\n \"memory_kb\": 208976,\n \"score_of_the_acc\": -1.7129,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1619_10668271\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nbool solve(){\\n int n,m;cin>>n>>m;\\n if(n==0)return 0;\\n vector<string>b(n);\\n for(auto &x:b)cin>>x;\\n\\n int ans=0;\\n if(n<m){\\n for(int s=0;s<(1<<n);s++){\\n vector<int>c(m);\\n int pc=0;\\n for(int i=0;i<n;i++){\\n if(s>>i&1){\\n pc++;\\n for(int j=0;j<m;j++)c[j]^=(b[i][j]-'0');\\n }\\n }\\n bool ng=false;\\n for(int j=0;j<m;j++)if(c[j])ng=true;\\n if(!ng)ans=max(ans,pc);\\n }\\n }else{\\n vector<int>dp(1<<m,-1e6);\\n dp[0]=0;\\n //使用材料xorがsのときのmax\\n vector<int>c(n);\\n for(int i=0;i<n;i++){\\n for(int j=0;j<m;j++)c[i]=c[i]*2+int(b[i][j]-'0');\\n }\\n for(int i=0;i<n;i++){\\n vector<int>old(1<<m,-1e6);\\n swap(old,dp);\\n for(int s=0;s<(1<<m);s++){\\n dp[s]=max(dp[s],old[s]);\\n dp[s^c[i]]=max(dp[s^c[i]],old[s]+1);\\n }\\n } \\n ans=dp[0];\\n }\\n cout<<ans<<endl;\\n return 1;\\n}\\nint main(){\\n while(solve());\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2960,\n \"memory_kb\": 36356,\n \"score_of_the_acc\": -0.5108,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1619_10668267\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nbool solve(){\\n int n,m;cin>>n>>m;\\n if(n==0)return 0;\\n vector<string>b(n);\\n for(auto &x:b)cin>>x;\\n\\n int ans=0;\\n if(n<m){\\n for(int s=0;s<(1<<n);s++){\\n vector<int>c(m);\\n int pc=0;\\n for(int i=0;i<n;i++){\\n if(s>>i&1){\\n pc++;\\n for(int j=0;j<m;j++)c[j]^=(b[i][j]-'0');\\n }\\n }\\n bool ng=false;\\n for(int j=0;j<m;j++)if(c[j])ng=true;\\n if(!ng)ans=max(ans,pc);\\n }\\n }else{\\n vector<int>dp(1<<m,-1e6);\\n dp[0]=0;\\n //使用材料xorがsのときのmax\\n vector<int>c(n);\\n for(int i=0;i<n;i++){\\n for(int j=0;j<m;j++)c[i]=c[i]*2+int(b[i][j]-'0');\\n }\\n for(int i=0;i<n;i++){\\n vector<int>old(1<<m,-1e6);\\n swap(old,dp);\\n for(int s=0;s<(1<<m);s++){\\n dp[s]=max(dp[s],old[s]);\\n dp[s^c[i]]=max(dp[s^c[i]],old[s]+1);\\n }\\n } \\n ans=dp[0];\\n }\\n cout<<ans<<endl;\\n return 1;\\n}\\nint main(){\\n while(solve());\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2960,\n \"memory_kb\": 36412,\n \"score_of_the_acc\": -0.511,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1619_10658718\",\n \"code_snippet\": \"#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n// 数値型\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing ld = long double;\\nusing P = pair<int,int>;\\nusing Pll = pair<ll, ll>;\\nusing Pli = pair<ll, int>;\\nusing Pil = pair<int, ll>;\\n\\n// vector関連\\nusing vi = vector<int>;\\nusing vvi = vector<vi>;\\nusing vvvi = vector<vvi>;\\nusing vll = vector<ll>;\\nusing vvll = vector<vll>;\\nusing vvvll = vector<vvll>;\\ntemplate<typename T>\\nusing vc = vector<T>;\\ntemplate<typename T>\\nusing vvc = vector<vc<T>>;\\ntemplate<typename T>\\nusing vvvc = vector<vvc<T>>;\\ntemplate<typename T>\\nusing vvvvc = vector<vvvc<T>>;\\n\\n// priority_queue\\ntemplate<typename T>\\nusing pq = priority_queue<T>;\\ntemplate<typename T>\\nusing pqg = priority_queue<T, vc<T>, greater<T>>;\\n\\n#define rep(i, n) for(int i = 0; i < (int)(n); i++)\\n#define FOR(i, a, b) for(int i = a; i < (int)(b); i++)\\n#define all(a) (a).begin(),(a).end()\\n#define rall(a) (a).rbegin(),(a).rend()\\n#define MIN(vec) *min_element(vec)\\n#define MAX(vec) *max_element(vec)\\n#define next_perm(vec) (vec).begin(), (vec).end()\\n#define UNIQUE(vec) vec.erase(unique(vec.begin(), vec.end()), vec.end())\\n#define el \\\"\\\\n\\\"\\n#define Yes cout << \\\"Yes\\\" << el\\n#define No cout << \\\"No\\\" << el\\n#define YES cout << \\\"YES\\\" << el\\n#define NO cout << \\\"NO\\\" << el\\n#define EPS 1e-8\\n#define Equal(a, b) (fabs((a)-(b)) < EPS) \\n#define dbg(x) cerr << #x << \\\"=\\\" << x << el \\n\\n// 定数\\nconst string abc = \\\"abcdefghijklmnopqrstuvwxyz\\\";\\nconst string ABC = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\nconstexpr int INF = 1001001001;\\nconstexpr ll LINF = 1001001001001001001ll;\\nconstexpr int DX[] = {1, 0, -1, 0};\\nconstexpr int DY[] = {0, 1, 0, -1};\\nconstexpr int DX8[] = {1, 0, -1, 0, 1, 1, -1, -1};\\nconstexpr int DY8[] = {0, 1, 0, -1, 1, -1, 1, -1};\\n\\ntemplate<typename T1, typename T2>\\nostream &operator<< (ostream &os, pair<T1, T2> p) {\\n os << \\\"{\\\" << p.first << \\\",\\\" << p.second << \\\"}\\\";\\n return os;\\n}\\ntemplate<typename T>\\nostream &operator<< (ostream &os, vc<T> &vec) {\\n int sz = vec.size();\\n rep(i, sz){\\n os << vec[i] << (i==sz-1?\\\"\\\":\\\" \\\");\\n }\\n return os;\\n}\\n\\ntemplate<typename T1, typename T2>\\nistream &operator>> (istream &is, pair<T1, T2> &p) {\\n is >> p.first >> p.second;\\n return is;\\n}\\ntemplate<typename T>\\nistream &operator>> (istream &is, vc<T> &vec) {\\n int sz = vec.size();\\n rep(i, sz) { is >> vec[i]; }\\n return is;\\n}\\n/// @brief aとｂの最大値をaに格納。更新があったかbool値を返す\\n/// @tparam T1 \\n/// @tparam T2 \\n/// @param a \\n/// @param b \\n/// @return bool\\ntemplate<typename T1, typename T2>\\ninline bool chmax(T1 &a, T2 b){\\n bool ret = a<b;\\n if(ret) a = b;\\n return ret;\\n}\\n\\n/// @brief aとｂの最小値をaに格納。更新があったかbool値を返す\\n/// @tparam T1 \\n/// @tparam T2 \\n/// @param a \\n/// @param b \\n/// @return bool\\ntemplate<typename T1, typename T2>\\ninline bool chmin(T1 &a, T2 b){\\n bool ret = a>b;\\n if(ret) {a = b;}\\n return ret;\\n}\\n\\ninline void YesNo(bool flag){\\n if(flag) {Yes;}\\n else {No;}\\n return;\\n}\\n\\ninline void YESNO(bool flag){\\n if(flag) {YES;}\\n else {NO;}\\n return;\\n}\\n\\ninline bool outof(ll x, ll xlim){\\n return (x<0 || x>=xlim);\\n}\\n\\ntemplate<typename T>\\ninline T sqnorm(T x, T y){\\n return x*x+y*y;\\n}\\n\\n/// @brief char->int\\n/// @param c \\n/// @return int\\ninline int ctoi(char c){\\n return c-'0';\\n}\\n\\n/// @brief xを素因数分解\\n/// @param x \\n/// @return vector<Pli>, 素因数の昇順に {p, cnt}\\nvector<Pli> prime_fact(ll x){\\n vector<Pli> ret;\\n for(ll i=2; i*i<=x; i++){\\n if(x%i == 0){\\n ret.emplace_back(i, 0);\\n while(x%i == 0){\\n ret.back().second++;\\n x /= i;\\n }\\n }\\n }\\n if(x != 1) ret.emplace_back(x, 1);\\n return ret;\\n}\\n\\n/// @brief xの約数列挙\\n/// @param x \\n/// @return vll, 約数の昇順\\nvll divisor_enum(ll x){\\n vector<ll> ret;\\n for(ll i=1; i*i<=x; i++){\\n if(x%i == 0){\\n ret.push_back(x/i);\\n ret.push_back(i);\\n }\\n }\\n sort(all(ret));\\n UNIQUE(ret);\\n return ret;\\n}\\n\\n/// @brief 繰り返し二乗法。\\n/// @tparam T \\n/// @param x \\n/// @param k \\n/// @param op \\n/// @param e \\n/// @return \\ntemplate<typename T>\\nT pow_t(T x, ll k, T (*op)(T, T), T (*e)()){\\n T ret = e();\\n while(k){\\n if(k&1) ret *= x;\\n x *= x;\\n k >>= 1;\\n }\\n return ret;\\n}\\n\\nll powll(ll x, ll k){\\n return pow_t<ll>(x, k, [](ll a, ll b) -> ll{return a*b;}, []() -> ll{return 1;});\\n}\\n\\ninline int pop_cnt(ll x) { return __builtin_popcountll(x); }\\ninline int top_bit(ll x) { return (x==0?-1:63-__builtin_clzll(x));}\\n\\nvoid main2();\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n main2();\\n}\\n\\nbool solve2(int n, int m){\\n if(n == 0) return false;\\n vc<string> b(n);\\n rep(i, n) cin >> b[i];\\n vc<bitset<500>> b2(n, bitset<500>(0));\\n rep(i, n){\\n rep(j, m){\\n if(b[i][j] == '1') b2[i].set(j, 1);\\n } \\n }\\n int ans = 0;\\n rep(S, 1<<n){\\n bitset<500> bs(0);\\n int cnt = pop_cnt(S);\\n if(cnt <= ans) continue; \\n rep(j, n){\\n if(S>>j&1) bs ^= b2[j];\\n }\\n if(bs.count() == 0) ans = cnt;\\n }\\n cout << ans << el;\\n return true;\\n}\\nbool solve3(int n, int m){\\n vc<string> b(n);\\n rep(i, n) cin >> b[i];\\n vi dp(1<<m, -INF);\\n vi dp2(1<<m, -INF);\\n dp[0] = 0;\\n rep(i, n){\\n int mask = 0;\\n rep(j, m) if(b[i][j] == '1') mask |= 1<<j;\\n rep(S, 1<<m){\\n dp2[S] = max(dp[S], dp[S^mask]+1); \\n }\\n swap(dp, dp2);\\n }\\n cout << dp[0] << el;\\n return true;\\n}\\nbool solve(){\\n int n, m;\\n cin >> n >> m;\\n if(n == 0) return false;\\n if(n < m){\\n return solve2(n, m);\\n }\\n else{\\n return solve3(n, m);\\n }\\n}\\n\\nvoid main2(){\\n while(solve()){\\n ;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 710,\n \"memory_kb\": 36212,\n \"score_of_the_acc\": -0.1964,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1619_10632212\",\n \"code_snippet\": \"#pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n\\n// #ifndef ONLINE_JUDGE\\n// #define _GLIBCXX_DEBUG // 配列外参照のエラー\\n// #endif\\n\\n// スタンダードライブラリ\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n// 型関連\\nusing ll = long long;\\nusing lint = long long;\\nusing pll = pair<ll, ll>;\\nusing plll = tuple<ll, ll, ll>;\\nusing pii = pair<int, int>;\\nusing piii = tuple<ll, ll, ll>;\\ntemplate <class T> using prique = priority_queue<T>;\\n\\n// 型定数\\nconstexpr ll mod = 998244353;\\nconstexpr ll MOD = 1000000007;\\nint INF32 = 2e9;\\nll INF64 = 9e18;\\n#define endl '\\\\n';\\n\\nint dx[4] = {1, 0, -1, 0};\\nint dy[4] = {0, 1, 0, -1};\\n\\n/////////////////////////// print関連\\ntemplate <typename T> void print(vector<T> A);\\nvoid print();\\ntemplate <class Head, class... Tail> void print(Head &&head, Tail &&...tail);\\nvoid print(string S);\\ntemplate <typename T> void print(vector<vector<T>> &F);\\n\\ninline void Yes(bool f);\\n\\n///////////////////ここから//////////////////////\\nbool solve() {\\n int N, M;\\n cin >> N >> M;\\n if (N == 0) {\\n return false;\\n }\\n vector<string> SS;\\n vector<int> B(N);\\n for (int i = 0; i < N; i++) {\\n string S;\\n cin >> S;\\n SS.push_back(S);\\n int val = 0;\\n for (int j = 0; j < M; j++) {\\n if (S[j] == '1') {\\n val += (1 << j);\\n }\\n }\\n B[i] = val;\\n }\\n if (N <= 22) {\\n int ans = 0;\\n for (int S = 0; S < (1 << N); S++) {\\n int cnt = 0;\\n vector<int> V(M);\\n for (int i = 0; i < N; i++) {\\n if (S & (1 << i)) {\\n cnt++;\\n for (int j = 0; j < M; j++) {\\n if (SS[i][j] == '1') {\\n V[j]=1-V[j];\\n }\\n }\\n }\\n }\\n bool ok = true;\\n for (int j = 0; j < M; j++) {\\n if (V[j]) {\\n ok = false;\\n break;\\n }\\n }\\n if (ok) {\\n ans=max(ans,cnt);\\n }\\n }\\n print(ans);\\n } else {\\n vector<int> dp(1 << M, -1);\\n dp[0] = 0;\\n for (int i = 0; i < N; i++) {\\n vector<int> ndp(1 << M, -1);\\n for (int S = 0; S < (1 << M); S++) {\\n if (dp[S] == -1) {\\n continue;\\n }\\n ndp[S ^ B[i]] = max(ndp[S ^ B[i]], dp[S] + 1);\\n ndp[S] = max(ndp[S], dp[S]);\\n }\\n swap(dp,ndp);\\n }\\n print(dp[0]);\\n }\\n\\n return true;\\n}\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n while (solve())\\n ;\\n}\\n\\n////////////////////print/////////////////////////\\n// 1次元ベクトルを出力する\\ntemplate <typename T> void print(vector<T> A) {\\n if (A.size() == 0) {\\n return;\\n }\\n for (size_t i = 0; i < A.size() - 1; i++) {\\n cout << A[i] << ' ';\\n }\\n cout << A[A.size() - 1] << endl;\\n return;\\n}\\n\\n// 2次元ベクトルを出力する\\ntemplate <typename T> void print(vector<vector<T>> &F) {\\n for (size_t i = 0; i < F.size(); i++) {\\n for (size_t j = 0; j < F[i].size(); j++) {\\n cout << F[i][j];\\n if (j < F[i].size() - 1) {\\n cout << ' ';\\n }\\n }\\n cout << endl;\\n }\\n}\\n\\n// 空白行を出力するprint\\nvoid print() { cout << endl; }\\n\\n// 数値・文字列を空白区切りで出力する. print(a,b)など\\ntemplate <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {\\n cout << head;\\n if (sizeof...(tail) != 0)\\n cout << \\\" \\\";\\n print(forward<Tail>(tail)...);\\n}\\n\\nvoid print(string S) { cout << S << endl; }\\n\\n//////////////出力関連\\n\\ninline void Yes(bool f) {\\n if (f) {\\n cout << \\\"Yes\\\" << endl;\\n } else {\\n cout << \\\"No\\\" << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4000,\n \"memory_kb\": 19832,\n \"score_of_the_acc\": -0.586,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1619_10630838\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define ll long long\\n\\nvector<int> myxor(vector<int> &a,vector<int> &b){\\n assert(a.size()==b.size());\\n vector<int> ans(a.size(),0);\\n for(int i=0;i<(ll)a.size();i++){\\n ans.at(i)=a.at(i)^b.at(i);\\n }\\n return ans;\\n}\\n\\nbool solve(){\\n int n,m; cin>>n>>m;\\n if(n==0 && m == 0) return 0;\\n\\n vector<vector<int>> b(n,vector<int>(m));\\n vector<ll> recipeint(n,0);\\n\\n for(int i=0;i<n;i++){\\n for(int j=0;j<m;j++){\\n char c; cin>>c;\\n b[i][j] = c-'0';\\n }\\n }\\n ll ans=0;\\n if(n <= 20){\\n for(int i=0;i<(1<<n);i++){\\n bitset<501> bt(0);\\n ll siz=0;\\n for(int k=0;k<n;k++){\\n if(i&(1<<k)){\\n siz++;\\n for(int j=0;j<m;j++){\\n if(b[k][j]==1)bt.flip(j);\\n }\\n }\\n }\\n if((int)bt.count()!=0)continue;\\n ans=max(ans,siz);\\n }\\n }\\n else{\\n map<vector<int>,ll> mp;\\n vector<pair<vector<int>,ll>> t(0);\\n for(int i=0;i<n;i++){\\n t.clear();\\n if(mp.count(b.at(i))==0){\\n t.push_back(make_pair(b.at(i),1));\\n }\\n for(pair<vector<int>,ll> pp:mp){\\n t.push_back(make_pair(myxor(pp.first,b.at(i)),pp.second+1));\\n }\\n for(int i=0;i<(ll)t.size();i++){\\n if(mp.count(t.at(i).first)==0){\\n mp[t.at(i).first]=t.at(i).second;\\n }\\n else{\\n mp.at(t.at(i).first)=max(mp.at(t.at(i).first),t.at(i).second);\\n }\\n }\\n }\\n if(mp.count(vector<int>(m,0))==0){\\n ans=0;\\n }\\n else{\\n ans=mp.at(vector<int>(m,0));\\n }\\n }\\n cout<<ans<<endl;\\n return 1;\\n}\\n\\nint main(){\\n while(solve());\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4070,\n \"memory_kb\": 249200,\n \"score_of_the_acc\": -1.5649,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1619_10630613\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#pragma GCC optimize(\\\"Ofast\\\")\\n\\n#define rep(i, n) for(ll i = 0; i < (n); ++i)\\n#define all(A) A.begin(), A.end()\\n\\nbool chmin(auto &a, auto b) {return a > b ? a = b, 1 : 0;}\\nbool chmax(auto &a, auto b) {return a < b ? a = b, 1 : 0;}\\n\\nusing ll = long long;\\n\\nvoid print(auto... vs) {\\n ((cout << vs << ' '), ...) << endl;\\n}\\n\\nstruct dsu {\\n int n;\\n vector<int> par;\\n\\n dsu(int n) : n(n), par(n, -1){};\\n\\n int find(int v) {\\n if(par[v] < 0) return v;\\n return par[v] = find(par[v]);\\n }\\n\\n bool merge(int x, int y) {\\n x = find(x);\\n y = find(y);\\n if(x == y) return false;\\n if(par[x] > par[y]) swap(x, y);\\n par[x] += par[y];\\n par[y] = x;\\n return true;\\n }\\n\\n int size(int v) { return -par[find(v)]; }\\n\\n bool same(int x, int y) { return find(x) == find(y); }\\n};\\n\\nint main() {\\n while(1) {\\n ll N, M; cin >> N >> M;\\n if(N + M == 0) break;\\n vector<string> B(N);\\n rep(i, N) {\\n cin >> B[i];\\n }\\n \\n ll res = 0;\\n if(N <= 26) {\\n // N < 25\\n using bs = bitset<500>;\\n vector<bs> b(N);\\n rep(i, N) {\\n b[i] = 0;\\n rep(j, M) {\\n if(B[i][j] == '1') b[i][j] = 1;\\n }\\n }\\n // rep(i, N) {\\n // print(b[i]);\\n // }\\n \\n for(ll bit = 0; bit < (1LL<<N); ++bit) {\\n bs tmp = 0;\\n rep(i, N) {\\n if(bit & (1LL<<i)) {\\n tmp ^= b[i];\\n }\\n }\\n // print(bit, tmp);\\n if(tmp == 0) chmax(res, __builtin_popcountll(bit));\\n }\\n \\n \\n }\\n else {\\n // M < 25\\n vector<int> b(N);\\n rep(i, N) {\\n ll now = 0;\\n rep(j, M) {\\n now *= 2;\\n now += (B[i][j] - '0');\\n }\\n b[i] = now;\\n }\\n \\n vector dp(N+1, vector<int>(1LL<<M, -1));\\n dp[0][0] = 0;\\n rep(i, N) {\\n rep(bit, 1LL<<M) {\\n if(dp[i][bit] >= 0) {\\n chmax(dp[i+1][bit], dp[i][bit]);\\n chmax(dp[i+1][bit ^ b[i]], dp[i][bit] + 1);\\n }\\n }\\n }\\n \\n // rep(i, N) {\\n // rep(bit, 1LL<<M) {\\n // print(i, bit, dp[i][bit]);\\n // }\\n // }\\n res = max(dp[N][0], 0);\\n }\\n \\n cout << res << endl;\\n \\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 5800,\n \"memory_kb\": 33256,\n \"score_of_the_acc\": -0.8938,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1619_10630551\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nvoid solve1(int N, int M, vector<string> B) {\\n vector<bitset<500>> bit(N);\\n for (int i = 0; i < N; i++) {\\n for (int j = 0; j < M; j++) {\\n if (B[i][j] == '1') bit[i].set(j);\\n }\\n }\\n int ans = 0;\\n for (int i = 0; i < 1 << N; i++) {\\n bitset<500> b;\\n for (int j = 0; j < N; j++) {\\n if (i >> j & 1) b ^= bit[j];\\n }\\n if (b.count() == 0) {\\n ans = max(ans, __builtin_popcount(i));\\n }\\n }\\n cout << ans << '\\\\n';\\n}\\n\\nvoid solve2(int N, int M, vector<string> B) {\\n vector<int> dp(1 << M, -1 << 30);\\n dp[0] = 0;\\n for (int i = 0; i < N; i++) {\\n auto ep = dp;\\n int bit = 0;\\n for (int j = 0; j < M; j++) {\\n if (B[i][j] == '1') bit ^= 1 << j;\\n }\\n for (int j = 0; j < 1 << M; j++) {\\n ep[j ^ bit] = max(ep[j ^ bit], dp[j] + 1);\\n }\\n dp = ep;\\n }\\n cout << dp[0] << '\\\\n';\\n}\\n\\nbool solve() {\\n int N, M;\\n cin >> N >> M;\\n if (N == 0 && M == 0) return false;\\n vector<string> B(N);\\n for (int i = 0; i < N; i++) cin >> B[i];\\n if (N <= 23) solve1(N, M, B);\\n else solve2(N, M, B);\\n return true;\\n}\\n\\nint main() {\\n while (solve()) {}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4710,\n \"memory_kb\": 12516,\n \"score_of_the_acc\": -0.6541,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1619_10630521\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#include <atcoder/all>\\nusing namespace atcoder;\\n\\nusing ll = long long;\\nusing mint = modint998244353;\\n\\nunordered_map<string, int> enumerate(vector<string> S, int M) {\\n int N = S.size();\\n unordered_map<string, int> ret;\\n for(int s = 0; s < 1 << N; s++) {\\n int cnt = 0;\\n string x(M, '0');\\n for(int i = 0; i < N; i++) {\\n if((~s >> i) & 1) continue;\\n cnt++;\\n for(int j = 0; j < M; j++) {\\n x[j] ^= S[i][j] - '0';\\n }\\n }\\n ret[x] = max(ret[x], cnt);\\n }\\n return ret;\\n}\\n\\nbool solve() {\\n int N, M;\\n cin >> N >> M;\\n if(N == 0) return false;\\n vector<string> S(N);\\n for(int i = 0; i < N; i++) {\\n cin >> S[i];\\n }\\n if(N <= 30) {\\n vector<string> L, R;\\n for(int i = 0; i < N; i++) {\\n (i & 1 ? L : R).push_back(S[i]);\\n }\\n auto mpl = enumerate(L, M);\\n auto mpr = enumerate(R, M);\\n int ans = 0;\\n for(auto [s, c] : mpl) {\\n if(mpr.count(s)) ans = max(ans, c + mpr[s]);\\n // cout << s << \\\" \\\" << c << \\\" \\\" << (mpr.count(s) ? mpr[s] : 0) << endl;\\n }\\n cout << ans << endl;\\n }else {\\n vector<int> A;\\n for(auto s : S) {\\n int ret = 0;\\n for(char c : s) ret = 2 * ret + (c - '0');\\n A.push_back(ret);\\n }\\n const int INF = 1 << 20;\\n vector dp(N + 1, vector<int>(1 << M, -INF));\\n dp[0][0] = 0;\\n for(int i = 0; i < N; i++) {\\n for(int j = 0; j < 1 << M; j++) {\\n dp[i + 1][j] = max(dp[i + 1][j], dp[i][j]);\\n dp[i + 1][j ^ A[i]] = max(dp[i + 1][j ^ A[i]], dp[i][j] + 1);\\n }\\n }\\n cout << dp[N][0] << endl;\\n }\\n return true;\\n}\\n\\nint main() {\\n while(solve());\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 12740,\n \"score_of_the_acc\": -0.0009,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1619_10630473\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll =long long;\\n\\nusing BS=bitset<500>;\\nvoid solve(ll H,ll W){\\n vector<BS> B(H);\\n for(int i=0;i<H;i++){\\n string S;\\n cin>>S;\\n B[i]=BS(S);\\n }\\n unordered_map<BS,ll> M;\\n M[0]=0;\\n for(int i=0;i<H;i++){\\n unordered_map<BS,ll> NM;\\n for(auto [m,n]:M){\\n NM[m]=max(NM[m],n);\\n NM[m^B[i]]=max(NM[m^B[i]],n+1);\\n }\\n swap(NM,M);\\n }\\n cout<<M[0]<<endl;\\n\\n \\n}\\n\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n\\n ll H,W;\\n while(cin>>H>>W,H+W!=0)\\n solve(H,W);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2990,\n \"memory_kb\": 167704,\n \"score_of_the_acc\": -1.0699,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1619_10604073\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#include <unordered_map>\\n#include <stdlib.h>\\nusing namespace std;\\n#define rep(i, a, n) for(ll i = a; i < n; i++)\\n#define rrep(i, a, n) for(ll i = a; i >= n; i--)\\n#define ll long long\\n#define pii pair<int, int>\\n#define pll pair<ll, ll>\\n#define all(x) (x).begin(), (x).end()\\n//constexpr ll MOD = 1000000007;\\nconstexpr ll MOD = 998244353;\\nconstexpr int IINF = 1001001001;\\nconstexpr ll INF = 1LL<<60;\\ntemplate<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}\\ntemplate<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}\\n\\n\\nll gcd(ll a, ll b){\\n if(a%b == 0){\\n return b;\\n }else{\\n return gcd(b, a%b);\\n }\\n}\\n\\nll lcm(ll a, ll b){\\n return a*b / gcd(a, b);\\n}\\n\\nll powMod(ll x, ll n) {\\n if (n == 0) return 1 % MOD;\\n ll val = powMod(x, n / 2);\\n val *= val;\\n val %= MOD;\\n if (n % 2 == 1) val *= x;\\n return val % MOD;\\n}\\n\\nint main() {\\n while(true){\\n ll n, m; cin >> n >> m;\\n if(n*m == 0) break;\\n if(n < m){\\n vector<vector<ll>> b(n,vector<ll>(m));\\n rep(i,0,n){\\n string s; cin >> s;\\n rep(j,0,m) b[i][j] = s[j]-'0';\\n }\\n ll ans = 0;\\n // rep(i,0,n){\\n // rep(j,0,m) cout << b[i][j];\\n // cout << endl;\\n // }\\n rep(bit,0,1LL<<n){\\n vector<ll> num(m,0);\\n rep(i,0,n){\\n if(bit>>i&1){\\n rep(j,0,m) num[j] ^= b[i][j];\\n }\\n }\\n ll sum = 0;\\n rep(j,0,m) sum += num[j];\\n if(sum == 0){\\n chmax(ans, __popcount(bit));\\n // cout << \\\"bit:\\\" << bit << endl;\\n }\\n }\\n cout << ans << endl;\\n }else{\\n vector<ll> b(n);\\n rep(i,0,n){\\n string s; cin >> s;\\n ll num = 0;\\n for(auto c: s){\\n num *= 2;\\n num += c-'0';\\n }\\n b[i] = num;\\n }\\n vector<ll> dp(1LL<<m, -INF);\\n dp[0] = 0;\\n rep(i,0,n){\\n vector<ll> ndp(1LL << m, -INF);\\n rep(j,0,1LL<<m){\\n if(dp[j] == -INF) continue;\\n chmax(ndp[j], dp[j]);\\n chmax(ndp[j^b[i]], dp[j]+1);\\n }\\n swap(dp, ndp);\\n }\\n cout << dp[0] << endl;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2740,\n \"memory_kb\": 73064,\n \"score_of_the_acc\": -0.6352,\n \"final_rank\": 6\n }\n]","isConversational":false}}},{"rowIdx":994,"cells":{"group_id":{"kind":"string","value":"aoj_1620_cpp"},"problem_description":{"kind":"string","value":"Boolean Expression Compressor\nYou are asked to build a compressor for Boolean expressions\nthat transforms expressions to the shortest form keeping their meaning.\nThe grammar of the Boolean expressions has terminals\n0\n1\na\nb\nc\nd\n-\n^\n*\n(\n)\n, start symbol <E> and the following production rule:\n<E> ::=\n0\n|\n1\n|\na\n|\nb\n|\nc\n|\nd\n|\n-\n<E> |\n(\n<E>\n^\n<E>\n)\n|\n(\n<E>\n*\n<E>\n)\nLetters\na\n,\nb\n,\nc\nand\nd\nrepresent Boolean\nvariables that have values of either\n0\nor\n1\n.\nOperators are evaluated as shown in the Table below.\nIn other words,\n-\nmeans negation (NOT),\n^\nmeans exclusive disjunction (XOR), and\n*\nmeans logical conjunction (AND).\nTable: Evaluations of operators\nWrite a program that calculates the length of the shortest expression that\nevaluates equal to the given expression with whatever values of the four variables.\nFor example,\n0\n, that is the first expression in the sample input,\ncannot be shortened further.\nTherefore the shortest length for this expression is 1.\nFor another example,\n(a*(1*b))\n, the second in the sample input,\nalways evaluates equal to\n(a*b)\nand\n(b*a)\n,\nwhich are the shortest. The output for this expression, thus, should be\n5\n.\nInput\nThe input consists of multiple datasets.\nA dataset consists of one line, containing an expression\nconforming to the grammar described above.\nThe length of the expression is less than or equal to 16 characters.\nThe end of the input is indicated by a line containing one\n\n.\n (period).\nThe number of datasets in the input is at most 200.\nOutput\nFor each dataset, \noutput a single line containing an integer which is the length of the\nshortest expression that has the same value as the given expression for \nall combinations of values in the variables.\nSample Input\n0\n(a*(1*b))\n(1^a)\n(-(-a*-b)*a)\n(a^(b^(c^d)))\n.\nOutput for the Sample Input\n1\n5\n2\n1\n13"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1620_10853829","code_snippet":"#include<cstdio>\n#include<algorithm>\n#include<vector>\n#include<queue>\n#include<map>\n#include<cstring>\nusing namespace std;\n\nconst int N = 16;\n\nchar S[N + 2];\nint T[N + 2], p;\nmap<char, int> M;\nconst char *al = \"abcd\";\nconst char *nu = \"01\";\nconst char *st = \"^*\";\n\nvector<vector<char>> V[N + 2];\n\nint get(vector<char> &s)\n{\n\tif (strchr(nu, s[p]))\n\t\treturn s[p++] - '0';\n\tif (strchr(al, s[p]))\n\t\treturn M[s[p++]];\n\tif (s[p] == '-')\n\t{\n\t\tp++;\n\t\treturn 1 ^ get(s);\n\t}\n\tp++;\n\tint l = get(s);\n\tint t = p++;\n\tint r = get(s);\n\tp++;\n\tif (s[t] == '^')\n\t\treturn l^r;\n\telse\n\t\treturn l&r;\n}\n\nint get(char *s)\n{\n\tif (strchr(nu, s[p]))\n\t\treturn s[p++] - '0';\n\tif (strchr(al, s[p]))\n\t\treturn M[s[p++]];\n\tif (s[p] == '-')\n\t{\n\t\tp++;\n\t\treturn 1 ^ get(s);\n\t}\n\tp++;\n\tint l = get(s);\n\tint t = p++;\n\tint r = get(s);\n\tp++;\n\tif (s[t] == '^')\n\t\treturn l^r;\n\telse\n\t\treturn l&r;\n}\n\nvoid init(int k)\n{\n\tif (k == 1)\n\t{\n\t\tfor (int i = 0; i < 4; i++)\n\t\t\tV[k].push_back({ al[i] });\n\t\tfor (int i = 0; i < 2; i++)\n\t\t\tV[k].push_back({ nu[i] });\n\t}\n\tif (k >= 2)\n\t{\n\t\tfor (auto &t : V[k - 1])\n\t\t{\n\t\t\tV[k].push_back({ '-' });\n\t\t\tvector<char> &v = V[k].back();\n\t\t\tv.insert(v.end(), t.begin(), t.end());\n\t\t}\n\t}\n\tif (k >= 3)\n\t{\n\t\tfor (int i = 1, j = k - 3 - 1; i < k - 3; i++, j--)\n\t\t{\n\t\t\tfor (auto &t : V[i])\n\t\t\t\tfor (auto &t2 : V[j])\n\t\t\t\t{\n\t\t\t\t\tfor (int l = 0; l < 2; l++)\n\t\t\t\t\t{\n\t\t\t\t\t\tV[k].push_back({ '(' });\n\t\t\t\t\t\tvector<char> &v = V[k].back();\n\t\t\t\t\t\tv.insert(v.end(), t.begin(), t.end());\n\t\t\t\t\t\tv.push_back(st[l]);\n\t\t\t\t\t\tv.insert(v.end(), t2.begin(), t2.end());\n\t\t\t\t\t\tv.push_back(')');\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t}\n\t}\n\t//for (auto &v : V[k])\n\t//{\n\t//\tfor (auto &c : v)\n\t//\t\tprintf(\"%c\", c);\n\t//\tprintf(\"\\n\");\n\t//\tprintf(\"k=%d\\n\", k);\n\t//}\n}\n\nint main()\n{\n\tfor (int i = 1; i < N; i++)\n\t{\n\t\tinit(i);\n\t\t//printf(\"i=%d\\n\", i);\n\t}\n\tfor (; scanf(\"%s\", S) && S[0] != '.'; )\n\t{\n\t\tfor (int t = 0; t < 1 << 4; t++)\n\t\t{\n\t\t\tfor (int l = 0; l < 4; l++)\n\t\t\t\tM[al[l]] = t >> l & 1;\n\t\t\tp = 0;\n\t\t\tT[t] = get(S);\n\t\t\t//printf(\"t=%d\\n\", t);\n\t\t}\n\t\t//printf(\"A\\n\");\n\t\tint ans = 1;\n\t\tfor (; ans < 16; ans++)\n\t\t{\n\t\t\tbool ok = false;\n\t\t\tfor (auto &v : V[ans])\n\t\t\t{\n\t\t\t\tbool all = true;\n\t\t\t\tfor (int t = 0; t < 1 << 4; t++)\n\t\t\t\t{\n\t\t\t\t\tfor (int l = 0; l < 4; l++)\n\t\t\t\t\t\tM[al[l]] = t >> l & 1;\n\t\t\t\t\tp = 0;\n\t\t\t\t\tall &= T[t] == get(v);\n\t\t\t\t\tif (!all)\n\t\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tif (all)\n\t\t\t\t{\n\t\t\t\t\tok = true;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (ok)\n\t\t\t\tbreak;\n\t\t\t//printf(\"nowans=%d\\n\", ans);\n\t\t}\n\t\tprintf(\"%d\\n\", ans);\n\t}\n}\n\n/*\n\n\n*/","accuracy":1,"time_ms":2900,"memory_kb":166396,"score_of_the_acc":-1.7769,"final_rank":20},{"submission_id":"aoj_1620_10668668","code_snippet":"#pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n\n// #ifndef ONLINE_JUDGE\n// #define _GLIBCXX_DEBUG // 配列外参照のエラー\n// #endif\n\n// スタンダードライブラリ\n#include <bits/stdc++.h>\nusing namespace std;\n\n// 型関連\nusing ll = long long;\nusing lint = long long;\nusing pll = pair<ll, ll>;\nusing plll = tuple<ll, ll, ll>;\nusing pii = pair<int, int>;\nusing piii = tuple<ll, ll, ll>;\nusing vi = vector<int>;\nusing vvi = vector<vector<int>>;\nusing vvvi = vector<vector<vector<int>>>;\nusing vvvvi = vector<vector<vector<vector<int>>>>;\nusing vl = vector<ll>;\nusing vvl = vector<vector<ll>>;\nusing vvvl = vector<vector<vector<ll>>>;\nusing vvvvl = vector<vector<vector<vector<ll>>>>;\n\ntemplate <class T> using prique = priority_queue<T>;\n\n// 型定数\nconstexpr ll mod = 998244353;\nconstexpr ll MOD = 1000000007;\nint INF32 = 2e9;\nll INF64 = 9e18;\n#define endl '\\n';\n\nint dx[4] = {1, 0, -1, 0};\nint dy[4] = {0, 1, 0, -1};\n\n/////////////////////////// print関連\ntemplate <typename T> void print(vector<T> A);\nvoid print();\ntemplate <class Head, class... Tail> void print(Head &&head, Tail &&...tail);\nvoid print(string S);\ntemplate <typename T> void print(vector<vector<T>> &F);\n\ninline void Yes(bool f);\n\n\nint get_val(string &S, vi &V) {\n int idx=0;\n auto E = [&](auto E) -> int {\n if (S[idx] == '0' || S[idx] == '1') {\n idx++;\n return S[idx-1] - '0';\n }\n if (S[idx] == 'a' || S[idx] == 'b' || S[idx] == 'c' || S[idx] == 'd') {\n idx++;\n return V[S[idx-1]-'a'];\n }\n if (S[idx] == '-') {\n idx++;\n int nval = E(E);\n return (1^nval);\n }\n idx++;\n int left = E(E);\n char op = S[idx];\n idx++;\n int right = E(E);\n idx++;\n if (op == '*') {\n return (left & right);\n }\n return (left ^ right);\n };\n\n return E(E);\n}\n\nbool is_sameST(string S, string T) {\n\n \n\n for (int B = 0; B < (1 << 4); B++) {\n vi V(4);\n for (int i = 0; i < 4; i++) {\n if (B & (1 << i)) {\n V[i]=1;\n }\n }\n if (get_val(S, V) != get_val(T, V)) {\n return false;\n }\n }\n return true;\n}\n\n///////////////////ここから//////////////////////\nbool solve(vector<vector<string>> &Logical) {\n string S;\n cin >> S;\n if (S == \".\")\n return false;\n int N = S.size();\n\n \n for (int i = 1; i < N; i++) {\n for (auto l : Logical[i]) {\n if (is_sameST(S, l)) {\n print(i);\n return true;\n }\n }\n }\n print(N);\n\n return true;\n}\n\nint main() {\n ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n\n int N=15;\n vector<vector<string>> Logical(N + 1);\n Logical[1] = {\"a\", \"b\", \"c\", \"d\", \"0\", \"1\"};\n\n for (int i = 2; i < N + 1; i++) {\n for (auto l : Logical[i - 1]) {\n Logical[i].push_back(\"-\" + l);\n }\n for (int j = 1; j < i - 3; j++) {\n for (auto l1 : Logical[j]) {\n for (auto l2 : Logical[i - 3 - j]) {\n Logical[i].push_back(\"(\" + l1 + \"*\" + l2 + \")\");\n Logical[i].push_back(\"(\" + l1 + \"^\" + l2 + \")\");\n }\n }\n }\n }\n while (solve(Logical))\n ;\n}\n\n////////////////////print/////////////////////////\n// 1次元ベクトルを出力する\ntemplate <typename T> void print(vector<T> A) {\n if (A.size() == 0) {\n return;\n }\n for (size_t i = 0; i < A.size() - 1; i++) {\n cout << A[i] << ' ';\n }\n cout << A[A.size() - 1] << endl;\n return;\n}\n\n// 2次元ベクトルを出力する\ntemplate <typename T> void print(vector<vector<T>> &F) {\n for (size_t i = 0; i < F.size(); i++) {\n for (size_t j = 0; j < F[i].size(); j++) {\n cout << F[i][j];\n if (j < F[i].size() - 1) {\n cout << ' ';\n }\n }\n cout << endl;\n }\n}\n\n// 空白行を出力するprint\nvoid print() { cout << endl; }\n\n// 数値・文字列を空白区切りで出力する. print(a,b)など\ntemplate <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {\n cout << head;\n if (sizeof...(tail) != 0)\n cout << \" \";\n print(forward<Tail>(tail)...);\n}\n\nvoid print(string S) { cout << S << endl; }\n\n//////////////出力関連\n\ninline void Yes(bool f) {\n if (f) {\n cout << \"Yes\" << endl;\n } else {\n cout << \"No\" << endl;\n }\n}","accuracy":1,"time_ms":1370,"memory_kb":98536,"score_of_the_acc":-0.949,"final_rank":17},{"submission_id":"aoj_1620_10630583","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nusing ll =long long;\n\n\nll a=0,b=0,c=0,d=0;\nll eval(string S){\n if(S==\"a\"){\n return a;\n }\n else if(S==\"b\"){\n return b;\n }\n else if(S==\"c\"){\n return c;\n }\n else if(S==\"d\"){\n return d;\n }\n else if(S==\"0\"){\n return 0;\n }\n else if(S==\"1\"){\n return (1<<16)-1;\n }\n else if(S[0]=='-'){\n return (1<<16)-1-eval(S.substr(1,S.size()-1));\n }\n else{\n ll k=0;\n for(ll i=1;i<S.size();i++){\n if(S[i]=='(')k++;\n else if(S[i]==')')k--;\n else if(S[i]=='*'&&k==0){\n return eval(S.substr(1,i-1))&eval(S.substr(i+1,S.size()-i-2));\n }\n else if(S[i]=='^'&&k==0){\n return eval(S.substr(1,i-1))^eval(S.substr(i+1,S.size()-i-2));\n }\n }\n }\n return 0;\n}\n\nmap<ll,ll> AN;\n\n\nvoid init(){\n for(int i=0;i<16;i++){\n a*=2;\n b*=2;\n c*=2;\n d*=2;\n if(i%16<8)a++;\n if(i%8<4)b++;\n if(i%4<2)c++;\n if(i%2<1)d++;\n }\n\n priority_queue<pair<ll,string>,vector<pair<ll,string>>,greater<pair<ll,string>>> Q;\n Q.push({1,\"0\"});\n Q.push({1,\"1\"});\n Q.push({1,\"a\"});\n Q.push({1,\"b\"});\n Q.push({1,\"c\"});\n Q.push({1,\"d\"});\n // AN[eval(\"0\")]=1;\n // AN[eval(\"1\")]=1;\n // AN[eval(\"a\")]=1;\n // AN[eval(\"b\")]=1;\n // AN[eval(\"c\")]=1;\n // AN[eval(\"d\")]=1;\n set<string> seen;\n ll MX=15;\n while(!Q.empty()){\n auto [n,s]=Q.top();\n Q.pop();\n // cout<<AN.size()<<endl;\n if(seen.count(s))continue;\n seen.insert(s);\n if(AN.count(eval(s)))continue;\n AN[eval(s)]=n;\n string ns=\"-\"+s;\n if(!AN.count(eval(ns))&&ns.size()<15){\n Q.push({ns.size(),ns});\n }\n for(auto ss:seen){\n ns=\"(\"+ss+\"^\"+s+\")\";\n if(!AN.count(eval(ns))&&ns.size()<15){\n Q.push({ns.size(),ns});\n }\n ns=\"(\"+ss+\"*\"+s+\")\";\n if(!AN.count(eval(ns))&&ns.size()<15){\n Q.push({ns.size(),ns});\n }\n ns=\"(\"+s+\"^\"+ss+\")\";\n if(!AN.count(eval(ns))&&ns.size()<15){\n Q.push({ns.size(),ns});\n }\n ns=\"(\"+s+\"*\"+ss+\")\";\n if(!AN.count(eval(ns))&&ns.size()<15){\n Q.push({ns.size(),ns});\n }\n }\n }\n}\n\n\nvoid solve(string S){\n if(!AN.count(eval(S))){\n AN[eval(S)]=S.size();\n }\n cout<<AN[eval(S)]<<\"\\n\";\n}\n\n\nint main(){\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n init();\n\n string S;\n while(cin>>S,S!=\".\")solve(S);\n}","accuracy":1,"time_ms":3730,"memory_kb":4264,"score_of_the_acc":-1.0048,"final_rank":19},{"submission_id":"aoj_1620_10582668","code_snippet":"#pragma region Macros\n#include <bits/stdc++.h>\n\n#include <atcoder/all>\nusing namespace std;\nusing namespace atcoder;\nusing lint = long long;\nusing mint = modint998244353;\nusing ull = unsigned long long;\nusing ld = long double;\nusing int128 = __int128_t;\n#define all(x) (x).begin(), (x).end()\n#define EPS 1e-8\n#define uniqv(v) v.erase(unique(all(v)), v.end())\n#define OVERLOAD_REP(_1, _2, _3, name, ...) name\n#define REP1(i, n) for (auto i = std::decay_t<decltype(n)>{}; (i) != (n); ++(i))\n#define REP2(i, l, r) for (auto i = (l); (i) != (r); ++(i))\n#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)\n#define log(x) cout << x << endl\n#define logfixed(x) cout << fixed << setprecision(10) << x << endl;\n#define logy(bool) \\\n if (bool) { \\\n cout << \"Yes\" << endl; \\\n } else { \\\n cout << \"No\" << endl; \\\n }\n\nostream &operator<<(ostream &dest, __int128_t value) {\n ostream::sentry s(dest);\n if (s) {\n __uint128_t tmp = value < 0 ? -value : value;\n char buffer[128];\n char *d = end(buffer);\n do {\n --d;\n *d = \"0123456789\"[tmp % 10];\n tmp /= 10;\n } while (tmp != 0);\n if (value < 0) {\n --d;\n *d = '-';\n }\n int len = end(buffer) - d;\n if (dest.rdbuf()->sputn(d, len) != len) {\n dest.setstate(ios_base::badbit);\n }\n }\n return dest;\n}\n\ntemplate <typename T>\nostream &operator<<(ostream &os, const vector<T> &v) {\n for (int i = 0; i < (int)v.size(); i++) {\n os << v[i] << (i + 1 != (int)v.size() ? \" \" : \"\");\n }\n return os;\n}\n\ntemplate <typename T>\nostream &operator<<(ostream &os, const set<T> &set_var) {\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\n os << *itr;\n ++itr;\n if (itr != set_var.end()) os << \" \";\n itr--;\n }\n return os;\n}\n\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\n os << itr->first << \" -> \" << itr->second << \"\\n\";\n }\n return os;\n}\n\ntemplate <typename T, typename U>\nostream &operator<<(ostream &os, const pair<T, U> &pair_var) {\n os << \"(\" << pair_var.first << \", \" << pair_var.second << \")\";\n return os;\n}\n\nvoid out() { cout << '\\n'; }\ntemplate <class T, class... Ts>\nvoid out(const T &a, const Ts &...b) {\n cout << a;\n (cout << ... << (cout << ' ', b));\n cout << '\\n';\n}\n\ntemplate <typename T>\nistream &operator>>(istream &is, vector<T> &v) {\n for (T &in : v) is >> in;\n return is;\n}\n\ninline void in(void) { return; }\ntemplate <typename First, typename... Rest>\nvoid in(First &first, Rest &...rest) {\n cin >> first;\n in(rest...);\n return;\n}\n\ntemplate <typename T>\nbool chmax(T &a, const T &b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <typename T>\nbool chmin(T &a, const T &b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\n\nvector<lint> dx8 = {1, 1, 0, -1, -1, -1, 0, 1};\nvector<lint> dy8 = {0, 1, 1, 1, 0, -1, -1, -1};\nvector<lint> dx4 = {1, 0, -1, 0};\nvector<lint> dy4 = {0, 1, 0, -1};\n\n#pragma endregion\n\nbool operate(bool A, char c, bool B) {\n if (c == '^') return A ^ B;\n if (c == '*') return A & B;\n return 1;\n}\n\nbool eval(string s, bool a, bool b, bool c, bool d) {\n // cout << s << endl;\n int l = s.size();\n if (s == \"0\") return 0;\n if (s == \"1\") return 1;\n if (s == \"a\") return a;\n if (s == \"b\") return b;\n if (s == \"c\") return c;\n if (s == \"d\") return d;\n\n // is (E*F) or 1 or 0\n if (s[0] == '(' && s[l - 1] == ')') {\n int x = 0;\n int op;\n bool L, R;\n for (int p = 1; p < l; ++p) {\n if (s[p] == '(') x++;\n if (s[p] == ')') x--;\n if (x == 0 && s[p] != '-') {\n L = eval(s.substr(1, p), a, b, c, d);\n op = s[p + 1];\n R = eval(s.substr(p + 2, l - p - 3), a, b, c, d);\n return operate(L, op, R);\n }\n }\n assert(false);\n\n } else if (s[0] == '-') {\n return !eval(s.substr(1, l - 1), a, b, c, d);\n } else {\n assert(false);\n }\n}\n\nint main() {\n cin.tie(0)->sync_with_stdio(0);\n string s;\n\n vector<vector<string>> create(17, vector<string>());\n queue<string> que;\n\n create[1] = {\"a\", \"b\", \"c\", \"d\", \"1\", \"0\"};\n for (auto v : create[1]) {\n que.push(v);\n }\n\n auto hash = [&](string s) -> int {\n int h = 0;\n for (int bit = 0; bit < (1 << 4); ++bit) {\n int a = bit & 1, b = (bit >> 1) & 1;\n int c = (bit >> 2) & 1, d = (bit >> 3) & 1;\n h += (1 << bit) * (int)eval(s, a, b, c, d);\n }\n return h;\n };\n\n map<int, int> smallest;\n map<int, string> ans;\n for (auto v : create[1]) {\n smallest[hash(v)] = 1;\n ans[hash(v)] = v;\n }\n\n for (int size = 1; size <= 16; ++size)\n for (int pos = 0; pos < create[size].size(); ++pos) {\n string E = create[size][pos];\n // cout << E << endl;\n // -E\n if (1 + size <= 16) {\n string onew = \"-\" + E;\n if (!smallest.contains(hash(onew)) || smallest[hash(onew)] > 1 + size) {\n create[1 + size].push_back(onew);\n smallest[hash(onew)] = 1 + size;\n ans[hash(onew)] = onew;\n }\n }\n // (E op F)\n for (int i = 1; i <= size; ++i) {\n if (3 + size + i > 16) break;\n int new_size = 3 + size + i;\n for (auto F : create[i]) {\n string new1 = '(' + E + '^' + F + ')';\n string new2 = '(' + E + '*' + F + ')';\n if (!smallest.contains(hash(new1)) || smallest[hash(new1)] > new_size) {\n create[new_size].push_back(new1);\n smallest[hash(new1)] = new_size;\n ans[hash(new1)] = new1;\n }\n if (!smallest.contains(hash(new2)) || smallest[hash(new2)] > new_size) {\n create[new_size].push_back(new2);\n smallest[hash(new2)] = new_size;\n ans[hash(new2)] = new2;\n }\n }\n }\n }\n\n while (1) {\n in(s);\n if (s == \".\") break;\n\n cout << smallest[hash(s)] << endl;\n // cout << ans[hash(s)] << endl;\n }\n}","accuracy":1,"time_ms":120,"memory_kb":4096,"score_of_the_acc":-0.0333,"final_rank":7},{"submission_id":"aoj_1620_10545893","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef int ll;\ntypedef unsigned long long ull;\ntypedef long double ld;\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\n#define rrep(i,start,end) for (ll i = start;i >= (ll)(end);i--)\n#define repn(i,end) for(ll i = 0; i <= (ll)(end); i++)\n#define reps(i,start,end) for(ll i = start; i < (ll)(end); i++)\n#define repsn(i,start,end) for(ll i = start; i <= (ll)(end); i++)\n#define each(p,a) for(auto &p:a)\ntypedef vector<ll> vll;\ntypedef vector<pair<ll ,ll>> vpll;\ntypedef vector<vector<ll>> vvll;\ntypedef set<ll> sll;\ntypedef map<ll , ll> mpll;\ntypedef pair<ll ,ll> pll;\ntypedef tuple<ll , ll , ll> tpl3;\n#define LL(...) ll __VA_ARGS__; input(__VA_ARGS__)\n#define LD(...) ld __VA_ARGS__; input(__VA_ARGS__)\n#define Str(...) string __VA_ARGS__; input(__VA_ARGS__)\n#define Ch(...) char __VA_ARGS__; input(__VA_ARGS__)\n#define all(a) (a).begin(),(a).end()\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\n#define sz(x) (ll)x.size()\n// << std::fixed << std::setprecision(10)\nconst ll INF = 1LL << 30;\nconst ld EPS = 1e-9;\n \nll lceil(ll a,ll b){if(a%b==0){return a/b;}if(a>=0){return (a/b)+1;}else{return -((-a)/b);}}\nll lfloor(ll a,ll b){if(a%b==0){return a/b;}if(a>=0){return (a/b);}else{return -((-a)/b)-1;}}\ninline ll positive_mod(ll a,ll m){return (a % m + m)%m;}\ninline ll popcnt(ull a){ return __builtin_popcountll(a);}\n//0indexed\ninline ll topbit(ll a){assert(a != 0);return 63 - __builtin_clzll(a);}\ninline ll smlbit(ll a){assert(a != 0);return __builtin_ctzll(a);}\ntemplate<class T> bool chmin(T& a, T b){if(a > b){a = b;return true;}return false;}\ntemplate<class T> bool chmax(T& a, T b){if(a < b){a = b;return true;}return false;}\ntemplate<typename T> std::istream &operator>>(std::istream&is,std::vector<T>&v){for(T &in:v){is>>in;}return is;}\ntemplate<typename T> std::ostream &operator<<(std::ostream&os,const std::vector<T>&v){for(auto it=std::begin(v);it!=std::end(v);){os<<*it<<((++it)!=std::end(v)?\" \":\"\");}return os;}\ntemplate<typename T1, typename T2>std::ostream &operator<< (std::ostream &os, std::pair<T1,T2> p){os << \"{\" << p.first << \",\" << p.second << \"}\";return os;}\ntemplate<class... T>void input(T&... a){(cin >> ... >> a);}\nvoid print(){cout << endl;}\ntemplate<class T, class... Ts>void print(const T& a, const Ts&... b){cout << a;((cout << ' ' << b), ...);cout << endl;}\ntemplate<class T> void pspace(const T& a){ cout << a << ' ';}\nvoid perr(){cerr << endl;}\ntemplate<class T, class... Ts>void perr(const T& a, const Ts&... b){cerr << a;((cerr << ' ' << b), ...);cerr << endl;}\nvoid yes(bool i = true){ return print(i?\"yes\":\"no\"); }\nvoid Yes(bool i = true){ return print(i?\"Yes\":\"No\"); }\nvoid YES(bool i = true){ return print(i?\"YES\":\"NO\"); }\ntemplate <class T> vector<T> &operator++(vector<T> &v) {for(auto &e : v) e++;return v;}\ntemplate <class T> vector<T> operator++(vector<T> &v, signed) {auto res = v;for(auto &e : v) e++;return res;}\ntemplate <class T> vector<T> &operator--(vector<T> &v) {for(auto &e : v) e--;return v;}\ntemplate <class T> vector<T> operator--(vector<T> &v, signed) {auto res = v;for(auto &e : v) e--;return res;}\n//grid探索用\nvector<ll> _ta = {0,0,1,-1,1,1,-1,-1};\nvector<ll> _yo = {1,-1,0,0,1,-1,1,-1};\nbool isin(ll now_i,ll now_j,ll h,ll w){return (0<=now_i && now_i < h && 0 <= now_j && now_j < w);}\n \nll lpow(ll x,ll n){ll ans = 1;while(n >0){if(n & 1)ans *= x;x *= x;n >>= 1;}return ans;}\nll Modlpow(ll x,ll n,ll m){ll ans = 1;ll a = x%m;while(n >0){if(n & 1){ans *= a;ans%= m;}a *= a;a %= m;n >>= 1;}return ans;} \nconst ll MOD9 = 998244353LL;\nconst ll MOD10 = 1000000007LL;\n\ntypedef string::const_iterator State;\n\nclass ParseError {};\n//プロトタイプ宣言\nll expression(State &begin);\n\nstruct node{\n\tchar ch; // charがいいときもある\n\tvector<ll> to;\n};\nvector<node>nodes;\n\nset<char> variable = {'0','1','a','b','c','d'};\n//四則演算の式を構文解析し評価結果を返す。\nll expression(State &begin){\n if(variable.count(*begin)){\n ll ret = nodes.size();\n nodes.push_back({*begin,{}});\n begin++;\n return ret;\n }\n if(*begin== '-'){\n ll ret = nodes.size();\n nodes.push_back({'-',{}});\n begin++;\n ll nxt = expression(begin);\n nodes[ret].to.push_back(nxt);\n nodes[nxt].to.push_back(ret);\n return ret;\n }else if(*begin == '('){\n begin++;\n ll before = expression(begin);\n ll ret = nodes.size();\n assert(*begin == '^' or *begin == '*');\n nodes.push_back({*begin,{}});\n begin++;\n ll after = expression(begin);\n nodes[ret].to.push_back(before);\n nodes[ret].to.push_back(after);\n nodes[before].to.push_back(ret);\n nodes[after].to.push_back(ret);\n assert(*begin == ')');\n begin++;\n return ret;\n }\n return -1;\n}\n\n// map<string,pair<ll,vector<node>>>mp;\n\nvector<ll>states(1LL<<16,INF);\n\n\nll dfs(vll&val,ll v,ll par){\n char c = nodes[v].ch;\n if(variable.count(c)){\n if(c== '0' or c == '1'){\n return c-'0';\n }else{\n return val[c-'a'];\n }\n }else if(c == '-'){\n vll tmp;\n each(p,nodes[v].to)if(p != par){\n tmp.push_back(dfs(val,p,v));\n }\n assert(sz(tmp) ==1);\n return !tmp[0];\n }else {\n assert(c == '*' or c == '^');\n vll tmp;\n each(p,nodes[v].to)if(p != par){\n tmp.push_back(dfs(val,p,v));\n }\n assert(sz(tmp) ==2);\n if(c == '*'){\n return tmp[0]&tmp[1];\n }else{\n return tmp[0]^tmp[1];\n }\n }\n}\n\nvoid solve(string s){\n nodes.clear();\n State begin = s.begin();\n ll root = expression(begin);\n assert(begin== s.end());\n vll val(4);\n // vector<ll> found(n,0);//n頂点\n\n ll nowstate = 0;\n rep(i,1<<4){\n rep(j,4){\n if(i >> j &1){\n val[j] = 1;\n }else{\n val[j] = 0;\n }\n }\n nowstate+=dfs(val,root,-1) << i;\n }\n\n // assert(states.count(nowstate));\n cout << min(states[nowstate],sz(s)) << endl;\n\n}\n \nint main(){\n ios::sync_with_stdio(false);cin.tie(nullptr);\n vector<vector<string>> sable(15);\n sable[0].push_back(\"a\");\n sable[0].push_back(\"b\");\n sable[0].push_back(\"c\");\n sable[0].push_back(\"d\");\n sable[0].push_back(\"0\");\n sable[0].push_back(\"1\");\n\n ll sablesiz = sz(sable[0]);\n ll rem = 1LL << 16;\n rep(i,15){\n // cerr << i << endl;\n if(rem == 0)break;\n if(i != 0){\n // - をつけるだけ\n each(p,sable[i-1])if(p[0] != '-' && p != \"0\" && p != \"1\"){\n sable[i].push_back(string('-'+p));\n }\n //演算\n // (u * v)\n // (u ^ v)\n \n if(i >=3){\n for(ll j = 1;i+1-j-3 >=1;j++){\n ll k = i+1 -3-j;\n // assert(k >= 1);\n each(p,sable[j-1]){\n each(q,sable[k-1]){\n if((p == \"0\" or p == \"1\") && (q== \"0\" or q == \"1\"))continue;\n sable[i].push_back('('+p+'*'+q+')');\n sable[i].push_back('('+p+'^'+q+')');\n }\n }\n }\n }\n sablesiz += sz(sable[i]);\n }\n\n vll val(4);\n each(s,sable[i]){\n // assert(sz(s) == i+1);\n State begin = s.begin();\n ll root = expression(begin);\n // mp[s] = {root,nodes};\n // assert(begin== s.end());\n\n ll state = 0;\n\n rep(i,1<<4){\n rep(j,4){\n if(i >> j &1){\n val[j] = 1;\n }else{\n val[j] = 0;\n }\n }\n state += dfs(val,root,-1) << i;\n }\n if(states[state] == INF){\n rem--;\n }\n chmin(states[state],i+1);\n nodes.clear();\n }\n \n }\n\n // rep(i,6){\n // each(p,sable[i]){\n // cout << p << endl;\n // }\n // }\n\n\n // cerr << sablesiz << endl;\n\n\n\n\n while(true){\n Str(s);\n if(s ==\".\")break;\n solve(s);\n }\n}","accuracy":1,"time_ms":2470,"memory_kb":50368,"score_of_the_acc":-0.9491,"final_rank":18},{"submission_id":"aoj_1620_10544739","code_snippet":"#line 1 \"AOJ/ICPC2017/e.cpp\"\n#include <bits/stdc++.h>\nusing namespace std;\n\n#line 2 \"/opt/ei1333_s_library/math/combinatorics/montgomery-mod-int.hpp\"\n\ntemplate <uint32_t mod_, bool fast = false>\nstruct MontgomeryModInt {\n private:\n using mint = MontgomeryModInt;\n using i32 = int32_t;\n using i64 = int64_t;\n using u32 = uint32_t;\n using u64 = uint64_t;\n\n static constexpr u32 get_r() {\n u32 ret = mod_;\n for (i32 i = 0; i < 4; i++) ret *= 2 - mod_ * ret;\n return ret;\n }\n\n static constexpr u32 r = get_r();\n\n static constexpr u32 n2 = -u64(mod_) % mod_;\n\n static_assert(r * mod_ == 1, \"invalid, r * mod != 1\");\n static_assert(mod_ < (1 << 30), \"invalid, mod >= 2 ^ 30\");\n static_assert((mod_ & 1) == 1, \"invalid, mod % 2 == 0\");\n\n u32 x;\n\n public:\n MontgomeryModInt() : x{} {}\n\n MontgomeryModInt(const i64 &a)\n : x(reduce(u64(fast ? a : (a % mod() + mod())) * n2)) {}\n\n static constexpr u32 reduce(const u64 &b) {\n return u32(b >> 32) + mod() - u32((u64(u32(b) * r) * mod()) >> 32);\n }\n\n mint &operator+=(const mint &p) {\n if (i32(x += p.x - 2 * mod()) < 0) x += 2 * mod();\n return *this;\n }\n\n mint &operator-=(const mint &p) {\n if (i32(x -= p.x) < 0) x += 2 * mod();\n return *this;\n }\n\n mint &operator*=(const mint &p) {\n x = reduce(u64(x) * p.x);\n return *this;\n }\n\n mint &operator/=(const mint &p) {\n *this *= p.inv();\n return *this;\n }\n\n mint operator-() const { return mint() - *this; }\n\n mint operator+(const mint &p) const { return mint(*this) += p; }\n\n mint operator-(const mint &p) const { return mint(*this) -= p; }\n\n mint operator*(const mint &p) const { return mint(*this) *= p; }\n\n mint operator/(const mint &p) const { return mint(*this) /= p; }\n\n bool operator==(const mint &p) const {\n return (x >= mod() ? x - mod() : x) == (p.x >= mod() ? p.x - mod() : p.x);\n }\n\n bool operator!=(const mint &p) const {\n return (x >= mod() ? x - mod() : x) != (p.x >= mod() ? p.x - mod() : p.x);\n }\n\n u32 val() const {\n u32 ret = reduce(x);\n return ret >= mod() ? ret - mod() : ret;\n }\n\n mint pow(u64 n) const {\n mint ret(1), mul(*this);\n while (n > 0) {\n if (n & 1) ret *= mul;\n mul *= mul;\n n >>= 1;\n }\n return ret;\n }\n\n mint inv() const { return pow(mod() - 2); }\n\n friend ostream &operator<<(ostream &os, const mint &p) {\n return os << p.val();\n }\n\n friend istream &operator>>(istream &is, mint &a) {\n i64 t;\n is >> t;\n a = mint(t);\n return is;\n }\n\n static constexpr u32 mod() { return mod_; }\n};\n\ntemplate <uint32_t mod>\nusing modint = MontgomeryModInt<mod>;\nusing modint998244353 = modint<998244353>;\nusing modint1000000007 = modint<1000000007>;\n#line 1 \"/opt/ei1333_s_library/math/fft/superset-zeta-moebius-transform.hpp\"\n/**\n * @brief Superset Zeta/Moebius Transform (上位集合のゼータ/メビウス変換)\n */\ntemplate <typename T>\nvoid superset_zeta_transform(vector<T> &f) {\n const int n = (int)f.size();\n assert((n & (n - 1)) == 0);\n for (int i = 1; i < n; i <<= 1) {\n for (int j = 0; j < n; j += i << 1) {\n for (int k = 0; k < i; k++) {\n f[j + k] += f[j + k + i];\n }\n }\n }\n}\n\ntemplate <typename T>\nvoid superset_moebius_transform(vector<T> &f) {\n const int n = (int)f.size();\n assert((n & (n - 1)) == 0);\n for (int i = 1; i < n; i <<= 1) {\n for (int j = 0; j < n; j += i << 1) {\n for (int k = 0; k < i; k++) {\n f[j + k] -= f[j + k + i];\n }\n }\n }\n}\n#line 2 \"/opt/ei1333_s_library/math/fft/bitwise-and-convolution.hpp\"\n\n/**\n * @brief Bitwise And Convolution (Bitwise-AND畳み込み)\n */\ntemplate <typename T>\nvector<T> bitwise_and_convolution(vector<T> f, vector<T> g) {\n const int n = (int)f.size();\n assert(f.size() == g.size());\n assert((n & (n - 1)) == 0);\n superset_zeta_transform(f);\n superset_zeta_transform(g);\n for (int i = 0; i < n; i++) f[i] *= g[i];\n superset_moebius_transform(f);\n return f;\n}\n#line 1 \"/opt/ei1333_s_library/math/fft/fast-walsh-hadamard-transform.hpp\"\n/**\n * @brief Fast Walsh Hadamard Transform (高速ウォルシュアダマール変換)\n */\ntemplate <typename T>\nvoid fast_walsh_hadamard_transform(vector<T> &f, bool inv = false) {\n const int n = (int)f.size();\n assert((n & (n - 1)) == 0);\n for (int i = 1; i < n; i <<= 1) {\n for (int j = 0; j < n; j += i << 1) {\n for (int k = 0; k < i; k++) {\n T s = f[j + k], t = f[j + k + i];\n f[j + k] = s + t;\n f[j + k + i] = s - t;\n }\n }\n }\n if (inv) {\n T inv_n = T(1) / n;\n for (auto &x : f) x *= inv_n;\n }\n}\n#line 2 \"/opt/ei1333_s_library/math/fft/bitwise-xor-convolution.hpp\"\n\n/**\n * @brief Bitwise Xor Convolution (Bitwise-XOR畳み込み)\n */\ntemplate <typename T>\nvector<T> bitwise_xor_convolution(vector<T> f, vector<T> g) {\n const int n = (int)f.size();\n assert(f.size() == g.size());\n assert((n & (n - 1)) == 0);\n fast_walsh_hadamard_transform(f, false);\n fast_walsh_hadamard_transform(g, false);\n for (int i = 0; i < n; i++) f[i] *= g[i];\n fast_walsh_hadamard_transform(f, true);\n return f;\n}\n#line 7 \"AOJ/ICPC2017/e.cpp\"\nusing mint = modint998244353;\n\nint parse(string s) {\n if (s == \"0\") {\n return 0;\n }\n if (s == \"1\") {\n return (1 << 16) - 1;\n }\n if (s == \"a\") {\n int res = 0;\n for (int d = 0; d < 16; ++d) {\n if (d >> 3 & 1) {\n res += 1 << d;\n }\n }\n return res;\n }\n if (s == \"b\") {\n int res = 0;\n for (int d = 0; d < 16; ++d) {\n if (d >> 2 & 1) {\n res += 1 << d;\n }\n }\n return res;\n }\n if (s == \"c\") {\n int res = 0;\n for (int d = 0; d < 16; ++d) {\n if (d >> 1 & 1) {\n res += 1 << d;\n }\n }\n return res;\n }\n if (s == \"d\") {\n int res = 0;\n for (int d = 0; d < 16; ++d) {\n if (d >> 0 & 1) {\n res += 1 << d;\n }\n }\n return res;\n }\n if (s[0] == '-') {\n return (1 << 16) - 1 - parse(string(s.begin() + 1, s.end()));\n }\n int stack = 0;\n for (int i = 0; i < s.size(); ++i) {\n if (s[i] == '(') {\n ++stack;\n }\n if (s[i] == ')') {\n --stack;\n }\n if (stack == 1 && s[i] == '^') {\n return parse(string(s.begin() + 1, s.begin() + i)) ^\n parse(string(s.begin() + i + 1, s.end() - 1));\n }\n if (stack == 1 && s[i] == '*') {\n return parse(string(s.begin() + 1, s.begin() + i)) &\n parse(string(s.begin() + i + 1, s.end() - 1));\n }\n }\n exit(1);\n}\n\nbool solve(vector<vector<mint>> &table) {\n string s;\n cin >> s;\n if (s == \".\") {\n return false;\n }\n int n = parse(s);\n int ans = 1;\n while (table[ans][n] == 0) {\n ++ans;\n }\n cout << ans << endl;\n return true;\n}\n\nvector<vector<mint>> precalc() {\n vector<vector<mint>> res(17, vector<mint>(1 << 16));\n res[1][parse(string(\"0\"))] = 1;\n res[1][parse(string(\"1\"))] = 1;\n res[1][parse(string(\"a\"))] = 1;\n res[1][parse(string(\"b\"))] = 1;\n res[1][parse(string(\"c\"))] = 1;\n res[1][parse(string(\"d\"))] = 1;\n for (int i = 2; i < 17; ++i) {\n for (int n = 0; n < (1 << 16); ++n) {\n if (res[i - 1][n] != 0) {\n res[i][n] = 1;\n res[i][(1 << 16) - 1 - n] = 1;\n }\n }\n if (i < 5) {\n continue;\n }\n for (int j = 1; j < i - 3; ++j) {\n auto tmp = bitwise_xor_convolution(res[j], res[i - 3 - j]);\n for (int n = 0; n < (1 << 16); ++n) {\n if (tmp[n] != 0) {\n res[i][n] = 1;\n }\n }\n }\n for (int j = 1; j < i - 3; ++j) {\n auto tmp = bitwise_and_convolution(res[j], res[i - 3 - j]);\n for (int n = 0; n < (1 << 16); ++n) {\n if (tmp[n] != 0) {\n res[i][n] = 1;\n }\n }\n }\n }\n return res;\n}\n\nint main(void) {\n auto table = precalc();\n while (solve(table))\n ;\n return 0;\n}","accuracy":1,"time_ms":170,"memory_kb":8204,"score_of_the_acc":-0.072,"final_rank":10},{"submission_id":"aoj_1620_9625720","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef vector<ll> vi;\ntypedef vector<vi> vvi;\ntypedef pair<ll,ll> pi;\n#define FOR(i,l,r) for(ll i=l;i<r;i++)\n#define REP(i,n) FOR(i,0,n)\n#define ALL(A) A.begin(),A.end()\n#define LB(A,x) (lower_bound(ALL(A),x)-A.begin())\ntemplate<typename T>bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}\ntemplate<typename T>bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}\nint main(){\n vi ans(65536,1e18);\n ans[0]=ans[43690]=ans[52428]=ans[61680]=ans[65280]=ans[65535]=1;\n priority_queue<pi>Q;\n Q.emplace(pi(-1,0));\n Q.emplace(pi(-1,43690));\n Q.emplace(pi(-1,52428));\n Q.emplace(pi(-1,61680));\n Q.emplace(pi(-1,65280));\n Q.emplace(pi(-1,65535));\n set<ll>S;\n while(Q.size()){\n ll d=-Q.top().first;\n ll v=Q.top().second;\n Q.pop();\n if(d!=ans[v]||d>16)continue;\n S.insert(v);\n if(chmin(ans[65535-v],d+1))Q.emplace(pi(-d-1,65535-v));\n for(auto u:S){\n if(chmin(ans[u^v],d+ans[u]+3))Q.emplace(pi(-ans[u^v],u^v));\n if(chmin(ans[u&v],d+ans[u]+3))Q.emplace(pi(-ans[u&v],u&v));\n }\n }\n while(1){\n string S;cin>>S;\n if(S==\".\")return 0;\n ll N=S.size();\n vi par(N);\n {\n stack<ll>st;\n REP(i,N){\n if(S[i]=='(')st.emplace(i);\n if(S[i]==')')par[st.top()]=i,st.pop();\n }\n }\n ll a=0;\n function<ll(ll,ll,ll)>f=[&](ll l,ll r,ll i){\n if(r-l==1){\n if(S[l]=='1')return 1LL;\n if(S[l]=='0')return 0LL;\n return (i>>(S[l]-'a'))%2;\n }\n if(S[l]=='-')return 1-f(l+1,r,i);\n assert(S[l]=='('&&par[l]==r-1);\n ll lev=0,t=l+1;\n while(lev||(S[t]!='*'&&S[t]!='^')){\n if(S[t]=='(')lev++;\n if(S[t]==')')lev--;\n t++;\n }\n ll x=f(l+1,t,i),y=f(t+1,r-1,i);\n if(S[t]=='^')return x^y;\n return x&y;\n };\n REP(i,16)if(f(0,N,i))a+=1<<i;\n cout<<ans[a]<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":6872,"score_of_the_acc":-0.0235,"final_rank":5},{"submission_id":"aoj_1620_9408035","code_snippet":"#ifndef _GLIBCXX_NO_ASSERT\n#include <cassert>\n#endif\n#include <cctype>\n#include <cerrno>\n#include <cfloat>\n#include <ciso646>\n#include <climits>\n#include <clocale>\n#include <cmath>\n#include <csetjmp>\n#include <csignal>\n#include <cstdarg>\n#include <cstddef>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#if __cplusplus >= 201103L\n#include <ccomplex>\n#include <cfenv>\n#include <cinttypes>\n#include <cstdbool>\n#include <cstdint>\n#include <ctgmath>\n#include <cwchar>\n#include <cwctype>\n#endif\n// C++\n#include <algorithm>\n#include <bitset>\n#include <complex>\n#include <deque>\n#include <exception>\n#include <fstream>\n#include <functional>\n#include <iomanip>\n#include <ios>\n#include <iosfwd>\n#include <iostream>\n#include <istream>\n#include <iterator>\n#include <limits>\n#include <list>\n#include <locale>\n#include <map>\n#include <memory>\n#include <new>\n#include <numeric>\n#include <ostream>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <stdexcept>\n#include <streambuf>\n#include <string>\n#include <typeinfo>\n#include <utility>\n#include <valarray>\n#include <vector>\n#if __cplusplus >= 201103L\n#include <array>\n#include <atomic>\n#include <chrono>\n#include <condition_variable>\n#include <forward_list>\n#include <future>\n#include <initializer_list>\n#include <mutex>\n#include <random>\n#include <ratio>\n#include <regex>\n#include <scoped_allocator>\n#include <system_error>\n#include <thread>\n#include <tuple>\n#include <type_traits>\n#include <typeindex>\n#include <unordered_map>\n#include <unordered_set>\n\n#endif\nusing namespace std;\nusing ll = long long;\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define all(v) v.begin(), v.end()\ntemplate <class T, class U>\ninline bool chmax(T &a, U b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T, class U>\ninline bool chmin(T &a, U b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\nconstexpr int INF = 1001001001;\nconstexpr int64_t llINF = 3000000000000000000;\nconst double pi = acos(-1);\nstruct linear_sieve {\n vector<int> least_factor, prime_list;\n linear_sieve(int n) : least_factor(n + 1, 0) {\n for (int i = 2; i <= n; i++) {\n if (least_factor[i] == 0) {\n least_factor[i] = i;\n prime_list.push_back(i);\n }\n for (int p : prime_list) {\n if (ll(i) * p > n || p > least_factor[i]) break;\n least_factor[i * p] = p;\n }\n }\n }\n};\n\nll extgcd(ll a, ll b, ll &x, ll &y) {\n // ax+by=gcd(|a|,|b|)\n if (a < 0 || b < 0) {\n ll d = extgcd(abs(a), abs(b), x, y);\n if (a < 0) x = -x;\n if (b < 0) y = -y;\n return d;\n }\n if (b == 0) {\n x = 1;\n y = 0;\n return a;\n }\n ll d = extgcd(b, a % b, y, x);\n y -= a / b * x;\n return d;\n}\nll modpow(ll a, ll b, ll m) {\n a %= m;\n ll res = 1 % m;\n while (b) {\n if (b & 1) {\n res *= a;\n res %= m;\n }\n a *= a;\n a %= m;\n b >>= 1;\n }\n return res;\n}\nll modinv(ll x, ll modulo) {\n ll a = x, b = modulo, u = 1, v = 0, t;\n while (b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return (u >= 0 ? u % modulo : (modulo - (-u) % modulo) % modulo);\n}\ntemplate <int modulo>\nstruct modint {\n int x;\n modint() : x(0) {}\n modint(int64_t y) : x(y >= 0 ? y % modulo : (modulo - (-y) % modulo) % modulo) {}\n modint &operator+=(const modint &p) {\n if ((x += p.x) >= modulo) x -= modulo;\n return *this;\n }\n modint &operator-=(const modint &p) {\n if ((x += modulo - p.x) >= modulo) x -= modulo;\n return *this;\n }\n modint &operator*=(const modint &p) {\n x = (int)(1LL * x * p.x % modulo);\n return *this;\n }\n modint &operator/=(const modint &p) {\n *this *= p.inv();\n return *this;\n }\n modint operator-() const { return modint(-x); }\n modint operator+(const modint &p) const { return modint(*this) += p; }\n modint operator-(const modint &p) const { return modint(*this) -= p; }\n modint operator*(const modint &p) const { return modint(*this) *= p; }\n modint operator/(const modint &p) const { return modint(*this) /= p; }\n bool operator==(const modint &p) const { return x == p.x; }\n bool operator!=(const modint &p) const { return x != p.x; }\n modint inv() const {\n int a = x, b = modulo, u = 1, v = 0, t;\n while (b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return modint(u);\n }\n modint pow(int64_t n) const {\n modint ret(1), mul(x);\n while (n > 0) {\n if (n & 1) ret *= mul;\n mul *= mul;\n n >>= 1;\n }\n return ret;\n }\n friend ostream &operator<<(ostream &os, const modint &p) { return os << p.x; }\n friend istream &operator>>(istream &is, modint &a) {\n int64_t t;\n is >> t;\n a = modint<modulo>(t);\n return (is);\n }\n int val() const { return x; }\n static constexpr int mod() { return modulo; }\n static constexpr int half() { return (modulo + 1) >> 1; }\n};\ntemplate <typename T>\nstruct Binomial {\n vector<T> inv, fact, factinv;\n Binomial(int n) {\n inv.resize(n + 1);\n fact.resize(n + 1);\n factinv.resize(n + 1);\n inv[0] = fact[0] = factinv[0] = 1;\n for (int i = 1; i <= n; i++) fact[i] = fact[i - 1] * i;\n factinv[n] = fact[n].inv();\n inv[n] = fact[n - 1] * factinv[n];\n for (int i = n - 1; i >= 1; i--) {\n factinv[i] = factinv[i + 1] * (i + 1);\n inv[i] = fact[i - 1] * factinv[i];\n }\n }\n T C(int n, int r) {\n if (n < 0 || n < r || r < 0) return 0;\n return fact[n] * factinv[n - r] * factinv[r];\n }\n T P(int n, int r) {\n if (n < 0 || n < r || r < 0) return 0;\n return fact[n] * factinv[n - r];\n }\n T H(int n, int r) {\n if (n == 0 && r == 0) return 1;\n if (n < 0 || r < 0) return 0;\n return r == 0 ? 1 : C(n + r - 1, r);\n }\n};\ntemplate <class T>\nstruct Matrix {\n int n;\n vector<vector<T>> m;\n Matrix() : Matrix(0) {}\n Matrix(int x) : Matrix(vector<vector<T>>(x, vector<T>(x, 0))) {}\n Matrix(const vector<vector<T>> &a) {\n n = a.size();\n m = a;\n }\n vector<T> &operator[](int i) { return m[i]; }\n const vector<T> &operator[](int i) const { return m[i]; }\n static Matrix identity(int x) {\n Matrix res(x);\n for (int i = 0; i < x; i++) res[i][i] = 1;\n return res;\n }\n Matrix operator+(const Matrix &a) const {\n Matrix x = (*this);\n return x += a;\n }\n Matrix operator*(const Matrix &a) const {\n Matrix x = (*this);\n return x *= a;\n }\n Matrix &operator+=(const Matrix &a) {\n Matrix res(n);\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n res[i][j] = m[i][j] + a[i][j];\n }\n }\n m = res.m;\n return *this;\n }\n Matrix &operator*=(const Matrix &a) {\n Matrix res(n);\n for (int i = 0; i < n; i++) {\n for (int k = 0; k < n; k++) {\n for (int j = 0; j < n; j++) {\n res[i][j] += m[i][k] * a[k][j];\n }\n }\n }\n m = res.m;\n return *this;\n }\n Matrix pow(ll b) const {\n Matrix x = *this, res = identity(n);\n while (b) {\n if (b & 1) {\n res *= x;\n }\n x *= x;\n b >>= 1;\n }\n return res;\n }\n};\nstruct UnionFind {\n vector<int> par, siz, es;\n UnionFind(int x) {\n par.resize(x);\n siz.resize(x);\n es.resize(x);\n for (int i = 0; i < x; i++) {\n par[i] = i;\n siz[i] = 1;\n es[i] = 0;\n }\n }\n int find(int x) {\n if (par[x] == x) return x;\n return par[x] = find(par[x]);\n }\n bool unite(int x, int y) {\n x = find(x), y = find(y);\n if (x == y) {\n es[x]++;\n return false;\n }\n if (siz[x] < siz[y]) swap(x, y);\n par[y] = x;\n siz[x] += siz[y];\n es[x] += es[y] + 1;\n return true;\n }\n bool same(int x, int y) { return find(x) == find(y); }\n int size(int x) { return siz[find(x)]; }\n int edges(int x) { return es[find(x)]; }\n};\ntemplate <class S, S (*op)(S, S), S (*e)()>\nstruct segtree {\n int siz = 1;\n vector<S> dat;\n segtree(int n) : segtree(vector<S>(n, e())) {}\n segtree(const vector<S> &a) {\n while (siz < a.size()) siz <<= 1;\n dat = vector<S>(siz << 1, e());\n for (int i = 0; i < a.size(); i++) dat[siz + i] = a[i];\n for (int i = siz - 1; i >= 1; i--) dat[i] = op(dat[2 * i], dat[2 * i + 1]);\n }\n void set(int p, S x) {\n p += siz;\n dat[p] = x;\n while (p > 0) {\n p >>= 1;\n dat[p] = op(dat[2 * p], dat[2 * p + 1]);\n }\n }\n void add(int p, S x) { set(p, get(p) + x); }\n S get(int p) { return dat[p + siz]; }\n S prod(int l, int r) {\n S vl = e(), vr = e();\n l += siz, r += siz;\n while (l < r) {\n if (l & 1) vl = op(vl, dat[l++]);\n if (r & 1) vr = op(dat[--r], vr);\n l >>= 1, r >>= 1;\n }\n return op(vl, vr);\n }\n S all_prod() { return dat[1]; }\n};\ntemplate <class T>\nstruct BIT {\n // 1-indexed\n int n, beki = 1;\n vector<T> bit;\n BIT(int x) {\n bit.resize(x + 1, 0);\n n = x;\n while (beki * 2 <= n) beki *= 2;\n }\n T sum(int i) {\n T res = 0;\n while (i > 0) {\n res += bit[i];\n i -= i & -i;\n }\n return res;\n }\n T sum(int l, int r) {\n //[l,r]\n return sum(r) - (l == 0 ? 0 : sum(l - 1));\n }\n void add(int i, T x) {\n while (i <= n) {\n bit[i] += x;\n i += i & -i;\n }\n }\n int lowerbound(T w) {\n if (w <= 0) return 0;\n int x = 0;\n for (int k = beki; k > 0; k >>= 1) {\n if (x + k <= n && bit[x + k] < w) {\n w -= bit[x + k];\n x += k;\n }\n }\n return x + 1;\n }\n};\ntemplate <class T, T (*op)(T, T), T (*e)()>\nstruct sparsetable {\n vector<vector<T>> table;\n vector<int> logtable;\n sparsetable() = default;\n sparsetable(vector<T> v) {\n int len = 0;\n while ((1 << len) <= v.size()) len++;\n table.assign(len, vector<T>(1 << len));\n for (int i = 0; i < (int)v.size(); i++) table[0][i] = v[i];\n for (int i = 1; i < len; i++) {\n for (int j = 0; j + (1 << i) <= (1 << len); j++) {\n table[i][j] = op(table[i - 1][j], table[i - 1][j + (1 << (i - 1))]);\n }\n }\n logtable.resize(v.size() + 1);\n for (int i = 2; i < logtable.size(); i++) {\n logtable[i] = logtable[(i >> 1)] + 1;\n }\n }\n T query(int l, int r) {\n assert(l <= r);\n if (l == r) return e();\n int len = logtable[r - l];\n return op(table[len][l], table[len][r - (1 << len)]);\n }\n};\ntemplate <class T, T (*op)(T, T), T (*e)()>\nstruct disjointsparsetable {\n vector<vector<T>> table;\n vector<int> logtable;\n disjointsparsetable() = default;\n disjointsparsetable(vector<T> v) {\n int len = 0;\n while ((1 << len) <= v.size()) len++;\n table.assign(len, vector<T>(1 << len, e()));\n for (int i = 0; i < (int)v.size(); i++) table[0][i] = v[i];\n for (int i = 1; i < len; i++) {\n int shift = 1 << i;\n for (int j = 0; j < (int)v.size(); j += shift << 1) {\n int t = min(j + shift, (int)v.size());\n table[i][t - 1] = v[t - 1];\n for (int k = t - 2; k >= j; k--) table[i][k] = op(v[k], table[i][k + 1]);\n if (v.size() <= t) break;\n table[i][t] = v[t];\n int r = min(t + shift, (int)v.size());\n for (int k = t + 1; k < r; k++) table[i][k] = op(table[i][k - 1], v[k]);\n }\n }\n logtable.resize(1 << len);\n for (int i = 2; i < logtable.size(); i++) {\n logtable[i] = logtable[(i >> 1)] + 1;\n }\n }\n T query(int l, int r) {\n if (l == r) return e();\n if (l >= --r) return table[0][l];\n int len = logtable[l ^ r];\n return op(table[len][l], table[len][r]);\n };\n};\npair<int, int> lcatree_op(pair<int, int> a, pair<int, int> b) { return min(a, b); }\npair<int, int> lcatree_e() { return {1000000000, -1}; }\nstruct lca_tree {\n int n, size;\n vector<int> in, ord, depth;\n sparsetable<pair<int, int>, lcatree_op, lcatree_e> st;\n lca_tree(vector<vector<int>> g, int root = 0) : n((int)g.size()), size(log2(n) + 2), in(n), depth(n, n) {\n depth[root] = 0;\n function<void(int, int)> dfs = [&](int v, int p) {\n in[v] = (int)ord.size();\n ord.push_back(v);\n for (int u : g[v]) {\n if (u == p) continue;\n if (depth[u] > depth[v] + 1) {\n depth[u] = depth[v] + 1;\n dfs(u, v);\n ord.push_back(v);\n }\n }\n };\n dfs(root, -1);\n vector<pair<int, int>> vec((int)ord.size());\n for (int i = 0; i < (int)ord.size(); i++) {\n vec[i] = make_pair(depth[ord[i]], ord[i]);\n }\n st = vec;\n }\n int lca(int u, int v) {\n if (in[u] > in[v]) swap(u, v);\n if (u == v) return u;\n return st.query(in[u], in[v]).second;\n }\n int dist(int u, int v) {\n int l = lca(u, v);\n return depth[u] + depth[v] - 2 * depth[l];\n }\n};\nstruct auxiliary_tree : lca_tree {\n vector<vector<int>> G;\n auxiliary_tree(vector<vector<int>> &g) : lca_tree(g), G(n) {}\n pair<int, vector<int>> query(vector<int> vs, bool decending = false) {\n // decending:親から子の方向のみ辺を貼る\n assert(!vs.empty());\n sort(vs.begin(), vs.end(), [&](int a, int b) { return in[a] < in[b]; });\n int m = vs.size();\n stack<int> st;\n st.push(vs[0]);\n for (int i = 0; i < m - 1; i++) {\n int w = lca(vs[i], vs[i + 1]);\n if (w != vs[i]) {\n int l = st.top();\n st.pop();\n while (!st.empty() && depth[w] < depth[st.top()]) {\n if (!decending) G[l].push_back(st.top());\n G[st.top()].push_back(l);\n l = st.top();\n st.pop();\n }\n if (st.empty() || st.top() != w) {\n st.push(w);\n vs.push_back(w);\n }\n if (!decending) G[l].push_back(w);\n G[w].push_back(l);\n }\n st.push(vs[i + 1]);\n }\n while (st.size() > 1) {\n int x = st.top();\n st.pop();\n if (!decending) G[x].push_back(st.top());\n G[st.top()].push_back(x);\n }\n // {root,vertex_list}\n return make_pair(st.top(), vs);\n }\n void clear(vector<int> vs) {\n for (int v : vs) G[v].clear();\n }\n};\nstruct Mo {\n int n;\n vector<pair<int, int>> lr;\n\n explicit Mo(int n) : n(n) {}\n\n void add(int l, int r) { /* [l, r) */\n lr.emplace_back(l, r);\n }\n\n template <typename AL, typename AR, typename EL, typename ER, typename O>\n void build(const AL &add_left, const AR &add_right, const EL &erase_left, const ER &erase_right, const O &out) {\n int q = (int)lr.size();\n int bs = n / min<int>(n, sqrt(q));\n vector<int> ord(q);\n iota(begin(ord), end(ord), 0);\n sort(begin(ord), end(ord), [&](int a, int b) {\n int ablock = lr[a].first / bs, bblock = lr[b].first / bs;\n if (ablock != bblock) return ablock < bblock;\n return (ablock & 1) ? lr[a].second > lr[b].second : lr[a].second < lr[b].second;\n });\n int l = 0, r = 0;\n for (auto idx : ord) {\n while (l > lr[idx].first) add_left(--l);\n while (r < lr[idx].second) add_right(r++);\n while (l < lr[idx].first) erase_left(l++);\n while (r > lr[idx].second) erase_right(--r);\n out(idx);\n }\n }\n\n template <typename A, typename E, typename O>\n void build(const A &add, const E &erase, const O &out) {\n build(add, add, erase, erase, out);\n }\n};\ntemplate <class S, S (*op)(S, S), S (*e)(), class F, S (*mapping)(F, S), F (*composition)(F, F), F (*id)()>\nstruct lazy_segtree {\n int _n, sz = 1;\n vector<S> dat;\n vector<F> lazy;\n lazy_segtree(vector<S> a) : _n(int(a.size())) {\n while (sz < _n) sz <<= 1;\n dat.resize(sz * 2, e());\n lazy.resize(sz * 2, id());\n rep(i, _n) dat[sz + i] = a[i];\n for (int i = sz - 1; i >= 1; i--) dat[i] = op(dat[2 * i], dat[2 * i + 1]);\n }\n void eval(int k) {\n dat[k] = mapping(lazy[k], dat[k]);\n if (k < sz) {\n lazy[k * 2] = composition(lazy[k], lazy[k * 2]);\n lazy[k * 2 + 1] = composition(lazy[k], lazy[k * 2 + 1]);\n }\n lazy[k] = id();\n }\n void apply(int a, int b, F f, int k = 1, int l = 0, int r = -1) {\n eval(k);\n if (r == -1) r = sz;\n if (r <= a || b <= l) return;\n if (a <= l && r <= b) {\n lazy[k] = composition(f, lazy[k]);\n eval(k);\n return;\n }\n int m = (l + r) >> 1;\n apply(a, b, f, 2 * k, l, m);\n apply(a, b, f, 2 * k + 1, m, r);\n dat[k] = op(dat[2 * k], dat[2 * k + 1]);\n }\n S prod(int a, int b, int k = 1, int l = 0, int r = -1) {\n eval(k);\n if (r == -1) r = sz;\n if (r <= a || b <= l) return e();\n if (a <= l && r <= b) return dat[k];\n int m = (l + r) >> 1;\n S vl = prod(a, b, 2 * k, l, m);\n S vr = prod(a, b, 2 * k + 1, m, r);\n return op(vl, vr);\n }\n};\n\ntemplate <class S, S (*op)(S, S), S (*e)()>\nstruct dual_segtree {\n int sz = 1, log = 0;\n vector<S> lz;\n dual_segtree(vector<S> a) {\n int n = a.size();\n while (sz < n) {\n sz <<= 1;\n log++;\n }\n lz.assign(sz << 1, e());\n for (int i = 0; i < n; i++) lz[i + sz] = a[i];\n }\n void push(int k) {\n int b = __builtin_ctz(k);\n for (int d = log; d > b; d--) {\n lz[k >> d << 1] = op(lz[k >> d << 1], lz[k >> d]);\n lz[k >> d << 1 | 1] = op(lz[k >> d << 1 | 1], lz[k >> d]);\n lz[k >> d] = e();\n }\n }\n void apply(int l, int r, S x) {\n l += sz, r += sz;\n push(l);\n push(r);\n while (l < r) {\n if (l & 1) {\n lz[l] = op(lz[l], x);\n l++;\n }\n if (r & 1) {\n r--;\n lz[r] = op(lz[r], x);\n }\n l >>= 1, r >>= 1;\n }\n }\n S get(int k) {\n k += sz;\n S res = e();\n while (k) {\n res = op(res, lz[k]);\n k >>= 1;\n }\n return res;\n }\n};\n\n/*\n#include <atcoder/string>\nint string_period(string s) {\n int n = s.size();\n auto z = atcoder::z_algorithm(s);\n for (int i = 1; i < n; i++) {\n if (n % i == 0 && z[i] == n - i) return i;\n }\n return n;\n}\n*/\nstruct LowLink {\n vector<vector<int>> g;\n vector<int> ord, low, out;\n vector<bool> used;\n vector<pair<int, int>> bridge;\n vector<pair<int, int>> articulation;\n int unions;\n LowLink(vector<vector<int>> g) : g(g) {\n int n = (int)g.size();\n ord.resize(n);\n low.resize(n);\n out.resize(n);\n used.resize(n);\n unions = 0;\n int t = 0;\n for (int i = 0; i < n; i++) {\n if (!used[i]) {\n dfs(i, t, -1);\n unions++;\n }\n }\n }\n void dfs(int v, int &t, int par) {\n used[v] = true;\n ord[v] = t++, low[v] = ord[v];\n int cnt = 0;\n bool par_back = false;\n for (int to : g[v]) {\n if (!used[to]) {\n dfs(to, t, v);\n low[v] = min(low[v], low[to]);\n if (ord[v] < low[to]) bridge.push_back(minmax(v, to));\n if (ord[v] <= low[to]) cnt++;\n } else if (to != par || par_back) {\n low[v] = min(low[v], ord[to]);\n } else\n par_back = true;\n }\n if (par != -1) cnt++;\n if (cnt >= 2) articulation.push_back({v, cnt});\n out[v] = t;\n }\n};\ntemplate <typename T>\nT rand(T l, T r) {\n static mt19937 mt(random_device{}());\n if constexpr (is_integral_v<T>) {\n uniform_int_distribution<T> dist(l, r);\n return dist(mt);\n } else if constexpr (is_floating_point_v<T>) {\n uniform_real_distribution<T> dist(l, r);\n return dist(mt);\n }\n}\nint res[1 << 16];\nchar Minus(char c) {\n if (c == '0') return '1';\n return '0';\n}\nchar Xor(char a, char b) {\n if (a == b) return '0';\n return '1';\n}\nchar And(char a, char b) {\n if (a == '1' && b == '1') return '1';\n return '0';\n}\nint calc_formula(string s) {\n string t;\n for (char c : s) {\n t += c;\n while (1) {\n if (t.size() >= 2 && t.end()[-2] == '-' && isdigit(t.back())) {\n char d = Minus(t.back());\n t.pop_back();\n t.pop_back();\n t += d;\n continue;\n }\n if (t.back() == ')') {\n char d = '.';\n if (t.end()[-3] == '^')\n d = Xor(t.end()[-4], t.end()[-2]);\n else\n d = And(t.end()[-4], t.end()[-2]);\n t.pop_back();\n t.pop_back();\n t.pop_back();\n t.pop_back();\n t.pop_back();\n t.push_back(d);\n continue;\n }\n break;\n }\n }\n return (t[0] - '0');\n}\nint calc_charFormula(string &s) {\n int ans = 0;\n rep(i, 16) {\n string t = s;\n for (char &c : t) {\n rep(j, 4) {\n if (c == 'a' + j) c = '0' + ((i >> j) & 1);\n }\n }\n ans |= calc_formula(t) << i;\n }\n return ans;\n}\nvoid precalc() {\n fill(res, res + 65536, INF);\n vector<vector<string>> E(17);\n E[1] = {\"0\", \"1\", \"a\", \"b\", \"c\", \"d\"};\n for (auto s : E[1]) {\n res[calc_charFormula(s)] = 1;\n }\n for (int i = 2; i <= 16; i++) {\n vector<string> tmp;\n for (auto s : E[i - 1]) {\n tmp.push_back('-' + s);\n }\n for (int j = 1; j + 3 < i; j++) {\n int k = i - 3 - j;\n for (auto s : E[j]) {\n for (auto t : E[k]) {\n tmp.push_back('(' + s + '^' + t + ')');\n tmp.push_back('(' + s + '*' + t + ')');\n }\n }\n }\n for (auto s : tmp) {\n int ans = calc_charFormula(s);\n if (chmin(res[ans], s.size())) E[i].push_back(s);\n }\n }\n}\nvoid solve() {\n string s;\n cin >> s;\n if (s == \".\") exit(0);\n cout << res[calc_charFormula(s)] << endl;\n // calc for 2^4 patterns\n // generate all possible string and calc for 2^4 patterns\n}\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n /*int t;\n cin >> t;\n while (t--) */\n precalc();\n while (1) solve();\n}","accuracy":1,"time_ms":50,"memory_kb":4372,"score_of_the_acc":-0.0162,"final_rank":4},{"submission_id":"aoj_1620_9369749","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\ntemplate <class T>\nusing vc = vector<T>;\ntemplate <class T>\nusing vvc = vc<vc<T>>;\nvoid solve();\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n ll t = 1;\n // cin >> t;\n for (int i = 1; i <= t; i++) solve();\n return 0;\n}\n#define rep(i, a, b) for (ll i = (a); i < (b); i++)\nll dy[4] = {0, 1, 0, -1}, dx[4] = {1, 0, -1, 0};\n// ll dy[8] = {1, 1, 0, -1, -1, -1, 0, 1}, dx[8] = {0, 1, 1, 1, 0, -1, -1, -1};\nstring s, t;\nll pos;\nvoid solve() {\n ll ABCD[4];\n auto get = [&](char c) -> ll {\n if (c == 'a') return ABCD[0];\n if (c == 'b') return ABCD[1];\n if (c == 'c') return ABCD[2];\n if (c == 'd') return ABCD[3];\n return 0;\n };\n vc<ll> min_op(1 << 16, 1e9);\n auto E = [&](auto &&E, string &S) -> ll {\n if (S[pos] == '(') {\n pos++;\n ll v1 = E(E, S);\n char op = S[pos++];\n ll v2 = E(E, S);\n pos++;\n if (op == '^') return v1 ^ v2;\n return v1 & v2;\n }\n if (S[pos] == '0' || S[pos] == '1') {\n pos++;\n return S[pos - 1] - '0';\n }\n if ('a' <= S[pos] && S[pos] <= 'd') {\n ll v = get(S[pos]);\n pos++;\n return v;\n }\n pos++;\n ll v1 = E(E, S);\n return 1 - v1;\n };\n auto check2 = [&]() -> void {\n ll num = 0;\n rep(a, 0, 2) {\n rep(b, 0, 2) {\n rep(c, 0, 2) {\n rep(d, 0, 2) {\n ABCD[0] = a, ABCD[1] = b, ABCD[2] = c, ABCD[3] = d;\n pos = 0;\n ll val = a * 8 + b * 4 + c * 2 + d;\n num |= (1 << val) * E(E, t);\n }\n }\n }\n }\n min_op[num] = min(min_op[num], (ll)t.size());\n };\n auto check = [&](vc<char> &C) -> void {\n ll nC = C.size();\n if (nC >= 5) return;\n if (nC == 0) return;\n auto add1 = [&](bool f) -> void {\n if (f) t += \"-\";\n t += \"(\";\n };\n auto add2 = [&](bool f, int idx) -> void {\n if (f) t += \"-\";\n t += C[idx];\n };\n auto add_op = [&](bool f) -> void {\n if (f)\n t += \"^\";\n else\n t += \"*\";\n };\n if (nC == 1) {\n rep(m2, 0, 2) {\n t = \"\";\n add2(m2, 0);\n check2();\n }\n return;\n }\n if (nC == 2) {\n rep(m1, 0, 2) {\n rep(m2, 0, 4) {\n rep(op, 0, 2) {\n t = \"\";\n add1(m1);\n add2(m2 & 1, 0);\n add_op(op);\n add2(m2 & 2, 1);\n t += \")\";\n check2();\n }\n }\n }\n return;\n }\n if (nC == 3) {\n rep(m1, 0, 4) {\n rep(m2, 0, 8) {\n rep(op, 0, 4) {\n t = \"\";\n add1(m1 & 1);\n add1(m1 & 2);\n add2(m2 & 1, 0);\n add_op(op & 1);\n add2(m2 & 2, 1);\n t += \")\";\n add_op(op & 2);\n add2(m2 & 4, 2);\n t += \")\";\n check2();\n }\n }\n }\n return;\n }\n rep(m1, 0, 8) {\n rep(m2, 0, 16) {\n rep(op, 0, 8) {\n t = \"\";\n add1(m1 & 1);\n add1(m1 & 2);\n add1(m1 & 4);\n add2(m2 & 1, 0);\n add_op(op & 1);\n add2(m2 & 2, 1);\n t += \")\";\n add_op(op & 2);\n add2(m2 & 4, 2);\n t += \")\";\n add_op(op & 4);\n add2(m2 & 8, 3);\n t += \")\";\n check2();\n }\n }\n }\n rep(m1, 0, 8) {\n rep(m2, 0, 16) {\n rep(op, 0, 8) {\n t = \"\";\n add1(m1 & 1);\n add1(m1 & 2);\n add2(m2 & 1, 0);\n add_op(op & 1);\n add2(m2 & 2, 1);\n t += \")\";\n add_op(op & 2);\n add1(m1 & 4);\n add2(m2 & 4, 2);\n add_op(op & 4);\n add2(m2 & 8, 3);\n t += \")\";\n t += \")\";\n check2();\n }\n }\n }\n return;\n };\n auto dfs = [&](auto &&dfs, vc<char> &C) -> void {\n if (C.size() >= 5) return;\n check(C);\n for (char c = 'a'; c <= 'd'; c++) {\n C.push_back(c);\n dfs(dfs, C);\n C.pop_back();\n }\n };\n vc<char> C;\n dfs(dfs, C);\n min_op[0] = 1, min_op[65535] = 1;\n while (true) {\n string s;\n cin >> s;\n if (s == \".\") break;\n ll num = 0;\n rep(a, 0, 2) rep(b, 0, 2) rep(c, 0, 2) rep(d, 0, 2) {\n ABCD[0] = a, ABCD[1] = b, ABCD[2] = c, ABCD[3] = d;\n pos = 0;\n ll val = a * 8 + b * 4 + c * 2 + d;\n num |= (1 << val) * E(E, s);\n }\n cout << min_op[num] << endl;\n }\n}","accuracy":1,"time_ms":210,"memory_kb":3484,"score_of_the_acc":-0.0538,"final_rank":9},{"submission_id":"aoj_1620_9232294","code_snippet":"#include <bits/stdc++.h>\n\nconst int N{1 << 16};\nint dist[N];\n\nvoid init() {\n const int INF{(int)2e9};\n std::fill(dist, dist + N, INF);\n using qt = std::pair<int, int>;\n std::priority_queue<qt, std::vector<qt>, std::greater<qt>> que;\n dist[0] = 1; // 0\n que.emplace(dist[0], 0);\n dist[N - 1] = 1; // 1\n que.emplace(dist[1], N - 1);\n for (int i{} ; i < 4 ; i++) { // a, b, c, d\n int val{};\n for (int bit{} ; bit < (1 << 4) ; bit++) {\n if (bit & (1 << i)) val |= (1 << bit);\n }\n dist[val] = 1;\n que.emplace(dist[val], val);\n }\n while (que.size()) {\n auto [d, v]{que.top()};\n que.pop();\n if (dist[v] < d) continue;\n {// -\n int x{(N - 1) ^ v};\n if (dist[x] > dist[v] + 1) {\n dist[x] = dist[v] + 1;\n que.emplace(dist[x], x);\n }\n }\n for (int i{} ; i < N ; i++) {\n if (dist[i] + dist[v] + 3 > 16) continue;\n {\n int x{i ^ v};\n if (dist[x] > dist[i] + dist[v] + 3) {\n dist[x] = dist[i] + dist[v] + 3;\n que.emplace(dist[x], x);\n }\n }\n {\n int x{i & v};\n if (dist[x] > dist[i] + dist[v] + 3) {\n dist[x] = dist[i] + dist[v] + 3;\n que.emplace(dist[x], x);\n }\n }\n }\n }\n}\n\nint parse(const std::string& S) {\n int res{};\n for (int bit{} ; bit < (1 << 4) ; bit++) {\n int it{};\n auto f{[&](auto f) -> int {\n if (S[it] == '(') {\n it++;\n int front{f(f)};\n assert(S[it] == '*' or S[it] == '^');\n char op{S[it]};\n it++;\n int back{f(f)};\n assert(S[it] == ')');\n it++;\n return op == '*' ? (front & back) : (front ^ back);\n }\n else if (S[it] == '-') {\n it++;\n int val{f(f)};\n return 1 - val;\n }\n else {\n char c{S[it]};\n it++;\n if (c == '0') return 0;\n if (c == '1') return 1;\n if (c == 'a') return (bool)(bit & (1 << 0));\n if (c == 'b') return (bool)(bit & (1 << 1));\n if (c == 'c') return (bool)(bit & (1 << 2));\n if (c == 'd') return (bool)(bit & (1 << 3));\n assert(false);\n return -1;\n }\n }};\n if (f(f)) res |= (1 << bit);\n }\n return res;\n}\n\nbool solve() {\n std::string S;\n std::cin >> S;\n if (S == \".\") return false;\n std::cout << dist[parse(S)] << '\\n';\n return true;\n}\n\nint main() {\n init();\n std::cin.tie(nullptr)->sync_with_stdio(false);\n while (solve()) ;\n}","accuracy":1,"time_ms":100,"memory_kb":3584,"score_of_the_acc":-0.0248,"final_rank":6},{"submission_id":"aoj_1620_9004236","code_snippet":"#line 2 \"cp-library/src/cp-template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nusing i32 = int;\nusing u32 = unsigned int;\nusing i64 = long long;\nusing u64 = unsigned long long;\nusing i128 = __int128_t;\ntemplate < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }\ntemplate < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }\ntemplate < class T, class U > T ceil (T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); }\ntemplate < class T, class U > T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); }\nint popcnt(i32 x) { return __builtin_popcount(x); }\nint popcnt(u32 x) { return __builtin_popcount(x); }\nint popcnt(i64 x) { return __builtin_popcountll(x); }\nint popcnt(u64 x) { return __builtin_popcountll(x); }\n\n#line 2 \"cp-library/src/utility/rep_itr.hpp\"\ntemplate < class T > struct itr_rep {\n T i, d;\n constexpr itr_rep(const T i) noexcept : i(i), d(1) {}\n constexpr itr_rep(const T i, const T d) noexcept : i(i), d(d) {}\n void operator++() noexcept { i += d; }\n constexpr int operator*() const noexcept { return i; }\n constexpr bool operator!=(const itr_rep x) const noexcept { return d > 0 ? i < x.i : i > x.i; }\n};\n\ntemplate < class T > struct rep {\n const itr_rep< T > s, t;\n constexpr rep(const T t) noexcept : s(0), t(t) {}\n constexpr rep(const T s, const T t) noexcept : s(s), t(t) {}\n constexpr rep(const T s, const T t, const T d) noexcept : s(s, d), t(t, d) {}\n constexpr auto begin() const noexcept { return s; }\n constexpr auto end () const noexcept { return t; }\n};\n\ntemplate < class T > struct revrep {\n const itr_rep < T > s, t;\n constexpr revrep(const T t) noexcept : s(t - 1, -1), t(-1, -1) {}\n constexpr revrep(const T s, const T t) noexcept : s(t - 1, -1), t(s - 1, -1) {}\n constexpr revrep(const T s, const T t, const T d) noexcept : s(t - 1, -d), t(s - 1, -d) {}\n constexpr auto begin() const noexcept { return s; }\n constexpr auto end () const noexcept { return t; }\n};\n#line 3 \"cp-library/src/utility/io.hpp\"\n\n/* 128bit integer */\nistream& operator>>(istream& is, i128& x) {\n std::string s; is >> s;\n int pm = (s[0] == '-');\n x = 0;\n for(int i : rep(pm, int(s.size()))) x = x * 10 + (s[i] - '0');\n if(pm) x *= -1;\n return is;\n}\nostream& operator<<(ostream& os, const i128& x) {\n if(x == 0) return os << '0';\n i128 y = x;\n if(y < 0) { os << '-'; y *= -1; }\n std::vector<int> ny;\n while(y > 0) { ny.push_back(y % 10); y /= 10; }\n for(int i : revrep(ny.size())) os << ny[i];\n return os;\n}\n\ntemplate < class S, class T > istream& operator>>(istream& is, std::pair< S, T >& x) { is >> x.first >> x.second; return is; }\ntemplate < class S, class T > ostream& operator<<(ostream& os, const std::pair< S, T >& x) { os << x.first << \" \" << x.second; return os; }\n\nnamespace scanner {\n struct sca {\n template < class T > operator T() {\n T s; std::cin >> s; return s;\n }\n };\n struct vec {\n int n;\n vec(int n) : n(n) {}\n template < class T > operator std::vector< T >() {\n std::vector< T > v(n);\n for(T& x : v) std::cin >> x;\n return v;\n }\n };\n struct mat {\n int h, w;\n mat(int h, int w) : h(h), w(w) {}\n template < class T > operator std::vector< std::vector< T > >() {\n std::vector m(h, std::vector< T >(w));\n for(std::vector< T >& v : m) for(T& x : v) std::cin >> x;\n return m;\n }\n };\n struct speedup {\n speedup() {\n std::cin.tie(0);\n std::ios::sync_with_stdio(0);\n }\n } speedup_instance;\n}\nscanner::sca in() { return scanner::sca(); }\nscanner::vec in(int n) { return scanner::vec(n); }\nscanner::mat in(int h, int w) { return scanner::mat(h, w); }\n\nnamespace printer {\n void precision(int d) { std::cout << std::fixed << std::setprecision(d); }\n void flush() { std::cout.flush(); }\n}\n\ntemplate < class T >\nostream& operator<<(ostream& os, const std::vector< T > a) {\n int n = a.size();\n for(int i : rep(n)) { os << a[i]; if(i != n - 1) os << ' '; }\n return os;\n}\n\nint print() { std::cout << '\\n'; return 0; }\ntemplate < class head, class... tail > int print(head&& h, tail&&... t) {\n std::cout << h; if(sizeof...(tail)) std::cout << ' ';\n return print(std::forward<tail>(t)...);\n}\ntemplate < class T > int print_n(const std::vector< T > a) {\n int n = a.size();\n for(int i : rep(n)) std::cout << a[i] << \"\\n\";\n return 0;\n}\n\n\n#line 2 \"cp-library/src/utility/key_val.hpp\"\n\ntemplate < class K, class V >\nstruct key_val {\n K key; V val;\n key_val() {}\n key_val(K key, V val) : key(key), val(val) {}\n template < std::size_t Index >\n std::tuple_element_t< Index, key_val >& get() {\n if constexpr (Index == 0) return key;\n if constexpr (Index == 1) return val;\n }\n};\n\nnamespace std {\n\ntemplate < class K, class V > struct tuple_size < key_val< K, V > > : integral_constant< size_t, 2 > {};\ntemplate < class K, class V > struct tuple_element < 0, key_val< K, V > > { using type = K; };\ntemplate < class K, class V > struct tuple_element < 1, key_val< K, V > > { using type = V; };\n\n}\n#line 2 \"cp-library/src/utility/vec_op.hpp\"\ntemplate < class T > key_val< int, T > max_of(const vector< T >& a) {\n int i = std::max_element(a.begin(), a.end()) - a.begin();\n return {i, a[i]};\n}\ntemplate < class T > key_val< int, T > min_of(const vector< T >& a) {\n int i = std::min_element(a.begin(), a.end()) - a.begin();\n return {i, a[i]};\n}\ntemplate < class S, class T > S sum_of(const vector< T >& a) {\n S sum = 0;\n for(const T x : a) sum += x;\n return sum;\n}\ntemplate < class S, class T > vector< S > freq_of(const vector< T >& a, T L, T R) {\n vector< S > res(R - L, S(0));\n for(const T x : a) res[x - L] += 1;\n return res;\n}\ntemplate < class S, class T > struct prefix_sum {\n vector< S > s;\n prefix_sum(const vector< T >& a) : s(a) {\n s.insert(s.begin(), S(0));\n for(int i : rep(a.size())) s[i + 1] += s[i];\n }\n // [L, R)\n S sum(int L, int R) { return s[R] - s[L]; }\n};\n#line 3 \"cp-library/src/utility/heap.hpp\"\n\ntemplate < class T > using heap_min = std::priority_queue< T, std::vector< T >, std::greater< T > >;\ntemplate < class T > using heap_max = std::priority_queue< T, std::vector< T >, std::less< T > >;\n\n#line 27 \"cp-library/src/cp-template.hpp\"\n\n#line 1 \"cp-library/src/algorithm/bin_search.hpp\"\ntemplate < class T, class F >\nT bin_search(T ok, T ng, F f) {\n while(abs(ng - ok) > 1) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n\ntemplate < class T, class F >\nT bin_search_real(T ok, T ng, F f, int step = 80) {\n while(step--) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n#line 2 \"cp-library/src/algorithm/argsort.hpp\"\n\ntemplate < class T > std::vector< int > argsort(const std::vector< T > &a) {\n std::vector< int > ids((int)a.size());\n std::iota(ids.begin(), ids.end(), 0);\n std::sort(ids.begin(), ids.end(), [&](int i, int j) {\n return a[i] < a[j] || (a[i] == a[j] && i < j);\n });\n return ids;\n}\n#line 1 \"macro.hpp\"\nnamespace macro {\n\nusing size_type = int;\ntemplate < class container > void sort(container& a) { std::sort(std:: begin(a), std:: end(a)); }\ntemplate < class container > void rsort(container& a) { std::sort(std::rbegin(a), std::rend(a)); }\ntemplate < class container > void reverse(container& a) { std::reverse(std::begin(a), std::end(a)); }\ntemplate < class container > void unique(container& a) {\n std::sort(std::begin(a), std::end(a));\n a.erase(std::unique(std::begin(a), std::end(a)), std::end(a));\n}\ntemplate < class container > container sorted(const container& a) { container b = a; sort(b); return std::move(b); }\ntemplate < class container > container rsorted(const container& a) { container b = a; rsort(b); return std::move(b); }\ntemplate < class container, class compare > void sort(container& a, const compare& cmp) { std::sort(std::begin(a), std::end(a), cmp); }\ntemplate < class container, class compare > container sorted(const container& a, const compare& cmp) { container b = a; sort(b, cmp); return std::move(b); }\ntemplate < class container, class value > size_type lower_bound(const container& a, const value& x) { return std::lower_bound(std::begin(a), std::end(a), x) - std::begin(a); }\ntemplate < class container, class value > size_type upper_bound(const container& a, const value& x) { return std::upper_bound(std::begin(a), std::end(a), x) - std::begin(a); }\n\nconst std::vector<std::pair<size_type, size_type>> dir4 = { {+1, 0}, {-1, 0}, { 0, +1}, { 0, -1} };\nconst std::vector<std::pair<size_type, size_type>> dir8 = { {-1, -1}, {-1, 0}, {-1, +1}, { 0, -1}, { 0, +1}, {+1, -1}, {+1, 0}, {+1, +1} };\n\n#ifdef _DEBUG\n#define debug(x) std::cout << \"[\" << __LINE__ << \"] \" << #x << \": \" << x << std::endl\n#else\n#define debug(x)\n#endif\n\ntemplate < class container > void concat(container& a, const container& b) {\n a.insert(std::end(a), std::begin(b), std::end(b));\n}\nstd::vector<size_type> iota(const size_type n) {\n std::vector<size_type> I(n);\n std::iota(std::begin(I), std::end(I), 0);\n return I;\n}\ntemplate < class container > std::vector<size_type> sort_idx(const container& a) {\n const size_type n = a.size();\n std::vector<size_type> I = iota(n);\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return a[i] < a[j] or (a[i] == a[j] and i < j); });\n return I;\n}\ntemplate < class container, class compare > std::vector<size_type> sort_idx(const container& a, const compare& cmp) {\n const size_type n = a.size();\n std::vector<size_type> I = iota(n);\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return cmp(a[i], a[j]) or (a[i] == a[j] and i < j); });\n return std::move(I);\n}\n\nstruct grid {\n using size_type = int;\n size_type H, W;\n grid(const size_type H, const size_type W) : H(H), W(W) {}\n bool contains(const size_type i, const size_type j) {\n return 0 <= i and i < H and 0 <= j and j < W;\n }\n};\n\nusing f64 = long double;\n\n} // namespace macro\n\nusing namespace macro;\n#line 3 \"A.cpp\"\n\nbool solve(const string& s, int& i, int x) {\n if(s[i] == '0') { i++; return 0; }\n if(s[i] == '1') { i++; return 1; }\n if(s[i] == 'a') { i++; return x & (1 << 0); }\n if(s[i] == 'b') { i++; return x & (1 << 1); }\n if(s[i] == 'c') { i++; return x & (1 << 2); }\n if(s[i] == 'd') { i++; return x & (1 << 3); }\n if(s[i] == '-') { i++; return !solve(s, i, x); }\n if(s[i] == '(') {\n i++;\n bool L = solve(s, i, x);\n assert(s[i] == '^' or s[i] == '*');\n char op = s[i];\n i++;\n bool R = solve(s, i, x);\n assert(s[i] == ')');\n i++;\n if(op == '^') {\n return L ^ R;\n } else {\n return L & R;\n }\n }\n assert(0);\n}\n\nset<string> st;\nmap<vector<int>, int> mp;\nvoid dfs(string s) {\n if(s.size() <= 16 and !st.count(s)) {\n\n vector<int> f(1 << 4, 0);\n for(int x : rep(1 << 4)) {\n int i = 0;\n f[x] = solve(s, i, x);\n }\n if(!mp.count(f) or mp[f] > s.size()) {\n mp[f] = s.size();\n st.insert(s);\n dfs(\"-\" + s);\n for(string t : st) {\n if(1 + s.size() + 1 + t.size() + 1 <= 16) {\n dfs(\"(\" + s + \"^\" + t + \")\");\n dfs(\"(\" + t + \"^\" + s + \")\");\n dfs(\"(\" + s + \"*\" + t + \")\");\n dfs(\"(\" + t + \"*\" + s + \")\");\n }\n }\n }\n }\n}\n\nint main() {\n dfs(\"0\");\n dfs(\"1\");\n dfs(\"a\");\n dfs(\"b\");\n dfs(\"c\");\n dfs(\"d\");\n\n for(string s : st) {\n vector<int> f(1 << 4, 0);\n for(int x : rep(1 << 4)) {\n int i = 0;\n f[x] = solve(s, i, x);\n }\n if(!mp.count(f)) {\n mp[f] = s.size();\n } else {\n chmin(mp[f], (int)s.size());\n }\n }\n\n while(true) {\n string s = in();\n if(s == \".\") return 0;\n\n vector<int> f(1 << 4, 0);\n for(int x : rep(1 << 4)) {\n int i = 0;\n f[x] = solve(s, i, x);\n }\n print(mp[f]);\n }\n}","accuracy":1,"time_ms":140,"memory_kb":4120,"score_of_the_acc":-0.0389,"final_rank":8},{"submission_id":"aoj_1620_8393693","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nconst vector<int> base = { 0x0000, 0xffff, 0xaaaa, 0xcccc, 0xf0f0, 0xff00 };\n\nint parse(const string& s, int &pos) {\n\tif (s[pos] == '0' || s[pos] == '1' || s[pos] == 'a' || s[pos] == 'b' || s[pos] == 'c' || s[pos] == 'd') {\n\t\tint res = base[s[pos] == '0' ? 0 : s[pos] == '1' ? 1 : s[pos] == 'a' ? 2 : s[pos] == 'b' ? 3 : s[pos] == 'c' ? 4 : 5];\n\t\tpos += 1;\n\t\treturn res;\n\t}\n\tif (s[pos] == '-') {\n\t\tpos += 1;\n\t\treturn 65535 - parse(s, pos);\n\t}\n\tpos += 1;\n\tint lc = parse(s, pos);\n\tchar ch = s[pos];\n\tpos += 1;\n\tint rc = parse(s, pos);\n\tpos += 1;\n\treturn (ch == '^' ? lc ^ rc : lc & rc);\n}\n\nint main() {\n\t// step #1. precompute distances\n\tvector<int> dist(65536, -1);\n\tvector<vector<int> > group(2);\n\tint cnt = base.size();\n\tgroup[1] = base;\n\tfor (int i : base) {\n\t\tdist[i] = 1;\n\t}\n\tint d = 1, x = 0;\n\twhile (cnt < 65536) {\n\t\td += 1;\n\t\tgroup.push_back(vector<int>());\n\t\tfor (int i : group[d - 1]) {\n\t\t\tif (dist[65535 - i] == -1) {\n\t\t\t\tdist[65535 - i] = d;\n\t\t\t\tgroup[d].push_back(65535 - i);\n\t\t\t\tcnt += 1;\n\t\t\t}\n\t\t}\n\t\tif (d >= 5) {\n\t\t\tfor (int i = 1; i <= d - 4; i++) {\n\t\t\t\tfor (int j : group[i]) {\n\t\t\t\t\tfor (int k : group[(d - 3) - i]) {\n\t\t\t\t\t\tx += 1;\n\t\t\t\t\t\tif (dist[j ^ k] == -1) {\n\t\t\t\t\t\t\tdist[j ^ k] = d;\n\t\t\t\t\t\t\tgroup[d].push_back(j ^ k);\n\t\t\t\t\t\t\tcnt += 1;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tif (dist[j & k] == -1) {\n\t\t\t\t\t\t\tdist[j & k] = d;\n\t\t\t\t\t\t\tgroup[d].push_back(j & k);\n\t\t\t\t\t\t\tcnt += 1;\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}\n\t}\n\t\n\t// step #2. solve\n\tcin.tie(0);\n\tios::sync_with_stdio(false);\n\twhile (true) {\n\t\tstring s;\n\t\tcin >> s;\n\t\tif (s == \".\") {\n\t\t\tbreak;\n\t\t}\n\t\tint pos = 0;\n\t\tint bit = parse(s, pos);\n\t\tcout << dist[bit] << '\\n';\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3756,"score_of_the_acc":-0.0044,"final_rank":2},{"submission_id":"aoj_1620_8027079","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nusing ll = long long;\n#define rep(i, n) for (ll i = 0; i < (n); i++)\n\nstruct Parser {\n string S;\n int idx;\n int val;\n Parser(string s) : S(s), idx(0){};\n\n char peek() { return S[idx]; }\n char read() { return S[idx++]; }\n bool consume(char c) {\n if (peek() == c) {\n read();\n return true;\n }\n return false;\n }\n bool eos() { return idx == (int)S.size(); }\n\n int solve(int v) {\n val = v;\n idx = 0;\n return E();\n }\n\n int E() {\n if (consume('-')) {\n return 1 - E();\n }\n if (consume('(')) {\n int a = E();\n char op = read();\n int b = E();\n consume(')');\n if (op == '^') {\n if (a != b) return 1;\n return 0;\n } else {\n if (a == 1 && b == 1) return 1;\n return 0;\n }\n }\n char a = read();\n if (a == '0') return 0;\n if (a == '1') return 1;\n if (a == 'a') return ((val >> 0) & 1);\n if (a == 'b') return ((val >> 1) & 1);\n if (a == 'c') return ((val >> 2) & 1);\n if (a == 'd') return ((val >> 3) & 1);\n exit(1);\n }\n};\n\nint res(string s) {\n int re = 0;\n Parser ps(s);\n rep(v, 1 << 4) {\n re *= 2;\n ll a = ps.solve(v);\n re += a;\n if (!(a == 0 || a == 1)) {\n cout << \"WA\" << endl;\n }\n }\n return re;\n}\n\nstruct Pre {\n vector<int> dp;\n\n Pre() {\n int inf = 10000;\n dp.resize(1 << 16, inf);\n vector<int> update(1 << 16, inf);\n set<int> ok;\n auto add = [&](int key, int val) {\n if (dp[key] != inf) return;\n update[key] = min(update[key], val);\n };\n // 更新するとき気を付ける\n\n auto nxtmns = [&]() {\n for (auto key : ok) {\n // add(((1 << 16) - 1) ^ key, dp[key] + 1);\n int u = 0;\n rep(i, 16) {\n if (!((key >> i) & 1)) {\n u += (1 << i);\n }\n }\n add(u, dp[key] + 1);\n }\n };\n\n auto nxt = [&]() {\n for (auto k1 : ok) {\n for (auto k2 : ok) {\n if (3 + dp[k1] + dp[k2] > 18) continue;\n add(k1 ^ k2, 3 + dp[k1] + dp[k2]);\n add(k1 & k2, 3 + dp[k1] + dp[k2]);\n }\n }\n };\n\n auto ud = [&](int v) {\n rep(i, 1 << 16) if (update[i] == v) {\n dp[i] = update[i];\n ok.insert(i);\n update[i] = inf;\n }\n };\n\n add(res(\"0\"), 1);\n add(res(\"1\"), 1);\n add(res(\"a\"), 1);\n add(res(\"b\"), 1);\n add(res(\"c\"), 1);\n add(res(\"d\"), 1);\n\n for (int v = 1; v <= 16; v++) {\n ud(v);\n nxtmns();\n ud(v);\n nxt();\n }\n ud(17);\n\n // cout << \"=====\" << endl;\n // rep(i, 1 << 16) cout << i << \" \" << dp[i] << endl;\n // cout << \"=====\" << endl;\n }\n} pre;\n\nbool solve() {\n string S;\n cin >> S;\n if (S == \".\") return false;\n\n int ans = min((int)S.size(), pre.dp[res(S)]);\n if ((int)S.size() < pre.dp[res(S)]) {\n cout << \"WA!! \" << S << \" \" << pre.dp[res(S)] << endl;\n exit(1);\n }\n cout << ans << endl;\n\n return true;\n}\n\nint main() {\n auto st = [&](int s) {\n string res;\n while (s > 0) {\n res += '0' + s % 2;\n s /= 2;\n }\n return res;\n };\n auto nxtmns = [&](int key) {\n int u = 0;\n rep(i, 16) {\n if (!((key >> i) & 1)) {\n u += (1 << i);\n }\n }\n return u;\n };\n\n // cout << \"a : \" << pre.dp[res(\"a\")] << endl;\n // cout << \"-a : \" << pre.dp[res(\"-a\")] << endl;\n // cout << \"nxtmnsval \" << st(nxtmns(res(\"a\"))) << endl;\n // cout << \"res( a) : \" << st(res(\"a\")) << endl;\n // cout << \"res(-a) : \" << st(res(\"-a\")) << endl;\n auto out = [&](string s) { cout << s << \" \" << pre.dp[res(s)] << endl; };\n // out(\"(c*d)\");\n // out(\"((c*d)*a)\");\n // out(\"-((c*d)*a)\");\n // out(\"--a\");\n // out(\"(-((c*d)*a)^a)\");\n // out(\"(a^b)\");\n while (solve())\n ;\n}","accuracy":1,"time_ms":50,"memory_kb":3496,"score_of_the_acc":-0.0108,"final_rank":3},{"submission_id":"aoj_1620_8016523","code_snippet":"#include<bits/stdc++.h>\n#define rng(i,a,b) for(int i=(a);i<(b);i++)\n#define rep(i,n) rng(i,0,(n))\n#define vec vector\n#define pb emplace_back\n#define all(a) (a).begin(),(a).end()\nusing ll = long long;\nusing ld = long double;\nusing namespace std;\n\nsigned main() {\n\n struct st {\n string s;\n int val;\n };\n\n //1\n vec<st>e;\n int one = 0, two = 0, thr = 0;\n rep(z, 4) {\n st tmp;\n tmp.s = 'a' + z;\n tmp.val = 0;\n rep(i, 2)rep(j, 2)rep(x, 2)rep(y, 2) {\n if (z == 0 && i == 1 || z == 1 && j == 1 || z == 2 && x == 1 || z == 3 && y == 1) {\n int keta = (i << 3) | (j << 2) | (x << 1) | y;\n tmp.val |= (1 << keta);\n }\n }\n e.pb(tmp);\n tmp.s = \"-\";\n tmp.s += 'a' + z;\n tmp.val = 0;\n rep(i, 2)rep(j, 2)rep(x, 2)rep(y, 2) {\n if (z == 0 && i == 0 || z == 1 && j == 0 || z == 2 && x == 0 || z == 3 && y == 0) {\n int keta = (i << 3) | (j << 2) | (x << 1) | y;\n tmp.val |= (1 << keta);\n }\n }\n e.pb(tmp);\n one += 2;\n }\n\n //2 = 1*1\n rep(i, one)rng(j, i + 1, one) {\n rep(k, 2)rep(r, 2) {\n st tmp;\n tmp.s = \"(\";\n tmp.s += ((k == 0) ? \"\" : \"-\") + e[i].s + \"^\" + ((r == 0) ? \"\" : \"-\") + e[j].s + \")\";\n tmp.val = (k == 0 ? e[i].val : (((1 << 16) - 1) ^ e[i].val)) ^ (r == 0 ? e[j].val : (((1 << 16) - 1) ^ e[j].val));\n e.pb(tmp);\n tmp;\n tmp.s = \"(\";\n tmp.s += ((k == 0) ? \"\" : \"-\") + e[i].s + \"*\" + ((r == 0) ? \"\" : \"-\") + e[j].s + \")\";\n tmp.val = (k == 0 ? e[i].val : (((1 << 16) - 1) ^ e[i].val)) & (r == 0 ? e[j].val : (((1 << 16) - 1) ^ e[j].val));\n e.pb(tmp);\n two += 2;\n }\n }\n\n //3=1*2\n rep(i, one)rng(j, one, one + two) {\n rep(k, 2)rep(r, 2) {\n st tmp;\n tmp.s = \"(\";\n tmp.s += ((k == 0) ? \"\" : \"-\") + e[i].s + \"^\" + ((r == 0) ? \"\" : \"-\") + e[j].s + \")\";\n tmp.val = (k == 0 ? e[i].val : (((1 << 16) - 1) ^ e[i].val)) ^ (r == 0 ? e[j].val : (((1 << 16) - 1) ^ e[j].val));\n e.pb(tmp);\n tmp.s = \"(\";\n tmp.s += ((k == 0) ? \"\" : \"-\") + e[i].s + \"*\" + ((r == 0) ? \"\" : \"-\") + e[j].s + \")\";\n tmp.val = (k == 0 ? e[i].val : (((1 << 16) - 1) ^ e[i].val)) & (r == 0 ? e[j].val : (((1 << 16) - 1) ^ e[j].val));\n e.pb(tmp);\n thr += 2;\n }\n }\n\n //3=2*2\n rng(i, one, one + two)rng(j, i + 1, one + two) {\n rep(k, 2)rep(r, 2) {\n st tmp;\n tmp.s = \"(\";\n tmp.s += ((k == 0) ? \"\" : \"-\") + e[i].s + \"^\" + ((r == 0) ? \"\" : \"-\") + e[j].s + \")\";\n tmp.val = (k == 0 ? e[i].val : (((1 << 16) - 1) ^ e[i].val)) ^ (r == 0 ? e[j].val : (((1 << 16) - 1) ^ e[j].val));\n if (tmp.s.size() <= 16)e.pb(tmp);\n tmp.s = \"(\";\n tmp.s += ((k == 0) ? \"\" : \"-\") + e[i].s + \"*\" + ((r == 0) ? \"\" : \"-\") + e[j].s + \")\";\n tmp.val = (k == 0 ? e[i].val : (((1 << 16) - 1) ^ e[i].val)) & (r == 0 ? e[j].val : (((1 << 16) - 1) ^ e[j].val));\n if (tmp.s.size() <= 16)e.pb(tmp);\n }\n }\n\n //4=(1,2)*3\n rep(i, one + two)rng(j, one + two, one + two + thr) {\n rep(k, 2)rep(r, 2) {\n st tmp;\n tmp.s = \"(\";\n tmp.s += ((k == 0) ? \"\" : \"-\") + e[i].s + \"^\" + ((r == 0) ? \"\" : \"-\") + e[j].s + \")\";\n tmp.val = (k == 0 ? e[i].val : (((1 << 16) - 1) ^ e[i].val)) ^ (r == 0 ? e[j].val : (((1 << 16) - 1) ^ e[j].val));\n if (tmp.s.size() <= 16)e.pb(tmp);\n tmp.s = \"(\";\n tmp.s += ((k == 0) ? \"\" : \"-\") + e[i].s + \"*\" + ((r == 0) ? \"\" : \"-\") + e[j].s + \")\";\n tmp.val = (k == 0 ? e[i].val : (((1 << 16) - 1) ^ e[i].val)) & (r == 0 ? e[j].val : (((1 << 16) - 1) ^ e[j].val));\n if (tmp.s.size() <= 16)e.pb(tmp);\n }\n }\n string s;\n while (cin >> s && s != \".\") {\n int val = 0;\n vec<int>kakko(s.size(), -1);\n stack<int>stc;\n rep(i, s.size()) {\n if (s[i] == '(') {\n stc.push(i);\n }\n else if (s[i] == ')') {\n int t = stc.top();stc.pop();\n kakko[t] = i;\n }\n }\n rep(i, 2)rep(j, 2)rep(x, 2)rep(y, 2) {\n auto dfs = [&](int l, int r, auto& dfs) ->bool {\n int cnt = 0;\n vec<bool>v;\n int op = -1;\n for (int z = l;z < r;z++) {\n if (s[z] == '(') {\n bool ret = dfs(z + 1, kakko[z], dfs);\n if (cnt % 2 == 1) ret = !ret;\n cnt = 0;\n v.pb(ret);\n z = kakko[z];\n }\n else if ('a' <= s[z] && s[z] <= 'd' || s[z] == '0' || s[z] == '1') {\n if (s[z] == 'a') v.pb((cnt % 2 == 0) ? i : 1 - i);\n if (s[z] == 'b') v.pb((cnt % 2 == 0) ? j : 1 - j);\n if (s[z] == 'c') v.pb((cnt % 2 == 0) ? x : 1 - x);\n if (s[z] == 'd') v.pb((cnt % 2 == 0) ? y : 1 - y);\n if (s[z] == '0') v.pb((cnt % 2 == 0) ? 0 : 1);\n if (s[z] == '1') v.pb((cnt % 2 == 0) ? 1 : 0);\n cnt = 0;\n }\n else if (s[z] == '*') op = 0;\n else if (s[z] == '^') op = 1;\n else cnt++;\n }\n if (op < 0) return v[0];\n if (op == 0) return v[0] & v[1];\n return v[0] ^ v[1];\n };\n int keta = (i << 3) | (j << 2) | (x << 1) | y;\n val |= (dfs(0, s.size(), dfs) << keta);\n }\n\n //0か1は例外処理\n bool flag = true;\n rep(i, 2)rep(j, 2)rep(x, 2)rep(y, 2) {\n int keta = (i << 3) | (j << 2) | (x << 1) | y;\n if ((val >> keta) & 1) flag = false;\n }\n if (flag) {\n cout << \"1\\n\";\n continue;\n }\n flag = true;\n rep(i, 2)rep(j, 2)rep(x, 2)rep(y, 2) {\n int keta = (i << 3) | (j << 2) | (x << 1) | y;\n if (!((val >> keta) & 1)) flag = false;\n }\n if (flag) {\n cout << \"1\\n\";\n continue;\n }\n\n int ans = s.size();\n for (const auto& g : e) {\n if (g.s.size() > ans) continue;\n if (val == g.val) ans = min(ans, int(g.s.size()));\n if (val == (((1 << 16) - 1) ^ g.val)) ans = min(ans, int(g.s.size()) + 1);\n }\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":2180,"memory_kb":16604,"score_of_the_acc":-0.6639,"final_rank":16},{"submission_id":"aoj_1620_7974903","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint NOT(int x) {\n return x^1;\n}\nint XOR(int x, int y) {\n return x^y;\n}\nint AND(int x, int y) {\n return x&y;\n}\nint expression(string &s, int &l, int &r, vector<int> &f) {\n if( '0' <= s[l] && s[l] <= '1' ) {\n return s[l]-'0';\n }else if( 'a' <= s[l] && s[l] <= 'd' ) {\n return f[s[l]-'a'];\n }else if( s[l] == '-' ) {\n l++;\n return NOT(expression(s, l, r, f));\n }else {\n int p, q;\n char c;\n for( int i = l+1, d = 0; i <= r-1; i++ ) {\n if( s[i] == '(' ) d++;\n if( s[i] == ')' ) d--;\n if( ( s[i] == '*' || s[i] == '^' ) && d == 0 ) c = s[i], p = i-1, q = i+1;\n }\n if( c == '*' ) {\n l++, r--;\n return AND(expression(s, l, p, f), expression(s, q, r, f));\n }\n if( c == '^' ) {\n l++, r--;\n return XOR(expression(s, l, p, f), expression(s, q, r, f));\n }\n }\n return -1;\n}\nint main() {\n int L = 16, rem = 1<<L;\n vector<int> ans(1<<L, -1);\n vector<vector<string>> E(L+1, vector<string>());\n vector<vector<int>> f_all(1<<4, vector<int>(4));\n for( int i = 0; i < 1<<4; i++ ) {\n for( int j = 0; j < 4; j++ ) {\n f_all[i][j] = (i>>j)&1;\n }\n }\n auto get_key = [&](string s) -> int {\n int ret = 0;\n for( int i = 0; i < 1<<4; i++ ) {\n int _l = 0, _r = (int)s.size()-1;\n ret |= expression(s, _l, _r, f_all[i])<<i;\n }\n return ret;\n };\n auto operate = [&](string s) -> void {\n int ret = get_key(s);\n if( ans[ret] == -1 ) {\n rem--;\n ans[ret] = (int)s.size();\n }\n };\n E[1] = {\"0\", \"1\", \"a\", \"b\", \"c\", \"d\"};\n for( string &s : E[1] ) {\n operate(s);\n }\n for( int l = 2; l <= L; l++ ) {\n for( string &s : E[l-1] ) {\n if( s.front() != '-' ) E[l].push_back(\"-\"+s);\n }\n if( l >= 5 ) {\n for( int x = 1; x <= (l-3)/2; x++ ) {\n for( string &s : E[x] ) {\n for( string &t : E[l-3-x] ) {\n E[l].push_back(\"(\"+s+\"*\"+t+\")\");\n E[l].push_back(\"(\"+s+\"^\"+t+\")\");\n }\n }\n }\n }\n for( string &s : E[l] ) {\n if( rem == 0 ) break;\n operate(s);\n }\n }\n string e;\n while( true ) {\n cin >> e;\n if( e == \".\" ) break;\n cout << ans[get_key(e)] << endl;\n }\n}","accuracy":1,"time_ms":610,"memory_kb":45816,"score_of_the_acc":-0.4211,"final_rank":14},{"submission_id":"aoj_1620_7776375","code_snippet":"#include <bits/stdc++.h>\n\n#define rep(i,s,n) for(int i = int(s); i < int(n); i++)\n#define rrep(i,s,n) for(int i = int(n) - 1; i >= s; i--)\n#define all(v) v.begin(), v.end()\n\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\n\ntemplate<class T>\nbool chmin(T &a, T b) {\n if(a <= b) return false;\n a = b;\n return true;\n}\n\ntemplate<class T>\nbool chmax(T &a, T b) {\n if(a >= b) return false;\n a = b;\n return true;\n}\n\nint main() {\n const int INF = std::numeric_limits<int>::max() / 4;\n const int sz = 4;\n const int m = 1<<sz;\n const int mask = (1<<m) - 1;\n const int max = 16;\n std::vector<int> table(4, 0);\n rep(i,0,4) {\n rep(bit,0,1<<sz) {\n if((bit >> i) & 1) {\n table[i] |= (1<<bit);\n }\n }\n }\n std::vector<int> dp(1<<m, INF);\n {\n dp[0] = 1;\n dp[mask] = 1;\n std::vector<std::pair<int,int>> p;\n p.emplace_back(1, 0);\n p.emplace_back(1, mask);\n rep(i,0,4) {\n p.emplace_back(1, table[i]);\n dp[table[i]] = 1;\n }\n int idx = 0;\n while(idx < (int)p.size()) {\n auto [lenS, S] = p[idx];\n if(dp[S] < lenS || dp[S] > max) {\n idx++;\n continue;\n }\n if(dp[mask ^ S] > lenS + 1) {\n dp[mask ^ S] = lenS + 1;\n p.emplace_back(lenS + 1, mask ^ S);\n }\n rep(i,0,idx) {\n auto [lenT, T] = p[i];\n if(dp[T] < lenT) continue;\n if(dp[S^T] > lenS + lenT + 3) {\n dp[S^T] = lenS + lenT + 3;\n p.emplace_back(lenS + lenT + 3, S^T);\n }\n if(dp[S&T] > lenS + lenT + 3) {\n dp[S&T] = lenS + lenT + 3;\n p.emplace_back(lenS + lenT + 3, S & T);\n }\n }\n idx++;\n }\n }\n std::string s;\n while(std::cin >> s, s != \".\") {\n int idx = 0;\n auto f = [&]() -> int {\n char c = s[idx++];\n if(c == '0') return 0;\n else if(c == '1') return (1<<m) - 1;\n else if('a' <= c && c <= 'd') {\n return table[c-'a'];\n }\n else {\n assert(0);\n }\n };\n auto expect = [&](char c) -> bool {\n return s[idx] == c;\n };\n auto consume = [&](char c) -> void {\n if(s[idx] == c) {\n idx++;\n }\n else {\n assert(0);\n }\n };\n auto E = [&](auto &&self) -> int {\n if(expect('-')) {\n consume('-');\n int e = self(self);\n return mask ^ e;\n }\n else if(expect('(')) {\n consume('(');\n int lhs = self(self);\n char c = s[idx];\n consume(c);\n int rhs = self(self);\n consume(')');\n if(c == '*') {\n return lhs & rhs;\n }\n else if(c == '^') {\n return lhs ^ rhs;\n }\n else {\n assert(0);\n }\n }\n else {\n return f();\n }\n };\n int res = E(E);\n assert(idx == (int)s.size());\n std::cout << dp[res] << '\\n';\n }\n}","accuracy":1,"time_ms":310,"memory_kb":5224,"score_of_the_acc":-0.0913,"final_rank":11},{"submission_id":"aoj_1620_6787084","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\nusing vvvvll = vector<vvvll>;\nusing vb = vector<bool>;\nusing vvb = vector<vb>;\nusing vvvb = vector<vvb>;\nusing vd = vector<double>;\nusing vvd = vector<vd>;\nusing vvvd = vector<vvd>;\n#define all(A) A.begin(),A.end()\n#define ALL(A) A.begin(),A.end()\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\nusing pqr = priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>;\n\ntemplate<class T>\nbool chmax(T& p, T q, bool C = 1) {\n if (C == 0 && p == q) {\n return 1;\n }\n if (p < q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\n\ntemplate<class T>\nbool chmin(T& p, T q, bool C = 1) {\n if (C == 0 && p == q) {\n return 1;\n }\n if (p > q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\n\nll gcd(ll(a), ll(b)) {\n if (b == 0)return a;\n ll c = a;\n while (a % b != 0) {\n c = a % b;\n a = b;\n b = c;\n }\n return b;\n}\n\nvll M((1 << 16), 1e18);\n\nbool dev(string S, bool a, bool b, bool c, bool d) {\n bool res = 0;\n ll N = S.size();\n if (S[0] == '(') {\n ll kakko = 0;\n for (ll i = 1; i < N; i++) {\n if (S[i] == '(')kakko++;\n else if (S[i] == ')')kakko--;\n else if (S[i] == '^' && kakko == 0) {\n string S1 = S.substr(1, i - 1);\n string S2 = S.substr(i + 1, N - i - 2);\n return dev(S1, a, b, c, d) ^ dev(S2, a, b, c, d);\n break;\n }\n else if (S[i] == '*' && kakko == 0) {\n string S1 = S.substr(1, i - 1);\n string S2 = S.substr(i + 1, N - i - 2);\n return dev(S1, a, b, c, d) & dev(S2, a, b, c, d);\n break;\n }\n }\n }\n else if (S[0] == '-') {\n return !dev(S.substr(1, N - 1), a, b, c, d);\n }\n else if (S[0] == 'a')return a;\n else if (S[0] == 'b')return b;\n else if (S[0] == 'c')return c;\n else if (S[0] == 'd')return d;\n else if (S[0] == '0')return 0;\n else if (S[0] == '1')return 1;\n return res;\n}\n\nll solve(string S) {\n ll res = 0;\n rep(bit, (1 << 4)) {\n bool a = (bit & 1);\n bool b = (bit & 2);\n bool c = (bit & 4);\n bool d = (bit & 8);\n if (dev(S, a, b, c, d))res += (1 << bit);\n }\n return res;\n}\nset<string> maked;\nvector<string> V;\n\nvoid make(string S) {\n if (maked.count(S))return;\n maked.insert(S);\n if(chmin(M[solve(S)], ll(S.size()))){\n \n V.push_back(S);\n make(\"-\" + S);\n rep(i,V.size()){\n string p = V[i];\n if (p != \"\") {\n if (p.size() + S.size() > 10)continue;\n make(\"(\" + p + \"*\" + S + \")\");\n make(\"(\" + p + \"^\" + S + \")\");\n make(\"(\" + S + \"*\" + p + \")\");\n make(\"(\" + S + \"^\" + p + \")\");\n }\n }\n }\n\n}\n\n\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n maked.insert(\"\");\n make(\"0\");\n make(\"1\");\n make(\"a\");\n make(\"b\");\n make(\"c\");\n make(\"d\");\n string S;\n while (cin >> S) {\n if (S == \".\")return 0;\n cout << min(ll(S.size()),M[solve(S)]) << endl;\n }\n\n}","accuracy":1,"time_ms":10,"memory_kb":3972,"score_of_the_acc":-0.003,"final_rank":1},{"submission_id":"aoj_1620_6710763","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\"\nusing namespace std;\n// #include <atcoder/lazysegtree>\n// using namespace atcoder;\n\ntypedef long long int ll;\ntypedef unsigned long long ull;\ntypedef long double ld;\ntypedef pair<ll, ll> pll;\ntypedef vector<ll> vll;\ntypedef vector<vll> vvll;\ntypedef vector<vvll> vvvll;\ntypedef vector<pll> vpll;\ntypedef vector<vpll> vvpll;\ntypedef vector<bool> vb;\ntypedef vector<vb> vvb;\ntypedef vector<double> vd;\ntypedef vector<vd> vvd;\ntypedef priority_queue<pll, vpll, function<bool(pll, pll)> > pqpll;\ntypedef priority_queue<ll, vll, function<bool(pll, pll)> > pqll;\n\n//struct edge{ ll from,to,cost; edge(ll e_from,ll e_to,ll e_cost): from(e_from), to(e_to), cost(e_cost){} };\n//typedef vector<vector<edge>> Graph;\n\n#define rep(i,a,n) for(ll i = a;i < n;i++)\n#define rrep(i,a,n) for(ll i = n-1; i >= a;i--)\n#define LINF (1LL << 60)\n#define INF (1 << 30)\n#define fs first\n#define sc second\n#define EPS 1e-10\n#define ALL(a) a.begin(), a.end()\n#define tcheck(a) if((clock() - start)/(ld)CLOCKS_PER_SEC >= a) break\n#define debug(s) cout << #s << endl\n#define debugval(x) cout << #x\" = \" << x << endl\n\ntemplate<typename T> ll sz(vector<T>& pos) { return (ll)pos.size(); }\ntemplate<typename T> ll sz(priority_queue<T, vector<T> >& pq) { return (ll)pq.size(); }\ntemplate<typename T> ll sz(priority_queue<T, vector<T>, greater<T> >& pq) { return (ll)pq.size(); }\nll sz(string& s) { return (ll)s.size(); }\n\ntemplate<typename T> void chmin(T& a, T b) { if (a > b) a = b; }\ntemplate<typename T> void chmax(T& a, T b) { if (a < b) a = b; }\n\nll gcd(ll a, ll b) { return ((!b) ? a : gcd(b, a % b)); }\nll lcm(ll a, ll b) { return a / gcd(a, b) * b; }\nll dx[4] = { 0,-1,0,1 }, dy[4] = { -1,0,1,0 };\ninline bool isinside(ll i, ll n) { return (i < n&& i >= 0); }\n\ntypedef string::const_iterator State;\nclass ParseError {};\n\nconst ll A = 0xFF00, B = 0xF0F0, C = 0xCCCC, D = 0xAAAA;\n\nll expr(State& begin) {\n if (*begin == '1') {\n begin++;\n return 0xFFFF;\n }\n else if (*begin == '0') {\n begin++;\n return 0;\n }\n else if ('a' <= *begin && *begin <= 'd') {\n ll res = 0;\n if (*begin == 'a') res = A;\n else if (*begin == 'b') res = B;\n else if (*begin == 'c') res = C;\n else if (*begin == 'd') res = D;\n begin++;\n return res;\n }\n else if (*begin == '-') {\n begin++;\n ll res = expr(begin);\n res ^= 0xFFFF;\n return res;\n }\n else if (*begin == '(') {\n begin++;\n ll res = expr(begin);\n char op = *begin; begin++;\n ll res2 = expr(begin);\n if (op == '^') res ^= res2;\n else if (op == '*') res &= res2;\n else {\n cout << \"parseerror0 : \" << *begin << endl;\n throw ParseError();\n }\n begin++;\n return res;\n }\n else {\n cout << \"parseerror1 : \" << *begin << endl;\n throw ParseError();\n }\n return 0;\n}\n\n\nstring t = \"01abcd\";\nvector<string> tvec = vector<string>({ \"-E\",\"(E^E)\",\"(E*E)\" });\nint main() {\n string s;\n while (1) {\n cin >> s;\n if (s == \".\") break;\n\n State begin = s.begin();\n ll res = expr(begin);\n\n ll ans = 16;\n queue<string> que;\n que.emplace(\"E\");\n while (que.size()) {\n string str = que.front();\n que.pop();\n if (ans <= str.size())continue;\n ll ecnt = 0;\n rep(i, 0, sz(str)) if (str[i] == 'E') ecnt++;\n rep(i, 0, sz(str)) {\n if (str[i] == 'E') {\n rep(j, 0, sz(t)) {\n str[i] = t[j];\n begin = str.begin();\n if (ecnt == 1 && expr(begin) == res) chmin(ans, sz(str));\n else if (ecnt >= 2) que.push(str);\n }\n\n rep(j, 0, sz(tvec)) {\n string newstr = str.substr(0, i) + tvec[j] + str.substr(i + 1, sz(str) - i - 1);\n if (sz(newstr) <= 15) que.push(newstr);\n }\n }\n }\n }\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":1390,"memory_kb":19432,"score_of_the_acc":-0.4689,"final_rank":15},{"submission_id":"aoj_1620_6690512","code_snippet":"#include <iostream>\n#include <cstdio>\n#include <cstdlib>\n#include <algorithm>\n#include <cmath>\n#include <vector>\n#include <set>\n#include <map>\n#include <unordered_set>\n#include <unordered_map>\n#include <queue>\n#include <ctime>\n#include <cassert>\n#include <complex>\n#include <string>\n#include <cstring>\n#include <chrono>\n#include <random>\n#include <queue>\n#include <bitset>\n#include <stack>\n#include <functional>\n\n// AtCoder\n// #include <atcoder/all>\n// using namespace atcoder;\n\n#ifdef LOCAL\n #define eprintf(...) fprintf(stderr, __VA_ARGS__)\n#else\n #define eprintf(...)\n#endif\n\n#define rep_(i, a_, b_, a, b, ...) for (int i = (a), i##_len = (b); i < i##_len; ++i)\n#define rep(i, ...) rep_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)\n#define reprev_(i, a_, b_, a, b, ...) for (int i = (b)-1, i##_min = (a); i >= i##_min; --i)\n#define reprev(i, ...) reprev_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)\n#define all(x) (x).begin(), (x).end()\ntemplate <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }\ntemplate <class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; }\n#define fls(x) (64 - __builtin_clzll(x))\n#define pcnt(x) __builtin_popcountll(x)\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair <int,int> P;\ntypedef long double ld;\n\nint var(char c) {\n if (c == '0') return 0b0000'0000'0000'0000;\n if (c == '1') return 0b1111'1111'1111'1111;\n if (c == 'a') return 0b1111'1111'0000'0000;\n if (c == 'b') return 0b1111'0000'1111'0000;\n if (c == 'c') return 0b1100'1100'1100'1100;\n if (c == 'd') return 0b1010'1010'1010'1010;\n // cerr << \"[debug] c=\" << c << endl;\n assert(false);\n}\nint parse(const string &s, int &cur) {\n // cerr << \"[debug] cur=\" << cur << \" s[cur]=\" << s[cur] << endl;\n\n int res = 0;\n if (s[cur] == '(') {\n int l = parse(s, ++cur);\n char op = s[cur++];\n int r = parse(s, cur);\n ++cur;\n if (op == '*') return l & r;\n else return l ^ r;\n } else if (s[cur] == '-') {\n int tmp = parse(s, ++cur);\n return ~tmp & 0b1111'1111'1111'1111;\n } else {\n return var(s[cur++]);\n }\n // cerr << \"[debug] cur=\" << cur << endl;\n assert(false);\n}\nint parse(const string &s) {\n int cur = 0;\n return parse(s, cur);\n}\nvoid debug_out(int res) {\n cerr << \"[debug] \";\n reprev (i, 16) cerr << (res >> i & 1);\n cerr << endl;\n}\n\nvector<int> make_table(void) {\n vector<int> res(1 << 16, 1e9);\n map<int, int> mp, mp_;\n mp[var('0')] = 1;\n mp[var('1')] = 1;\n mp[var('a')] = 1;\n mp[var('b')] = 1;\n mp[var('c')] = 1;\n mp[var('d')] = 1;\n rep (_, 4) {\n for (auto [k, v] : mp) {\n // -\n int minus = ~k & 0b1111'1111'1111'1111;\n if (mp.find(minus) == mp.end()) mp[minus] = v + 1;\n else chmin(mp[minus], v + 1);\n }\n\n if (_ == 3) break;\n\n mp_ = mp;\n for (auto [k, v] : mp) {\n for (auto [k_, v_] : mp) {\n int res = k & k_;\n if (mp_.find(res) == mp_.end()) mp_[res] = v + v_ + 3;\n else chmin(mp_[res], v + v_ + 3);\n }\n\n // ^\n for (auto [k_, v_] : mp) {\n int res = k ^ k_;\n if (mp_.find(res) == mp_.end()) mp_[res] = v + v_ + 3;\n else chmin(mp_[res], v + v_ + 3);\n }\n }\n swap(mp, mp_);\n }\n for (auto [k, v] : mp) res[k] = v;\n return res;\n}\n\nint main (void)\n{\n cin.tie(0);\n ios::sync_with_stdio(false);\n auto table = make_table();\n string s;\n while (true) {\n cin >> s;\n if (s == \".\") break;\n int parsed = parse(s);\n // debug_out(parsed);\n cout << table[parsed] << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":510,"memory_kb":6288,"score_of_the_acc":-0.1516,"final_rank":12},{"submission_id":"aoj_1620_5963071","code_snippet":"#include <iostream>\n#include <algorithm>\n#include <map>\n#include <set>\n#include <queue>\n#include <bitset>\n#include <climits>\n#include <string>\n#include <cmath>\n#include <bitset>\n#include <complex>\n#include <functional>\n#include <ctime>\n#include <cassert>\n#include <fstream>\n#include <stack>\n#include <random>\n#include <iomanip>\n#include <time.h>\n#include <list>\n#include <unordered_map>\n\n#include <algorithm>\n#include <array>\n\nusing namespace std;\ntypedef long long ll;\ntypedef long double dd;\ntypedef vector<ll> vl;\ntypedef vector<dd> vd;\ntypedef vector<vector<ll>> vvl;\n#define i_7 (ll)(1E9+7)\n//#define i_7 998244353\n#define i_5 i_7-2\nll mod(ll a){\n ll c=a%i_7;\n if(c>=0)return c;\n return c+i_7;\n}\ntypedef pair<ll,ll> l_l;\ntypedef pair<dd,dd> d_d;\nll inf=(ll)1E18;\n#define rep(i,l,r) for(ll i=l;i<=r;i++)\n#define pb push_back\nll max(ll a,ll b){if(a<b)return b;else return a;}\nll min(ll a,ll b){if(a>b)return b;else return a;}\ndd EPS=1E-6;\ndd PI=acos(-1);\n#define endl \"\\n\"\n#define fastio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);\n\n\n\n\nll exp(const string &s, ll &cur, const bitset<4> cha){\n if(s[cur] == '-'){\n cur++;\n ll tmp = exp(s, cur, cha);\n return 1-tmp;\n }else if(s[cur] == '('){\n cur++;\n ll t1 = exp(s, cur, cha);\n char op = s[cur];\n cur++;\n ll t2 = exp(s, cur, cha);\n cur++;\n if(op == '*'){\n return t1&t2;\n }else if(op == '^'){\n return t1^t2;\n }\n assert(0);\n return 0;\n }else if(s[cur] == '0' || s[cur] == '1'){\n ll tmp = s[cur] - '0';\n cur++;\n return tmp;\n }else{\n ll index = s[cur] - 'a';\n ll tmp = cha[index];\n cur++;\n return tmp;\n }\n}\n\nbitset<16> exp_all(const string &s){\n bitset<16> res;\n rep(i,0,15){\n bitset<4> cha(i);\n ll cur=0;\n ll exp_res = exp(s, cur, cha);\n res[i] = exp_res;\n }\n return res;\n}\n\nstruct Hoge{\n ll time;\n bitset<16> value;\n Hoge(ll time, bitset<16> value){\n this->time = time;\n this->value = value;\n }\n bool operator < ( const Hoge &b ) const{\n if(this->time == b.time){\n return this->value.to_ulong() < b.value.to_ulong();\n }else{\n return this->time < b.time;\n }\n }\n \n};\n\nsigned main(){fastio\n ll N=(1<<16);\n ll dp[N];\n rep(i,0,N-1)dp[i] = inf;\n \n bitset<16> bit_0(\"0000000000000000\");\n bitset<16> bit_1(\"1111111111111111\");\n bitset<16> bit_a(\"1111111100000000\");\n bitset<16> bit_b(\"1111000011110000\");\n bitset<16> bit_c(\"1100110011001100\");\n bitset<16> bit_d(\"1010101010101010\");\n dp[bit_0.to_ulong()] = 1;\n dp[bit_1.to_ulong()] = 1;\n dp[bit_a.to_ulong()] = 1;\n dp[bit_b.to_ulong()] = 1;\n dp[bit_c.to_ulong()] = 1;\n dp[bit_d.to_ulong()] = 1;\n set<Hoge> que;\n que.insert(Hoge(1, bit_0));\n que.insert(Hoge(1, bit_1));\n que.insert(Hoge(1, bit_a));\n que.insert(Hoge(1, bit_b));\n que.insert(Hoge(1, bit_c));\n que.insert(Hoge(1, bit_d));\n \n while(!que.empty()){\n Hoge que_tmp=*que.begin(); que.erase(que.begin());\n ll d=que_tmp.time;\n bitset<16> value = que_tmp.value;\n if(dp[value.to_ulong()] < d)continue;\n //'-'\n //cout<<value<<' '<<dp[value.to_ulong()]<<' '<<que.size()<<endl;\n if(d > 16)continue;\n \n bitset<16> not_ = ~value;\n if(dp[not_.to_ulong()] > dp[value.to_ulong()] + 1){\n dp[not_.to_ulong()] = dp[value.to_ulong()] + 1;\n que.insert(Hoge(dp[not_.to_ulong()], not_));\n }\n rep(i,0,(1<<16)-1){\n if(dp[i]==inf)continue;\n bitset<16> bi(i);\n bitset<16> and_ = value&bi;\n bitset<16> xor_ = value^bi;\n if(dp[and_.to_ulong()] > dp[value.to_ulong()] + dp[i] +3){\n dp[and_.to_ulong()] = dp[value.to_ulong()] + dp[i] +3;\n que.insert(Hoge(dp[and_.to_ulong()], and_));\n }\n if(dp[xor_.to_ulong()] > dp[value.to_ulong()] + dp[i] +3){\n dp[xor_.to_ulong()] = dp[value.to_ulong()] + dp[i] +3;\n que.insert(Hoge(dp[xor_.to_ulong()], xor_));\n }\n }\n }\n \n //cout<<\"Hoge\"<<endl;\n \n while(true){\n string s;cin>>s;\n if(s==\".\"){\n return 0;\n }\n bitset<16> res = exp_all(s);\n cout<<dp[res.to_ulong()]<<endl;\n }\n \n return 0;\n}","accuracy":1,"time_ms":210,"memory_kb":25784,"score_of_the_acc":-0.1906,"final_rank":13}],"string":"[\n {\n \"submission_id\": \"aoj_1620_10853829\",\n \"code_snippet\": \"#include<cstdio>\\n#include<algorithm>\\n#include<vector>\\n#include<queue>\\n#include<map>\\n#include<cstring>\\nusing namespace std;\\n\\nconst int N = 16;\\n\\nchar S[N + 2];\\nint T[N + 2], p;\\nmap<char, int> M;\\nconst char *al = \\\"abcd\\\";\\nconst char *nu = \\\"01\\\";\\nconst char *st = \\\"^*\\\";\\n\\nvector<vector<char>> V[N + 2];\\n\\nint get(vector<char> &s)\\n{\\n\\tif (strchr(nu, s[p]))\\n\\t\\treturn s[p++] - '0';\\n\\tif (strchr(al, s[p]))\\n\\t\\treturn M[s[p++]];\\n\\tif (s[p] == '-')\\n\\t{\\n\\t\\tp++;\\n\\t\\treturn 1 ^ get(s);\\n\\t}\\n\\tp++;\\n\\tint l = get(s);\\n\\tint t = p++;\\n\\tint r = get(s);\\n\\tp++;\\n\\tif (s[t] == '^')\\n\\t\\treturn l^r;\\n\\telse\\n\\t\\treturn l&r;\\n}\\n\\nint get(char *s)\\n{\\n\\tif (strchr(nu, s[p]))\\n\\t\\treturn s[p++] - '0';\\n\\tif (strchr(al, s[p]))\\n\\t\\treturn M[s[p++]];\\n\\tif (s[p] == '-')\\n\\t{\\n\\t\\tp++;\\n\\t\\treturn 1 ^ get(s);\\n\\t}\\n\\tp++;\\n\\tint l = get(s);\\n\\tint t = p++;\\n\\tint r = get(s);\\n\\tp++;\\n\\tif (s[t] == '^')\\n\\t\\treturn l^r;\\n\\telse\\n\\t\\treturn l&r;\\n}\\n\\nvoid init(int k)\\n{\\n\\tif (k == 1)\\n\\t{\\n\\t\\tfor (int i = 0; i < 4; i++)\\n\\t\\t\\tV[k].push_back({ al[i] });\\n\\t\\tfor (int i = 0; i < 2; i++)\\n\\t\\t\\tV[k].push_back({ nu[i] });\\n\\t}\\n\\tif (k >= 2)\\n\\t{\\n\\t\\tfor (auto &t : V[k - 1])\\n\\t\\t{\\n\\t\\t\\tV[k].push_back({ '-' });\\n\\t\\t\\tvector<char> &v = V[k].back();\\n\\t\\t\\tv.insert(v.end(), t.begin(), t.end());\\n\\t\\t}\\n\\t}\\n\\tif (k >= 3)\\n\\t{\\n\\t\\tfor (int i = 1, j = k - 3 - 1; i < k - 3; i++, j--)\\n\\t\\t{\\n\\t\\t\\tfor (auto &t : V[i])\\n\\t\\t\\t\\tfor (auto &t2 : V[j])\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tfor (int l = 0; l < 2; l++)\\n\\t\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\t\\tV[k].push_back({ '(' });\\n\\t\\t\\t\\t\\t\\tvector<char> &v = V[k].back();\\n\\t\\t\\t\\t\\t\\tv.insert(v.end(), t.begin(), t.end());\\n\\t\\t\\t\\t\\t\\tv.push_back(st[l]);\\n\\t\\t\\t\\t\\t\\tv.insert(v.end(), t2.begin(), t2.end());\\n\\t\\t\\t\\t\\t\\tv.push_back(')');\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\t//for (auto &v : V[k])\\n\\t//{\\n\\t//\\tfor (auto &c : v)\\n\\t//\\t\\tprintf(\\\"%c\\\", c);\\n\\t//\\tprintf(\\\"\\\\n\\\");\\n\\t//\\tprintf(\\\"k=%d\\\\n\\\", k);\\n\\t//}\\n}\\n\\nint main()\\n{\\n\\tfor (int i = 1; i < N; i++)\\n\\t{\\n\\t\\tinit(i);\\n\\t\\t//printf(\\\"i=%d\\\\n\\\", i);\\n\\t}\\n\\tfor (; scanf(\\\"%s\\\", S) && S[0] != '.'; )\\n\\t{\\n\\t\\tfor (int t = 0; t < 1 << 4; t++)\\n\\t\\t{\\n\\t\\t\\tfor (int l = 0; l < 4; l++)\\n\\t\\t\\t\\tM[al[l]] = t >> l & 1;\\n\\t\\t\\tp = 0;\\n\\t\\t\\tT[t] = get(S);\\n\\t\\t\\t//printf(\\\"t=%d\\\\n\\\", t);\\n\\t\\t}\\n\\t\\t//printf(\\\"A\\\\n\\\");\\n\\t\\tint ans = 1;\\n\\t\\tfor (; ans < 16; ans++)\\n\\t\\t{\\n\\t\\t\\tbool ok = false;\\n\\t\\t\\tfor (auto &v : V[ans])\\n\\t\\t\\t{\\n\\t\\t\\t\\tbool all = true;\\n\\t\\t\\t\\tfor (int t = 0; t < 1 << 4; t++)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tfor (int l = 0; l < 4; l++)\\n\\t\\t\\t\\t\\t\\tM[al[l]] = t >> l & 1;\\n\\t\\t\\t\\t\\tp = 0;\\n\\t\\t\\t\\t\\tall &= T[t] == get(v);\\n\\t\\t\\t\\t\\tif (!all)\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (all)\\n\\t\\t\\t\\t{\\n\\t\\t\\t\\t\\tok = true;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (ok)\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t//printf(\\\"nowans=%d\\\\n\\\", ans);\\n\\t\\t}\\n\\t\\tprintf(\\\"%d\\\\n\\\", ans);\\n\\t}\\n}\\n\\n/*\\n\\n\\n*/\",\n \"accuracy\": 1,\n \"time_ms\": 2900,\n \"memory_kb\": 166396,\n \"score_of_the_acc\": -1.7769,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1620_10668668\",\n \"code_snippet\": \"#pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n\\n// #ifndef ONLINE_JUDGE\\n// #define _GLIBCXX_DEBUG // 配列外参照のエラー\\n// #endif\\n\\n// スタンダードライブラリ\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n// 型関連\\nusing ll = long long;\\nusing lint = long long;\\nusing pll = pair<ll, ll>;\\nusing plll = tuple<ll, ll, ll>;\\nusing pii = pair<int, int>;\\nusing piii = tuple<ll, ll, ll>;\\nusing vi = vector<int>;\\nusing vvi = vector<vector<int>>;\\nusing vvvi = vector<vector<vector<int>>>;\\nusing vvvvi = vector<vector<vector<vector<int>>>>;\\nusing vl = vector<ll>;\\nusing vvl = vector<vector<ll>>;\\nusing vvvl = vector<vector<vector<ll>>>;\\nusing vvvvl = vector<vector<vector<vector<ll>>>>;\\n\\ntemplate <class T> using prique = priority_queue<T>;\\n\\n// 型定数\\nconstexpr ll mod = 998244353;\\nconstexpr ll MOD = 1000000007;\\nint INF32 = 2e9;\\nll INF64 = 9e18;\\n#define endl '\\\\n';\\n\\nint dx[4] = {1, 0, -1, 0};\\nint dy[4] = {0, 1, 0, -1};\\n\\n/////////////////////////// print関連\\ntemplate <typename T> void print(vector<T> A);\\nvoid print();\\ntemplate <class Head, class... Tail> void print(Head &&head, Tail &&...tail);\\nvoid print(string S);\\ntemplate <typename T> void print(vector<vector<T>> &F);\\n\\ninline void Yes(bool f);\\n\\n\\nint get_val(string &S, vi &V) {\\n int idx=0;\\n auto E = [&](auto E) -> int {\\n if (S[idx] == '0' || S[idx] == '1') {\\n idx++;\\n return S[idx-1] - '0';\\n }\\n if (S[idx] == 'a' || S[idx] == 'b' || S[idx] == 'c' || S[idx] == 'd') {\\n idx++;\\n return V[S[idx-1]-'a'];\\n }\\n if (S[idx] == '-') {\\n idx++;\\n int nval = E(E);\\n return (1^nval);\\n }\\n idx++;\\n int left = E(E);\\n char op = S[idx];\\n idx++;\\n int right = E(E);\\n idx++;\\n if (op == '*') {\\n return (left & right);\\n }\\n return (left ^ right);\\n };\\n\\n return E(E);\\n}\\n\\nbool is_sameST(string S, string T) {\\n\\n \\n\\n for (int B = 0; B < (1 << 4); B++) {\\n vi V(4);\\n for (int i = 0; i < 4; i++) {\\n if (B & (1 << i)) {\\n V[i]=1;\\n }\\n }\\n if (get_val(S, V) != get_val(T, V)) {\\n return false;\\n }\\n }\\n return true;\\n}\\n\\n///////////////////ここから//////////////////////\\nbool solve(vector<vector<string>> &Logical) {\\n string S;\\n cin >> S;\\n if (S == \\\".\\\")\\n return false;\\n int N = S.size();\\n\\n \\n for (int i = 1; i < N; i++) {\\n for (auto l : Logical[i]) {\\n if (is_sameST(S, l)) {\\n print(i);\\n return true;\\n }\\n }\\n }\\n print(N);\\n\\n return true;\\n}\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n\\n int N=15;\\n vector<vector<string>> Logical(N + 1);\\n Logical[1] = {\\\"a\\\", \\\"b\\\", \\\"c\\\", \\\"d\\\", \\\"0\\\", \\\"1\\\"};\\n\\n for (int i = 2; i < N + 1; i++) {\\n for (auto l : Logical[i - 1]) {\\n Logical[i].push_back(\\\"-\\\" + l);\\n }\\n for (int j = 1; j < i - 3; j++) {\\n for (auto l1 : Logical[j]) {\\n for (auto l2 : Logical[i - 3 - j]) {\\n Logical[i].push_back(\\\"(\\\" + l1 + \\\"*\\\" + l2 + \\\")\\\");\\n Logical[i].push_back(\\\"(\\\" + l1 + \\\"^\\\" + l2 + \\\")\\\");\\n }\\n }\\n }\\n }\\n while (solve(Logical))\\n ;\\n}\\n\\n////////////////////print/////////////////////////\\n// 1次元ベクトルを出力する\\ntemplate <typename T> void print(vector<T> A) {\\n if (A.size() == 0) {\\n return;\\n }\\n for (size_t i = 0; i < A.size() - 1; i++) {\\n cout << A[i] << ' ';\\n }\\n cout << A[A.size() - 1] << endl;\\n return;\\n}\\n\\n// 2次元ベクトルを出力する\\ntemplate <typename T> void print(vector<vector<T>> &F) {\\n for (size_t i = 0; i < F.size(); i++) {\\n for (size_t j = 0; j < F[i].size(); j++) {\\n cout << F[i][j];\\n if (j < F[i].size() - 1) {\\n cout << ' ';\\n }\\n }\\n cout << endl;\\n }\\n}\\n\\n// 空白行を出力するprint\\nvoid print() { cout << endl; }\\n\\n// 数値・文字列を空白区切りで出力する. print(a,b)など\\ntemplate <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {\\n cout << head;\\n if (sizeof...(tail) != 0)\\n cout << \\\" \\\";\\n print(forward<Tail>(tail)...);\\n}\\n\\nvoid print(string S) { cout << S << endl; }\\n\\n//////////////出力関連\\n\\ninline void Yes(bool f) {\\n if (f) {\\n cout << \\\"Yes\\\" << endl;\\n } else {\\n cout << \\\"No\\\" << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1370,\n \"memory_kb\": 98536,\n \"score_of_the_acc\": -0.949,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1620_10630583\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll =long long;\\n\\n\\nll a=0,b=0,c=0,d=0;\\nll eval(string S){\\n if(S==\\\"a\\\"){\\n return a;\\n }\\n else if(S==\\\"b\\\"){\\n return b;\\n }\\n else if(S==\\\"c\\\"){\\n return c;\\n }\\n else if(S==\\\"d\\\"){\\n return d;\\n }\\n else if(S==\\\"0\\\"){\\n return 0;\\n }\\n else if(S==\\\"1\\\"){\\n return (1<<16)-1;\\n }\\n else if(S[0]=='-'){\\n return (1<<16)-1-eval(S.substr(1,S.size()-1));\\n }\\n else{\\n ll k=0;\\n for(ll i=1;i<S.size();i++){\\n if(S[i]=='(')k++;\\n else if(S[i]==')')k--;\\n else if(S[i]=='*'&&k==0){\\n return eval(S.substr(1,i-1))&eval(S.substr(i+1,S.size()-i-2));\\n }\\n else if(S[i]=='^'&&k==0){\\n return eval(S.substr(1,i-1))^eval(S.substr(i+1,S.size()-i-2));\\n }\\n }\\n }\\n return 0;\\n}\\n\\nmap<ll,ll> AN;\\n\\n\\nvoid init(){\\n for(int i=0;i<16;i++){\\n a*=2;\\n b*=2;\\n c*=2;\\n d*=2;\\n if(i%16<8)a++;\\n if(i%8<4)b++;\\n if(i%4<2)c++;\\n if(i%2<1)d++;\\n }\\n\\n priority_queue<pair<ll,string>,vector<pair<ll,string>>,greater<pair<ll,string>>> Q;\\n Q.push({1,\\\"0\\\"});\\n Q.push({1,\\\"1\\\"});\\n Q.push({1,\\\"a\\\"});\\n Q.push({1,\\\"b\\\"});\\n Q.push({1,\\\"c\\\"});\\n Q.push({1,\\\"d\\\"});\\n // AN[eval(\\\"0\\\")]=1;\\n // AN[eval(\\\"1\\\")]=1;\\n // AN[eval(\\\"a\\\")]=1;\\n // AN[eval(\\\"b\\\")]=1;\\n // AN[eval(\\\"c\\\")]=1;\\n // AN[eval(\\\"d\\\")]=1;\\n set<string> seen;\\n ll MX=15;\\n while(!Q.empty()){\\n auto [n,s]=Q.top();\\n Q.pop();\\n // cout<<AN.size()<<endl;\\n if(seen.count(s))continue;\\n seen.insert(s);\\n if(AN.count(eval(s)))continue;\\n AN[eval(s)]=n;\\n string ns=\\\"-\\\"+s;\\n if(!AN.count(eval(ns))&&ns.size()<15){\\n Q.push({ns.size(),ns});\\n }\\n for(auto ss:seen){\\n ns=\\\"(\\\"+ss+\\\"^\\\"+s+\\\")\\\";\\n if(!AN.count(eval(ns))&&ns.size()<15){\\n Q.push({ns.size(),ns});\\n }\\n ns=\\\"(\\\"+ss+\\\"*\\\"+s+\\\")\\\";\\n if(!AN.count(eval(ns))&&ns.size()<15){\\n Q.push({ns.size(),ns});\\n }\\n ns=\\\"(\\\"+s+\\\"^\\\"+ss+\\\")\\\";\\n if(!AN.count(eval(ns))&&ns.size()<15){\\n Q.push({ns.size(),ns});\\n }\\n ns=\\\"(\\\"+s+\\\"*\\\"+ss+\\\")\\\";\\n if(!AN.count(eval(ns))&&ns.size()<15){\\n Q.push({ns.size(),ns});\\n }\\n }\\n }\\n}\\n\\n\\nvoid solve(string S){\\n if(!AN.count(eval(S))){\\n AN[eval(S)]=S.size();\\n }\\n cout<<AN[eval(S)]<<\\\"\\\\n\\\";\\n}\\n\\n\\nint main(){\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n\\n init();\\n\\n string S;\\n while(cin>>S,S!=\\\".\\\")solve(S);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3730,\n \"memory_kb\": 4264,\n \"score_of_the_acc\": -1.0048,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1620_10582668\",\n \"code_snippet\": \"#pragma region Macros\\n#include <bits/stdc++.h>\\n\\n#include <atcoder/all>\\nusing namespace std;\\nusing namespace atcoder;\\nusing lint = long long;\\nusing mint = modint998244353;\\nusing ull = unsigned long long;\\nusing ld = long double;\\nusing int128 = __int128_t;\\n#define all(x) (x).begin(), (x).end()\\n#define EPS 1e-8\\n#define uniqv(v) v.erase(unique(all(v)), v.end())\\n#define OVERLOAD_REP(_1, _2, _3, name, ...) name\\n#define REP1(i, n) for (auto i = std::decay_t<decltype(n)>{}; (i) != (n); ++(i))\\n#define REP2(i, l, r) for (auto i = (l); (i) != (r); ++(i))\\n#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP2, REP1)(__VA_ARGS__)\\n#define log(x) cout << x << endl\\n#define logfixed(x) cout << fixed << setprecision(10) << x << endl;\\n#define logy(bool) \\\\\\n if (bool) { \\\\\\n cout << \\\"Yes\\\" << endl; \\\\\\n } else { \\\\\\n cout << \\\"No\\\" << endl; \\\\\\n }\\n\\nostream &operator<<(ostream &dest, __int128_t value) {\\n ostream::sentry s(dest);\\n if (s) {\\n __uint128_t tmp = value < 0 ? -value : value;\\n char buffer[128];\\n char *d = end(buffer);\\n do {\\n --d;\\n *d = \\\"0123456789\\\"[tmp % 10];\\n tmp /= 10;\\n } while (tmp != 0);\\n if (value < 0) {\\n --d;\\n *d = '-';\\n }\\n int len = end(buffer) - d;\\n if (dest.rdbuf()->sputn(d, len) != len) {\\n dest.setstate(ios_base::badbit);\\n }\\n }\\n return dest;\\n}\\n\\ntemplate <typename T>\\nostream &operator<<(ostream &os, const vector<T> &v) {\\n for (int i = 0; i < (int)v.size(); i++) {\\n os << v[i] << (i + 1 != (int)v.size() ? \\\" \\\" : \\\"\\\");\\n }\\n return os;\\n}\\n\\ntemplate <typename T>\\nostream &operator<<(ostream &os, const set<T> &set_var) {\\n for (auto itr = set_var.begin(); itr != set_var.end(); itr++) {\\n os << *itr;\\n ++itr;\\n if (itr != set_var.end()) os << \\\" \\\";\\n itr--;\\n }\\n return os;\\n}\\n\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, const map<T, U> &map_var) {\\n for (auto itr = map_var.begin(); itr != map_var.end(); itr++) {\\n os << itr->first << \\\" -> \\\" << itr->second << \\\"\\\\n\\\";\\n }\\n return os;\\n}\\n\\ntemplate <typename T, typename U>\\nostream &operator<<(ostream &os, const pair<T, U> &pair_var) {\\n os << \\\"(\\\" << pair_var.first << \\\", \\\" << pair_var.second << \\\")\\\";\\n return os;\\n}\\n\\nvoid out() { cout << '\\\\n'; }\\ntemplate <class T, class... Ts>\\nvoid out(const T &a, const Ts &...b) {\\n cout << a;\\n (cout << ... << (cout << ' ', b));\\n cout << '\\\\n';\\n}\\n\\ntemplate <typename T>\\nistream &operator>>(istream &is, vector<T> &v) {\\n for (T &in : v) is >> in;\\n return is;\\n}\\n\\ninline void in(void) { return; }\\ntemplate <typename First, typename... Rest>\\nvoid in(First &first, Rest &...rest) {\\n cin >> first;\\n in(rest...);\\n return;\\n}\\n\\ntemplate <typename T>\\nbool chmax(T &a, const T &b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <typename T>\\nbool chmin(T &a, const T &b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\n\\nvector<lint> dx8 = {1, 1, 0, -1, -1, -1, 0, 1};\\nvector<lint> dy8 = {0, 1, 1, 1, 0, -1, -1, -1};\\nvector<lint> dx4 = {1, 0, -1, 0};\\nvector<lint> dy4 = {0, 1, 0, -1};\\n\\n#pragma endregion\\n\\nbool operate(bool A, char c, bool B) {\\n if (c == '^') return A ^ B;\\n if (c == '*') return A & B;\\n return 1;\\n}\\n\\nbool eval(string s, bool a, bool b, bool c, bool d) {\\n // cout << s << endl;\\n int l = s.size();\\n if (s == \\\"0\\\") return 0;\\n if (s == \\\"1\\\") return 1;\\n if (s == \\\"a\\\") return a;\\n if (s == \\\"b\\\") return b;\\n if (s == \\\"c\\\") return c;\\n if (s == \\\"d\\\") return d;\\n\\n // is (E*F) or 1 or 0\\n if (s[0] == '(' && s[l - 1] == ')') {\\n int x = 0;\\n int op;\\n bool L, R;\\n for (int p = 1; p < l; ++p) {\\n if (s[p] == '(') x++;\\n if (s[p] == ')') x--;\\n if (x == 0 && s[p] != '-') {\\n L = eval(s.substr(1, p), a, b, c, d);\\n op = s[p + 1];\\n R = eval(s.substr(p + 2, l - p - 3), a, b, c, d);\\n return operate(L, op, R);\\n }\\n }\\n assert(false);\\n\\n } else if (s[0] == '-') {\\n return !eval(s.substr(1, l - 1), a, b, c, d);\\n } else {\\n assert(false);\\n }\\n}\\n\\nint main() {\\n cin.tie(0)->sync_with_stdio(0);\\n string s;\\n\\n vector<vector<string>> create(17, vector<string>());\\n queue<string> que;\\n\\n create[1] = {\\\"a\\\", \\\"b\\\", \\\"c\\\", \\\"d\\\", \\\"1\\\", \\\"0\\\"};\\n for (auto v : create[1]) {\\n que.push(v);\\n }\\n\\n auto hash = [&](string s) -> int {\\n int h = 0;\\n for (int bit = 0; bit < (1 << 4); ++bit) {\\n int a = bit & 1, b = (bit >> 1) & 1;\\n int c = (bit >> 2) & 1, d = (bit >> 3) & 1;\\n h += (1 << bit) * (int)eval(s, a, b, c, d);\\n }\\n return h;\\n };\\n\\n map<int, int> smallest;\\n map<int, string> ans;\\n for (auto v : create[1]) {\\n smallest[hash(v)] = 1;\\n ans[hash(v)] = v;\\n }\\n\\n for (int size = 1; size <= 16; ++size)\\n for (int pos = 0; pos < create[size].size(); ++pos) {\\n string E = create[size][pos];\\n // cout << E << endl;\\n // -E\\n if (1 + size <= 16) {\\n string onew = \\\"-\\\" + E;\\n if (!smallest.contains(hash(onew)) || smallest[hash(onew)] > 1 + size) {\\n create[1 + size].push_back(onew);\\n smallest[hash(onew)] = 1 + size;\\n ans[hash(onew)] = onew;\\n }\\n }\\n // (E op F)\\n for (int i = 1; i <= size; ++i) {\\n if (3 + size + i > 16) break;\\n int new_size = 3 + size + i;\\n for (auto F : create[i]) {\\n string new1 = '(' + E + '^' + F + ')';\\n string new2 = '(' + E + '*' + F + ')';\\n if (!smallest.contains(hash(new1)) || smallest[hash(new1)] > new_size) {\\n create[new_size].push_back(new1);\\n smallest[hash(new1)] = new_size;\\n ans[hash(new1)] = new1;\\n }\\n if (!smallest.contains(hash(new2)) || smallest[hash(new2)] > new_size) {\\n create[new_size].push_back(new2);\\n smallest[hash(new2)] = new_size;\\n ans[hash(new2)] = new2;\\n }\\n }\\n }\\n }\\n\\n while (1) {\\n in(s);\\n if (s == \\\".\\\") break;\\n\\n cout << smallest[hash(s)] << endl;\\n // cout << ans[hash(s)] << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 4096,\n \"score_of_the_acc\": -0.0333,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1620_10545893\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef int ll;\\ntypedef unsigned long long ull;\\ntypedef long double ld;\\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\\n#define rrep(i,start,end) for (ll i = start;i >= (ll)(end);i--)\\n#define repn(i,end) for(ll i = 0; i <= (ll)(end); i++)\\n#define reps(i,start,end) for(ll i = start; i < (ll)(end); i++)\\n#define repsn(i,start,end) for(ll i = start; i <= (ll)(end); i++)\\n#define each(p,a) for(auto &p:a)\\ntypedef vector<ll> vll;\\ntypedef vector<pair<ll ,ll>> vpll;\\ntypedef vector<vector<ll>> vvll;\\ntypedef set<ll> sll;\\ntypedef map<ll , ll> mpll;\\ntypedef pair<ll ,ll> pll;\\ntypedef tuple<ll , ll , ll> tpl3;\\n#define LL(...) ll __VA_ARGS__; input(__VA_ARGS__)\\n#define LD(...) ld __VA_ARGS__; input(__VA_ARGS__)\\n#define Str(...) string __VA_ARGS__; input(__VA_ARGS__)\\n#define Ch(...) char __VA_ARGS__; input(__VA_ARGS__)\\n#define all(a) (a).begin(),(a).end()\\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\\n#define sz(x) (ll)x.size()\\n// << std::fixed << std::setprecision(10)\\nconst ll INF = 1LL << 30;\\nconst ld EPS = 1e-9;\\n \\nll lceil(ll a,ll b){if(a%b==0){return a/b;}if(a>=0){return (a/b)+1;}else{return -((-a)/b);}}\\nll lfloor(ll a,ll b){if(a%b==0){return a/b;}if(a>=0){return (a/b);}else{return -((-a)/b)-1;}}\\ninline ll positive_mod(ll a,ll m){return (a % m + m)%m;}\\ninline ll popcnt(ull a){ return __builtin_popcountll(a);}\\n//0indexed\\ninline ll topbit(ll a){assert(a != 0);return 63 - __builtin_clzll(a);}\\ninline ll smlbit(ll a){assert(a != 0);return __builtin_ctzll(a);}\\ntemplate<class T> bool chmin(T& a, T b){if(a > b){a = b;return true;}return false;}\\ntemplate<class T> bool chmax(T& a, T b){if(a < b){a = b;return true;}return false;}\\ntemplate<typename T> std::istream &operator>>(std::istream&is,std::vector<T>&v){for(T &in:v){is>>in;}return is;}\\ntemplate<typename T> std::ostream &operator<<(std::ostream&os,const std::vector<T>&v){for(auto it=std::begin(v);it!=std::end(v);){os<<*it<<((++it)!=std::end(v)?\\\" \\\":\\\"\\\");}return os;}\\ntemplate<typename T1, typename T2>std::ostream &operator<< (std::ostream &os, std::pair<T1,T2> p){os << \\\"{\\\" << p.first << \\\",\\\" << p.second << \\\"}\\\";return os;}\\ntemplate<class... T>void input(T&... a){(cin >> ... >> a);}\\nvoid print(){cout << endl;}\\ntemplate<class T, class... Ts>void print(const T& a, const Ts&... b){cout << a;((cout << ' ' << b), ...);cout << endl;}\\ntemplate<class T> void pspace(const T& a){ cout << a << ' ';}\\nvoid perr(){cerr << endl;}\\ntemplate<class T, class... Ts>void perr(const T& a, const Ts&... b){cerr << a;((cerr << ' ' << b), ...);cerr << endl;}\\nvoid yes(bool i = true){ return print(i?\\\"yes\\\":\\\"no\\\"); }\\nvoid Yes(bool i = true){ return print(i?\\\"Yes\\\":\\\"No\\\"); }\\nvoid YES(bool i = true){ return print(i?\\\"YES\\\":\\\"NO\\\"); }\\ntemplate <class T> vector<T> &operator++(vector<T> &v) {for(auto &e : v) e++;return v;}\\ntemplate <class T> vector<T> operator++(vector<T> &v, signed) {auto res = v;for(auto &e : v) e++;return res;}\\ntemplate <class T> vector<T> &operator--(vector<T> &v) {for(auto &e : v) e--;return v;}\\ntemplate <class T> vector<T> operator--(vector<T> &v, signed) {auto res = v;for(auto &e : v) e--;return res;}\\n//grid探索用\\nvector<ll> _ta = {0,0,1,-1,1,1,-1,-1};\\nvector<ll> _yo = {1,-1,0,0,1,-1,1,-1};\\nbool isin(ll now_i,ll now_j,ll h,ll w){return (0<=now_i && now_i < h && 0 <= now_j && now_j < w);}\\n \\nll lpow(ll x,ll n){ll ans = 1;while(n >0){if(n & 1)ans *= x;x *= x;n >>= 1;}return ans;}\\nll Modlpow(ll x,ll n,ll m){ll ans = 1;ll a = x%m;while(n >0){if(n & 1){ans *= a;ans%= m;}a *= a;a %= m;n >>= 1;}return ans;} \\nconst ll MOD9 = 998244353LL;\\nconst ll MOD10 = 1000000007LL;\\n\\ntypedef string::const_iterator State;\\n\\nclass ParseError {};\\n//プロトタイプ宣言\\nll expression(State &begin);\\n\\nstruct node{\\n\\tchar ch; // charがいいときもある\\n\\tvector<ll> to;\\n};\\nvector<node>nodes;\\n\\nset<char> variable = {'0','1','a','b','c','d'};\\n//四則演算の式を構文解析し評価結果を返す。\\nll expression(State &begin){\\n if(variable.count(*begin)){\\n ll ret = nodes.size();\\n nodes.push_back({*begin,{}});\\n begin++;\\n return ret;\\n }\\n if(*begin== '-'){\\n ll ret = nodes.size();\\n nodes.push_back({'-',{}});\\n begin++;\\n ll nxt = expression(begin);\\n nodes[ret].to.push_back(nxt);\\n nodes[nxt].to.push_back(ret);\\n return ret;\\n }else if(*begin == '('){\\n begin++;\\n ll before = expression(begin);\\n ll ret = nodes.size();\\n assert(*begin == '^' or *begin == '*');\\n nodes.push_back({*begin,{}});\\n begin++;\\n ll after = expression(begin);\\n nodes[ret].to.push_back(before);\\n nodes[ret].to.push_back(after);\\n nodes[before].to.push_back(ret);\\n nodes[after].to.push_back(ret);\\n assert(*begin == ')');\\n begin++;\\n return ret;\\n }\\n return -1;\\n}\\n\\n// map<string,pair<ll,vector<node>>>mp;\\n\\nvector<ll>states(1LL<<16,INF);\\n\\n\\nll dfs(vll&val,ll v,ll par){\\n char c = nodes[v].ch;\\n if(variable.count(c)){\\n if(c== '0' or c == '1'){\\n return c-'0';\\n }else{\\n return val[c-'a'];\\n }\\n }else if(c == '-'){\\n vll tmp;\\n each(p,nodes[v].to)if(p != par){\\n tmp.push_back(dfs(val,p,v));\\n }\\n assert(sz(tmp) ==1);\\n return !tmp[0];\\n }else {\\n assert(c == '*' or c == '^');\\n vll tmp;\\n each(p,nodes[v].to)if(p != par){\\n tmp.push_back(dfs(val,p,v));\\n }\\n assert(sz(tmp) ==2);\\n if(c == '*'){\\n return tmp[0]&tmp[1];\\n }else{\\n return tmp[0]^tmp[1];\\n }\\n }\\n}\\n\\nvoid solve(string s){\\n nodes.clear();\\n State begin = s.begin();\\n ll root = expression(begin);\\n assert(begin== s.end());\\n vll val(4);\\n // vector<ll> found(n,0);//n頂点\\n\\n ll nowstate = 0;\\n rep(i,1<<4){\\n rep(j,4){\\n if(i >> j &1){\\n val[j] = 1;\\n }else{\\n val[j] = 0;\\n }\\n }\\n nowstate+=dfs(val,root,-1) << i;\\n }\\n\\n // assert(states.count(nowstate));\\n cout << min(states[nowstate],sz(s)) << endl;\\n\\n}\\n \\nint main(){\\n ios::sync_with_stdio(false);cin.tie(nullptr);\\n vector<vector<string>> sable(15);\\n sable[0].push_back(\\\"a\\\");\\n sable[0].push_back(\\\"b\\\");\\n sable[0].push_back(\\\"c\\\");\\n sable[0].push_back(\\\"d\\\");\\n sable[0].push_back(\\\"0\\\");\\n sable[0].push_back(\\\"1\\\");\\n\\n ll sablesiz = sz(sable[0]);\\n ll rem = 1LL << 16;\\n rep(i,15){\\n // cerr << i << endl;\\n if(rem == 0)break;\\n if(i != 0){\\n // - をつけるだけ\\n each(p,sable[i-1])if(p[0] != '-' && p != \\\"0\\\" && p != \\\"1\\\"){\\n sable[i].push_back(string('-'+p));\\n }\\n //演算\\n // (u * v)\\n // (u ^ v)\\n \\n if(i >=3){\\n for(ll j = 1;i+1-j-3 >=1;j++){\\n ll k = i+1 -3-j;\\n // assert(k >= 1);\\n each(p,sable[j-1]){\\n each(q,sable[k-1]){\\n if((p == \\\"0\\\" or p == \\\"1\\\") && (q== \\\"0\\\" or q == \\\"1\\\"))continue;\\n sable[i].push_back('('+p+'*'+q+')');\\n sable[i].push_back('('+p+'^'+q+')');\\n }\\n }\\n }\\n }\\n sablesiz += sz(sable[i]);\\n }\\n\\n vll val(4);\\n each(s,sable[i]){\\n // assert(sz(s) == i+1);\\n State begin = s.begin();\\n ll root = expression(begin);\\n // mp[s] = {root,nodes};\\n // assert(begin== s.end());\\n\\n ll state = 0;\\n\\n rep(i,1<<4){\\n rep(j,4){\\n if(i >> j &1){\\n val[j] = 1;\\n }else{\\n val[j] = 0;\\n }\\n }\\n state += dfs(val,root,-1) << i;\\n }\\n if(states[state] == INF){\\n rem--;\\n }\\n chmin(states[state],i+1);\\n nodes.clear();\\n }\\n \\n }\\n\\n // rep(i,6){\\n // each(p,sable[i]){\\n // cout << p << endl;\\n // }\\n // }\\n\\n\\n // cerr << sablesiz << endl;\\n\\n\\n\\n\\n while(true){\\n Str(s);\\n if(s ==\\\".\\\")break;\\n solve(s);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2470,\n \"memory_kb\": 50368,\n \"score_of_the_acc\": -0.9491,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1620_10544739\",\n \"code_snippet\": \"#line 1 \\\"AOJ/ICPC2017/e.cpp\\\"\\n#include <bits/stdc++.h>\\nusing namespace std;\\n\\n#line 2 \\\"/opt/ei1333_s_library/math/combinatorics/montgomery-mod-int.hpp\\\"\\n\\ntemplate <uint32_t mod_, bool fast = false>\\nstruct MontgomeryModInt {\\n private:\\n using mint = MontgomeryModInt;\\n using i32 = int32_t;\\n using i64 = int64_t;\\n using u32 = uint32_t;\\n using u64 = uint64_t;\\n\\n static constexpr u32 get_r() {\\n u32 ret = mod_;\\n for (i32 i = 0; i < 4; i++) ret *= 2 - mod_ * ret;\\n return ret;\\n }\\n\\n static constexpr u32 r = get_r();\\n\\n static constexpr u32 n2 = -u64(mod_) % mod_;\\n\\n static_assert(r * mod_ == 1, \\\"invalid, r * mod != 1\\\");\\n static_assert(mod_ < (1 << 30), \\\"invalid, mod >= 2 ^ 30\\\");\\n static_assert((mod_ & 1) == 1, \\\"invalid, mod % 2 == 0\\\");\\n\\n u32 x;\\n\\n public:\\n MontgomeryModInt() : x{} {}\\n\\n MontgomeryModInt(const i64 &a)\\n : x(reduce(u64(fast ? a : (a % mod() + mod())) * n2)) {}\\n\\n static constexpr u32 reduce(const u64 &b) {\\n return u32(b >> 32) + mod() - u32((u64(u32(b) * r) * mod()) >> 32);\\n }\\n\\n mint &operator+=(const mint &p) {\\n if (i32(x += p.x - 2 * mod()) < 0) x += 2 * mod();\\n return *this;\\n }\\n\\n mint &operator-=(const mint &p) {\\n if (i32(x -= p.x) < 0) x += 2 * mod();\\n return *this;\\n }\\n\\n mint &operator*=(const mint &p) {\\n x = reduce(u64(x) * p.x);\\n return *this;\\n }\\n\\n mint &operator/=(const mint &p) {\\n *this *= p.inv();\\n return *this;\\n }\\n\\n mint operator-() const { return mint() - *this; }\\n\\n mint operator+(const mint &p) const { return mint(*this) += p; }\\n\\n mint operator-(const mint &p) const { return mint(*this) -= p; }\\n\\n mint operator*(const mint &p) const { return mint(*this) *= p; }\\n\\n mint operator/(const mint &p) const { return mint(*this) /= p; }\\n\\n bool operator==(const mint &p) const {\\n return (x >= mod() ? x - mod() : x) == (p.x >= mod() ? p.x - mod() : p.x);\\n }\\n\\n bool operator!=(const mint &p) const {\\n return (x >= mod() ? x - mod() : x) != (p.x >= mod() ? p.x - mod() : p.x);\\n }\\n\\n u32 val() const {\\n u32 ret = reduce(x);\\n return ret >= mod() ? ret - mod() : ret;\\n }\\n\\n mint pow(u64 n) const {\\n mint ret(1), mul(*this);\\n while (n > 0) {\\n if (n & 1) ret *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return ret;\\n }\\n\\n mint inv() const { return pow(mod() - 2); }\\n\\n friend ostream &operator<<(ostream &os, const mint &p) {\\n return os << p.val();\\n }\\n\\n friend istream &operator>>(istream &is, mint &a) {\\n i64 t;\\n is >> t;\\n a = mint(t);\\n return is;\\n }\\n\\n static constexpr u32 mod() { return mod_; }\\n};\\n\\ntemplate <uint32_t mod>\\nusing modint = MontgomeryModInt<mod>;\\nusing modint998244353 = modint<998244353>;\\nusing modint1000000007 = modint<1000000007>;\\n#line 1 \\\"/opt/ei1333_s_library/math/fft/superset-zeta-moebius-transform.hpp\\\"\\n/**\\n * @brief Superset Zeta/Moebius Transform (上位集合のゼータ/メビウス変換)\\n */\\ntemplate <typename T>\\nvoid superset_zeta_transform(vector<T> &f) {\\n const int n = (int)f.size();\\n assert((n & (n - 1)) == 0);\\n for (int i = 1; i < n; i <<= 1) {\\n for (int j = 0; j < n; j += i << 1) {\\n for (int k = 0; k < i; k++) {\\n f[j + k] += f[j + k + i];\\n }\\n }\\n }\\n}\\n\\ntemplate <typename T>\\nvoid superset_moebius_transform(vector<T> &f) {\\n const int n = (int)f.size();\\n assert((n & (n - 1)) == 0);\\n for (int i = 1; i < n; i <<= 1) {\\n for (int j = 0; j < n; j += i << 1) {\\n for (int k = 0; k < i; k++) {\\n f[j + k] -= f[j + k + i];\\n }\\n }\\n }\\n}\\n#line 2 \\\"/opt/ei1333_s_library/math/fft/bitwise-and-convolution.hpp\\\"\\n\\n/**\\n * @brief Bitwise And Convolution (Bitwise-AND畳み込み)\\n */\\ntemplate <typename T>\\nvector<T> bitwise_and_convolution(vector<T> f, vector<T> g) {\\n const int n = (int)f.size();\\n assert(f.size() == g.size());\\n assert((n & (n - 1)) == 0);\\n superset_zeta_transform(f);\\n superset_zeta_transform(g);\\n for (int i = 0; i < n; i++) f[i] *= g[i];\\n superset_moebius_transform(f);\\n return f;\\n}\\n#line 1 \\\"/opt/ei1333_s_library/math/fft/fast-walsh-hadamard-transform.hpp\\\"\\n/**\\n * @brief Fast Walsh Hadamard Transform (高速ウォルシュアダマール変換)\\n */\\ntemplate <typename T>\\nvoid fast_walsh_hadamard_transform(vector<T> &f, bool inv = false) {\\n const int n = (int)f.size();\\n assert((n & (n - 1)) == 0);\\n for (int i = 1; i < n; i <<= 1) {\\n for (int j = 0; j < n; j += i << 1) {\\n for (int k = 0; k < i; k++) {\\n T s = f[j + k], t = f[j + k + i];\\n f[j + k] = s + t;\\n f[j + k + i] = s - t;\\n }\\n }\\n }\\n if (inv) {\\n T inv_n = T(1) / n;\\n for (auto &x : f) x *= inv_n;\\n }\\n}\\n#line 2 \\\"/opt/ei1333_s_library/math/fft/bitwise-xor-convolution.hpp\\\"\\n\\n/**\\n * @brief Bitwise Xor Convolution (Bitwise-XOR畳み込み)\\n */\\ntemplate <typename T>\\nvector<T> bitwise_xor_convolution(vector<T> f, vector<T> g) {\\n const int n = (int)f.size();\\n assert(f.size() == g.size());\\n assert((n & (n - 1)) == 0);\\n fast_walsh_hadamard_transform(f, false);\\n fast_walsh_hadamard_transform(g, false);\\n for (int i = 0; i < n; i++) f[i] *= g[i];\\n fast_walsh_hadamard_transform(f, true);\\n return f;\\n}\\n#line 7 \\\"AOJ/ICPC2017/e.cpp\\\"\\nusing mint = modint998244353;\\n\\nint parse(string s) {\\n if (s == \\\"0\\\") {\\n return 0;\\n }\\n if (s == \\\"1\\\") {\\n return (1 << 16) - 1;\\n }\\n if (s == \\\"a\\\") {\\n int res = 0;\\n for (int d = 0; d < 16; ++d) {\\n if (d >> 3 & 1) {\\n res += 1 << d;\\n }\\n }\\n return res;\\n }\\n if (s == \\\"b\\\") {\\n int res = 0;\\n for (int d = 0; d < 16; ++d) {\\n if (d >> 2 & 1) {\\n res += 1 << d;\\n }\\n }\\n return res;\\n }\\n if (s == \\\"c\\\") {\\n int res = 0;\\n for (int d = 0; d < 16; ++d) {\\n if (d >> 1 & 1) {\\n res += 1 << d;\\n }\\n }\\n return res;\\n }\\n if (s == \\\"d\\\") {\\n int res = 0;\\n for (int d = 0; d < 16; ++d) {\\n if (d >> 0 & 1) {\\n res += 1 << d;\\n }\\n }\\n return res;\\n }\\n if (s[0] == '-') {\\n return (1 << 16) - 1 - parse(string(s.begin() + 1, s.end()));\\n }\\n int stack = 0;\\n for (int i = 0; i < s.size(); ++i) {\\n if (s[i] == '(') {\\n ++stack;\\n }\\n if (s[i] == ')') {\\n --stack;\\n }\\n if (stack == 1 && s[i] == '^') {\\n return parse(string(s.begin() + 1, s.begin() + i)) ^\\n parse(string(s.begin() + i + 1, s.end() - 1));\\n }\\n if (stack == 1 && s[i] == '*') {\\n return parse(string(s.begin() + 1, s.begin() + i)) &\\n parse(string(s.begin() + i + 1, s.end() - 1));\\n }\\n }\\n exit(1);\\n}\\n\\nbool solve(vector<vector<mint>> &table) {\\n string s;\\n cin >> s;\\n if (s == \\\".\\\") {\\n return false;\\n }\\n int n = parse(s);\\n int ans = 1;\\n while (table[ans][n] == 0) {\\n ++ans;\\n }\\n cout << ans << endl;\\n return true;\\n}\\n\\nvector<vector<mint>> precalc() {\\n vector<vector<mint>> res(17, vector<mint>(1 << 16));\\n res[1][parse(string(\\\"0\\\"))] = 1;\\n res[1][parse(string(\\\"1\\\"))] = 1;\\n res[1][parse(string(\\\"a\\\"))] = 1;\\n res[1][parse(string(\\\"b\\\"))] = 1;\\n res[1][parse(string(\\\"c\\\"))] = 1;\\n res[1][parse(string(\\\"d\\\"))] = 1;\\n for (int i = 2; i < 17; ++i) {\\n for (int n = 0; n < (1 << 16); ++n) {\\n if (res[i - 1][n] != 0) {\\n res[i][n] = 1;\\n res[i][(1 << 16) - 1 - n] = 1;\\n }\\n }\\n if (i < 5) {\\n continue;\\n }\\n for (int j = 1; j < i - 3; ++j) {\\n auto tmp = bitwise_xor_convolution(res[j], res[i - 3 - j]);\\n for (int n = 0; n < (1 << 16); ++n) {\\n if (tmp[n] != 0) {\\n res[i][n] = 1;\\n }\\n }\\n }\\n for (int j = 1; j < i - 3; ++j) {\\n auto tmp = bitwise_and_convolution(res[j], res[i - 3 - j]);\\n for (int n = 0; n < (1 << 16); ++n) {\\n if (tmp[n] != 0) {\\n res[i][n] = 1;\\n }\\n }\\n }\\n }\\n return res;\\n}\\n\\nint main(void) {\\n auto table = precalc();\\n while (solve(table))\\n ;\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 8204,\n \"score_of_the_acc\": -0.072,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1620_9625720\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef vector<ll> vi;\\ntypedef vector<vi> vvi;\\ntypedef pair<ll,ll> pi;\\n#define FOR(i,l,r) for(ll i=l;i<r;i++)\\n#define REP(i,n) FOR(i,0,n)\\n#define ALL(A) A.begin(),A.end()\\n#define LB(A,x) (lower_bound(ALL(A),x)-A.begin())\\ntemplate<typename T>bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}\\ntemplate<typename T>bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}\\nint main(){\\n vi ans(65536,1e18);\\n ans[0]=ans[43690]=ans[52428]=ans[61680]=ans[65280]=ans[65535]=1;\\n priority_queue<pi>Q;\\n Q.emplace(pi(-1,0));\\n Q.emplace(pi(-1,43690));\\n Q.emplace(pi(-1,52428));\\n Q.emplace(pi(-1,61680));\\n Q.emplace(pi(-1,65280));\\n Q.emplace(pi(-1,65535));\\n set<ll>S;\\n while(Q.size()){\\n ll d=-Q.top().first;\\n ll v=Q.top().second;\\n Q.pop();\\n if(d!=ans[v]||d>16)continue;\\n S.insert(v);\\n if(chmin(ans[65535-v],d+1))Q.emplace(pi(-d-1,65535-v));\\n for(auto u:S){\\n if(chmin(ans[u^v],d+ans[u]+3))Q.emplace(pi(-ans[u^v],u^v));\\n if(chmin(ans[u&v],d+ans[u]+3))Q.emplace(pi(-ans[u&v],u&v));\\n }\\n }\\n while(1){\\n string S;cin>>S;\\n if(S==\\\".\\\")return 0;\\n ll N=S.size();\\n vi par(N);\\n {\\n stack<ll>st;\\n REP(i,N){\\n if(S[i]=='(')st.emplace(i);\\n if(S[i]==')')par[st.top()]=i,st.pop();\\n }\\n }\\n ll a=0;\\n function<ll(ll,ll,ll)>f=[&](ll l,ll r,ll i){\\n if(r-l==1){\\n if(S[l]=='1')return 1LL;\\n if(S[l]=='0')return 0LL;\\n return (i>>(S[l]-'a'))%2;\\n }\\n if(S[l]=='-')return 1-f(l+1,r,i);\\n assert(S[l]=='('&&par[l]==r-1);\\n ll lev=0,t=l+1;\\n while(lev||(S[t]!='*'&&S[t]!='^')){\\n if(S[t]=='(')lev++;\\n if(S[t]==')')lev--;\\n t++;\\n }\\n ll x=f(l+1,t,i),y=f(t+1,r-1,i);\\n if(S[t]=='^')return x^y;\\n return x&y;\\n };\\n REP(i,16)if(f(0,N,i))a+=1<<i;\\n cout<<ans[a]<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 6872,\n \"score_of_the_acc\": -0.0235,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1620_9408035\",\n \"code_snippet\": \"#ifndef _GLIBCXX_NO_ASSERT\\n#include <cassert>\\n#endif\\n#include <cctype>\\n#include <cerrno>\\n#include <cfloat>\\n#include <ciso646>\\n#include <climits>\\n#include <clocale>\\n#include <cmath>\\n#include <csetjmp>\\n#include <csignal>\\n#include <cstdarg>\\n#include <cstddef>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <ctime>\\n#if __cplusplus >= 201103L\\n#include <ccomplex>\\n#include <cfenv>\\n#include <cinttypes>\\n#include <cstdbool>\\n#include <cstdint>\\n#include <ctgmath>\\n#include <cwchar>\\n#include <cwctype>\\n#endif\\n// C++\\n#include <algorithm>\\n#include <bitset>\\n#include <complex>\\n#include <deque>\\n#include <exception>\\n#include <fstream>\\n#include <functional>\\n#include <iomanip>\\n#include <ios>\\n#include <iosfwd>\\n#include <iostream>\\n#include <istream>\\n#include <iterator>\\n#include <limits>\\n#include <list>\\n#include <locale>\\n#include <map>\\n#include <memory>\\n#include <new>\\n#include <numeric>\\n#include <ostream>\\n#include <queue>\\n#include <set>\\n#include <sstream>\\n#include <stack>\\n#include <stdexcept>\\n#include <streambuf>\\n#include <string>\\n#include <typeinfo>\\n#include <utility>\\n#include <valarray>\\n#include <vector>\\n#if __cplusplus >= 201103L\\n#include <array>\\n#include <atomic>\\n#include <chrono>\\n#include <condition_variable>\\n#include <forward_list>\\n#include <future>\\n#include <initializer_list>\\n#include <mutex>\\n#include <random>\\n#include <ratio>\\n#include <regex>\\n#include <scoped_allocator>\\n#include <system_error>\\n#include <thread>\\n#include <tuple>\\n#include <type_traits>\\n#include <typeindex>\\n#include <unordered_map>\\n#include <unordered_set>\\n\\n#endif\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i, n) for (int i = 0; i < n; i++)\\n#define all(v) v.begin(), v.end()\\ntemplate <class T, class U>\\ninline bool chmax(T &a, U b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <class T, class U>\\ninline bool chmin(T &a, U b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\nconstexpr int INF = 1001001001;\\nconstexpr int64_t llINF = 3000000000000000000;\\nconst double pi = acos(-1);\\nstruct linear_sieve {\\n vector<int> least_factor, prime_list;\\n linear_sieve(int n) : least_factor(n + 1, 0) {\\n for (int i = 2; i <= n; i++) {\\n if (least_factor[i] == 0) {\\n least_factor[i] = i;\\n prime_list.push_back(i);\\n }\\n for (int p : prime_list) {\\n if (ll(i) * p > n || p > least_factor[i]) break;\\n least_factor[i * p] = p;\\n }\\n }\\n }\\n};\\n\\nll extgcd(ll a, ll b, ll &x, ll &y) {\\n // ax+by=gcd(|a|,|b|)\\n if (a < 0 || b < 0) {\\n ll d = extgcd(abs(a), abs(b), x, y);\\n if (a < 0) x = -x;\\n if (b < 0) y = -y;\\n return d;\\n }\\n if (b == 0) {\\n x = 1;\\n y = 0;\\n return a;\\n }\\n ll d = extgcd(b, a % b, y, x);\\n y -= a / b * x;\\n return d;\\n}\\nll modpow(ll a, ll b, ll m) {\\n a %= m;\\n ll res = 1 % m;\\n while (b) {\\n if (b & 1) {\\n res *= a;\\n res %= m;\\n }\\n a *= a;\\n a %= m;\\n b >>= 1;\\n }\\n return res;\\n}\\nll modinv(ll x, ll modulo) {\\n ll a = x, b = modulo, u = 1, v = 0, t;\\n while (b > 0) {\\n t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return (u >= 0 ? u % modulo : (modulo - (-u) % modulo) % modulo);\\n}\\ntemplate <int modulo>\\nstruct modint {\\n int x;\\n modint() : x(0) {}\\n modint(int64_t y) : x(y >= 0 ? y % modulo : (modulo - (-y) % modulo) % modulo) {}\\n modint &operator+=(const modint &p) {\\n if ((x += p.x) >= modulo) x -= modulo;\\n return *this;\\n }\\n modint &operator-=(const modint &p) {\\n if ((x += modulo - p.x) >= modulo) x -= modulo;\\n return *this;\\n }\\n modint &operator*=(const modint &p) {\\n x = (int)(1LL * x * p.x % modulo);\\n return *this;\\n }\\n modint &operator/=(const modint &p) {\\n *this *= p.inv();\\n return *this;\\n }\\n modint operator-() const { return modint(-x); }\\n modint operator+(const modint &p) const { return modint(*this) += p; }\\n modint operator-(const modint &p) const { return modint(*this) -= p; }\\n modint operator*(const modint &p) const { return modint(*this) *= p; }\\n modint operator/(const modint &p) const { return modint(*this) /= p; }\\n bool operator==(const modint &p) const { return x == p.x; }\\n bool operator!=(const modint &p) const { return x != p.x; }\\n modint inv() const {\\n int a = x, b = modulo, u = 1, v = 0, t;\\n while (b > 0) {\\n t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return modint(u);\\n }\\n modint pow(int64_t n) const {\\n modint ret(1), mul(x);\\n while (n > 0) {\\n if (n & 1) ret *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return ret;\\n }\\n friend ostream &operator<<(ostream &os, const modint &p) { return os << p.x; }\\n friend istream &operator>>(istream &is, modint &a) {\\n int64_t t;\\n is >> t;\\n a = modint<modulo>(t);\\n return (is);\\n }\\n int val() const { return x; }\\n static constexpr int mod() { return modulo; }\\n static constexpr int half() { return (modulo + 1) >> 1; }\\n};\\ntemplate <typename T>\\nstruct Binomial {\\n vector<T> inv, fact, factinv;\\n Binomial(int n) {\\n inv.resize(n + 1);\\n fact.resize(n + 1);\\n factinv.resize(n + 1);\\n inv[0] = fact[0] = factinv[0] = 1;\\n for (int i = 1; i <= n; i++) fact[i] = fact[i - 1] * i;\\n factinv[n] = fact[n].inv();\\n inv[n] = fact[n - 1] * factinv[n];\\n for (int i = n - 1; i >= 1; i--) {\\n factinv[i] = factinv[i + 1] * (i + 1);\\n inv[i] = fact[i - 1] * factinv[i];\\n }\\n }\\n T C(int n, int r) {\\n if (n < 0 || n < r || r < 0) return 0;\\n return fact[n] * factinv[n - r] * factinv[r];\\n }\\n T P(int n, int r) {\\n if (n < 0 || n < r || r < 0) return 0;\\n return fact[n] * factinv[n - r];\\n }\\n T H(int n, int r) {\\n if (n == 0 && r == 0) return 1;\\n if (n < 0 || r < 0) return 0;\\n return r == 0 ? 1 : C(n + r - 1, r);\\n }\\n};\\ntemplate <class T>\\nstruct Matrix {\\n int n;\\n vector<vector<T>> m;\\n Matrix() : Matrix(0) {}\\n Matrix(int x) : Matrix(vector<vector<T>>(x, vector<T>(x, 0))) {}\\n Matrix(const vector<vector<T>> &a) {\\n n = a.size();\\n m = a;\\n }\\n vector<T> &operator[](int i) { return m[i]; }\\n const vector<T> &operator[](int i) const { return m[i]; }\\n static Matrix identity(int x) {\\n Matrix res(x);\\n for (int i = 0; i < x; i++) res[i][i] = 1;\\n return res;\\n }\\n Matrix operator+(const Matrix &a) const {\\n Matrix x = (*this);\\n return x += a;\\n }\\n Matrix operator*(const Matrix &a) const {\\n Matrix x = (*this);\\n return x *= a;\\n }\\n Matrix &operator+=(const Matrix &a) {\\n Matrix res(n);\\n for (int i = 0; i < n; i++) {\\n for (int j = 0; j < n; j++) {\\n res[i][j] = m[i][j] + a[i][j];\\n }\\n }\\n m = res.m;\\n return *this;\\n }\\n Matrix &operator*=(const Matrix &a) {\\n Matrix res(n);\\n for (int i = 0; i < n; i++) {\\n for (int k = 0; k < n; k++) {\\n for (int j = 0; j < n; j++) {\\n res[i][j] += m[i][k] * a[k][j];\\n }\\n }\\n }\\n m = res.m;\\n return *this;\\n }\\n Matrix pow(ll b) const {\\n Matrix x = *this, res = identity(n);\\n while (b) {\\n if (b & 1) {\\n res *= x;\\n }\\n x *= x;\\n b >>= 1;\\n }\\n return res;\\n }\\n};\\nstruct UnionFind {\\n vector<int> par, siz, es;\\n UnionFind(int x) {\\n par.resize(x);\\n siz.resize(x);\\n es.resize(x);\\n for (int i = 0; i < x; i++) {\\n par[i] = i;\\n siz[i] = 1;\\n es[i] = 0;\\n }\\n }\\n int find(int x) {\\n if (par[x] == x) return x;\\n return par[x] = find(par[x]);\\n }\\n bool unite(int x, int y) {\\n x = find(x), y = find(y);\\n if (x == y) {\\n es[x]++;\\n return false;\\n }\\n if (siz[x] < siz[y]) swap(x, y);\\n par[y] = x;\\n siz[x] += siz[y];\\n es[x] += es[y] + 1;\\n return true;\\n }\\n bool same(int x, int y) { return find(x) == find(y); }\\n int size(int x) { return siz[find(x)]; }\\n int edges(int x) { return es[find(x)]; }\\n};\\ntemplate <class S, S (*op)(S, S), S (*e)()>\\nstruct segtree {\\n int siz = 1;\\n vector<S> dat;\\n segtree(int n) : segtree(vector<S>(n, e())) {}\\n segtree(const vector<S> &a) {\\n while (siz < a.size()) siz <<= 1;\\n dat = vector<S>(siz << 1, e());\\n for (int i = 0; i < a.size(); i++) dat[siz + i] = a[i];\\n for (int i = siz - 1; i >= 1; i--) dat[i] = op(dat[2 * i], dat[2 * i + 1]);\\n }\\n void set(int p, S x) {\\n p += siz;\\n dat[p] = x;\\n while (p > 0) {\\n p >>= 1;\\n dat[p] = op(dat[2 * p], dat[2 * p + 1]);\\n }\\n }\\n void add(int p, S x) { set(p, get(p) + x); }\\n S get(int p) { return dat[p + siz]; }\\n S prod(int l, int r) {\\n S vl = e(), vr = e();\\n l += siz, r += siz;\\n while (l < r) {\\n if (l & 1) vl = op(vl, dat[l++]);\\n if (r & 1) vr = op(dat[--r], vr);\\n l >>= 1, r >>= 1;\\n }\\n return op(vl, vr);\\n }\\n S all_prod() { return dat[1]; }\\n};\\ntemplate <class T>\\nstruct BIT {\\n // 1-indexed\\n int n, beki = 1;\\n vector<T> bit;\\n BIT(int x) {\\n bit.resize(x + 1, 0);\\n n = x;\\n while (beki * 2 <= n) beki *= 2;\\n }\\n T sum(int i) {\\n T res = 0;\\n while (i > 0) {\\n res += bit[i];\\n i -= i & -i;\\n }\\n return res;\\n }\\n T sum(int l, int r) {\\n //[l,r]\\n return sum(r) - (l == 0 ? 0 : sum(l - 1));\\n }\\n void add(int i, T x) {\\n while (i <= n) {\\n bit[i] += x;\\n i += i & -i;\\n }\\n }\\n int lowerbound(T w) {\\n if (w <= 0) return 0;\\n int x = 0;\\n for (int k = beki; k > 0; k >>= 1) {\\n if (x + k <= n && bit[x + k] < w) {\\n w -= bit[x + k];\\n x += k;\\n }\\n }\\n return x + 1;\\n }\\n};\\ntemplate <class T, T (*op)(T, T), T (*e)()>\\nstruct sparsetable {\\n vector<vector<T>> table;\\n vector<int> logtable;\\n sparsetable() = default;\\n sparsetable(vector<T> v) {\\n int len = 0;\\n while ((1 << len) <= v.size()) len++;\\n table.assign(len, vector<T>(1 << len));\\n for (int i = 0; i < (int)v.size(); i++) table[0][i] = v[i];\\n for (int i = 1; i < len; i++) {\\n for (int j = 0; j + (1 << i) <= (1 << len); j++) {\\n table[i][j] = op(table[i - 1][j], table[i - 1][j + (1 << (i - 1))]);\\n }\\n }\\n logtable.resize(v.size() + 1);\\n for (int i = 2; i < logtable.size(); i++) {\\n logtable[i] = logtable[(i >> 1)] + 1;\\n }\\n }\\n T query(int l, int r) {\\n assert(l <= r);\\n if (l == r) return e();\\n int len = logtable[r - l];\\n return op(table[len][l], table[len][r - (1 << len)]);\\n }\\n};\\ntemplate <class T, T (*op)(T, T), T (*e)()>\\nstruct disjointsparsetable {\\n vector<vector<T>> table;\\n vector<int> logtable;\\n disjointsparsetable() = default;\\n disjointsparsetable(vector<T> v) {\\n int len = 0;\\n while ((1 << len) <= v.size()) len++;\\n table.assign(len, vector<T>(1 << len, e()));\\n for (int i = 0; i < (int)v.size(); i++) table[0][i] = v[i];\\n for (int i = 1; i < len; i++) {\\n int shift = 1 << i;\\n for (int j = 0; j < (int)v.size(); j += shift << 1) {\\n int t = min(j + shift, (int)v.size());\\n table[i][t - 1] = v[t - 1];\\n for (int k = t - 2; k >= j; k--) table[i][k] = op(v[k], table[i][k + 1]);\\n if (v.size() <= t) break;\\n table[i][t] = v[t];\\n int r = min(t + shift, (int)v.size());\\n for (int k = t + 1; k < r; k++) table[i][k] = op(table[i][k - 1], v[k]);\\n }\\n }\\n logtable.resize(1 << len);\\n for (int i = 2; i < logtable.size(); i++) {\\n logtable[i] = logtable[(i >> 1)] + 1;\\n }\\n }\\n T query(int l, int r) {\\n if (l == r) return e();\\n if (l >= --r) return table[0][l];\\n int len = logtable[l ^ r];\\n return op(table[len][l], table[len][r]);\\n };\\n};\\npair<int, int> lcatree_op(pair<int, int> a, pair<int, int> b) { return min(a, b); }\\npair<int, int> lcatree_e() { return {1000000000, -1}; }\\nstruct lca_tree {\\n int n, size;\\n vector<int> in, ord, depth;\\n sparsetable<pair<int, int>, lcatree_op, lcatree_e> st;\\n lca_tree(vector<vector<int>> g, int root = 0) : n((int)g.size()), size(log2(n) + 2), in(n), depth(n, n) {\\n depth[root] = 0;\\n function<void(int, int)> dfs = [&](int v, int p) {\\n in[v] = (int)ord.size();\\n ord.push_back(v);\\n for (int u : g[v]) {\\n if (u == p) continue;\\n if (depth[u] > depth[v] + 1) {\\n depth[u] = depth[v] + 1;\\n dfs(u, v);\\n ord.push_back(v);\\n }\\n }\\n };\\n dfs(root, -1);\\n vector<pair<int, int>> vec((int)ord.size());\\n for (int i = 0; i < (int)ord.size(); i++) {\\n vec[i] = make_pair(depth[ord[i]], ord[i]);\\n }\\n st = vec;\\n }\\n int lca(int u, int v) {\\n if (in[u] > in[v]) swap(u, v);\\n if (u == v) return u;\\n return st.query(in[u], in[v]).second;\\n }\\n int dist(int u, int v) {\\n int l = lca(u, v);\\n return depth[u] + depth[v] - 2 * depth[l];\\n }\\n};\\nstruct auxiliary_tree : lca_tree {\\n vector<vector<int>> G;\\n auxiliary_tree(vector<vector<int>> &g) : lca_tree(g), G(n) {}\\n pair<int, vector<int>> query(vector<int> vs, bool decending = false) {\\n // decending:親から子の方向のみ辺を貼る\\n assert(!vs.empty());\\n sort(vs.begin(), vs.end(), [&](int a, int b) { return in[a] < in[b]; });\\n int m = vs.size();\\n stack<int> st;\\n st.push(vs[0]);\\n for (int i = 0; i < m - 1; i++) {\\n int w = lca(vs[i], vs[i + 1]);\\n if (w != vs[i]) {\\n int l = st.top();\\n st.pop();\\n while (!st.empty() && depth[w] < depth[st.top()]) {\\n if (!decending) G[l].push_back(st.top());\\n G[st.top()].push_back(l);\\n l = st.top();\\n st.pop();\\n }\\n if (st.empty() || st.top() != w) {\\n st.push(w);\\n vs.push_back(w);\\n }\\n if (!decending) G[l].push_back(w);\\n G[w].push_back(l);\\n }\\n st.push(vs[i + 1]);\\n }\\n while (st.size() > 1) {\\n int x = st.top();\\n st.pop();\\n if (!decending) G[x].push_back(st.top());\\n G[st.top()].push_back(x);\\n }\\n // {root,vertex_list}\\n return make_pair(st.top(), vs);\\n }\\n void clear(vector<int> vs) {\\n for (int v : vs) G[v].clear();\\n }\\n};\\nstruct Mo {\\n int n;\\n vector<pair<int, int>> lr;\\n\\n explicit Mo(int n) : n(n) {}\\n\\n void add(int l, int r) { /* [l, r) */\\n lr.emplace_back(l, r);\\n }\\n\\n template <typename AL, typename AR, typename EL, typename ER, typename O>\\n void build(const AL &add_left, const AR &add_right, const EL &erase_left, const ER &erase_right, const O &out) {\\n int q = (int)lr.size();\\n int bs = n / min<int>(n, sqrt(q));\\n vector<int> ord(q);\\n iota(begin(ord), end(ord), 0);\\n sort(begin(ord), end(ord), [&](int a, int b) {\\n int ablock = lr[a].first / bs, bblock = lr[b].first / bs;\\n if (ablock != bblock) return ablock < bblock;\\n return (ablock & 1) ? lr[a].second > lr[b].second : lr[a].second < lr[b].second;\\n });\\n int l = 0, r = 0;\\n for (auto idx : ord) {\\n while (l > lr[idx].first) add_left(--l);\\n while (r < lr[idx].second) add_right(r++);\\n while (l < lr[idx].first) erase_left(l++);\\n while (r > lr[idx].second) erase_right(--r);\\n out(idx);\\n }\\n }\\n\\n template <typename A, typename E, typename O>\\n void build(const A &add, const E &erase, const O &out) {\\n build(add, add, erase, erase, out);\\n }\\n};\\ntemplate <class S, S (*op)(S, S), S (*e)(), class F, S (*mapping)(F, S), F (*composition)(F, F), F (*id)()>\\nstruct lazy_segtree {\\n int _n, sz = 1;\\n vector<S> dat;\\n vector<F> lazy;\\n lazy_segtree(vector<S> a) : _n(int(a.size())) {\\n while (sz < _n) sz <<= 1;\\n dat.resize(sz * 2, e());\\n lazy.resize(sz * 2, id());\\n rep(i, _n) dat[sz + i] = a[i];\\n for (int i = sz - 1; i >= 1; i--) dat[i] = op(dat[2 * i], dat[2 * i + 1]);\\n }\\n void eval(int k) {\\n dat[k] = mapping(lazy[k], dat[k]);\\n if (k < sz) {\\n lazy[k * 2] = composition(lazy[k], lazy[k * 2]);\\n lazy[k * 2 + 1] = composition(lazy[k], lazy[k * 2 + 1]);\\n }\\n lazy[k] = id();\\n }\\n void apply(int a, int b, F f, int k = 1, int l = 0, int r = -1) {\\n eval(k);\\n if (r == -1) r = sz;\\n if (r <= a || b <= l) return;\\n if (a <= l && r <= b) {\\n lazy[k] = composition(f, lazy[k]);\\n eval(k);\\n return;\\n }\\n int m = (l + r) >> 1;\\n apply(a, b, f, 2 * k, l, m);\\n apply(a, b, f, 2 * k + 1, m, r);\\n dat[k] = op(dat[2 * k], dat[2 * k + 1]);\\n }\\n S prod(int a, int b, int k = 1, int l = 0, int r = -1) {\\n eval(k);\\n if (r == -1) r = sz;\\n if (r <= a || b <= l) return e();\\n if (a <= l && r <= b) return dat[k];\\n int m = (l + r) >> 1;\\n S vl = prod(a, b, 2 * k, l, m);\\n S vr = prod(a, b, 2 * k + 1, m, r);\\n return op(vl, vr);\\n }\\n};\\n\\ntemplate <class S, S (*op)(S, S), S (*e)()>\\nstruct dual_segtree {\\n int sz = 1, log = 0;\\n vector<S> lz;\\n dual_segtree(vector<S> a) {\\n int n = a.size();\\n while (sz < n) {\\n sz <<= 1;\\n log++;\\n }\\n lz.assign(sz << 1, e());\\n for (int i = 0; i < n; i++) lz[i + sz] = a[i];\\n }\\n void push(int k) {\\n int b = __builtin_ctz(k);\\n for (int d = log; d > b; d--) {\\n lz[k >> d << 1] = op(lz[k >> d << 1], lz[k >> d]);\\n lz[k >> d << 1 | 1] = op(lz[k >> d << 1 | 1], lz[k >> d]);\\n lz[k >> d] = e();\\n }\\n }\\n void apply(int l, int r, S x) {\\n l += sz, r += sz;\\n push(l);\\n push(r);\\n while (l < r) {\\n if (l & 1) {\\n lz[l] = op(lz[l], x);\\n l++;\\n }\\n if (r & 1) {\\n r--;\\n lz[r] = op(lz[r], x);\\n }\\n l >>= 1, r >>= 1;\\n }\\n }\\n S get(int k) {\\n k += sz;\\n S res = e();\\n while (k) {\\n res = op(res, lz[k]);\\n k >>= 1;\\n }\\n return res;\\n }\\n};\\n\\n/*\\n#include <atcoder/string>\\nint string_period(string s) {\\n int n = s.size();\\n auto z = atcoder::z_algorithm(s);\\n for (int i = 1; i < n; i++) {\\n if (n % i == 0 && z[i] == n - i) return i;\\n }\\n return n;\\n}\\n*/\\nstruct LowLink {\\n vector<vector<int>> g;\\n vector<int> ord, low, out;\\n vector<bool> used;\\n vector<pair<int, int>> bridge;\\n vector<pair<int, int>> articulation;\\n int unions;\\n LowLink(vector<vector<int>> g) : g(g) {\\n int n = (int)g.size();\\n ord.resize(n);\\n low.resize(n);\\n out.resize(n);\\n used.resize(n);\\n unions = 0;\\n int t = 0;\\n for (int i = 0; i < n; i++) {\\n if (!used[i]) {\\n dfs(i, t, -1);\\n unions++;\\n }\\n }\\n }\\n void dfs(int v, int &t, int par) {\\n used[v] = true;\\n ord[v] = t++, low[v] = ord[v];\\n int cnt = 0;\\n bool par_back = false;\\n for (int to : g[v]) {\\n if (!used[to]) {\\n dfs(to, t, v);\\n low[v] = min(low[v], low[to]);\\n if (ord[v] < low[to]) bridge.push_back(minmax(v, to));\\n if (ord[v] <= low[to]) cnt++;\\n } else if (to != par || par_back) {\\n low[v] = min(low[v], ord[to]);\\n } else\\n par_back = true;\\n }\\n if (par != -1) cnt++;\\n if (cnt >= 2) articulation.push_back({v, cnt});\\n out[v] = t;\\n }\\n};\\ntemplate <typename T>\\nT rand(T l, T r) {\\n static mt19937 mt(random_device{}());\\n if constexpr (is_integral_v<T>) {\\n uniform_int_distribution<T> dist(l, r);\\n return dist(mt);\\n } else if constexpr (is_floating_point_v<T>) {\\n uniform_real_distribution<T> dist(l, r);\\n return dist(mt);\\n }\\n}\\nint res[1 << 16];\\nchar Minus(char c) {\\n if (c == '0') return '1';\\n return '0';\\n}\\nchar Xor(char a, char b) {\\n if (a == b) return '0';\\n return '1';\\n}\\nchar And(char a, char b) {\\n if (a == '1' && b == '1') return '1';\\n return '0';\\n}\\nint calc_formula(string s) {\\n string t;\\n for (char c : s) {\\n t += c;\\n while (1) {\\n if (t.size() >= 2 && t.end()[-2] == '-' && isdigit(t.back())) {\\n char d = Minus(t.back());\\n t.pop_back();\\n t.pop_back();\\n t += d;\\n continue;\\n }\\n if (t.back() == ')') {\\n char d = '.';\\n if (t.end()[-3] == '^')\\n d = Xor(t.end()[-4], t.end()[-2]);\\n else\\n d = And(t.end()[-4], t.end()[-2]);\\n t.pop_back();\\n t.pop_back();\\n t.pop_back();\\n t.pop_back();\\n t.pop_back();\\n t.push_back(d);\\n continue;\\n }\\n break;\\n }\\n }\\n return (t[0] - '0');\\n}\\nint calc_charFormula(string &s) {\\n int ans = 0;\\n rep(i, 16) {\\n string t = s;\\n for (char &c : t) {\\n rep(j, 4) {\\n if (c == 'a' + j) c = '0' + ((i >> j) & 1);\\n }\\n }\\n ans |= calc_formula(t) << i;\\n }\\n return ans;\\n}\\nvoid precalc() {\\n fill(res, res + 65536, INF);\\n vector<vector<string>> E(17);\\n E[1] = {\\\"0\\\", \\\"1\\\", \\\"a\\\", \\\"b\\\", \\\"c\\\", \\\"d\\\"};\\n for (auto s : E[1]) {\\n res[calc_charFormula(s)] = 1;\\n }\\n for (int i = 2; i <= 16; i++) {\\n vector<string> tmp;\\n for (auto s : E[i - 1]) {\\n tmp.push_back('-' + s);\\n }\\n for (int j = 1; j + 3 < i; j++) {\\n int k = i - 3 - j;\\n for (auto s : E[j]) {\\n for (auto t : E[k]) {\\n tmp.push_back('(' + s + '^' + t + ')');\\n tmp.push_back('(' + s + '*' + t + ')');\\n }\\n }\\n }\\n for (auto s : tmp) {\\n int ans = calc_charFormula(s);\\n if (chmin(res[ans], s.size())) E[i].push_back(s);\\n }\\n }\\n}\\nvoid solve() {\\n string s;\\n cin >> s;\\n if (s == \\\".\\\") exit(0);\\n cout << res[calc_charFormula(s)] << endl;\\n // calc for 2^4 patterns\\n // generate all possible string and calc for 2^4 patterns\\n}\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n /*int t;\\n cin >> t;\\n while (t--) */\\n precalc();\\n while (1) solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 4372,\n \"score_of_the_acc\": -0.0162,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1620_9369749\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\ntemplate <class T>\\nusing vc = vector<T>;\\ntemplate <class T>\\nusing vvc = vc<vc<T>>;\\nvoid solve();\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n cout << fixed << setprecision(20);\\n ll t = 1;\\n // cin >> t;\\n for (int i = 1; i <= t; i++) solve();\\n return 0;\\n}\\n#define rep(i, a, b) for (ll i = (a); i < (b); i++)\\nll dy[4] = {0, 1, 0, -1}, dx[4] = {1, 0, -1, 0};\\n// ll dy[8] = {1, 1, 0, -1, -1, -1, 0, 1}, dx[8] = {0, 1, 1, 1, 0, -1, -1, -1};\\nstring s, t;\\nll pos;\\nvoid solve() {\\n ll ABCD[4];\\n auto get = [&](char c) -> ll {\\n if (c == 'a') return ABCD[0];\\n if (c == 'b') return ABCD[1];\\n if (c == 'c') return ABCD[2];\\n if (c == 'd') return ABCD[3];\\n return 0;\\n };\\n vc<ll> min_op(1 << 16, 1e9);\\n auto E = [&](auto &&E, string &S) -> ll {\\n if (S[pos] == '(') {\\n pos++;\\n ll v1 = E(E, S);\\n char op = S[pos++];\\n ll v2 = E(E, S);\\n pos++;\\n if (op == '^') return v1 ^ v2;\\n return v1 & v2;\\n }\\n if (S[pos] == '0' || S[pos] == '1') {\\n pos++;\\n return S[pos - 1] - '0';\\n }\\n if ('a' <= S[pos] && S[pos] <= 'd') {\\n ll v = get(S[pos]);\\n pos++;\\n return v;\\n }\\n pos++;\\n ll v1 = E(E, S);\\n return 1 - v1;\\n };\\n auto check2 = [&]() -> void {\\n ll num = 0;\\n rep(a, 0, 2) {\\n rep(b, 0, 2) {\\n rep(c, 0, 2) {\\n rep(d, 0, 2) {\\n ABCD[0] = a, ABCD[1] = b, ABCD[2] = c, ABCD[3] = d;\\n pos = 0;\\n ll val = a * 8 + b * 4 + c * 2 + d;\\n num |= (1 << val) * E(E, t);\\n }\\n }\\n }\\n }\\n min_op[num] = min(min_op[num], (ll)t.size());\\n };\\n auto check = [&](vc<char> &C) -> void {\\n ll nC = C.size();\\n if (nC >= 5) return;\\n if (nC == 0) return;\\n auto add1 = [&](bool f) -> void {\\n if (f) t += \\\"-\\\";\\n t += \\\"(\\\";\\n };\\n auto add2 = [&](bool f, int idx) -> void {\\n if (f) t += \\\"-\\\";\\n t += C[idx];\\n };\\n auto add_op = [&](bool f) -> void {\\n if (f)\\n t += \\\"^\\\";\\n else\\n t += \\\"*\\\";\\n };\\n if (nC == 1) {\\n rep(m2, 0, 2) {\\n t = \\\"\\\";\\n add2(m2, 0);\\n check2();\\n }\\n return;\\n }\\n if (nC == 2) {\\n rep(m1, 0, 2) {\\n rep(m2, 0, 4) {\\n rep(op, 0, 2) {\\n t = \\\"\\\";\\n add1(m1);\\n add2(m2 & 1, 0);\\n add_op(op);\\n add2(m2 & 2, 1);\\n t += \\\")\\\";\\n check2();\\n }\\n }\\n }\\n return;\\n }\\n if (nC == 3) {\\n rep(m1, 0, 4) {\\n rep(m2, 0, 8) {\\n rep(op, 0, 4) {\\n t = \\\"\\\";\\n add1(m1 & 1);\\n add1(m1 & 2);\\n add2(m2 & 1, 0);\\n add_op(op & 1);\\n add2(m2 & 2, 1);\\n t += \\\")\\\";\\n add_op(op & 2);\\n add2(m2 & 4, 2);\\n t += \\\")\\\";\\n check2();\\n }\\n }\\n }\\n return;\\n }\\n rep(m1, 0, 8) {\\n rep(m2, 0, 16) {\\n rep(op, 0, 8) {\\n t = \\\"\\\";\\n add1(m1 & 1);\\n add1(m1 & 2);\\n add1(m1 & 4);\\n add2(m2 & 1, 0);\\n add_op(op & 1);\\n add2(m2 & 2, 1);\\n t += \\\")\\\";\\n add_op(op & 2);\\n add2(m2 & 4, 2);\\n t += \\\")\\\";\\n add_op(op & 4);\\n add2(m2 & 8, 3);\\n t += \\\")\\\";\\n check2();\\n }\\n }\\n }\\n rep(m1, 0, 8) {\\n rep(m2, 0, 16) {\\n rep(op, 0, 8) {\\n t = \\\"\\\";\\n add1(m1 & 1);\\n add1(m1 & 2);\\n add2(m2 & 1, 0);\\n add_op(op & 1);\\n add2(m2 & 2, 1);\\n t += \\\")\\\";\\n add_op(op & 2);\\n add1(m1 & 4);\\n add2(m2 & 4, 2);\\n add_op(op & 4);\\n add2(m2 & 8, 3);\\n t += \\\")\\\";\\n t += \\\")\\\";\\n check2();\\n }\\n }\\n }\\n return;\\n };\\n auto dfs = [&](auto &&dfs, vc<char> &C) -> void {\\n if (C.size() >= 5) return;\\n check(C);\\n for (char c = 'a'; c <= 'd'; c++) {\\n C.push_back(c);\\n dfs(dfs, C);\\n C.pop_back();\\n }\\n };\\n vc<char> C;\\n dfs(dfs, C);\\n min_op[0] = 1, min_op[65535] = 1;\\n while (true) {\\n string s;\\n cin >> s;\\n if (s == \\\".\\\") break;\\n ll num = 0;\\n rep(a, 0, 2) rep(b, 0, 2) rep(c, 0, 2) rep(d, 0, 2) {\\n ABCD[0] = a, ABCD[1] = b, ABCD[2] = c, ABCD[3] = d;\\n pos = 0;\\n ll val = a * 8 + b * 4 + c * 2 + d;\\n num |= (1 << val) * E(E, s);\\n }\\n cout << min_op[num] << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 3484,\n \"score_of_the_acc\": -0.0538,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1620_9232294\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nconst int N{1 << 16};\\nint dist[N];\\n\\nvoid init() {\\n const int INF{(int)2e9};\\n std::fill(dist, dist + N, INF);\\n using qt = std::pair<int, int>;\\n std::priority_queue<qt, std::vector<qt>, std::greater<qt>> que;\\n dist[0] = 1; // 0\\n que.emplace(dist[0], 0);\\n dist[N - 1] = 1; // 1\\n que.emplace(dist[1], N - 1);\\n for (int i{} ; i < 4 ; i++) { // a, b, c, d\\n int val{};\\n for (int bit{} ; bit < (1 << 4) ; bit++) {\\n if (bit & (1 << i)) val |= (1 << bit);\\n }\\n dist[val] = 1;\\n que.emplace(dist[val], val);\\n }\\n while (que.size()) {\\n auto [d, v]{que.top()};\\n que.pop();\\n if (dist[v] < d) continue;\\n {// -\\n int x{(N - 1) ^ v};\\n if (dist[x] > dist[v] + 1) {\\n dist[x] = dist[v] + 1;\\n que.emplace(dist[x], x);\\n }\\n }\\n for (int i{} ; i < N ; i++) {\\n if (dist[i] + dist[v] + 3 > 16) continue;\\n {\\n int x{i ^ v};\\n if (dist[x] > dist[i] + dist[v] + 3) {\\n dist[x] = dist[i] + dist[v] + 3;\\n que.emplace(dist[x], x);\\n }\\n }\\n {\\n int x{i & v};\\n if (dist[x] > dist[i] + dist[v] + 3) {\\n dist[x] = dist[i] + dist[v] + 3;\\n que.emplace(dist[x], x);\\n }\\n }\\n }\\n }\\n}\\n\\nint parse(const std::string& S) {\\n int res{};\\n for (int bit{} ; bit < (1 << 4) ; bit++) {\\n int it{};\\n auto f{[&](auto f) -> int {\\n if (S[it] == '(') {\\n it++;\\n int front{f(f)};\\n assert(S[it] == '*' or S[it] == '^');\\n char op{S[it]};\\n it++;\\n int back{f(f)};\\n assert(S[it] == ')');\\n it++;\\n return op == '*' ? (front & back) : (front ^ back);\\n }\\n else if (S[it] == '-') {\\n it++;\\n int val{f(f)};\\n return 1 - val;\\n }\\n else {\\n char c{S[it]};\\n it++;\\n if (c == '0') return 0;\\n if (c == '1') return 1;\\n if (c == 'a') return (bool)(bit & (1 << 0));\\n if (c == 'b') return (bool)(bit & (1 << 1));\\n if (c == 'c') return (bool)(bit & (1 << 2));\\n if (c == 'd') return (bool)(bit & (1 << 3));\\n assert(false);\\n return -1;\\n }\\n }};\\n if (f(f)) res |= (1 << bit);\\n }\\n return res;\\n}\\n\\nbool solve() {\\n std::string S;\\n std::cin >> S;\\n if (S == \\\".\\\") return false;\\n std::cout << dist[parse(S)] << '\\\\n';\\n return true;\\n}\\n\\nint main() {\\n init();\\n std::cin.tie(nullptr)->sync_with_stdio(false);\\n while (solve()) ;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 100,\n \"memory_kb\": 3584,\n \"score_of_the_acc\": -0.0248,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1620_9004236\",\n \"code_snippet\": \"#line 2 \\\"cp-library/src/cp-template.hpp\\\"\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nusing i32 = int;\\nusing u32 = unsigned int;\\nusing i64 = long long;\\nusing u64 = unsigned long long;\\nusing i128 = __int128_t;\\ntemplate < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }\\ntemplate < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }\\ntemplate < class T, class U > T ceil (T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); }\\ntemplate < class T, class U > T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); }\\nint popcnt(i32 x) { return __builtin_popcount(x); }\\nint popcnt(u32 x) { return __builtin_popcount(x); }\\nint popcnt(i64 x) { return __builtin_popcountll(x); }\\nint popcnt(u64 x) { return __builtin_popcountll(x); }\\n\\n#line 2 \\\"cp-library/src/utility/rep_itr.hpp\\\"\\ntemplate < class T > struct itr_rep {\\n T i, d;\\n constexpr itr_rep(const T i) noexcept : i(i), d(1) {}\\n constexpr itr_rep(const T i, const T d) noexcept : i(i), d(d) {}\\n void operator++() noexcept { i += d; }\\n constexpr int operator*() const noexcept { return i; }\\n constexpr bool operator!=(const itr_rep x) const noexcept { return d > 0 ? i < x.i : i > x.i; }\\n};\\n\\ntemplate < class T > struct rep {\\n const itr_rep< T > s, t;\\n constexpr rep(const T t) noexcept : s(0), t(t) {}\\n constexpr rep(const T s, const T t) noexcept : s(s), t(t) {}\\n constexpr rep(const T s, const T t, const T d) noexcept : s(s, d), t(t, d) {}\\n constexpr auto begin() const noexcept { return s; }\\n constexpr auto end () const noexcept { return t; }\\n};\\n\\ntemplate < class T > struct revrep {\\n const itr_rep < T > s, t;\\n constexpr revrep(const T t) noexcept : s(t - 1, -1), t(-1, -1) {}\\n constexpr revrep(const T s, const T t) noexcept : s(t - 1, -1), t(s - 1, -1) {}\\n constexpr revrep(const T s, const T t, const T d) noexcept : s(t - 1, -d), t(s - 1, -d) {}\\n constexpr auto begin() const noexcept { return s; }\\n constexpr auto end () const noexcept { return t; }\\n};\\n#line 3 \\\"cp-library/src/utility/io.hpp\\\"\\n\\n/* 128bit integer */\\nistream& operator>>(istream& is, i128& x) {\\n std::string s; is >> s;\\n int pm = (s[0] == '-');\\n x = 0;\\n for(int i : rep(pm, int(s.size()))) x = x * 10 + (s[i] - '0');\\n if(pm) x *= -1;\\n return is;\\n}\\nostream& operator<<(ostream& os, const i128& x) {\\n if(x == 0) return os << '0';\\n i128 y = x;\\n if(y < 0) { os << '-'; y *= -1; }\\n std::vector<int> ny;\\n while(y > 0) { ny.push_back(y % 10); y /= 10; }\\n for(int i : revrep(ny.size())) os << ny[i];\\n return os;\\n}\\n\\ntemplate < class S, class T > istream& operator>>(istream& is, std::pair< S, T >& x) { is >> x.first >> x.second; return is; }\\ntemplate < class S, class T > ostream& operator<<(ostream& os, const std::pair< S, T >& x) { os << x.first << \\\" \\\" << x.second; return os; }\\n\\nnamespace scanner {\\n struct sca {\\n template < class T > operator T() {\\n T s; std::cin >> s; return s;\\n }\\n };\\n struct vec {\\n int n;\\n vec(int n) : n(n) {}\\n template < class T > operator std::vector< T >() {\\n std::vector< T > v(n);\\n for(T& x : v) std::cin >> x;\\n return v;\\n }\\n };\\n struct mat {\\n int h, w;\\n mat(int h, int w) : h(h), w(w) {}\\n template < class T > operator std::vector< std::vector< T > >() {\\n std::vector m(h, std::vector< T >(w));\\n for(std::vector< T >& v : m) for(T& x : v) std::cin >> x;\\n return m;\\n }\\n };\\n struct speedup {\\n speedup() {\\n std::cin.tie(0);\\n std::ios::sync_with_stdio(0);\\n }\\n } speedup_instance;\\n}\\nscanner::sca in() { return scanner::sca(); }\\nscanner::vec in(int n) { return scanner::vec(n); }\\nscanner::mat in(int h, int w) { return scanner::mat(h, w); }\\n\\nnamespace printer {\\n void precision(int d) { std::cout << std::fixed << std::setprecision(d); }\\n void flush() { std::cout.flush(); }\\n}\\n\\ntemplate < class T >\\nostream& operator<<(ostream& os, const std::vector< T > a) {\\n int n = a.size();\\n for(int i : rep(n)) { os << a[i]; if(i != n - 1) os << ' '; }\\n return os;\\n}\\n\\nint print() { std::cout << '\\\\n'; return 0; }\\ntemplate < class head, class... tail > int print(head&& h, tail&&... t) {\\n std::cout << h; if(sizeof...(tail)) std::cout << ' ';\\n return print(std::forward<tail>(t)...);\\n}\\ntemplate < class T > int print_n(const std::vector< T > a) {\\n int n = a.size();\\n for(int i : rep(n)) std::cout << a[i] << \\\"\\\\n\\\";\\n return 0;\\n}\\n\\n\\n#line 2 \\\"cp-library/src/utility/key_val.hpp\\\"\\n\\ntemplate < class K, class V >\\nstruct key_val {\\n K key; V val;\\n key_val() {}\\n key_val(K key, V val) : key(key), val(val) {}\\n template < std::size_t Index >\\n std::tuple_element_t< Index, key_val >& get() {\\n if constexpr (Index == 0) return key;\\n if constexpr (Index == 1) return val;\\n }\\n};\\n\\nnamespace std {\\n\\ntemplate < class K, class V > struct tuple_size < key_val< K, V > > : integral_constant< size_t, 2 > {};\\ntemplate < class K, class V > struct tuple_element < 0, key_val< K, V > > { using type = K; };\\ntemplate < class K, class V > struct tuple_element < 1, key_val< K, V > > { using type = V; };\\n\\n}\\n#line 2 \\\"cp-library/src/utility/vec_op.hpp\\\"\\ntemplate < class T > key_val< int, T > max_of(const vector< T >& a) {\\n int i = std::max_element(a.begin(), a.end()) - a.begin();\\n return {i, a[i]};\\n}\\ntemplate < class T > key_val< int, T > min_of(const vector< T >& a) {\\n int i = std::min_element(a.begin(), a.end()) - a.begin();\\n return {i, a[i]};\\n}\\ntemplate < class S, class T > S sum_of(const vector< T >& a) {\\n S sum = 0;\\n for(const T x : a) sum += x;\\n return sum;\\n}\\ntemplate < class S, class T > vector< S > freq_of(const vector< T >& a, T L, T R) {\\n vector< S > res(R - L, S(0));\\n for(const T x : a) res[x - L] += 1;\\n return res;\\n}\\ntemplate < class S, class T > struct prefix_sum {\\n vector< S > s;\\n prefix_sum(const vector< T >& a) : s(a) {\\n s.insert(s.begin(), S(0));\\n for(int i : rep(a.size())) s[i + 1] += s[i];\\n }\\n // [L, R)\\n S sum(int L, int R) { return s[R] - s[L]; }\\n};\\n#line 3 \\\"cp-library/src/utility/heap.hpp\\\"\\n\\ntemplate < class T > using heap_min = std::priority_queue< T, std::vector< T >, std::greater< T > >;\\ntemplate < class T > using heap_max = std::priority_queue< T, std::vector< T >, std::less< T > >;\\n\\n#line 27 \\\"cp-library/src/cp-template.hpp\\\"\\n\\n#line 1 \\\"cp-library/src/algorithm/bin_search.hpp\\\"\\ntemplate < class T, class F >\\nT bin_search(T ok, T ng, F f) {\\n while(abs(ng - ok) > 1) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n\\ntemplate < class T, class F >\\nT bin_search_real(T ok, T ng, F f, int step = 80) {\\n while(step--) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n#line 2 \\\"cp-library/src/algorithm/argsort.hpp\\\"\\n\\ntemplate < class T > std::vector< int > argsort(const std::vector< T > &a) {\\n std::vector< int > ids((int)a.size());\\n std::iota(ids.begin(), ids.end(), 0);\\n std::sort(ids.begin(), ids.end(), [&](int i, int j) {\\n return a[i] < a[j] || (a[i] == a[j] && i < j);\\n });\\n return ids;\\n}\\n#line 1 \\\"macro.hpp\\\"\\nnamespace macro {\\n\\nusing size_type = int;\\ntemplate < class container > void sort(container& a) { std::sort(std:: begin(a), std:: end(a)); }\\ntemplate < class container > void rsort(container& a) { std::sort(std::rbegin(a), std::rend(a)); }\\ntemplate < class container > void reverse(container& a) { std::reverse(std::begin(a), std::end(a)); }\\ntemplate < class container > void unique(container& a) {\\n std::sort(std::begin(a), std::end(a));\\n a.erase(std::unique(std::begin(a), std::end(a)), std::end(a));\\n}\\ntemplate < class container > container sorted(const container& a) { container b = a; sort(b); return std::move(b); }\\ntemplate < class container > container rsorted(const container& a) { container b = a; rsort(b); return std::move(b); }\\ntemplate < class container, class compare > void sort(container& a, const compare& cmp) { std::sort(std::begin(a), std::end(a), cmp); }\\ntemplate < class container, class compare > container sorted(const container& a, const compare& cmp) { container b = a; sort(b, cmp); return std::move(b); }\\ntemplate < class container, class value > size_type lower_bound(const container& a, const value& x) { return std::lower_bound(std::begin(a), std::end(a), x) - std::begin(a); }\\ntemplate < class container, class value > size_type upper_bound(const container& a, const value& x) { return std::upper_bound(std::begin(a), std::end(a), x) - std::begin(a); }\\n\\nconst std::vector<std::pair<size_type, size_type>> dir4 = { {+1, 0}, {-1, 0}, { 0, +1}, { 0, -1} };\\nconst std::vector<std::pair<size_type, size_type>> dir8 = { {-1, -1}, {-1, 0}, {-1, +1}, { 0, -1}, { 0, +1}, {+1, -1}, {+1, 0}, {+1, +1} };\\n\\n#ifdef _DEBUG\\n#define debug(x) std::cout << \\\"[\\\" << __LINE__ << \\\"] \\\" << #x << \\\": \\\" << x << std::endl\\n#else\\n#define debug(x)\\n#endif\\n\\ntemplate < class container > void concat(container& a, const container& b) {\\n a.insert(std::end(a), std::begin(b), std::end(b));\\n}\\nstd::vector<size_type> iota(const size_type n) {\\n std::vector<size_type> I(n);\\n std::iota(std::begin(I), std::end(I), 0);\\n return I;\\n}\\ntemplate < class container > std::vector<size_type> sort_idx(const container& a) {\\n const size_type n = a.size();\\n std::vector<size_type> I = iota(n);\\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return a[i] < a[j] or (a[i] == a[j] and i < j); });\\n return I;\\n}\\ntemplate < class container, class compare > std::vector<size_type> sort_idx(const container& a, const compare& cmp) {\\n const size_type n = a.size();\\n std::vector<size_type> I = iota(n);\\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return cmp(a[i], a[j]) or (a[i] == a[j] and i < j); });\\n return std::move(I);\\n}\\n\\nstruct grid {\\n using size_type = int;\\n size_type H, W;\\n grid(const size_type H, const size_type W) : H(H), W(W) {}\\n bool contains(const size_type i, const size_type j) {\\n return 0 <= i and i < H and 0 <= j and j < W;\\n }\\n};\\n\\nusing f64 = long double;\\n\\n} // namespace macro\\n\\nusing namespace macro;\\n#line 3 \\\"A.cpp\\\"\\n\\nbool solve(const string& s, int& i, int x) {\\n if(s[i] == '0') { i++; return 0; }\\n if(s[i] == '1') { i++; return 1; }\\n if(s[i] == 'a') { i++; return x & (1 << 0); }\\n if(s[i] == 'b') { i++; return x & (1 << 1); }\\n if(s[i] == 'c') { i++; return x & (1 << 2); }\\n if(s[i] == 'd') { i++; return x & (1 << 3); }\\n if(s[i] == '-') { i++; return !solve(s, i, x); }\\n if(s[i] == '(') {\\n i++;\\n bool L = solve(s, i, x);\\n assert(s[i] == '^' or s[i] == '*');\\n char op = s[i];\\n i++;\\n bool R = solve(s, i, x);\\n assert(s[i] == ')');\\n i++;\\n if(op == '^') {\\n return L ^ R;\\n } else {\\n return L & R;\\n }\\n }\\n assert(0);\\n}\\n\\nset<string> st;\\nmap<vector<int>, int> mp;\\nvoid dfs(string s) {\\n if(s.size() <= 16 and !st.count(s)) {\\n\\n vector<int> f(1 << 4, 0);\\n for(int x : rep(1 << 4)) {\\n int i = 0;\\n f[x] = solve(s, i, x);\\n }\\n if(!mp.count(f) or mp[f] > s.size()) {\\n mp[f] = s.size();\\n st.insert(s);\\n dfs(\\\"-\\\" + s);\\n for(string t : st) {\\n if(1 + s.size() + 1 + t.size() + 1 <= 16) {\\n dfs(\\\"(\\\" + s + \\\"^\\\" + t + \\\")\\\");\\n dfs(\\\"(\\\" + t + \\\"^\\\" + s + \\\")\\\");\\n dfs(\\\"(\\\" + s + \\\"*\\\" + t + \\\")\\\");\\n dfs(\\\"(\\\" + t + \\\"*\\\" + s + \\\")\\\");\\n }\\n }\\n }\\n }\\n}\\n\\nint main() {\\n dfs(\\\"0\\\");\\n dfs(\\\"1\\\");\\n dfs(\\\"a\\\");\\n dfs(\\\"b\\\");\\n dfs(\\\"c\\\");\\n dfs(\\\"d\\\");\\n\\n for(string s : st) {\\n vector<int> f(1 << 4, 0);\\n for(int x : rep(1 << 4)) {\\n int i = 0;\\n f[x] = solve(s, i, x);\\n }\\n if(!mp.count(f)) {\\n mp[f] = s.size();\\n } else {\\n chmin(mp[f], (int)s.size());\\n }\\n }\\n\\n while(true) {\\n string s = in();\\n if(s == \\\".\\\") return 0;\\n\\n vector<int> f(1 << 4, 0);\\n for(int x : rep(1 << 4)) {\\n int i = 0;\\n f[x] = solve(s, i, x);\\n }\\n print(mp[f]);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 4120,\n \"score_of_the_acc\": -0.0389,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1620_8393693\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nconst vector<int> base = { 0x0000, 0xffff, 0xaaaa, 0xcccc, 0xf0f0, 0xff00 };\\n\\nint parse(const string& s, int &pos) {\\n\\tif (s[pos] == '0' || s[pos] == '1' || s[pos] == 'a' || s[pos] == 'b' || s[pos] == 'c' || s[pos] == 'd') {\\n\\t\\tint res = base[s[pos] == '0' ? 0 : s[pos] == '1' ? 1 : s[pos] == 'a' ? 2 : s[pos] == 'b' ? 3 : s[pos] == 'c' ? 4 : 5];\\n\\t\\tpos += 1;\\n\\t\\treturn res;\\n\\t}\\n\\tif (s[pos] == '-') {\\n\\t\\tpos += 1;\\n\\t\\treturn 65535 - parse(s, pos);\\n\\t}\\n\\tpos += 1;\\n\\tint lc = parse(s, pos);\\n\\tchar ch = s[pos];\\n\\tpos += 1;\\n\\tint rc = parse(s, pos);\\n\\tpos += 1;\\n\\treturn (ch == '^' ? lc ^ rc : lc & rc);\\n}\\n\\nint main() {\\n\\t// step #1. precompute distances\\n\\tvector<int> dist(65536, -1);\\n\\tvector<vector<int> > group(2);\\n\\tint cnt = base.size();\\n\\tgroup[1] = base;\\n\\tfor (int i : base) {\\n\\t\\tdist[i] = 1;\\n\\t}\\n\\tint d = 1, x = 0;\\n\\twhile (cnt < 65536) {\\n\\t\\td += 1;\\n\\t\\tgroup.push_back(vector<int>());\\n\\t\\tfor (int i : group[d - 1]) {\\n\\t\\t\\tif (dist[65535 - i] == -1) {\\n\\t\\t\\t\\tdist[65535 - i] = d;\\n\\t\\t\\t\\tgroup[d].push_back(65535 - i);\\n\\t\\t\\t\\tcnt += 1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tif (d >= 5) {\\n\\t\\t\\tfor (int i = 1; i <= d - 4; i++) {\\n\\t\\t\\t\\tfor (int j : group[i]) {\\n\\t\\t\\t\\t\\tfor (int k : group[(d - 3) - i]) {\\n\\t\\t\\t\\t\\t\\tx += 1;\\n\\t\\t\\t\\t\\t\\tif (dist[j ^ k] == -1) {\\n\\t\\t\\t\\t\\t\\t\\tdist[j ^ k] = d;\\n\\t\\t\\t\\t\\t\\t\\tgroup[d].push_back(j ^ k);\\n\\t\\t\\t\\t\\t\\t\\tcnt += 1;\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tif (dist[j & k] == -1) {\\n\\t\\t\\t\\t\\t\\t\\tdist[j & k] = d;\\n\\t\\t\\t\\t\\t\\t\\tgroup[d].push_back(j & k);\\n\\t\\t\\t\\t\\t\\t\\tcnt += 1;\\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}\\n\\t}\\n\\t\\n\\t// step #2. solve\\n\\tcin.tie(0);\\n\\tios::sync_with_stdio(false);\\n\\twhile (true) {\\n\\t\\tstring s;\\n\\t\\tcin >> s;\\n\\t\\tif (s == \\\".\\\") {\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\t\\tint pos = 0;\\n\\t\\tint bit = parse(s, pos);\\n\\t\\tcout << dist[bit] << '\\\\n';\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3756,\n \"score_of_the_acc\": -0.0044,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1620_8027079\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nusing ll = long long;\\n#define rep(i, n) for (ll i = 0; i < (n); i++)\\n\\nstruct Parser {\\n string S;\\n int idx;\\n int val;\\n Parser(string s) : S(s), idx(0){};\\n\\n char peek() { return S[idx]; }\\n char read() { return S[idx++]; }\\n bool consume(char c) {\\n if (peek() == c) {\\n read();\\n return true;\\n }\\n return false;\\n }\\n bool eos() { return idx == (int)S.size(); }\\n\\n int solve(int v) {\\n val = v;\\n idx = 0;\\n return E();\\n }\\n\\n int E() {\\n if (consume('-')) {\\n return 1 - E();\\n }\\n if (consume('(')) {\\n int a = E();\\n char op = read();\\n int b = E();\\n consume(')');\\n if (op == '^') {\\n if (a != b) return 1;\\n return 0;\\n } else {\\n if (a == 1 && b == 1) return 1;\\n return 0;\\n }\\n }\\n char a = read();\\n if (a == '0') return 0;\\n if (a == '1') return 1;\\n if (a == 'a') return ((val >> 0) & 1);\\n if (a == 'b') return ((val >> 1) & 1);\\n if (a == 'c') return ((val >> 2) & 1);\\n if (a == 'd') return ((val >> 3) & 1);\\n exit(1);\\n }\\n};\\n\\nint res(string s) {\\n int re = 0;\\n Parser ps(s);\\n rep(v, 1 << 4) {\\n re *= 2;\\n ll a = ps.solve(v);\\n re += a;\\n if (!(a == 0 || a == 1)) {\\n cout << \\\"WA\\\" << endl;\\n }\\n }\\n return re;\\n}\\n\\nstruct Pre {\\n vector<int> dp;\\n\\n Pre() {\\n int inf = 10000;\\n dp.resize(1 << 16, inf);\\n vector<int> update(1 << 16, inf);\\n set<int> ok;\\n auto add = [&](int key, int val) {\\n if (dp[key] != inf) return;\\n update[key] = min(update[key], val);\\n };\\n // 更新するとき気を付ける\\n\\n auto nxtmns = [&]() {\\n for (auto key : ok) {\\n // add(((1 << 16) - 1) ^ key, dp[key] + 1);\\n int u = 0;\\n rep(i, 16) {\\n if (!((key >> i) & 1)) {\\n u += (1 << i);\\n }\\n }\\n add(u, dp[key] + 1);\\n }\\n };\\n\\n auto nxt = [&]() {\\n for (auto k1 : ok) {\\n for (auto k2 : ok) {\\n if (3 + dp[k1] + dp[k2] > 18) continue;\\n add(k1 ^ k2, 3 + dp[k1] + dp[k2]);\\n add(k1 & k2, 3 + dp[k1] + dp[k2]);\\n }\\n }\\n };\\n\\n auto ud = [&](int v) {\\n rep(i, 1 << 16) if (update[i] == v) {\\n dp[i] = update[i];\\n ok.insert(i);\\n update[i] = inf;\\n }\\n };\\n\\n add(res(\\\"0\\\"), 1);\\n add(res(\\\"1\\\"), 1);\\n add(res(\\\"a\\\"), 1);\\n add(res(\\\"b\\\"), 1);\\n add(res(\\\"c\\\"), 1);\\n add(res(\\\"d\\\"), 1);\\n\\n for (int v = 1; v <= 16; v++) {\\n ud(v);\\n nxtmns();\\n ud(v);\\n nxt();\\n }\\n ud(17);\\n\\n // cout << \\\"=====\\\" << endl;\\n // rep(i, 1 << 16) cout << i << \\\" \\\" << dp[i] << endl;\\n // cout << \\\"=====\\\" << endl;\\n }\\n} pre;\\n\\nbool solve() {\\n string S;\\n cin >> S;\\n if (S == \\\".\\\") return false;\\n\\n int ans = min((int)S.size(), pre.dp[res(S)]);\\n if ((int)S.size() < pre.dp[res(S)]) {\\n cout << \\\"WA!! \\\" << S << \\\" \\\" << pre.dp[res(S)] << endl;\\n exit(1);\\n }\\n cout << ans << endl;\\n\\n return true;\\n}\\n\\nint main() {\\n auto st = [&](int s) {\\n string res;\\n while (s > 0) {\\n res += '0' + s % 2;\\n s /= 2;\\n }\\n return res;\\n };\\n auto nxtmns = [&](int key) {\\n int u = 0;\\n rep(i, 16) {\\n if (!((key >> i) & 1)) {\\n u += (1 << i);\\n }\\n }\\n return u;\\n };\\n\\n // cout << \\\"a : \\\" << pre.dp[res(\\\"a\\\")] << endl;\\n // cout << \\\"-a : \\\" << pre.dp[res(\\\"-a\\\")] << endl;\\n // cout << \\\"nxtmnsval \\\" << st(nxtmns(res(\\\"a\\\"))) << endl;\\n // cout << \\\"res( a) : \\\" << st(res(\\\"a\\\")) << endl;\\n // cout << \\\"res(-a) : \\\" << st(res(\\\"-a\\\")) << endl;\\n auto out = [&](string s) { cout << s << \\\" \\\" << pre.dp[res(s)] << endl; };\\n // out(\\\"(c*d)\\\");\\n // out(\\\"((c*d)*a)\\\");\\n // out(\\\"-((c*d)*a)\\\");\\n // out(\\\"--a\\\");\\n // out(\\\"(-((c*d)*a)^a)\\\");\\n // out(\\\"(a^b)\\\");\\n while (solve())\\n ;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3496,\n \"score_of_the_acc\": -0.0108,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1620_8016523\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rng(i,a,b) for(int i=(a);i<(b);i++)\\n#define rep(i,n) rng(i,0,(n))\\n#define vec vector\\n#define pb emplace_back\\n#define all(a) (a).begin(),(a).end()\\nusing ll = long long;\\nusing ld = long double;\\nusing namespace std;\\n\\nsigned main() {\\n\\n struct st {\\n string s;\\n int val;\\n };\\n\\n //1\\n vec<st>e;\\n int one = 0, two = 0, thr = 0;\\n rep(z, 4) {\\n st tmp;\\n tmp.s = 'a' + z;\\n tmp.val = 0;\\n rep(i, 2)rep(j, 2)rep(x, 2)rep(y, 2) {\\n if (z == 0 && i == 1 || z == 1 && j == 1 || z == 2 && x == 1 || z == 3 && y == 1) {\\n int keta = (i << 3) | (j << 2) | (x << 1) | y;\\n tmp.val |= (1 << keta);\\n }\\n }\\n e.pb(tmp);\\n tmp.s = \\\"-\\\";\\n tmp.s += 'a' + z;\\n tmp.val = 0;\\n rep(i, 2)rep(j, 2)rep(x, 2)rep(y, 2) {\\n if (z == 0 && i == 0 || z == 1 && j == 0 || z == 2 && x == 0 || z == 3 && y == 0) {\\n int keta = (i << 3) | (j << 2) | (x << 1) | y;\\n tmp.val |= (1 << keta);\\n }\\n }\\n e.pb(tmp);\\n one += 2;\\n }\\n\\n //2 = 1*1\\n rep(i, one)rng(j, i + 1, one) {\\n rep(k, 2)rep(r, 2) {\\n st tmp;\\n tmp.s = \\\"(\\\";\\n tmp.s += ((k == 0) ? \\\"\\\" : \\\"-\\\") + e[i].s + \\\"^\\\" + ((r == 0) ? \\\"\\\" : \\\"-\\\") + e[j].s + \\\")\\\";\\n tmp.val = (k == 0 ? e[i].val : (((1 << 16) - 1) ^ e[i].val)) ^ (r == 0 ? e[j].val : (((1 << 16) - 1) ^ e[j].val));\\n e.pb(tmp);\\n tmp;\\n tmp.s = \\\"(\\\";\\n tmp.s += ((k == 0) ? \\\"\\\" : \\\"-\\\") + e[i].s + \\\"*\\\" + ((r == 0) ? \\\"\\\" : \\\"-\\\") + e[j].s + \\\")\\\";\\n tmp.val = (k == 0 ? e[i].val : (((1 << 16) - 1) ^ e[i].val)) & (r == 0 ? e[j].val : (((1 << 16) - 1) ^ e[j].val));\\n e.pb(tmp);\\n two += 2;\\n }\\n }\\n\\n //3=1*2\\n rep(i, one)rng(j, one, one + two) {\\n rep(k, 2)rep(r, 2) {\\n st tmp;\\n tmp.s = \\\"(\\\";\\n tmp.s += ((k == 0) ? \\\"\\\" : \\\"-\\\") + e[i].s + \\\"^\\\" + ((r == 0) ? \\\"\\\" : \\\"-\\\") + e[j].s + \\\")\\\";\\n tmp.val = (k == 0 ? e[i].val : (((1 << 16) - 1) ^ e[i].val)) ^ (r == 0 ? e[j].val : (((1 << 16) - 1) ^ e[j].val));\\n e.pb(tmp);\\n tmp.s = \\\"(\\\";\\n tmp.s += ((k == 0) ? \\\"\\\" : \\\"-\\\") + e[i].s + \\\"*\\\" + ((r == 0) ? \\\"\\\" : \\\"-\\\") + e[j].s + \\\")\\\";\\n tmp.val = (k == 0 ? e[i].val : (((1 << 16) - 1) ^ e[i].val)) & (r == 0 ? e[j].val : (((1 << 16) - 1) ^ e[j].val));\\n e.pb(tmp);\\n thr += 2;\\n }\\n }\\n\\n //3=2*2\\n rng(i, one, one + two)rng(j, i + 1, one + two) {\\n rep(k, 2)rep(r, 2) {\\n st tmp;\\n tmp.s = \\\"(\\\";\\n tmp.s += ((k == 0) ? \\\"\\\" : \\\"-\\\") + e[i].s + \\\"^\\\" + ((r == 0) ? \\\"\\\" : \\\"-\\\") + e[j].s + \\\")\\\";\\n tmp.val = (k == 0 ? e[i].val : (((1 << 16) - 1) ^ e[i].val)) ^ (r == 0 ? e[j].val : (((1 << 16) - 1) ^ e[j].val));\\n if (tmp.s.size() <= 16)e.pb(tmp);\\n tmp.s = \\\"(\\\";\\n tmp.s += ((k == 0) ? \\\"\\\" : \\\"-\\\") + e[i].s + \\\"*\\\" + ((r == 0) ? \\\"\\\" : \\\"-\\\") + e[j].s + \\\")\\\";\\n tmp.val = (k == 0 ? e[i].val : (((1 << 16) - 1) ^ e[i].val)) & (r == 0 ? e[j].val : (((1 << 16) - 1) ^ e[j].val));\\n if (tmp.s.size() <= 16)e.pb(tmp);\\n }\\n }\\n\\n //4=(1,2)*3\\n rep(i, one + two)rng(j, one + two, one + two + thr) {\\n rep(k, 2)rep(r, 2) {\\n st tmp;\\n tmp.s = \\\"(\\\";\\n tmp.s += ((k == 0) ? \\\"\\\" : \\\"-\\\") + e[i].s + \\\"^\\\" + ((r == 0) ? \\\"\\\" : \\\"-\\\") + e[j].s + \\\")\\\";\\n tmp.val = (k == 0 ? e[i].val : (((1 << 16) - 1) ^ e[i].val)) ^ (r == 0 ? e[j].val : (((1 << 16) - 1) ^ e[j].val));\\n if (tmp.s.size() <= 16)e.pb(tmp);\\n tmp.s = \\\"(\\\";\\n tmp.s += ((k == 0) ? \\\"\\\" : \\\"-\\\") + e[i].s + \\\"*\\\" + ((r == 0) ? \\\"\\\" : \\\"-\\\") + e[j].s + \\\")\\\";\\n tmp.val = (k == 0 ? e[i].val : (((1 << 16) - 1) ^ e[i].val)) & (r == 0 ? e[j].val : (((1 << 16) - 1) ^ e[j].val));\\n if (tmp.s.size() <= 16)e.pb(tmp);\\n }\\n }\\n string s;\\n while (cin >> s && s != \\\".\\\") {\\n int val = 0;\\n vec<int>kakko(s.size(), -1);\\n stack<int>stc;\\n rep(i, s.size()) {\\n if (s[i] == '(') {\\n stc.push(i);\\n }\\n else if (s[i] == ')') {\\n int t = stc.top();stc.pop();\\n kakko[t] = i;\\n }\\n }\\n rep(i, 2)rep(j, 2)rep(x, 2)rep(y, 2) {\\n auto dfs = [&](int l, int r, auto& dfs) ->bool {\\n int cnt = 0;\\n vec<bool>v;\\n int op = -1;\\n for (int z = l;z < r;z++) {\\n if (s[z] == '(') {\\n bool ret = dfs(z + 1, kakko[z], dfs);\\n if (cnt % 2 == 1) ret = !ret;\\n cnt = 0;\\n v.pb(ret);\\n z = kakko[z];\\n }\\n else if ('a' <= s[z] && s[z] <= 'd' || s[z] == '0' || s[z] == '1') {\\n if (s[z] == 'a') v.pb((cnt % 2 == 0) ? i : 1 - i);\\n if (s[z] == 'b') v.pb((cnt % 2 == 0) ? j : 1 - j);\\n if (s[z] == 'c') v.pb((cnt % 2 == 0) ? x : 1 - x);\\n if (s[z] == 'd') v.pb((cnt % 2 == 0) ? y : 1 - y);\\n if (s[z] == '0') v.pb((cnt % 2 == 0) ? 0 : 1);\\n if (s[z] == '1') v.pb((cnt % 2 == 0) ? 1 : 0);\\n cnt = 0;\\n }\\n else if (s[z] == '*') op = 0;\\n else if (s[z] == '^') op = 1;\\n else cnt++;\\n }\\n if (op < 0) return v[0];\\n if (op == 0) return v[0] & v[1];\\n return v[0] ^ v[1];\\n };\\n int keta = (i << 3) | (j << 2) | (x << 1) | y;\\n val |= (dfs(0, s.size(), dfs) << keta);\\n }\\n\\n //0か1は例外処理\\n bool flag = true;\\n rep(i, 2)rep(j, 2)rep(x, 2)rep(y, 2) {\\n int keta = (i << 3) | (j << 2) | (x << 1) | y;\\n if ((val >> keta) & 1) flag = false;\\n }\\n if (flag) {\\n cout << \\\"1\\\\n\\\";\\n continue;\\n }\\n flag = true;\\n rep(i, 2)rep(j, 2)rep(x, 2)rep(y, 2) {\\n int keta = (i << 3) | (j << 2) | (x << 1) | y;\\n if (!((val >> keta) & 1)) flag = false;\\n }\\n if (flag) {\\n cout << \\\"1\\\\n\\\";\\n continue;\\n }\\n\\n int ans = s.size();\\n for (const auto& g : e) {\\n if (g.s.size() > ans) continue;\\n if (val == g.val) ans = min(ans, int(g.s.size()));\\n if (val == (((1 << 16) - 1) ^ g.val)) ans = min(ans, int(g.s.size()) + 1);\\n }\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2180,\n \"memory_kb\": 16604,\n \"score_of_the_acc\": -0.6639,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1620_7974903\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint NOT(int x) {\\n return x^1;\\n}\\nint XOR(int x, int y) {\\n return x^y;\\n}\\nint AND(int x, int y) {\\n return x&y;\\n}\\nint expression(string &s, int &l, int &r, vector<int> &f) {\\n if( '0' <= s[l] && s[l] <= '1' ) {\\n return s[l]-'0';\\n }else if( 'a' <= s[l] && s[l] <= 'd' ) {\\n return f[s[l]-'a'];\\n }else if( s[l] == '-' ) {\\n l++;\\n return NOT(expression(s, l, r, f));\\n }else {\\n int p, q;\\n char c;\\n for( int i = l+1, d = 0; i <= r-1; i++ ) {\\n if( s[i] == '(' ) d++;\\n if( s[i] == ')' ) d--;\\n if( ( s[i] == '*' || s[i] == '^' ) && d == 0 ) c = s[i], p = i-1, q = i+1;\\n }\\n if( c == '*' ) {\\n l++, r--;\\n return AND(expression(s, l, p, f), expression(s, q, r, f));\\n }\\n if( c == '^' ) {\\n l++, r--;\\n return XOR(expression(s, l, p, f), expression(s, q, r, f));\\n }\\n }\\n return -1;\\n}\\nint main() {\\n int L = 16, rem = 1<<L;\\n vector<int> ans(1<<L, -1);\\n vector<vector<string>> E(L+1, vector<string>());\\n vector<vector<int>> f_all(1<<4, vector<int>(4));\\n for( int i = 0; i < 1<<4; i++ ) {\\n for( int j = 0; j < 4; j++ ) {\\n f_all[i][j] = (i>>j)&1;\\n }\\n }\\n auto get_key = [&](string s) -> int {\\n int ret = 0;\\n for( int i = 0; i < 1<<4; i++ ) {\\n int _l = 0, _r = (int)s.size()-1;\\n ret |= expression(s, _l, _r, f_all[i])<<i;\\n }\\n return ret;\\n };\\n auto operate = [&](string s) -> void {\\n int ret = get_key(s);\\n if( ans[ret] == -1 ) {\\n rem--;\\n ans[ret] = (int)s.size();\\n }\\n };\\n E[1] = {\\\"0\\\", \\\"1\\\", \\\"a\\\", \\\"b\\\", \\\"c\\\", \\\"d\\\"};\\n for( string &s : E[1] ) {\\n operate(s);\\n }\\n for( int l = 2; l <= L; l++ ) {\\n for( string &s : E[l-1] ) {\\n if( s.front() != '-' ) E[l].push_back(\\\"-\\\"+s);\\n }\\n if( l >= 5 ) {\\n for( int x = 1; x <= (l-3)/2; x++ ) {\\n for( string &s : E[x] ) {\\n for( string &t : E[l-3-x] ) {\\n E[l].push_back(\\\"(\\\"+s+\\\"*\\\"+t+\\\")\\\");\\n E[l].push_back(\\\"(\\\"+s+\\\"^\\\"+t+\\\")\\\");\\n }\\n }\\n }\\n }\\n for( string &s : E[l] ) {\\n if( rem == 0 ) break;\\n operate(s);\\n }\\n }\\n string e;\\n while( true ) {\\n cin >> e;\\n if( e == \\\".\\\" ) break;\\n cout << ans[get_key(e)] << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 610,\n \"memory_kb\": 45816,\n \"score_of_the_acc\": -0.4211,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1620_7776375\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n#define rep(i,s,n) for(int i = int(s); i < int(n); i++)\\n#define rrep(i,s,n) for(int i = int(n) - 1; i >= s; i--)\\n#define all(v) v.begin(), v.end()\\n\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing ld = long double;\\n\\ntemplate<class T>\\nbool chmin(T &a, T b) {\\n if(a <= b) return false;\\n a = b;\\n return true;\\n}\\n\\ntemplate<class T>\\nbool chmax(T &a, T b) {\\n if(a >= b) return false;\\n a = b;\\n return true;\\n}\\n\\nint main() {\\n const int INF = std::numeric_limits<int>::max() / 4;\\n const int sz = 4;\\n const int m = 1<<sz;\\n const int mask = (1<<m) - 1;\\n const int max = 16;\\n std::vector<int> table(4, 0);\\n rep(i,0,4) {\\n rep(bit,0,1<<sz) {\\n if((bit >> i) & 1) {\\n table[i] |= (1<<bit);\\n }\\n }\\n }\\n std::vector<int> dp(1<<m, INF);\\n {\\n dp[0] = 1;\\n dp[mask] = 1;\\n std::vector<std::pair<int,int>> p;\\n p.emplace_back(1, 0);\\n p.emplace_back(1, mask);\\n rep(i,0,4) {\\n p.emplace_back(1, table[i]);\\n dp[table[i]] = 1;\\n }\\n int idx = 0;\\n while(idx < (int)p.size()) {\\n auto [lenS, S] = p[idx];\\n if(dp[S] < lenS || dp[S] > max) {\\n idx++;\\n continue;\\n }\\n if(dp[mask ^ S] > lenS + 1) {\\n dp[mask ^ S] = lenS + 1;\\n p.emplace_back(lenS + 1, mask ^ S);\\n }\\n rep(i,0,idx) {\\n auto [lenT, T] = p[i];\\n if(dp[T] < lenT) continue;\\n if(dp[S^T] > lenS + lenT + 3) {\\n dp[S^T] = lenS + lenT + 3;\\n p.emplace_back(lenS + lenT + 3, S^T);\\n }\\n if(dp[S&T] > lenS + lenT + 3) {\\n dp[S&T] = lenS + lenT + 3;\\n p.emplace_back(lenS + lenT + 3, S & T);\\n }\\n }\\n idx++;\\n }\\n }\\n std::string s;\\n while(std::cin >> s, s != \\\".\\\") {\\n int idx = 0;\\n auto f = [&]() -> int {\\n char c = s[idx++];\\n if(c == '0') return 0;\\n else if(c == '1') return (1<<m) - 1;\\n else if('a' <= c && c <= 'd') {\\n return table[c-'a'];\\n }\\n else {\\n assert(0);\\n }\\n };\\n auto expect = [&](char c) -> bool {\\n return s[idx] == c;\\n };\\n auto consume = [&](char c) -> void {\\n if(s[idx] == c) {\\n idx++;\\n }\\n else {\\n assert(0);\\n }\\n };\\n auto E = [&](auto &&self) -> int {\\n if(expect('-')) {\\n consume('-');\\n int e = self(self);\\n return mask ^ e;\\n }\\n else if(expect('(')) {\\n consume('(');\\n int lhs = self(self);\\n char c = s[idx];\\n consume(c);\\n int rhs = self(self);\\n consume(')');\\n if(c == '*') {\\n return lhs & rhs;\\n }\\n else if(c == '^') {\\n return lhs ^ rhs;\\n }\\n else {\\n assert(0);\\n }\\n }\\n else {\\n return f();\\n }\\n };\\n int res = E(E);\\n assert(idx == (int)s.size());\\n std::cout << dp[res] << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 310,\n \"memory_kb\": 5224,\n \"score_of_the_acc\": -0.0913,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1620_6787084\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing vll = vector<ll>;\\nusing vvll = vector<vll>;\\nusing vvvll = vector<vvll>;\\nusing vvvvll = vector<vvvll>;\\nusing vb = vector<bool>;\\nusing vvb = vector<vb>;\\nusing vvvb = vector<vvb>;\\nusing vd = vector<double>;\\nusing vvd = vector<vd>;\\nusing vvvd = vector<vvd>;\\n#define all(A) A.begin(),A.end()\\n#define ALL(A) A.begin(),A.end()\\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\\nusing pqr = priority_queue<pair<ll, ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>>;\\n\\ntemplate<class T>\\nbool chmax(T& p, T q, bool C = 1) {\\n if (C == 0 && p == q) {\\n return 1;\\n }\\n if (p < q) {\\n p = q;\\n return 1;\\n }\\n else {\\n return 0;\\n }\\n}\\n\\ntemplate<class T>\\nbool chmin(T& p, T q, bool C = 1) {\\n if (C == 0 && p == q) {\\n return 1;\\n }\\n if (p > q) {\\n p = q;\\n return 1;\\n }\\n else {\\n return 0;\\n }\\n}\\n\\nll gcd(ll(a), ll(b)) {\\n if (b == 0)return a;\\n ll c = a;\\n while (a % b != 0) {\\n c = a % b;\\n a = b;\\n b = c;\\n }\\n return b;\\n}\\n\\nvll M((1 << 16), 1e18);\\n\\nbool dev(string S, bool a, bool b, bool c, bool d) {\\n bool res = 0;\\n ll N = S.size();\\n if (S[0] == '(') {\\n ll kakko = 0;\\n for (ll i = 1; i < N; i++) {\\n if (S[i] == '(')kakko++;\\n else if (S[i] == ')')kakko--;\\n else if (S[i] == '^' && kakko == 0) {\\n string S1 = S.substr(1, i - 1);\\n string S2 = S.substr(i + 1, N - i - 2);\\n return dev(S1, a, b, c, d) ^ dev(S2, a, b, c, d);\\n break;\\n }\\n else if (S[i] == '*' && kakko == 0) {\\n string S1 = S.substr(1, i - 1);\\n string S2 = S.substr(i + 1, N - i - 2);\\n return dev(S1, a, b, c, d) & dev(S2, a, b, c, d);\\n break;\\n }\\n }\\n }\\n else if (S[0] == '-') {\\n return !dev(S.substr(1, N - 1), a, b, c, d);\\n }\\n else if (S[0] == 'a')return a;\\n else if (S[0] == 'b')return b;\\n else if (S[0] == 'c')return c;\\n else if (S[0] == 'd')return d;\\n else if (S[0] == '0')return 0;\\n else if (S[0] == '1')return 1;\\n return res;\\n}\\n\\nll solve(string S) {\\n ll res = 0;\\n rep(bit, (1 << 4)) {\\n bool a = (bit & 1);\\n bool b = (bit & 2);\\n bool c = (bit & 4);\\n bool d = (bit & 8);\\n if (dev(S, a, b, c, d))res += (1 << bit);\\n }\\n return res;\\n}\\nset<string> maked;\\nvector<string> V;\\n\\nvoid make(string S) {\\n if (maked.count(S))return;\\n maked.insert(S);\\n if(chmin(M[solve(S)], ll(S.size()))){\\n \\n V.push_back(S);\\n make(\\\"-\\\" + S);\\n rep(i,V.size()){\\n string p = V[i];\\n if (p != \\\"\\\") {\\n if (p.size() + S.size() > 10)continue;\\n make(\\\"(\\\" + p + \\\"*\\\" + S + \\\")\\\");\\n make(\\\"(\\\" + p + \\\"^\\\" + S + \\\")\\\");\\n make(\\\"(\\\" + S + \\\"*\\\" + p + \\\")\\\");\\n make(\\\"(\\\" + S + \\\"^\\\" + p + \\\")\\\");\\n }\\n }\\n }\\n\\n}\\n\\n\\n\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n\\n maked.insert(\\\"\\\");\\n make(\\\"0\\\");\\n make(\\\"1\\\");\\n make(\\\"a\\\");\\n make(\\\"b\\\");\\n make(\\\"c\\\");\\n make(\\\"d\\\");\\n string S;\\n while (cin >> S) {\\n if (S == \\\".\\\")return 0;\\n cout << min(ll(S.size()),M[solve(S)]) << endl;\\n }\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3972,\n \"score_of_the_acc\": -0.003,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1620_6710763\",\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\\\"\\nusing namespace std;\\n// #include <atcoder/lazysegtree>\\n// using namespace atcoder;\\n\\ntypedef long long int ll;\\ntypedef unsigned long long ull;\\ntypedef long double ld;\\ntypedef pair<ll, ll> pll;\\ntypedef vector<ll> vll;\\ntypedef vector<vll> vvll;\\ntypedef vector<vvll> vvvll;\\ntypedef vector<pll> vpll;\\ntypedef vector<vpll> vvpll;\\ntypedef vector<bool> vb;\\ntypedef vector<vb> vvb;\\ntypedef vector<double> vd;\\ntypedef vector<vd> vvd;\\ntypedef priority_queue<pll, vpll, function<bool(pll, pll)> > pqpll;\\ntypedef priority_queue<ll, vll, function<bool(pll, pll)> > pqll;\\n\\n//struct edge{ ll from,to,cost; edge(ll e_from,ll e_to,ll e_cost): from(e_from), to(e_to), cost(e_cost){} };\\n//typedef vector<vector<edge>> Graph;\\n\\n#define rep(i,a,n) for(ll i = a;i < n;i++)\\n#define rrep(i,a,n) for(ll i = n-1; i >= a;i--)\\n#define LINF (1LL << 60)\\n#define INF (1 << 30)\\n#define fs first\\n#define sc second\\n#define EPS 1e-10\\n#define ALL(a) a.begin(), a.end()\\n#define tcheck(a) if((clock() - start)/(ld)CLOCKS_PER_SEC >= a) break\\n#define debug(s) cout << #s << endl\\n#define debugval(x) cout << #x\\\" = \\\" << x << endl\\n\\ntemplate<typename T> ll sz(vector<T>& pos) { return (ll)pos.size(); }\\ntemplate<typename T> ll sz(priority_queue<T, vector<T> >& pq) { return (ll)pq.size(); }\\ntemplate<typename T> ll sz(priority_queue<T, vector<T>, greater<T> >& pq) { return (ll)pq.size(); }\\nll sz(string& s) { return (ll)s.size(); }\\n\\ntemplate<typename T> void chmin(T& a, T b) { if (a > b) a = b; }\\ntemplate<typename T> void chmax(T& a, T b) { if (a < b) a = b; }\\n\\nll gcd(ll a, ll b) { return ((!b) ? a : gcd(b, a % b)); }\\nll lcm(ll a, ll b) { return a / gcd(a, b) * b; }\\nll dx[4] = { 0,-1,0,1 }, dy[4] = { -1,0,1,0 };\\ninline bool isinside(ll i, ll n) { return (i < n&& i >= 0); }\\n\\ntypedef string::const_iterator State;\\nclass ParseError {};\\n\\nconst ll A = 0xFF00, B = 0xF0F0, C = 0xCCCC, D = 0xAAAA;\\n\\nll expr(State& begin) {\\n if (*begin == '1') {\\n begin++;\\n return 0xFFFF;\\n }\\n else if (*begin == '0') {\\n begin++;\\n return 0;\\n }\\n else if ('a' <= *begin && *begin <= 'd') {\\n ll res = 0;\\n if (*begin == 'a') res = A;\\n else if (*begin == 'b') res = B;\\n else if (*begin == 'c') res = C;\\n else if (*begin == 'd') res = D;\\n begin++;\\n return res;\\n }\\n else if (*begin == '-') {\\n begin++;\\n ll res = expr(begin);\\n res ^= 0xFFFF;\\n return res;\\n }\\n else if (*begin == '(') {\\n begin++;\\n ll res = expr(begin);\\n char op = *begin; begin++;\\n ll res2 = expr(begin);\\n if (op == '^') res ^= res2;\\n else if (op == '*') res &= res2;\\n else {\\n cout << \\\"parseerror0 : \\\" << *begin << endl;\\n throw ParseError();\\n }\\n begin++;\\n return res;\\n }\\n else {\\n cout << \\\"parseerror1 : \\\" << *begin << endl;\\n throw ParseError();\\n }\\n return 0;\\n}\\n\\n\\nstring t = \\\"01abcd\\\";\\nvector<string> tvec = vector<string>({ \\\"-E\\\",\\\"(E^E)\\\",\\\"(E*E)\\\" });\\nint main() {\\n string s;\\n while (1) {\\n cin >> s;\\n if (s == \\\".\\\") break;\\n\\n State begin = s.begin();\\n ll res = expr(begin);\\n\\n ll ans = 16;\\n queue<string> que;\\n que.emplace(\\\"E\\\");\\n while (que.size()) {\\n string str = que.front();\\n que.pop();\\n if (ans <= str.size())continue;\\n ll ecnt = 0;\\n rep(i, 0, sz(str)) if (str[i] == 'E') ecnt++;\\n rep(i, 0, sz(str)) {\\n if (str[i] == 'E') {\\n rep(j, 0, sz(t)) {\\n str[i] = t[j];\\n begin = str.begin();\\n if (ecnt == 1 && expr(begin) == res) chmin(ans, sz(str));\\n else if (ecnt >= 2) que.push(str);\\n }\\n\\n rep(j, 0, sz(tvec)) {\\n string newstr = str.substr(0, i) + tvec[j] + str.substr(i + 1, sz(str) - i - 1);\\n if (sz(newstr) <= 15) que.push(newstr);\\n }\\n }\\n }\\n }\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1390,\n \"memory_kb\": 19432,\n \"score_of_the_acc\": -0.4689,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1620_6690512\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <algorithm>\\n#include <cmath>\\n#include <vector>\\n#include <set>\\n#include <map>\\n#include <unordered_set>\\n#include <unordered_map>\\n#include <queue>\\n#include <ctime>\\n#include <cassert>\\n#include <complex>\\n#include <string>\\n#include <cstring>\\n#include <chrono>\\n#include <random>\\n#include <queue>\\n#include <bitset>\\n#include <stack>\\n#include <functional>\\n\\n// AtCoder\\n// #include <atcoder/all>\\n// using namespace atcoder;\\n\\n#ifdef LOCAL\\n #define eprintf(...) fprintf(stderr, __VA_ARGS__)\\n#else\\n #define eprintf(...)\\n#endif\\n\\n#define rep_(i, a_, b_, a, b, ...) for (int i = (a), i##_len = (b); i < i##_len; ++i)\\n#define rep(i, ...) rep_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)\\n#define reprev_(i, a_, b_, a, b, ...) for (int i = (b)-1, i##_min = (a); i >= i##_min; --i)\\n#define reprev(i, ...) reprev_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)\\n#define all(x) (x).begin(), (x).end()\\ntemplate <class T> bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }\\ntemplate <class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; }\\n#define fls(x) (64 - __builtin_clzll(x))\\n#define pcnt(x) __builtin_popcountll(x)\\nusing namespace std;\\n\\ntypedef long long ll;\\ntypedef unsigned long long ull;\\ntypedef pair <int,int> P;\\ntypedef long double ld;\\n\\nint var(char c) {\\n if (c == '0') return 0b0000'0000'0000'0000;\\n if (c == '1') return 0b1111'1111'1111'1111;\\n if (c == 'a') return 0b1111'1111'0000'0000;\\n if (c == 'b') return 0b1111'0000'1111'0000;\\n if (c == 'c') return 0b1100'1100'1100'1100;\\n if (c == 'd') return 0b1010'1010'1010'1010;\\n // cerr << \\\"[debug] c=\\\" << c << endl;\\n assert(false);\\n}\\nint parse(const string &s, int &cur) {\\n // cerr << \\\"[debug] cur=\\\" << cur << \\\" s[cur]=\\\" << s[cur] << endl;\\n\\n int res = 0;\\n if (s[cur] == '(') {\\n int l = parse(s, ++cur);\\n char op = s[cur++];\\n int r = parse(s, cur);\\n ++cur;\\n if (op == '*') return l & r;\\n else return l ^ r;\\n } else if (s[cur] == '-') {\\n int tmp = parse(s, ++cur);\\n return ~tmp & 0b1111'1111'1111'1111;\\n } else {\\n return var(s[cur++]);\\n }\\n // cerr << \\\"[debug] cur=\\\" << cur << endl;\\n assert(false);\\n}\\nint parse(const string &s) {\\n int cur = 0;\\n return parse(s, cur);\\n}\\nvoid debug_out(int res) {\\n cerr << \\\"[debug] \\\";\\n reprev (i, 16) cerr << (res >> i & 1);\\n cerr << endl;\\n}\\n\\nvector<int> make_table(void) {\\n vector<int> res(1 << 16, 1e9);\\n map<int, int> mp, mp_;\\n mp[var('0')] = 1;\\n mp[var('1')] = 1;\\n mp[var('a')] = 1;\\n mp[var('b')] = 1;\\n mp[var('c')] = 1;\\n mp[var('d')] = 1;\\n rep (_, 4) {\\n for (auto [k, v] : mp) {\\n // -\\n int minus = ~k & 0b1111'1111'1111'1111;\\n if (mp.find(minus) == mp.end()) mp[minus] = v + 1;\\n else chmin(mp[minus], v + 1);\\n }\\n\\n if (_ == 3) break;\\n\\n mp_ = mp;\\n for (auto [k, v] : mp) {\\n for (auto [k_, v_] : mp) {\\n int res = k & k_;\\n if (mp_.find(res) == mp_.end()) mp_[res] = v + v_ + 3;\\n else chmin(mp_[res], v + v_ + 3);\\n }\\n\\n // ^\\n for (auto [k_, v_] : mp) {\\n int res = k ^ k_;\\n if (mp_.find(res) == mp_.end()) mp_[res] = v + v_ + 3;\\n else chmin(mp_[res], v + v_ + 3);\\n }\\n }\\n swap(mp, mp_);\\n }\\n for (auto [k, v] : mp) res[k] = v;\\n return res;\\n}\\n\\nint main (void)\\n{\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n auto table = make_table();\\n string s;\\n while (true) {\\n cin >> s;\\n if (s == \\\".\\\") break;\\n int parsed = parse(s);\\n // debug_out(parsed);\\n cout << table[parsed] << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 510,\n \"memory_kb\": 6288,\n \"score_of_the_acc\": -0.1516,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1620_5963071\",\n \"code_snippet\": \"#include <iostream>\\n#include <algorithm>\\n#include <map>\\n#include <set>\\n#include <queue>\\n#include <bitset>\\n#include <climits>\\n#include <string>\\n#include <cmath>\\n#include <bitset>\\n#include <complex>\\n#include <functional>\\n#include <ctime>\\n#include <cassert>\\n#include <fstream>\\n#include <stack>\\n#include <random>\\n#include <iomanip>\\n#include <time.h>\\n#include <list>\\n#include <unordered_map>\\n\\n#include <algorithm>\\n#include <array>\\n\\nusing namespace std;\\ntypedef long long ll;\\ntypedef long double dd;\\ntypedef vector<ll> vl;\\ntypedef vector<dd> vd;\\ntypedef vector<vector<ll>> vvl;\\n#define i_7 (ll)(1E9+7)\\n//#define i_7 998244353\\n#define i_5 i_7-2\\nll mod(ll a){\\n ll c=a%i_7;\\n if(c>=0)return c;\\n return c+i_7;\\n}\\ntypedef pair<ll,ll> l_l;\\ntypedef pair<dd,dd> d_d;\\nll inf=(ll)1E18;\\n#define rep(i,l,r) for(ll i=l;i<=r;i++)\\n#define pb push_back\\nll max(ll a,ll b){if(a<b)return b;else return a;}\\nll min(ll a,ll b){if(a>b)return b;else return a;}\\ndd EPS=1E-6;\\ndd PI=acos(-1);\\n#define endl \\\"\\\\n\\\"\\n#define fastio ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);\\n\\n\\n\\n\\nll exp(const string &s, ll &cur, const bitset<4> cha){\\n if(s[cur] == '-'){\\n cur++;\\n ll tmp = exp(s, cur, cha);\\n return 1-tmp;\\n }else if(s[cur] == '('){\\n cur++;\\n ll t1 = exp(s, cur, cha);\\n char op = s[cur];\\n cur++;\\n ll t2 = exp(s, cur, cha);\\n cur++;\\n if(op == '*'){\\n return t1&t2;\\n }else if(op == '^'){\\n return t1^t2;\\n }\\n assert(0);\\n return 0;\\n }else if(s[cur] == '0' || s[cur] == '1'){\\n ll tmp = s[cur] - '0';\\n cur++;\\n return tmp;\\n }else{\\n ll index = s[cur] - 'a';\\n ll tmp = cha[index];\\n cur++;\\n return tmp;\\n }\\n}\\n\\nbitset<16> exp_all(const string &s){\\n bitset<16> res;\\n rep(i,0,15){\\n bitset<4> cha(i);\\n ll cur=0;\\n ll exp_res = exp(s, cur, cha);\\n res[i] = exp_res;\\n }\\n return res;\\n}\\n\\nstruct Hoge{\\n ll time;\\n bitset<16> value;\\n Hoge(ll time, bitset<16> value){\\n this->time = time;\\n this->value = value;\\n }\\n bool operator < ( const Hoge &b ) const{\\n if(this->time == b.time){\\n return this->value.to_ulong() < b.value.to_ulong();\\n }else{\\n return this->time < b.time;\\n }\\n }\\n \\n};\\n\\nsigned main(){fastio\\n ll N=(1<<16);\\n ll dp[N];\\n rep(i,0,N-1)dp[i] = inf;\\n \\n bitset<16> bit_0(\\\"0000000000000000\\\");\\n bitset<16> bit_1(\\\"1111111111111111\\\");\\n bitset<16> bit_a(\\\"1111111100000000\\\");\\n bitset<16> bit_b(\\\"1111000011110000\\\");\\n bitset<16> bit_c(\\\"1100110011001100\\\");\\n bitset<16> bit_d(\\\"1010101010101010\\\");\\n dp[bit_0.to_ulong()] = 1;\\n dp[bit_1.to_ulong()] = 1;\\n dp[bit_a.to_ulong()] = 1;\\n dp[bit_b.to_ulong()] = 1;\\n dp[bit_c.to_ulong()] = 1;\\n dp[bit_d.to_ulong()] = 1;\\n set<Hoge> que;\\n que.insert(Hoge(1, bit_0));\\n que.insert(Hoge(1, bit_1));\\n que.insert(Hoge(1, bit_a));\\n que.insert(Hoge(1, bit_b));\\n que.insert(Hoge(1, bit_c));\\n que.insert(Hoge(1, bit_d));\\n \\n while(!que.empty()){\\n Hoge que_tmp=*que.begin(); que.erase(que.begin());\\n ll d=que_tmp.time;\\n bitset<16> value = que_tmp.value;\\n if(dp[value.to_ulong()] < d)continue;\\n //'-'\\n //cout<<value<<' '<<dp[value.to_ulong()]<<' '<<que.size()<<endl;\\n if(d > 16)continue;\\n \\n bitset<16> not_ = ~value;\\n if(dp[not_.to_ulong()] > dp[value.to_ulong()] + 1){\\n dp[not_.to_ulong()] = dp[value.to_ulong()] + 1;\\n que.insert(Hoge(dp[not_.to_ulong()], not_));\\n }\\n rep(i,0,(1<<16)-1){\\n if(dp[i]==inf)continue;\\n bitset<16> bi(i);\\n bitset<16> and_ = value&bi;\\n bitset<16> xor_ = value^bi;\\n if(dp[and_.to_ulong()] > dp[value.to_ulong()] + dp[i] +3){\\n dp[and_.to_ulong()] = dp[value.to_ulong()] + dp[i] +3;\\n que.insert(Hoge(dp[and_.to_ulong()], and_));\\n }\\n if(dp[xor_.to_ulong()] > dp[value.to_ulong()] + dp[i] +3){\\n dp[xor_.to_ulong()] = dp[value.to_ulong()] + dp[i] +3;\\n que.insert(Hoge(dp[xor_.to_ulong()], xor_));\\n }\\n }\\n }\\n \\n //cout<<\\\"Hoge\\\"<<endl;\\n \\n while(true){\\n string s;cin>>s;\\n if(s==\\\".\\\"){\\n return 0;\\n }\\n bitset<16> res = exp_all(s);\\n cout<<dp[res.to_ulong()]<<endl;\\n }\\n \\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 210,\n \"memory_kb\": 25784,\n \"score_of_the_acc\": -0.1906,\n \"final_rank\": 13\n }\n]","isConversational":false}}},{"rowIdx":995,"cells":{"group_id":{"kind":"string","value":"aoj_1623_cpp"},"problem_description":{"kind":"string","value":"Equivalent Deformation\nTwo triangles\nT\n1\nand\nT\n2\nwith the same area are on a plane.\nYour task is to perform the following operation to\nT\n1\nseveral times so that it is exactly superposed on\nT\n2\n.\nHere, vertices of\nT\n1\ncan be on any of the vertices of\nT\n2\n.\nCompute the minimum number of operations required to superpose\nT\n1\non\nT\n2\n.\n(Operation): Choose one vertex of the triangle and move it to an arbitrary point on a line passing through the vertex and parallel to the opposite side.\nAn operation example\nThe following figure shows a possible sequence of the operations for the first dataset of the sample input.\nInput\nThe input consists of at most 2000 datasets, each in the following format.\nx\n11\ny\n11\nx\n12\ny\n12\nx\n13\ny\n13\nx\n21\ny\n21\nx\n22\ny\n22\nx\n23\ny\n23\nx\nij\nand\ny\nij\nare the\nx-\nand\ny-\ncoordinate of the\nj\n-th vertex of\nT\ni\n.\nThe following holds for the dataset.\nAll the coordinate values are integers with at most 1000 of absolute values.\nT\n1\nand\nT\n2\nhave the same positive area size.\nThe given six vertices are all distinct points.\nAn empty line is placed between datasets.\nThe end of the input is indicated by EOF.\nOutput\nFor each dataset, output the minimum number of operations required in one line.\nIf five or more operations are required, output\nMany\ninstead.\nNote that, vertices may have non-integral values after they are moved.\nYou can prove that, for any input satisfying the above constraints, the number of operations required is bounded by some constant.\nSample Input\n0 1\n2 2\n1 0\n1 3\n5 2\n4 3\n\n0 0\n0 1\n1 0\n0 3\n0 2\n1 -1\n\n-5 -4\n0 1\n0 15\n-10 14\n-5 10\n0 -8\n\n-110 221\n-731 525\n-555 -258\n511 -83\n-1000 -737\n66 -562\n\n533 -45\n-525 -450\n-282 -667\n-439 823\n-196 606\n-768 -233\n\n0 0\n0 1\n1 0\n99 1\n100 1\n55 2\n\n354 -289\n89 -79\n256 -166\n131 -196\n-774 -809\n-519 -623\n\n-990 688\n-38 601\n-360 712\n384 759\n-241 140\n-59 196\n\n629 -591\n360 -847\n936 -265\n109 -990\n-456 -913\n-787 -884\n\n-1000 -1000\n-999 -999\n-1000 -998\n1000 1000\n999 999\n1000 998\n\n-386 -83\n404 -83\n-408 -117\n-162 -348\n128 -88\n296 -30\n\n-521 -245\n-613 -250\n797 451\n-642 239\n646 309\n-907 180\n\n-909 -544\n-394 10\n-296 260\n-833 268\n-875 882\n-907 -423\nOutput for the Sample Input\n4\n3\n3\n3\n3\n4\n4\n4\n4\nMany\nMany\nMany\nMany"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1623_9769018","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\nusing T = double;\nconst T eps = 1e-6;\nusing Point = complex<T>;\nusing Poly = vector<Point>;\n#define X real()\n#define Y imag()\ntemplate <typename T> inline bool eq(const T &a, const T &b) {\n return fabs(a - b) < eps;\n}\nbool cmp(const Point &a, const Point &b) {\n auto sub = [&](Point a) {\n return (a.Y < 0 ? -1 : (a.Y == 0 && a.X >= 0 ? 0 : 1));\n };\n if (sub(a) != sub(b))\n return sub(a) < sub(b);\n return a.Y * b.X < a.X * b.Y;\n}\nstruct Line {\n Point a, b, dir;\n Line() {}\n Line(Point _a, Point _b) : a(_a), b(_b), dir(b - a) {}\n Line(T A, T B, T C) {\n if (eq(A, .0)) {\n a = Point(0, C / B), b = Point(1 / C / B);\n } else if (eq(B, .0)) {\n a = Point(C / A, 0), b = Point(C / A, 1);\n } else {\n a = Point(0, C / B), b = Point(C / A, 0);\n }\n }\n};\nstruct Segment : Line {\n Segment() {}\n Segment(Point _a, Point _b) : Line(_a, _b) {}\n};\nstruct Circle {\n Point p;\n T r;\n Circle() {}\n Circle(Point _p, T _r) : p(_p), r(_r) {}\n};\n\nistream &operator>>(istream &is, Point &p) {\n T x, y;\n is >> x >> y;\n p = Point(x, y);\n return is;\n}\nostream &operator<<(ostream &os, Point &p) {\n os << fixed << setprecision(12) << p.X << ' ' << p.Y;\n return os;\n}\nPoint unit(const Point &a) {\n return a / abs(a);\n}\nT dot(const Point &a, const Point &b) {\n return a.X * b.X + a.Y * b.Y;\n}\nT cross(const Point &a, const Point &b) {\n return a.X * b.Y - a.Y * b.X;\n}\nPoint rot(const Point &a, const T &theta) {\n return Point(cos(theta) * a.X - sin(theta) * a.Y,\n sin(theta) * a.X + cos(theta) * a.Y);\n}\nPoint rot90(const Point &a) {\n return Point(-a.Y, a.X);\n}\nT arg(const Point &a, const Point &b, const Point &c) {\n double ret = acos(dot(a - b, c - b) / abs(a - b) / abs(c - b));\n if (cross(a - b, c - b) < 0)\n ret = -ret;\n return ret;\n}\n\nPoint Projection(const Line &l, const Point &p) {\n T t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n return l.a + (l.a - l.b) * t;\n}\nPoint Projection(const Segment &l, const Point &p) {\n T t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n return l.a + (l.a - l.b) * t;\n}\nPoint Reflection(const Line &l, const Point &p) {\n return p + (Projection(l, p) - p) * 2.;\n}\nint ccw(const Point &a, Point b, Point c) {\n b -= a;\n c -= a;\n if (cross(b, c) > eps)\n return 1; // ccw\n\n if (cross(b, c) < -eps)\n return -1; // cw\n\n if (dot(b, c) < 0)\n return 2; // c,a,b\n\n if (norm(b) < norm(c))\n return -2; // a,b,c\n\n return 0; // a,c,b\n\n}\nbool isOrthogonal(const Line &a, const Line &b) {\n return eq(dot(a.b - a.a, b.b - b.a), .0);\n}\nbool isParallel(const Line &a, const Line &b) {\n return eq(cross(a.b - a.a, b.b - b.a), .0);\n}\nbool isIntersect(const Segment &a, const Segment &b) {\n return ccw(a.a, a.b, b.a) * ccw(a.a, a.b, b.b) <= 0 and\n ccw(b.a, b.b, a.a) * ccw(b.a, b.b, a.b) <= 0;\n}\nint isIntersect(const Circle &a, const Circle &b) {\n T d = abs(a.p - b.p);\n if (d > a.r + b.r + eps)\n return 4;\n if (eq(d, a.r + b.r))\n return 3;\n if (eq(d, abs(a.r - b.r)))\n return 1;\n if (d < abs(a.r - b.r) - eps)\n return 0;\n return 2;\n}\nT Dist(const Line &a, const Point &b) {\n Point c = Projection(a, b);\n return abs(c - b);\n}\nT Dist(const Segment &a, const Point &b) {\n if (dot(a.b - a.a, b - a.a) < eps)\n return abs(b - a.a);\n if (dot(a.a - a.b, b - a.b) < eps)\n return abs(b - a.b);\n return abs(cross(a.b - a.a, b - a.a)) / abs(a.b - a.a);\n}\nT Dist(const Segment &a, const Segment &b) {\n if (isIntersect(a, b))\n return .0;\n T res = min({Dist(a, b.a), Dist(a, b.b), Dist(b, a.a), Dist(b, a.b)});\n return res;\n}\nPoint Intersection(const Line &a, const Line &b) {\n T d1 = cross(a.b - a.a, b.b - b.a);\n T d2 = cross(a.b - a.a, a.b - b.a);\n if (eq(d1, 0.) and eq(d2, 0.))\n return b.a;\n return b.a + (b.b - b.a) * (d2 / d1);\n}\nPoly Intersection(const Circle &a, const Line &b) {\n Poly res;\n T d = Dist(b, a.p);\n if (d > a.r + eps)\n return res;\n Point h = Projection(b, a.p);\n if (eq(d, a.r)) {\n res.push_back(h);\n return res;\n }\n Point e = unit(b.b - b.a);\n T ph = sqrt(a.r * a.r - d * d);\n res.push_back(h - e * ph);\n res.push_back(h + e * ph);\n return res;\n}\nPoly Intersection(const Circle &a, const Segment &b) {\n Line c(b.a, b.b);\n Poly sub = Intersection(a, c);\n double xmi = min(b.a.X, b.b.X), xma = max(b.a.X, b.b.X);\n double ymi = min(b.a.Y, b.b.Y), yma = max(b.a.Y, b.b.Y);\n Poly res;\n rep(i, 0, sub.size()) {\n if (xmi <= sub[i].X + eps and sub[i].X - eps <= xma and\n ymi <= sub[i].Y + eps and sub[i].Y - eps <= yma) {\n res.push_back(sub[i]);\n }\n }\n return res;\n}\nPoly Intersection(const Circle &a, const Circle &b) {\n Poly res;\n int mode = isIntersect(a, b);\n T d = abs(a.p - b.p);\n if (mode == 4 or mode == 0)\n return res;\n if (mode == 3) {\n T t = a.r / (a.r + b.r);\n res.push_back(a.p + (b.p - a.p) * t);\n return res;\n }\n if (mode == 1) {\n if (b.r < a.r - eps) {\n res.push_back(a.p + (b.p - a.p) * (a.r / d));\n } else {\n res.push_back(b.p + (a.p - b.p) * (b.r / d));\n }\n return res;\n }\n T rc = (a.r * a.r + d * d - b.r * b.r) / d / 2.;\n T rs = sqrt(a.r * a.r - rc * rc);\n if (a.r - abs(rc) < eps)\n rs = 0;\n Point e = unit(b.p - a.p);\n res.push_back(a.p + rc * e + rs * e * Point(0, 1));\n res.push_back(a.p + rc * e + rs * e * Point(0, -1));\n return res;\n}\nPoly HalfplaneIntersection(vector<Line> &H) {\n sort(ALL(H), [&](Line &l1, Line &l2) { return cmp(l1.dir, l2.dir); });\n auto outside = [&](Line &L, Point p) -> bool {\n return cross(L.dir, p - L.a) < -eps;\n };\n deque<Line> deq;\n int sz = 0;\n rep(i, 0, SZ(H)) {\n while (sz > 1 and\n outside(H[i], Intersection(deq[sz - 1], deq[sz - 2]))) {\n deq.pop_back();\n sz--;\n }\n while (sz > 1 and outside(H[i], Intersection(deq[0], deq[1]))) {\n deq.pop_front();\n sz--;\n }\n if (sz > 0 and fabs(cross(H[i].dir, deq[sz - 1].dir)) < eps) {\n if (dot(H[i].dir, deq[sz - 1].dir) < 0) {\n return {};\n }\n if (outside(H[i], deq[sz - 1].a)) {\n deq.pop_back();\n sz--;\n } else\n continue;\n }\n deq.push_back(H[i]);\n sz++;\n }\n\n while (sz > 2 and outside(deq[0], Intersection(deq[sz - 1], deq[sz - 2]))) {\n deq.pop_back();\n sz--;\n }\n while (sz > 2 and outside(deq[sz - 1], Intersection(deq[0], deq[1]))) {\n deq.pop_front();\n sz--;\n }\n if (sz < 3)\n return {};\n deq.push_back(deq.front());\n Poly ret;\n rep(i, 0, sz) ret.push_back(Intersection(deq[i], deq[i + 1]));\n return ret;\n}\n\nT Area(const Poly &a) {\n T res = 0;\n int n = a.size();\n rep(i, 0, n) res += cross(a[i], a[(i + 1) % n]);\n return fabs(res / 2.);\n}\nT Area(const Poly &a, const Circle &b) {\n int n = a.size();\n if (n < 3)\n return .0;\n auto rec = [&](auto self, const Circle &c, const Point &p1,\n const Point &p2) {\n Point va = c.p - p1, vb = c.p - p2;\n T f = cross(va, vb), res = .0;\n if (eq(f, .0))\n return res;\n if (max(abs(va), abs(vb)) < c.r + eps)\n return f;\n if (Dist(Segment(p1, p2), c.p) > c.r - eps)\n return c.r * c.r * arg(vb * conj(va));\n auto u = Intersection(c, Segment(p1, p2));\n Poly sub;\n sub.push_back(p1);\n for (auto &x : u)\n sub.push_back(x);\n sub.push_back(p2);\n rep(i, 0, sub.size() - 1) res += self(self, c, sub[i], sub[i + 1]);\n return res;\n };\n T res = .0;\n rep(i, 0, n) res += rec(rec, b, a[i], a[(i + 1) % n]);\n return fabs(res / 2.);\n}\nT Area(const Circle &a, const Circle &b) {\n T d = abs(a.p - b.p);\n if (d >= a.r + b.r - eps)\n return .0;\n if (d <= abs(a.r - b.r) + eps) {\n T r = min(a.r, b.r);\n return M_PI * r * r;\n }\n T ath = acos((a.r * a.r + d * d - b.r * b.r) / d / a.r / 2.);\n T res = a.r * a.r * (ath - sin(ath * 2) / 2.);\n T bth = acos((b.r * b.r + d * d - a.r * a.r) / d / b.r / 2.);\n res += b.r * b.r * (bth - sin(bth * 2) / 2.);\n return fabs(res);\n}\nbool isConvex(const Poly &a) {\n int n = a.size();\n int cur, pre, nxt;\n rep(i, 0, n) {\n pre = (i - 1 + n) % n;\n nxt = (i + 1) % n;\n cur = i;\n if (ccw(a[pre], a[cur], a[nxt]) == -1)\n return 0;\n }\n return 1;\n}\nint isContained(const Poly &a,\n const Point &b) { // 0:not contain,1:on edge,2:contain\n\n bool res = 0;\n int n = a.size();\n rep(i, 0, n) {\n Point p = a[i] - b, q = a[(i + 1) % n] - b;\n if (p.Y > q.Y)\n swap(p, q);\n if (p.Y < eps and eps < q.Y and cross(p, q) > eps)\n res ^= 1;\n if (eq(cross(p, q), .0) and dot(p, q) < eps)\n return 1;\n }\n return (res ? 2 : 0);\n}\nPoly ConvexHull(Poly &a) {\n sort(ALL(a), [](const Point &p, const Point &q) {\n return (eq(p.Y, q.Y) ? p.X < q.X : p.Y < q.Y);\n });\n a.erase(unique(ALL(a)), a.end());\n int n = a.size(), k = 0;\n Poly res(n * 2);\n for (int i = 0; i < n; res[k++] = a[i++]) {\n while (k >= 2 and\n cross(res[k - 1] - res[k - 2], a[i] - res[k - 1]) < eps)\n k--;\n }\n for (int i = n - 2, t = k + 1; i >= 0; res[k++] = a[i--]) {\n while (k >= t and\n cross(res[k - 1] - res[k - 2], a[i] - res[k - 1]) < eps)\n k--;\n }\n res.resize(k - 1);\n return res;\n}\nT Diam(const Poly &a) {\n int n = a.size();\n int x = 0, y = 0;\n rep(i, 1, n) {\n if (a[i].Y > a[x].Y)\n x = i;\n if (a[i].Y < a[y].Y)\n y = i;\n }\n T res = abs(a[x] - a[y]);\n int i = x, j = y;\n do {\n if (cross(a[(i + 1) % n] - a[i], a[(j + 1) % n] - a[j]) < 0)\n i = (i + 1) % n;\n else\n j = (j + 1) % n;\n chmax(res, abs(a[i] - a[j]));\n } while (i != x or j != y);\n return res;\n}\nPoly Cut(const Poly &a, const Line &l) {\n int n = a.size();\n Poly res;\n rep(i, 0, n) {\n Point p = a[i], q = a[(i + 1) % n];\n if (ccw(l.a, l.b, p) != -1)\n res.push_back(p);\n if (ccw(l.a, l.b, p) * ccw(l.a, l.b, q) < 0)\n res.push_back(Intersection(Line(p, q), l));\n }\n return res;\n}\n\nT Closest(Poly &a) {\n int n = a.size();\n if (n <= 1)\n return 0;\n sort(ALL(a), [&](Point a, Point b) {\n return (eq(a.X, b.X) ? a.Y < b.Y : a.X < b.X);\n });\n Poly buf(n);\n auto rec = [&](auto self, int lb, int rb) -> T {\n if (rb - lb <= 1)\n return (T)INF;\n int mid = (lb + rb) >> 1;\n auto x = a[mid].X;\n T res = min(self(self, lb, mid), self(self, mid, rb));\n inplace_merge(a.begin() + lb, a.begin() + mid, a.begin() + rb,\n [&](auto p, auto q) { return p.Y < q.Y; });\n int ptr = 0;\n rep(i, lb, rb) {\n if (abs(a[i].X - x) >= res)\n continue;\n rep(j, 0, ptr) {\n auto sub = a[i] - buf[ptr - 1 - j];\n if (sub.Y >= res)\n break;\n chmin(res, abs(sub));\n }\n buf[ptr++] = a[i];\n }\n return res;\n };\n return rec(rec, 0, n);\n}\n\nCircle Incircle(const Point &a, const Point &b, const Point &c) {\n T A = abs(b - c), B = abs(c - a), C = abs(a - b);\n Point p(A * a.X + B * b.X + C * c.X, A * a.Y + B * b.Y + C * c.Y);\n p /= (A + B + C);\n T r = Dist(Line(a, b), p);\n return Circle(p, r);\n}\nCircle Circumcircle(const Point &a, const Point &b, const Point &c) {\n Line l1((a + b) / 2., (a + b) / 2. + (b - a) * Point(0, 1));\n Line l2((b + c) / 2., (b + c) / 2. + (c - b) * Point(0, 1));\n Point p = Intersection(l1, l2);\n return Circle(p, abs(p - a));\n}\nPoly tangent(const Point &a, const Circle &b) {\n return Intersection(b, Circle(a, sqrt(norm(b.p - a) - b.r * b.r)));\n}\nvector<Line> tangent(const Circle &a, const Circle &b) {\n vector<Line> res;\n T d = abs(a.p - b.p);\n if (eq(d, 0.))\n return res;\n Point u = unit(b.p - a.p);\n Point v = u * Point(0, 1);\n for (int t : {-1, 1}) {\n T h = (a.r + b.r * t) / d;\n if (eq(h * h, 1.)) {\n res.push_back(Line(a.p + (h > 0 ? u : -u) * a.r,\n a.p + (h > 0 ? u : -u) * a.r + v));\n } else if (1 > h * h) {\n Point U = u * h, V = v * sqrt(1 - h * h);\n res.push_back(Line(a.p + (U + V) * a.r, b.p - (U + V) * (b.r * t)));\n res.push_back(Line(a.p + (U - V) * a.r, b.p - (U - V) * (b.r * t)));\n }\n }\n return res;\n}\n\n/**\n * @brief Geometry\n */\n\nint main() {\n Point P[2][3];\n double x,y;\nwhile(cin >> x >> y) {\n P[0][0] = Point(x,y);\n rep(i,0,2) {\n rep(j,0,3) {\n if (i == 0 && j == 0) continue;\n cin >> x >> y;\n P[i][j] = Point(x,y);\n }\n }\n auto DFS = [&](auto self, vector<Point> match, vector<Point> tmp, int id, int Dep) -> int {\n if (Dep >= 5) return 5;\n if (id == 3) {\n rep(i,0,3) {\n if (!eq(tmp[i],match[i])) return 5;\n }\n return Dep;\n }\n int Ret = 5;\n Point P1 = tmp[id], P2 = tmp[(id+1)%3], P3 = tmp[(id+2)%3];\n Point Q = match[id];\n if (isParallel(Line(P1,Q),Line(P2,P3))) {\n vector<Point> next = tmp;\n next[id] = Q;\n chmin(Ret,self(self,match,next,id+1,Dep+1));\n }\n else {\n {\n vector<Point> next = tmp;\n next[id] = Q;\n next[(id+1)%3] = Intersection(Line(P2,P2+P3-P1),Line(P3,P3+P1-Q));\n chmin(Ret,self(self,match,next,id+1,Dep+2));\n }\n {\n vector<Point> next = tmp;\n next[id] = Q;\n next[(id+2)%3] = Intersection(Line(P3,P3+P2-P1),Line(P2,P2+P1-Q));\n chmin(Ret,self(self,match,next,id+1,Dep+2));\n }\n }\n return Ret;\n };\n int ANS = 5;\n vector<int> ord1(3);\n iota(ALL(ord1),0);\n do {\n vector<int> ord2(3);\n iota(ALL(ord2),0);\n do {\n vector<Point> match(3);\n rep(i,0,3) match[i] = P[0][ord1[i]];\n vector<Point> tmp(3);\n rep(i,0,3) tmp[i] = P[1][ord2[i]];\n chmin(ANS, DFS(DFS,match,tmp,0,0));\n } while(next_permutation(ALL(ord2)));\n } while(next_permutation(ALL(ord1)));\n if (ANS == 5) cout << \"Many\" << endl;\n else cout << ANS << endl;\n}\n}","accuracy":1,"time_ms":50,"memory_kb":3488,"score_of_the_acc":-0.8721,"final_rank":12},{"submission_id":"aoj_1623_9283785","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing P = pair<ll, ll>;\n#define rep(i, a, b) for(ll i = a; i < b; ++i)\n#define rrep(i, a, b) for(ll i = a; i >= b; --i)\nconstexpr ll inf = 4e18;\nusing Real = long double;\nconst Real EPS = 1e-8, PI = acos(Real(-1.0));\nint sign(const Real& r) {\n if(r <= -EPS) return -1;\n if(r >= +EPS) return +1;\n return 0;\n}\nbool eq(const Real& a, const Real& b) {\n return sign(a - b) == 0;\n}\nusing Point = complex<Real>;\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, const Point& p) {\n return os << p.real() << ' ' << p.imag();\n}\nReal dot(const Point& p1, const Point& p2) {\n return (conj(p1) * p2).real();\n}\nReal cross(const Point& p1, const Point& p2) {\n return (conj(p1) * p2).imag();\n}\nint ccw(const Point& a, Point b, Point c) {\n b -= a;\n c -= a;\n if(sign(cross(b, c)) == 1) return 1;\n if(sign(cross(b, c)) == -1) return -1;\n if(sign(dot(b, c)) == -1) return +2;\n if(norm(b) < norm(c)) return -2;\n return 0;\n}\nstruct Line {\n Point a, b;\n Line() = default;\n Line(const Point& a, const Point& b)\n : a(a), b(b) {}\n};\nusing Segment = Line;\nbool is_parallel(const Line& a, const Line& b) {\n return eq(cross(a.b - a.a, b.b - b.a), 0.0);\n}\nbool is_intersect_ll(const Line& l1, const Line& l2) {\n if(!eq(cross(l1.b - l1.a, l2.b - l2.a), 0.0)) return true;\n return eq(cross(l1.b - l1.a, l2.b - l1.a), 0.0);\n}\nvector<Point> intersection_ll(const Line& l1, const Line& l2) {\n vector<Point> res;\n if(!is_intersect_ll(l1, l2)) return res;\n Real a = cross(l1.b - l1.a, l2.b - l2.a);\n Real b = cross(l1.b - l1.a, l1.b - l2.a);\n if(eq(a, 0.0) and eq(b, 0.0)) {\n res.push_back(l2.a);\n } else {\n res.push_back(l2.a + (l2.b - l2.a) * b / a);\n }\n return res;\n}\nint main(void) {\n cin.tie(0);\n ios::sync_with_stdio(0);\n vector<Point> p1(3), p2(3);\n while(cin >> p1[0]) {\n rep(i, 1, 3) cin >> p1[i];\n rep(i, 0, 3) cin >> p2[i];\n auto is_three = [&](vector<Point> t1, vector<Point> t2, vector<int> ord) -> bool {\n rep(i, 0, 3) {\n Line l1 = Line(t1[ord[i]], t2[ord[i]]);\n Line l2 = Line(t1[ord[(i + 1) % 3]], t1[ord[(i + 2) % 3]]);\n if(!is_parallel(l1, l2)) return false;\n t1[ord[i]] = t2[ord[i]];\n }\n return true;\n };\n auto is_four = [&](vector<Point> t1, vector<Point> t2, vector<int> ord) -> bool {\n Line l1 = Line(t1[ord[0]], t2[ord[0]]);\n Line l2 = Line(t1[ord[1]], t1[ord[2]]);\n if(is_parallel(l1, l2)) {\n vector<Point> t3 = t1;\n t3[ord[0]] = t2[ord[0]];\n\n Point dir1 = t3[ord[1]] - t2[ord[1]];\n Line l3 = Line(t3[ord[0]], t3[ord[0]] + dir1);\n Point dir2 = t3[ord[0]] - t3[ord[1]];\n Line l4 = Line(t3[ord[2]], t3[ord[2]] + dir2);\n if(is_intersect_ll(l3, l4)) return true;\n\n return false;\n }\n\n Point dir1 = t1[ord[0]] - t1[ord[2]];\n Line l3 = Line(t1[ord[1]], t1[ord[1]] + dir1);\n Point dir2 = t1[ord[0]] - t2[ord[0]];\n Line l4 = Line(t1[ord[2]], t1[ord[2]] + dir2);\n vector<Point> cand1 = intersection_ll(l3, l4);\n if(!cand1.empty()) {\n vector<Point> t3 = t1;\n t3[ord[1]] = cand1[0];\n vector<int> ord2(3);\n rep(i, 0, 3) ord2[i] = i;\n do {\n if(is_three(t3, t2, ord2)) return true;\n } while(next_permutation(ord2.begin(), ord2.end()));\n }\n\n Point dir3 = t1[ord[0]] - t1[ord[1]];\n Line l5 = Line(t1[ord[2]], t1[ord[2]] + dir3);\n Point dir4 = t1[ord[0]] - t2[ord[0]];\n Line l6 = Line(t1[ord[1]], t1[ord[1]] + dir4);\n vector<Point> cand2 = intersection_ll(l5, l6);\n if(!cand2.empty()) {\n vector<Point> t3 = t1;\n t3[ord[2]] = cand2[0];\n vector<int> ord2(3);\n rep(i, 0, 3) ord2[i] = i;\n do {\n if(is_three(t3, t2, ord2)) return true;\n } while(next_permutation(ord2.begin(), ord2.end()));\n }\n\n return false;\n };\n vector<int> perm(3);\n rep(i, 0, 3) perm[i] = i;\n int ans = 5;\n do {\n vector<Point> t2 = p2;\n vector<Point> t1(3);\n rep(i, 0, 3) {\n t1[i] = p1[perm[i]];\n }\n if(ccw(t1[0], t1[1], t1[2]) != ccw(t2[0], t2[1], t2[2])) continue;\n vector<int> ord(3);\n rep(i, 0, 3) ord[i] = i;\n do {\n if(is_three(t1, t2, ord)) ans = min(ans, 3);\n if(is_four(t1, t2, ord)) ans = min(ans, 4);\n } while(next_permutation(ord.begin(), ord.end()));\n } while(next_permutation(perm.begin(), perm.end()));\n if(ans == 5) {\n cout << \"Many\" << '\\n';\n } else {\n cout << ans << '\\n';\n }\n }\n}","accuracy":1,"time_ms":40,"memory_kb":3544,"score_of_the_acc":-1.0041,"final_rank":17},{"submission_id":"aoj_1623_9283770","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing P = pair<ll, ll>;\n#define rep(i, a, b) for(ll i = a; i < b; ++i)\n#define rrep(i, a, b) for(ll i = a; i >= b; --i)\nconstexpr ll inf = 4e18;\nusing Real = long double;\nconst Real EPS = 1e-8, PI = acos(Real(-1.0));\nint sign(const Real& r) {\n if(r <= -EPS) return -1;\n if(r >= +EPS) return +1;\n return 0;\n}\nbool eq(const Real& a, const Real& b) {\n return sign(a - b) == 0;\n}\nusing Point = complex<Real>;\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, const Point& p) {\n return os << p.real() << ' ' << p.imag();\n}\nReal dot(const Point& p1, const Point& p2) {\n return (conj(p1) * p2).real();\n}\nReal cross(const Point& p1, const Point& p2) {\n return (conj(p1) * p2).imag();\n}\nint ccw(const Point& a, Point b, Point c) {\n b -= a;\n c -= a;\n if(sign(cross(b, c)) == 1) return 1;\n if(sign(cross(b, c)) == -1) return -1;\n if(sign(dot(b, c)) == -1) return +2;\n if(norm(b) < norm(c)) return -2;\n return 0;\n}\nstruct Line {\n Point a, b;\n Line() = default;\n Line(const Point& a, const Point& b)\n : a(a), b(b) {}\n};\nusing Segment = Line;\nbool is_parallel(const Line& a, const Line& b) {\n return eq(cross(a.b - a.a, b.b - b.a), 0.0);\n}\nbool is_intersect_ll(const Line& l1, const Line& l2) {\n if(!eq(cross(l1.b - l1.a, l2.b - l2.a), 0.0)) return true;\n return eq(cross(l1.b - l1.a, l2.b - l1.a), 0.0);\n}\nvector<Point> intersection_ll(const Line& l1, const Line& l2) {\n vector<Point> res;\n if(!is_intersect_ll(l1, l2)) return res;\n Real a = cross(l1.b - l1.a, l2.b - l2.a);\n Real b = cross(l1.b - l1.a, l1.b - l2.a);\n if(eq(a, 0.0) and eq(b, 0.0)) {\n res.push_back(l2.a);\n } else {\n res.push_back(l2.a + (l2.b - l2.a) * b / a);\n }\n return res;\n}\nint main(void) {\n cin.tie(0);\n ios::sync_with_stdio(0);\n while(1) {\n vector<Point> p1(3), p2(3);\n rep(i, 0, 3) cin >> p1[i];\n if(cin.eof()) break;\n rep(i, 0, 3) cin >> p2[i];\n if(cin.eof()) break;\n auto is_three = [&](vector<Point> t1, vector<Point> t2, vector<int> ord) -> bool {\n rep(i, 0, 3) {\n Line l1 = Line(t1[ord[i]], t2[ord[i]]);\n Line l2 = Line(t1[ord[(i + 1) % 3]], t1[ord[(i + 2) % 3]]);\n if(!is_parallel(l1, l2)) return false;\n t1[ord[i]] = t2[ord[i]];\n }\n return true;\n };\n auto is_four = [&](vector<Point> t1, vector<Point> t2, vector<int> ord) -> bool {\n Line l1 = Line(t1[ord[0]], t2[ord[0]]);\n Line l2 = Line(t1[ord[1]], t1[ord[2]]);\n if(is_parallel(l1, l2)) {\n vector<Point> t3 = t1;\n t3[ord[0]] = t2[ord[0]];\n\n Point dir1 = t3[ord[1]] - t2[ord[1]];\n Line l3 = Line(t3[ord[0]], t3[ord[0]] + dir1);\n Point dir2 = t3[ord[0]] - t3[ord[1]];\n Line l4 = Line(t3[ord[2]], t3[ord[2]] + dir2);\n if(is_intersect_ll(l3, l4)) return true;\n\n return false;\n }\n\n Point dir1 = t1[ord[0]] - t1[ord[2]];\n Line l3 = Line(t1[ord[1]], t1[ord[1]] + dir1);\n Point dir2 = t1[ord[0]] - t2[ord[0]];\n Line l4 = Line(t1[ord[2]], t1[ord[2]] + dir2);\n vector<Point> cand1 = intersection_ll(l3, l4);\n if(!cand1.empty()) {\n vector<Point> t3 = t1;\n t3[ord[1]] = cand1[0];\n vector<int> ord2(3);\n rep(i, 0, 3) ord2[i] = i;\n do {\n if(is_three(t3, t2, ord2)) return true;\n } while(next_permutation(ord2.begin(), ord2.end()));\n }\n\n Point dir3 = t1[ord[0]] - t1[ord[1]];\n Line l5 = Line(t1[ord[2]], t1[ord[2]] + dir3);\n Point dir4 = t1[ord[0]] - t2[ord[0]];\n Line l6 = Line(t1[ord[1]], t1[ord[1]] + dir4);\n vector<Point> cand2 = intersection_ll(l5, l6);\n if(!cand2.empty()) {\n vector<Point> t3 = t1;\n t3[ord[2]] = cand2[0];\n vector<int> ord2(3);\n rep(i, 0, 3) ord2[i] = i;\n do {\n if(is_three(t3, t2, ord2)) return true;\n } while(next_permutation(ord2.begin(), ord2.end()));\n }\n\n return false;\n };\n vector<int> perm(3);\n rep(i, 0, 3) perm[i] = i;\n int ans = 5;\n do {\n vector<Point> t2 = p2;\n vector<Point> t1(3);\n rep(i, 0, 3) {\n t1[i] = p1[perm[i]];\n }\n if(ccw(t1[0], t1[1], t1[2]) != ccw(t2[0], t2[1], t2[2])) continue;\n vector<int> ord(3);\n rep(i, 0, 3) ord[i] = i;\n do {\n if(is_three(t1, t2, ord)) ans = min(ans, 3);\n if(is_four(t1, t2, ord)) ans = min(ans, 4);\n } while(next_permutation(ord.begin(), ord.end()));\n } while(next_permutation(perm.begin(), perm.end()));\n if(ans == 5) {\n cout << \"Many\";\n } else {\n cout << ans;\n }\n if(cin.eof()) break;\n cout << '\\n';\n }\n}","accuracy":1,"time_ms":40,"memory_kb":3424,"score_of_the_acc":-0.7184,"final_rank":4},{"submission_id":"aoj_1623_9282361","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vll = vector<ll>;\n#define all(A) A.begin(),A.end()\n#define rep(i, n) for (int i = 0; i < (int) (n); i++)\n\nbool OK = 1;\nbool is_diff(vll& PX, vll& PY, vll& QX, vll& QY, ll a, ll b, bool DIFF) {\n ll dx = PX[(a + 1) % 3] - PX[(a + 2) % 3];\n ll dy = PY[(a + 1) % 3] - PY[(a + 2) % 3];\n\n ll DX = PX[a] - QX[b];\n ll DY = PY[a] - QY[b];\n\n ll g = gcd(dx, dy);\n dx /= g;\n dy /= g;\n if (dx < 0) {\n dx *= -1;\n dy *= -1;\n }\n if (dx == 0 && dy <= 0)dy *= -1;\n\n ll G = gcd(DX, DY);\n DX /= G;\n DY /= G;\n if (DX < 0) {\n DX *= -1;\n DY *= -1;\n }\n if (DX == 0 && DY < 0)DY *= -1;\n if (dx == DX && dy == DY) {\n PX[a] = QX[b];\n PY[a] = QY[b];\n return 0;\n }\n\n\n\n\n if (DIFF)return 1;\n DX = QX[(b + 1) % 3] - QX[(b + 2) % 3];\n DY = QY[(b + 1) % 3] - QY[(b + 2) % 3];\n\n G = gcd(DX, DY);\n DX /= G;\n DY /= G;\n if (DX < 0) {\n DX *= -1;\n DY *= -1;\n }\n if (DX == 0 && DY < 0)DY *= -1;\n if (dx == DX && dy == DY) {\n OK = 0;\n return 1;\n }\n\n\n\n\n ll RHS = dy * DX - dx * DY;\n ll LHS = dy * DX * PX[a] - dx * DX * PY[a] - DY * dx * QX[b] + dx * DX * QY[b];\n ll GHS = gcd(RHS, LHS);\n RHS /= GHS;\n LHS /= GHS;\n // if (RHS < 0) {\n // RHS *= -1;\n // LHS *= -1;\n // }\n //nx=LHS/RHS\n //ny=dy/dx*(nx-PX[a])+PY[a]\n //ny=DY/DX*(nx-QX[b])+QY[b]\n if (dx != 0) {\n rep(i, 3) {\n if (i != a) {\n PX[i] *= (RHS * dx);\n PY[i] *= (RHS * dx);\n }\n if (i != b) {\n QX[i] *= (RHS * dx);\n QY[i] *= (RHS * dx);\n }\n }\n ll u = PX[a];\n ll v = PY[a];\n PX[a] = QX[b] = LHS * dx;\n //DY*(LHS-u*RHS)+v*DX*RHS;\n PY[a] = QY[b] = dy * (LHS - u * RHS) + v * dx * RHS;\n }\n else {\n rep(i, 3) {\n if (i != a) {\n PX[i] *= (RHS * DX);\n PY[i] *= (RHS * DX);\n }\n if (i != b) {\n QX[i] *= (RHS * DX);\n QY[i] *= (RHS * DX);\n }\n }\n //ny=DY/DX*(nx-QX[b])+QY[b]\n ll u = QX[b];\n ll v = QY[b];\n PX[a] = QX[b] = LHS * DX;\n PY[a] = QY[b] = DY * (LHS - u * RHS) + v * DX * RHS;\n }\n return 1;\n}\n\nbool eq(vll& PX, vll& PY, vll& QX, vll& QY) {\n vector<pair<ll, ll>> P(3), Q(3);\n rep(i, 3) {\n P[i] = { PX[i],PY[i] };\n Q[i] = { QX[i],QY[i] };\n }\n sort(all(P));\n sort(all(Q));\n return P == Q;\n}\n\nint main() {\n\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n\n\n vector<ll> X(6), Y(6);\n while (cin >> X[0] >> Y[0]) {\n rep(i, 5)cin >> X[i + 1] >> Y[i + 1];\n\n ll an = 5;\n\n rep(uu,2){\n rep(aa, 9)rep(bb, 9)rep(cc, 9)rep(dd, 9) {\n if (aa / 3 == bb / 3 || bb / 3 == cc / 3 || dd / 3 == cc / 3)continue;\n vector<ll> PX, PY, QX, QY;\n rep(i, 3) {\n PX.push_back(X[i]);\n PY.push_back(Y[i]);\n QX.push_back(X[i + 3]);\n QY.push_back(Y[i + 3]);\n }\n bool DIFF = 0;\n vll MV = { aa,bb,cc,dd };\n rep(p, 4) {\n if (aa == 0 && bb == 3 && cc <= 16) {\n cout << \"\";\n }\n if (!eq(PX, PY, QX, QY)) {\n ll a = MV[p] / 3;\n ll b = MV[p] % 3;\n OK = 1;\n if (PX[a] != QX[b] || PY[a] != QY[b]) {\n bool dif = is_diff(PX, PY, QX, QY, a, b, DIFF);\n if (DIFF && dif)OK = 0;\n if (dif)DIFF = 1;\n if (!OK) {\n continue;\n }\n }\n }\n }\n\n if (eq(PX, PY, QX, QY)) {\n // if (!DIFF)cout << aa << \" \" << bb << \" \" << cc << \" \" << dd << endl;\n if (!DIFF)an = min(an, 3ll);\n else an = min(an, 4ll);\n }\n\n }\n rep(i,3){\n swap(X[i],X[i+3]);\n swap(Y[i],Y[i+3]);\n }\n\n }\n if (an > 4)cout << \"Many\" << endl;\n else cout << an << endl;\n\n }\n\n\n\n}","accuracy":1,"time_ms":7370,"memory_kb":3460,"score_of_the_acc":-1.8,"final_rank":20},{"submission_id":"aoj_1623_9072252","code_snippet":"#line 2 \"cp-library/src/cp-template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nusing i32 = int;\nusing u32 = unsigned int;\nusing i64 = long long;\nusing u64 = unsigned long long;\nusing i128 = __int128_t;\ntemplate < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }\ntemplate < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }\ntemplate < class T, class U > T ceil (T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); }\ntemplate < class T, class U > T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); }\nint popcnt(i32 x) { return __builtin_popcount(x); }\nint popcnt(u32 x) { return __builtin_popcount(x); }\nint popcnt(i64 x) { return __builtin_popcountll(x); }\nint popcnt(u64 x) { return __builtin_popcountll(x); }\n\n#line 2 \"cp-library/src/utility/rep_itr.hpp\"\ntemplate < class T > struct itr_rep {\n T i, d;\n constexpr itr_rep(const T i) noexcept : i(i), d(1) {}\n constexpr itr_rep(const T i, const T d) noexcept : i(i), d(d) {}\n void operator++() noexcept { i += d; }\n constexpr int operator*() const noexcept { return i; }\n constexpr bool operator!=(const itr_rep x) const noexcept { return d > 0 ? i < x.i : i > x.i; }\n};\n\ntemplate < class T > struct rep {\n const itr_rep< T > s, t;\n constexpr rep(const T t) noexcept : s(0), t(t) {}\n constexpr rep(const T s, const T t) noexcept : s(s), t(t) {}\n constexpr rep(const T s, const T t, const T d) noexcept : s(s, d), t(t, d) {}\n constexpr auto begin() const noexcept { return s; }\n constexpr auto end () const noexcept { return t; }\n};\n\ntemplate < class T > struct revrep {\n const itr_rep < T > s, t;\n constexpr revrep(const T t) noexcept : s(t - 1, -1), t(-1, -1) {}\n constexpr revrep(const T s, const T t) noexcept : s(t - 1, -1), t(s - 1, -1) {}\n constexpr revrep(const T s, const T t, const T d) noexcept : s(t - 1, -d), t(s - 1, -d) {}\n constexpr auto begin() const noexcept { return s; }\n constexpr auto end () const noexcept { return t; }\n};\n#line 3 \"cp-library/src/utility/io.hpp\"\n\n/* 128bit integer */\nistream& operator>>(istream& is, i128& x) {\n std::string s; is >> s;\n int pm = (s[0] == '-');\n x = 0;\n for(int i : rep(pm, int(s.size()))) x = x * 10 + (s[i] - '0');\n if(pm) x *= -1;\n return is;\n}\nostream& operator<<(ostream& os, const i128& x) {\n if(x == 0) return os << '0';\n i128 y = x;\n if(y < 0) { os << '-'; y *= -1; }\n std::vector<int> ny;\n while(y > 0) { ny.push_back(y % 10); y /= 10; }\n for(int i : revrep(ny.size())) os << ny[i];\n return os;\n}\n\ntemplate < class S, class T > istream& operator>>(istream& is, std::pair< S, T >& x) { is >> x.first >> x.second; return is; }\ntemplate < class S, class T > ostream& operator<<(ostream& os, const std::pair< S, T >& x) { os << x.first << \" \" << x.second; return os; }\n\nnamespace scanner {\n struct sca {\n template < class T > operator T() {\n T s; std::cin >> s; return s;\n }\n };\n struct vec {\n int n;\n vec(int n) : n(n) {}\n template < class T > operator std::vector< T >() {\n std::vector< T > v(n);\n for(T& x : v) std::cin >> x;\n return v;\n }\n };\n struct mat {\n int h, w;\n mat(int h, int w) : h(h), w(w) {}\n template < class T > operator std::vector< std::vector< T > >() {\n std::vector m(h, std::vector< T >(w));\n for(std::vector< T >& v : m) for(T& x : v) std::cin >> x;\n return m;\n }\n };\n struct speedup {\n speedup() {\n std::cin.tie(0);\n std::ios::sync_with_stdio(0);\n }\n } speedup_instance;\n}\nscanner::sca in() { return scanner::sca(); }\nscanner::vec in(int n) { return scanner::vec(n); }\nscanner::mat in(int h, int w) { return scanner::mat(h, w); }\n\nnamespace printer {\n void precision(int d) { std::cout << std::fixed << std::setprecision(d); }\n void flush() { std::cout.flush(); }\n}\n\ntemplate < class T >\nostream& operator<<(ostream& os, const std::vector< T > a) {\n int n = a.size();\n for(int i : rep(n)) { os << a[i]; if(i != n - 1) os << ' '; }\n return os;\n}\n\nint print() { std::cout << '\\n'; return 0; }\ntemplate < class head, class... tail > int print(head&& h, tail&&... t) {\n std::cout << h; if(sizeof...(tail)) std::cout << ' ';\n return print(std::forward<tail>(t)...);\n}\ntemplate < class T > int print_n(const std::vector< T > a) {\n int n = a.size();\n for(int i : rep(n)) std::cout << a[i] << \"\\n\";\n return 0;\n}\n\n\n#line 2 \"cp-library/src/utility/key_val.hpp\"\n\ntemplate < class K, class V >\nstruct key_val {\n K key; V val;\n key_val() {}\n key_val(K key, V val) : key(key), val(val) {}\n template < std::size_t Index >\n std::tuple_element_t< Index, key_val >& get() {\n if constexpr (Index == 0) return key;\n if constexpr (Index == 1) return val;\n }\n};\n\nnamespace std {\n\ntemplate < class K, class V > struct tuple_size < key_val< K, V > > : integral_constant< size_t, 2 > {};\ntemplate < class K, class V > struct tuple_element < 0, key_val< K, V > > { using type = K; };\ntemplate < class K, class V > struct tuple_element < 1, key_val< K, V > > { using type = V; };\n\n}\n#line 2 \"cp-library/src/utility/vec_op.hpp\"\ntemplate < class T > key_val< int, T > max_of(const vector< T >& a) {\n int i = std::max_element(a.begin(), a.end()) - a.begin();\n return {i, a[i]};\n}\ntemplate < class T > key_val< int, T > min_of(const vector< T >& a) {\n int i = std::min_element(a.begin(), a.end()) - a.begin();\n return {i, a[i]};\n}\ntemplate < class S, class T > S sum_of(const vector< T >& a) {\n S sum = 0;\n for(const T x : a) sum += x;\n return sum;\n}\ntemplate < class S, class T > vector< S > freq_of(const vector< T >& a, T L, T R) {\n vector< S > res(R - L, S(0));\n for(const T x : a) res[x - L] += 1;\n return res;\n}\ntemplate < class S, class T > struct prefix_sum {\n vector< S > s;\n prefix_sum(const vector< T >& a) : s(a) {\n s.insert(s.begin(), S(0));\n for(int i : rep(a.size())) s[i + 1] += s[i];\n }\n // [L, R)\n S sum(int L, int R) { return s[R] - s[L]; }\n};\n#line 3 \"cp-library/src/utility/heap.hpp\"\n\ntemplate < class T > using heap_min = std::priority_queue< T, std::vector< T >, std::greater< T > >;\ntemplate < class T > using heap_max = std::priority_queue< T, std::vector< T >, std::less< T > >;\n\n#line 27 \"cp-library/src/cp-template.hpp\"\n\n#line 1 \"cp-library/src/algorithm/bin_search.hpp\"\ntemplate < class T, class F >\nT bin_search(T ok, T ng, F f) {\n while(abs(ng - ok) > 1) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n\ntemplate < class T, class F >\nT bin_search_real(T ok, T ng, F f, int step = 80) {\n while(step--) {\n T mid = (ok + ng) / 2;\n (f(mid) ? ok : ng) = mid;\n }\n return ok;\n}\n#line 2 \"cp-library/src/algorithm/argsort.hpp\"\n\ntemplate < class T > std::vector< int > argsort(const std::vector< T > &a) {\n std::vector< int > ids((int)a.size());\n std::iota(ids.begin(), ids.end(), 0);\n std::sort(ids.begin(), ids.end(), [&](int i, int j) {\n return a[i] < a[j] || (a[i] == a[j] && i < j);\n });\n return ids;\n}\n#line 1 \"macro.hpp\"\nnamespace macro {\n\nusing size_type = int;\ntemplate < class container > void sort(container& a) { std::sort(std:: begin(a), std:: end(a)); }\ntemplate < class container > void rsort(container& a) { std::sort(std::rbegin(a), std::rend(a)); }\ntemplate < class container > void reverse(container& a) { std::reverse(std::begin(a), std::end(a)); }\ntemplate < class container > void unique(container& a) {\n std::sort(std::begin(a), std::end(a));\n a.erase(std::unique(std::begin(a), std::end(a)), std::end(a));\n}\ntemplate < class container > container sorted(const container& a) { container b = a; sort(b); return std::move(b); }\ntemplate < class container > container rsorted(const container& a) { container b = a; rsort(b); return std::move(b); }\ntemplate < class container, class compare > void sort(container& a, const compare& cmp) { std::sort(std::begin(a), std::end(a), cmp); }\ntemplate < class container, class compare > container sorted(const container& a, const compare& cmp) { container b = a; sort(b, cmp); return std::move(b); }\ntemplate < class container, class value > size_type lower_bound(const container& a, const value& x) { return std::lower_bound(std::begin(a), std::end(a), x) - std::begin(a); }\ntemplate < class container, class value > size_type upper_bound(const container& a, const value& x) { return std::upper_bound(std::begin(a), std::end(a), x) - std::begin(a); }\n\nconst std::vector<std::pair<size_type, size_type>> dir4 = { {+1, 0}, {-1, 0}, { 0, +1}, { 0, -1} };\nconst std::vector<std::pair<size_type, size_type>> dir8 = { {-1, -1}, {-1, 0}, {-1, +1}, { 0, -1}, { 0, +1}, {+1, -1}, {+1, 0}, {+1, +1} };\n\n#ifdef _DEBUG\n#define debug(x) std::cout << \"[\" << __LINE__ << \"] \" << #x << \": \" << x << std::endl\n#else\n#define debug(x)\n#endif\n\ntemplate < class container > void concat(container& a, const container& b) {\n a.insert(std::end(a), std::begin(b), std::end(b));\n}\nstd::vector<size_type> iota(const size_type n) {\n std::vector<size_type> I(n);\n std::iota(std::begin(I), std::end(I), 0);\n return I;\n}\ntemplate < class container > std::vector<size_type> sort_idx(const container& a) {\n const size_type n = a.size();\n std::vector<size_type> I = iota(n);\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return a[i] < a[j] or (a[i] == a[j] and i < j); });\n return I;\n}\ntemplate < class container, class compare > std::vector<size_type> sort_idx(const container& a, const compare& cmp) {\n const size_type n = a.size();\n std::vector<size_type> I = iota(n);\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return cmp(a[i], a[j]) or (a[i] == a[j] and i < j); });\n return std::move(I);\n}\n\nstruct grid {\n using size_type = int;\n size_type H, W;\n grid(const size_type H, const size_type W) : H(H), W(W) {}\n bool contains(const size_type i, const size_type j) {\n return 0 <= i and i < H and 0 <= j and j < W;\n }\n};\n\nusing f64 = long double;\n\n} // namespace macro\n\nusing namespace macro;\n#line 3 \"A.cpp\"\n\ntemplate < class T > int sign(const T x) {\n T e = (is_integral_v< T > ? 1 : 1e-8);\n if(x <= -e) return -1;\n if(x >= +e) return +1;\n return 0;\n}\ntemplate < class T > bool equals(const T& a, const T& b) { return sign(a - b) == 0; }\ntemplate < class T > struct point {\n T x, y;\n point() : x(0), y(0) {}\n point(T x, T y) : x(x), y(y) {}\n point(std::pair< T, T > p) : x(p.first), y(p.second) {}\n point& operator+=(const point& p) { x += p.x, y += p.y; return *this; }\n point& operator-=(const point& p) { x -= p.x, y -= p.y; return *this; }\n point& operator*=(const T r) { x *= r, y *= r; return *this; }\n point& operator/=(const T r) { x /= r, y /= r; return *this; }\n point operator+(const point& p) const { return point(*this) += p; }\n point operator-(const point& p) const { return point(*this) -= p; }\n point operator*(const T r) const { return point(*this) *= r; }\n point operator/(const T r) const { return point(*this) /= r; }\n point operator-() const { return {-x, -y}; }\n bool operator==(const point& p) const { return equals(x, p.x) and equals(y, p.y); }\n bool operator!=(const point& p) const { return !equals(x, p.x) or !equals(y, p.y); }\n bool operator<(const point& p) const { return x == p.x ? y < p.y : x < p.x; }\n point< T > rot(double theta) {\n static_assert(is_floating_point_v< T >);\n double cos_ = std::cos(theta), sin_ = std::sin(theta);\n return {cos_ * x - sin_ * y, sin_ * x + cos_ * y};\n }\n};\ntemplate < class T > istream& operator>>(istream& is, point< T >& p) { return is >> p.x >> p.y; }\ntemplate < class T > ostream& operator<<(ostream& os, point< T >& p) { return os << p.x << \" \" << p.y; }\ntemplate < class T > T dot(const point< T >& a, const point< T >& b) { return a.x * b.x + a.y * b.y; }\ntemplate < class T > T det(const point< T >& a, const point< T >& b) { return a.x * b.y - a.y * b.x; }\ntemplate < class T > T norm(const point< T >& p) { return p.x * p.x + p.y * p.y; }\ntemplate < class T > double abs(const point< T >& p) { return std::sqrt(norm(p)); }\ntemplate < class T > double angle(const point< T >& p) { return std::atan2(p.y, p.x); }\n\ntemplate < class T > int ccw(const point< T >& a, point< T > b, point< T > c) {\n b -= a, c -= a;\n if(sign(det(b, c)) == +1) return +1; // counter clockwise\n if(sign(det(b, c)) == -1) return -1; // clockwise\n if(sign(dot(b, c)) == -1) return +2; // c-a-b\n if(norm(b) < norm(c)) return -2; // a-b-c\n return 0; // a-c-b\n}\n\ntemplate < class T > struct line {\n point< T > a, b;\n line() {}\n line(point< T > a, point< T > b) : a(a), b(b) {}\n};\ntemplate < class T > point< T > projection(const line< T >& l, const point< T >& p) {\n static_assert(is_floating_point_v< T >);\n return l.a + (l.a - l.b) * dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\n}\ntemplate < class T > point< T > reflection(const line< T >& l, const point< T >& p) {\n static_assert(is_floating_point_v< T >);\n return p + (projection(l, p) - p) * T(2);\n}\ntemplate < class T > bool orthogonal(const line< T >& a, const line< T >& b) { return equals(dot(a.b - a.a, b.b - b.a), T(0)); }\ntemplate < class T > bool parallel (const line< T >& a, const line< T >& b) { return equals(det(a.b - a.a, b.b - b.a), T(0)); }\ntemplate < class T > point< T > cross_point_ll(const line< T >& l, const line< T >& m) {\n static_assert(is_floating_point_v< T >);\n T A = det(l.b - l.a, m.b - m.a);\n T B = det(l.b - l.a, l.b - m.a);\n if(equals(abs(A), T(0)) and equals(abs(B), T(0))) return m.a;\n return m.a + (m.b - m.a) * B / A;\n}\n\ntemplate < class T > using segment = line< T >;\ntemplate < class T > bool intersect_ss(const segment< T >& s, const segment< T >& t) {\n return ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 and ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\n}\ntemplate < class T > double distance_sp(const segment< T >& s, const point< T >& p) {\n static_assert(is_floating_point_v< T >);\n point r = projection(s, p);\n if(ccw(s.a, s.b, r) == 0) return abs(r - p);\n return std::min(abs(s.a - p), abs(s.b - p));\n}\ntemplate < class T > double distance_ss(const segment< T >& a, const segment< T >& b) {\n if(intersect_ss(a, b)) return 0;\n return std::min({ distance_sp(a, b.a), distance_sp(a, b.b), distance_sp(b, a.a), distance_sp(b, a.b) });\n}\n\ntemplate < class T > using polygon = std::vector< point< T > >;\ntemplate < class T > T area2(const polygon< T >& p) {\n T s = 0;\n int n = p.size();\n for(int i = 0; i < n; i++) s += det(p[i], p[(i + 1) % n]);\n return s;\n}\ntemplate < class T > T area(const polygon< T >& p) { return area2(p) / T(2); }\n\ntemplate < class T > bool is_convex(const polygon< T >& p) {\n int n = p.size();\n for(int i = 0; i < n; i++) if(ccw(p[(i - 1 + n) % n], p[i], p[(i + 1) % n]) == -1) return false;\n return true;\n}\ntemplate < class T > int contains(const polygon< T >& g, const point< T >& p) {\n int n = g.size();\n bool in = false;\n for(int i = 0; i < n; i++) {\n point a = g[i] - p, b = g[(i + 1) % n] - p;\n if(sign(a.y - b.y) == +1) std::swap(a, b);\n if(sign(a.y) <= 0 and sign(b.y) ==+1 and sign(det(a, b)) == -1) in = !in;\n if(sign(det(a, b)) == 0 and sign(dot(a, b)) <= 0) return 1; // ON\n }\n return in ? 2 : 0;\n}\ntemplate < class T > polygon< T > convex_cut(const polygon< T >& p, const line< T >& l) {\n int n = p.size();\n polygon< T > res;\n for(int i = 0; i < n; i++) {\n point now = p[i], nxt = p[(i + 1) % n];\n if(ccw(l.a, l.b, now) != -1) res.push_back(now);\n if(ccw(l.a, l.b, now) * ccw(l.a, l.b, nxt) < 0) res.push_back(cross_point_ll(line(now, nxt), l));\n }\n return res;\n}\ntemplate < class T > polygon< T > convex_hull(polygon< T >& p) {\n int n = p.size(), k = 0;\n if(n <= 2) return p;\n std::sort(p.begin(), p.end());\n polygon< T > ch(n + n);\n for(int i = 0; i < n; ch[k++] = p[i++])\n while(k >= 2 and sign(det(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1])) == -1) k--;\n for(int i = n - 2, t = k + 1; i >= 0; ch[k++] = p[i--])\n while(k >= t and sign(det(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1])) == -1) k--;\n ch.resize(k - 1);\n return ch;\n}\ntemplate < class T > T diameter2(const polygon< T >& p) {\n static_assert(is_floating_point_v< T >);\n int n = p.size(), is = 0, js = 0;\n for(int i = 1; i < n; i++) {\n if(sign(p[i].y - p[is].y) == +1) is = i;\n if(sign(p[i].y - p[js].y) == -1) js = i;\n }\n T dist_max = norm(p[is] - p[js]);\n int maxi = is, i = is, maxj = js, j = js;\n do {\n if(sign(det(p[(i + 1) % n] - p[i], p[(j + 1) % n] - p[j])) >= 0) j = (j + 1) % n; else i = (i + 1) % n;\n if(norm(p[i] - p[j]) > dist_max) {\n dist_max = norm(p[i] - p[j]);\n maxi = i, maxj = j;\n }\n } while(i != is or j != js);\n return dist_max;\n}\ntemplate < class T > double diameter(const polygon< T >& p) {\n static_assert(is_floating_point_v< T >);\n return std::sqrt(diameter2(p));\n}\n\ntemplate < class T > struct circle {\n point< T > p;\n T r;\n circle() = default;\n circle(point< T > p, T r) : p(p), r(r) {}\n};\ntemplate < class T > istream& operator>>(istream& is, circle< T >& c) { return is >> c.p >> c.r; }\ntemplate < class T > int intersect_cc(circle< T > c1, circle< T > c2) {\n if(c1.r < c2.r) std::swap(c1, c2);\n T d = abs(c1.p - c2.p);\n if(sign(c1.r + c2.r - d) == -1) return 4;\n if(equals(c1.r + c2.r, d)) return 3;\n if(sign(c1.r - c2.r - d) == -1) return 2;\n if(equals(c1.r - c2.r, d)) return 1;\n return 0;\n}\ntemplate < class T > std::pair<point< T >, point< T >> cross_point_cc(const circle< T >& c1, const circle< T >& c2) {\n T d = abs(c1.p - c2.p);\n T a = std::acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d));\n T t = angle(c2.p - c1.p);\n point< T > p1 = c1.p + point< T >(std::cos(t + a), std::sin(t + a)) * c1.r;\n point< T > p2 = c1.p + point< T >(std::cos(t - a), std::sin(t - a)) * c1.r;\n return {p1, p2};\n}\n\nint solve(vector<point<f64>> P_, vector<point<f64>> Q_) {\n int ans = 5;\n vector<int> I = {0, 1, 2}, J = {0, 1, 2};\n do { do {\n auto dfs = [&](auto self, vector<point<f64>> P, vector<point<f64>> Q, int i) -> int {\n if(i == 0) {\n if(P[0] == Q[0]) return 0 + self(self, P, Q, i + 1);\n if(parallel(line<f64>(P[0], Q[0]), line<f64>(P[1], P[2]))) {\n P[0] = Q[0];\n return 1 + self(self, P, Q, i + 1);\n } else {\n int ans = 100;\n for(int j : {1, 2}) {\n const int k = 3 - j;\n line<f64> l0(P[j], P[j] + (P[k] - P[0]));\n line<f64> l1(P[k], P[k] + (P[0] - Q[0]));\n if(parallel(l0, l1)) continue;\n point<f64> p = cross_point_ll<f64>(l0, l1);\n vector<point<f64>> nP = P;\n nP[j] = p;\n nP[0] = Q[0];\n chmin(ans, 2 + self(self, nP, Q, i + 1));\n }\n return ans;\n }\n }\n\n if(i == 1) {\n if(P[1] == Q[1]) return 0 + self(self, P, Q, i + 1);\n if(parallel(line<f64>(P[1], Q[1]), line<f64>(P[0], P[2]))) {\n P[1] = Q[1];\n return 1 + self(self, P, Q, i + 1);\n } else {\n line<f64> l0(P[2], P[2] + (P[0] - P[1]));\n line<f64> l1(P[0], P[0] + (P[1] - Q[1]));\n if(parallel(l0, l1)) return 100;\n point<f64> p = cross_point_ll<f64>(l0, l1);\n P[2] = p;\n P[1] = Q[1];\n return 2 + self(self, P, Q, i + 1);\n }\n }\n\n if(i == 2) {\n if(P[2] == Q[2]) return 0;\n if(parallel(line<f64>(P[2], Q[2]), line<f64>(P[0], P[1]))) {\n return 1;\n } else {\n return 100;\n }\n }\n\n assert(0);\n };\n\n vector<point<f64>> P(3), Q(3);\n for(int i : rep(3)) {\n P[i] = P_[I[i]];\n Q[i] = Q_[J[i]];\n }\n chmin(ans, dfs(dfs, P, Q, 0));\n } while(next_permutation(I.begin(), I.end())); } while(next_permutation(J.begin(), J.end()));\n return ans;\n}\n\nint main() {\n vector<point<f64>> P(3), Q(3);\n while(cin >> P[0].x) {\n cin >> P[0].y;\n for(int i : rep(1, 3)) cin >> P[i].x >> P[i].y;\n for(int i : rep(0, 3)) cin >> Q[i].x >> Q[i].y;\n int ans = solve(P, Q);\n print(ans == 5 ? \"Many\" : to_string(ans));\n }\n}","accuracy":1,"time_ms":30,"memory_kb":3452,"score_of_the_acc":-0.7837,"final_rank":8},{"submission_id":"aoj_1623_8016820","code_snippet":"#include <bits/stdc++.h>\n#define rng(i, a, b) for (int i = (a); i < (b); i++)\n#define rep(i, n) rng(i, 0, (n))\n#define vec vector\nusing namespace std;\ntypedef long double D;\ntypedef complex<D> P;\ntypedef pair<P, P> L;\ntypedef vector<P> VP;\nconst D EPS = 1e-9;\n#define X real()\n#define Y imag()\n#define EQ(n, m) (abs((n) - (m)) < EPS)\nD dot(P a, P b)\n{\n return (conj(a) * b).X;\n}\nD cross(P a, P b)\n{\n return (conj(a) * b).Y;\n}\nP crosspointLL(P a1, P a2, P b1, P b2)\n{\n D d1 = cross(b2 - b1, b1 - a1);\n D d2 = cross(b2 - b1, a2 - a1);\n if (EQ(d1, 0) && EQ(d2, 0))\n return a1;\n if (EQ(d2, 0))\n return P(5000, 5000);\n return a1 + d1 / d2 * (a2 - a1);\n}\nVP inx, y;\nint solve(VP x, int cnt)\n{\n\n vector<bool> okx(3, false), oky(3, false);\n rep(i, 3) rep(j, 3)\n {\n if (oky[j])\n continue;\n if (EQ(x[i], y[j]))\n {\n okx[i] = true;\n oky[j] = true;\n }\n }\n bool ok = true;\n rep(i, 3)\n {\n if (okx[i] == false)\n ok = false;\n }\n if (ok)\n {\n return 0;\n }\n int res = 5;\n rep(i, 3) rep(j, 3)\n {\n if (okx[i] || oky[j])\n continue;\n // x[i]をy[j]に移動\n if (EQ(cross(x[(i + 1) % 3] - x[(i + 2) % 3], y[j] - x[i]), 0))\n {\n VP v = x;\n v[i] = y[j];\n res = min(res, 1 + solve(v, cnt));\n }\n else\n {\n if (okx[(i + 1) % 3] == false)\n {\n VP v = x;\n P z = crosspointLL(x[(i + 2) % 3], x[(i + 2) % 3] + y[j] - x[i], x[(i + 1) % 3], x[(i + 1) % 3] + x[i] - x[(i + 2) % 3]);\n v[(i + 1) % 3] = z;\n if (cnt == 0)\n res = min(res, 1 + solve(v, cnt + 1));\n }\n if (okx[(i + 2) % 3] == false)\n {\n VP v = x;\n P z = crosspointLL(x[(i + 1) % 3], x[(i + 1) % 3] + y[j] - x[i], x[(i + 2) % 3], x[(i + 2) % 3] + x[i] - x[(i + 1) % 3]);\n v[(i + 2) % 3] = z;\n if (cnt == 0)\n res = min(res, 1 + solve(v, cnt + 1));\n }\n }\n }\n // rep(i, 3)\n // {\n // cout << x[i].X << \" \" << x[i].Y << endl;\n // }\n // cout << endl;\n // cout << res << endl;\n return res;\n}\n\nsigned main()\n{\n int x0;\n while (cin >> x0)\n {\n inx.clear();\n y.clear();\n for (int i = 0; i < 3; i++)\n {\n if (i == 0)\n {\n int v;\n cin >> v;\n inx.emplace_back(x0, v);\n }\n else\n {\n int u, v;\n cin >> u >> v;\n inx.emplace_back(u, v);\n }\n }\n for (int i = 0; i < 3; i++)\n {\n int u, v;\n cin >> u >> v;\n y.emplace_back(u, v);\n }\n int ans = solve(inx, 0);\n if (ans >= 5)\n cout << \"Many\" << endl;\n else\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":90,"memory_kb":3436,"score_of_the_acc":-0.7537,"final_rank":7},{"submission_id":"aoj_1623_8013089","code_snippet":"#include <algorithm>\n#include <climits>\n#include <iostream>\n#include <numeric>\n#include <utility>\n#include <vector>\n\nusing namespace std;\nusing uint = unsigned int;\nusing ll = long long;\nusing ull = unsigned long long;\nusing lint = ll;\nusing ulint = ull;\nusing pii = pair<int, int>;\nusing pll = pair<lint, lint>;\ntemplate <class T>\nusing V = vector<T>;\ntemplate <class T>\nusing VV = V<V<T>>;\n#define For(i, a, b) for (int i = int(a); i < int(b); ++i)\n#define rep(i, n) For(i, 0, n)\ntemplate <class T, class U>\nbool chmin(T &a, const U &b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T, class U>\nbool chmax(T &a, const U &b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T>\nT div_floor(T a, T b) {\n if (b < 0) a = -a, b = -b;\n return a >= 0 ? a / b : (a + 1) / b - 1;\n}\ntemplate <class T>\nT div_ceil(T a, T b) {\n if (b < 0) a = -a, b = -b;\n return a <= 0 ? a / b : (a - 1) / b + 1;\n}\n\ntemplate <class T>\nostream &operator<<(ostream &os, const V<T> &v) {\n os << \"[\";\n for (auto d : v) os << d << \", \";\n return os << \"]\";\n}\n\n#include <cmath>\nusing re = long double;\nre EPS = 1e-9;\n\nint sgn(re x) {\n if (x < -EPS) return -1;\n if (x > EPS) return 1;\n return 0;\n}\nbool eq(re x, re y) { return sgn(x - y) == 0; }\nbool ge(re x, re y) { return sgn(x - y) == 1; }\nbool le(re x, re y) { return sgn(x - y) == -1; }\nbool geq(re x, re y) { return sgn(x - y) >= 0; }\nbool leq(re x, re y) { return sgn(x - y) <= 0; }\n\nstruct pt {\n re x, y;\n\n pt(re x = 0, re y = 0) : x(x), y(y) {}\n\n bool operator==(const pt &p) const { return eq(x, p.x) && eq(y, p.y); }\n bool operator<(const pt &p) const {\n if (eq(x, p.x)) {\n return le(y, p.y);\n }\n return le(x, p.x);\n }\n\n pt &operator+=(const pt &r) {\n this->x += r.x;\n this->y += r.y;\n return *this;\n }\n pt &operator-=(const pt &r) {\n this->x -= r.x;\n this->y -= r.y;\n return *this;\n }\n pt &operator*=(const re &r) {\n this->x *= r;\n this->y *= r;\n return *this;\n }\n pt &operator/=(const re &r) {\n this->x /= r;\n this->y /= r;\n return *this;\n }\n\n friend pt operator+(const pt &l, const pt &r) { return pt(l) += r; }\n friend pt operator-(const pt &l, const pt &r) { return pt(l) -= r; }\n friend pt operator*(const pt &l, const re &r) { return pt(l) *= r; }\n friend pt operator/(const pt &l, const re &r) { return pt(l) /= r; }\n\n friend re operator*(const pt &l, const pt &r) {\n return l.x * r.x + l.y * r.y;\n }\n friend re operator^(const pt &l, const pt &r) {\n return l.x * r.y - l.y * r.x;\n }\n};\nostream &operator<<(ostream &os, const pt &p) {\n os << \"(\";\n os << p.x << \", \" << p.y;\n return os << \")\";\n}\n\nusing Vec = pt;\nusing Pts = V<pt>;\n\nre norm(pt p) { return p * p; }\nre abs(pt p) { return sqrt(norm(p)); }\nre arg(pt p) { return atan2(p.y, p.x); }\nre angle(pt a, pt b) { return arg({a * b, a ^ b}); }\n\nstruct Line {\n pt a;\n Vec v;\n\n Line() {}\n Line(pt a, Vec v) : a(a), v(v) {}\n};\n\npt intersection(Line l1, Line l2) {\n auto [a, v] = l1;\n auto [b, w] = l2;\n auto t = ((b - a) ^ w) / (v ^ w);\n return a + v * t;\n}\n\nint main() {\n auto dfs = [&](auto self, int cur, Pts ps, Pts qs, int num, int &ans) {\n if (cur == 3) {\n chmin(ans, num);\n return;\n }\n auto a = ps[cur], b = ps[(cur + 1) % 3], c = ps[(cur + 2) % 3];\n if (a == qs[cur]) {\n self(self, cur + 1, ps, qs, num, ans);\n return;\n }\n\n auto v = qs[cur] - a;\n if (eq(v ^ (b - c), 0)) {\n ps[cur] = qs[cur];\n self(self, cur + 1, ps, qs, num + 1, ans);\n return;\n }\n\n {\n auto vs = ps;\n auto p = intersection(Line(c, v), Line(b, c - a));\n ps[cur] = qs[cur];\n ps[(cur + 1) % 3] = p;\n self(self, cur + 1, vs, qs, num + 2, ans);\n }\n {\n auto vs = ps;\n auto p = intersection(Line(b, v), Line(c, b - a));\n ps[cur] = qs[cur];\n ps[(cur + 2) % 3] = p;\n self(self, cur + 1, vs, qs, num + 2, ans);\n }\n };\n\n Pts ps(3), qs(3);\n while (cin >> ps[0].x) {\n cin >> ps[0].y;\n For(i, 1, 3) cin >> ps[i].x >> ps[i].y;\n rep(i, 3) cin >> qs[i].x >> qs[i].y;\n\n int ans = 100;\n sort(ps.begin(), ps.end());\n do {\n sort(qs.begin(), qs.end());\n do {\n dfs(dfs, 0, ps, qs, 0, ans);\n\n } while (next_permutation(qs.begin(), qs.end()));\n } while (next_permutation(ps.begin(), ps.end()));\n\n if (ans >= 5) {\n puts(\"Many\");\n } else {\n printf(\"%d\\n\", ans);\n }\n }\n}","accuracy":1,"time_ms":70,"memory_kb":3536,"score_of_the_acc":-0.9891,"final_rank":15},{"submission_id":"aoj_1623_7783144","code_snippet":"#line 1 \"test/geometry/base_rational.test.cpp\"\n#define PROBLEM \"https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1623&lang=jp\"\n\n#line 2 \"template/template.hpp\"\n\n#include <bits/stdc++.h>\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 <typename T> bool chmin(T &a, const T &b) {\n if (a <= b) return false;\n a = b;\n return true;\n}\ntemplate <typename T> 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\n// using namespace lib;\n#line 2 \"utility/rational.hpp\"\n\n#line 4 \"utility/rational.hpp\"\n\nnamespace lib{\n\nstruct rational{\n rational() : p(0), q(1) {}\n rational(ll n) : p(n), q(1) {}\n rational(ll n, ll m){\n assert(m != 0);\n if (m < 0) n = -n, m = -m;\n ll g = gcd(n,m);\n p = n / g; q = m / g;\n }\n ld val(){\n return ld(p) / ld(q);\n }\n rational& operator+=(const rational& rhs){\n ll g = gcd(q,rhs.q);\n ll np = rhs.q / g * p + q / g * rhs.p;\n ll nq = q / g * rhs.q;\n ll ng = gcd(np,nq);\n p = np/ng, q = nq/ng;\n return *this; \n }\n rational& operator-=(const rational& rhs){\n (*this) += rational(-rhs.p,rhs.q);\n return *this;\n }\n rational& operator*=(const rational& rhs){\n ll g1 = gcd(q,rhs.p), g2 = gcd(p,rhs.q);\n ll np = p / g2 * rhs.p / g1;\n ll nq = q / g1 * rhs.q / g2;\n p = np, q = nq;\n return *this;\n }\n rational& operator/=(const rational& rhs){\n (*this) *= rational(rhs.q,rhs.p);\n return *this;\n }\n rational operator+() const {return *this;}\n rational operator-() const {return rational() - *this;}\n friend rational operator+(const rational& lhs, const rational& rhs) {\n return rational(lhs) += rhs;\n }\n friend rational operator-(const rational& lhs, const rational& rhs) {\n return rational(lhs) -= rhs;\n }\n friend rational operator*(const rational& lhs, const rational& rhs) {\n return rational(lhs) *= rhs;\n }\n friend rational operator/(const rational& lhs, const rational& rhs) {\n return rational(lhs) /= rhs;\n }\n friend bool operator==(const rational& lhs, const rational& rhs) {\n return lhs.p == rhs.p && lhs.q == rhs.q;\n }\n friend bool operator!=(const rational& lhs, const rational& rhs) {\n return lhs.p != rhs.p || lhs.q != rhs.q;\n }\n friend bool operator< (const rational lhs, const rational rhs) {\n return less_than(lhs,rhs);\n }\n friend bool operator> (const rational lhs, const rational rhs) {\n return less_than(rhs,lhs);\n }\n friend bool operator<= (const rational lhs, const rational rhs) {\n return lhs == rhs || lhs < rhs;\n }\n friend bool operator>= (const rational lhs, const rational rhs) {\n return lhs == rhs || lhs > rhs;\n }\n friend std::ostream &operator<<(std::ostream &os,const rational&r) {\n return os << r.p << \" / \" << r.q;\n }\n private:\n ll p, q;\n static bool less_than(rational lhs, rational rhs){\n __int128_t lv = __int128_t(lhs.p) * __int128_t(rhs.q);\n __int128_t rv = __int128_t(lhs.q) * __int128_t(rhs.p);\n return lv < rv;\n }\n};\n\n\n} // namespace lib\n#line 2 \"geometry/base_arbitary.hpp\"\n\n#line 4 \"geometry/base_arbitary.hpp\"\n\nnamespace lib {\n\ntemplate<typename T>\nstruct Vec {\n T x, y;\n Vec (T _x = T(0), T _y = T(0)) : x(_x), y(_y) {}\n Vec& operator*=(const T& a){\n x *= a;\n y *= a;\n return *this;\n }\n Vec& operator/=(const T& a){\n x /= a;\n y /= a;\n return *this;\n }\n Vec& operator+=(const Vec& rhs) {\n x += rhs.x;\n y += rhs.y;\n return *this;\n }\n Vec& operator-=(const Vec& rhs) {\n x -= rhs.x;\n y -= rhs.y;\n return *this;\n }\n friend bool operator==(const Vec& lhs, const Vec& rhs) {\n return lhs.x == rhs.x && lhs.y == rhs.y;\n }\n friend bool operator!=(const Vec& lhs, const Vec& rhs) {\n return lhs.x != rhs.x || lhs.y != rhs.y;\n }\n friend Vec operator+(const Vec& lhs, const Vec& rhs) {\n return Vec(lhs) += rhs;\n }\n friend Vec operator-(const Vec& lhs, const Vec& rhs) {\n return Vec(lhs) -= rhs;\n }\n friend Vec operator*(const Vec& lhs, const T& rhs) {\n return Vec(lhs) *= rhs;\n }\n friend Vec operator*(const T& rhs, const Vec& lhs) {\n return Vec(lhs) *= rhs;\n }\n friend Vec operator/(const Vec& lhs, const T& rhs) {\n return Vec(lhs) /= rhs;\n }\n friend Vec operator/(const T& rhs, const Vec& lhs) {\n return Vec(lhs) /= rhs;\n }\n};\n\ntemplate<typename T>\nT dot(const Vec<T> &a, const Vec<T> &b){\n return a.x * b.x + a.y * b.y;\n}\n\n// cross > 0 : counter clockwise a -> b\ntemplate<typename T>\nT cross(const Vec<T> &a, const Vec<T> &b){\n return a.x * b.y - a.y * b.x;\n}\n\ntemplate<typename T>\nld abs(const Vec<T> &a){\n return sqrtl(a.x*a.x+a.y*a.y);\n}\n\ntemplate<typename T>\nT norm(const Vec<T> &a){\n return a.x*a.x+a.y*a.y;\n}\n\ntemplate<typename T>\nstruct Line {\n Vec<T> p, q;\n};\n\ntemplate<typename T>\nint intersection(const Line<T> &a, const Line<T> &b){\n if (cross(a.p-a.q,b.p-b.q) == 0){\n if (cross(a.p-b.p,a.q-b.p) == 0) return 2;\n return 0;\n }\n return 1;\n}\n\n// intersection == 1 (cross(a.p-a.q,b.p-b.q) != 0)\ntemplate<typename T>\nVec<T> cross_point(const Line<T> &a, const Line<T> &b){\n Vec<T> va = a.p-a.q, vb = b.p-b.q;\n Vec<T> ba = b.p-a.q;\n T alpha = cross(ba,vb) / cross(va,vb);\n return alpha * a.p + (1 - alpha) * a.q;\n}\n\n\n} // namespace lib\n#line 6 \"test/geometry/base_rational.test.cpp\"\n\nusing namespace lib;\nusing vec = Vec<rational>;\nusing line = Line<rational>;\n\nconst vector<vector<int>> order = {{0,1,2},{0,2,1},{1,0,2},{1,2,0},{2,0,1},{2,1,0}};\n\nint main(){\n while (true){\n vector<vec> ia(3), b(3);\n rep(i,0,6){\n ll x, y; cin >> x >> y;\n if (!cin) return 0;\n (i < 3 ? ia[i] : b[i-3]) = vec(x,y);\n }\n int ans = 5;\n for (auto fid : order) for (auto tid : order) rep(j,0,2){\n auto a = ia;\n int cur = 0;\n rep(i,0,3){\n int f = fid[i], t = tid[i];\n if (a[f] == b[t]) continue;\n cur++;\n int p = (f+1)%3, q = (f+2)%3;\n if (cross(a[p]-a[q],b[t]-a[f]) == 0){\n a[f] = b[t];\n continue;\n }\n cur++;\n if (j == 1) swap(p,q);\n line l1({a[p],a[p]+a[f]-b[t]}), l2({a[q],a[q]+a[f]-a[p]});\n if (intersection(l1,l2) == 1){\n a[q] = cross_point(l1,l2);\n a[f] = b[t];\n }\n else {\n cur = 5;\n break;\n }\n }\n chmin(ans,cur);\n }\n if (ans == 5) cout << \"Many\" << endl;\n else cout << ans << endl;\n }\n}","accuracy":1,"time_ms":1530,"memory_kb":3460,"score_of_the_acc":-1.0065,"final_rank":18},{"submission_id":"aoj_1623_7783133","code_snippet":"#line 1 \"test/geometry/base_rational.test.cpp\"\n#define PROBLEM \"https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1623&lang=jp\"\n\n#line 2 \"template/template.hpp\"\n\n#include <bits/stdc++.h>\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 <typename T> bool chmin(T &a, const T &b) {\n if (a <= b) return false;\n a = b;\n return true;\n}\ntemplate <typename T> 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\n// using namespace lib;\n#line 2 \"utility/rational.hpp\"\n\n#line 4 \"utility/rational.hpp\"\n\nnamespace lib{\n\nstruct rational{\n rational() : p(0), q(1) {}\n rational(ll n) : p(n), q(1) {}\n rational(ll n, ll m){\n assert(m != 0);\n if (m < 0) n = -n, m = -m;\n ll g = gcd(n,m);\n p = n / g; q = m / g;\n }\n ld val(){\n return ld(p) / ld(q);\n }\n rational& operator+=(const rational& rhs){\n ll g = gcd(q,rhs.q);\n ll np = rhs.q / g * p + q / g * rhs.p;\n ll nq = q / g * rhs.q;\n ll ng = gcd(np,nq);\n p = np/ng, q = nq/ng;\n return *this; \n }\n rational& operator-=(const rational& rhs){\n (*this) += rational(-rhs.p,rhs.q);\n return *this;\n }\n rational& operator*=(const rational& rhs){\n ll g1 = gcd(q,rhs.p), g2 = gcd(p,rhs.q);\n ll np = p / g2 * rhs.p / g1;\n ll nq = q / g1 * rhs.q / g2;\n p = np, q = nq;\n return *this;\n }\n rational& operator/=(const rational& rhs){\n (*this) *= rational(rhs.q,rhs.p);\n return *this;\n }\n rational operator+() const {return *this;}\n rational operator-() const {return rational() - *this;}\n friend rational operator+(const rational& lhs, const rational& rhs) {\n return rational(lhs) += rhs;\n }\n friend rational operator-(const rational& lhs, const rational& rhs) {\n return rational(lhs) -= rhs;\n }\n friend rational operator*(const rational& lhs, const rational& rhs) {\n return rational(lhs) *= rhs;\n }\n friend rational operator/(const rational& lhs, const rational& rhs) {\n return rational(lhs) /= rhs;\n }\n friend bool operator==(const rational& lhs, const rational& rhs) {\n return lhs.p == rhs.p && lhs.q == rhs.q;\n }\n friend bool operator!=(const rational& lhs, const rational& rhs) {\n return lhs.p != rhs.p || lhs.q != rhs.q;\n }\n friend bool operator< (const rational lhs, const rational rhs) {\n return less_than(lhs,rhs);\n }\n friend bool operator> (const rational lhs, const rational rhs) {\n return less_than(rhs,lhs);\n }\n friend bool operator<= (const rational lhs, const rational rhs) {\n return lhs == rhs || lhs < rhs;\n }\n friend bool operator>= (const rational lhs, const rational rhs) {\n return lhs == rhs || lhs > rhs;\n }\n friend std::ostream &operator<<(std::ostream &os,const rational&r) {\n return os << r.p << \" / \" << r.q;\n }\n private:\n ll p, q;\n static bool less_than(rational lhs, rational rhs){\n __int128_t lv = __int128_t(lhs.p) * __int128_t(rhs.q);\n __int128_t rv = __int128_t(lhs.q) * __int128_t(rhs.p);\n return lv < rv;\n }\n};\n\n\n} // namespace lib\n#line 2 \"geometry/base_arbitary.hpp\"\n\n#line 4 \"geometry/base_arbitary.hpp\"\n\nnamespace lib {\n\ntemplate<typename T>\nstruct Vec {\n T x, y;\n Vec (T _x = T(0), T _y = T(0)) : x(_x), y(_y) {}\n Vec& operator*=(const T& a){\n x *= a;\n y *= a;\n return *this;\n }\n Vec& operator/=(const T& a){\n x /= a;\n y /= a;\n return *this;\n }\n Vec& operator+=(const Vec& rhs) {\n x += rhs.x;\n y += rhs.y;\n return *this;\n }\n Vec& operator-=(const Vec& rhs) {\n x -= rhs.x;\n y -= rhs.y;\n return *this;\n }\n friend bool operator==(const Vec& lhs, const Vec& rhs) {\n return lhs.x == rhs.x && lhs.y == rhs.y;\n }\n friend bool operator!=(const Vec& lhs, const Vec& rhs) {\n return lhs.x != rhs.x || lhs.y != rhs.y;\n }\n friend Vec operator+(const Vec& lhs, const Vec& rhs) {\n return Vec(lhs) += rhs;\n }\n friend Vec operator-(const Vec& lhs, const Vec& rhs) {\n return Vec(lhs) -= rhs;\n }\n friend Vec operator*(const Vec& lhs, const T& rhs) {\n return Vec(lhs) *= rhs;\n }\n friend Vec operator*(const T& rhs, const Vec& lhs) {\n return Vec(lhs) *= rhs;\n }\n friend Vec operator/(const Vec& lhs, const T& rhs) {\n return Vec(lhs) /= rhs;\n }\n friend Vec operator/(const T& rhs, const Vec& lhs) {\n return Vec(lhs) /= rhs;\n }\n};\n\ntemplate<typename T>\nT dot(const Vec<T> &a, const Vec<T> &b){\n return a.x * b.x + a.y * b.y;\n}\n\n// cross > 0 : counter clockwise a -> b\ntemplate<typename T>\nT cross(const Vec<T> &a, const Vec<T> &b){\n return a.x * b.y - a.y * b.x;\n}\n\ntemplate<typename T>\nld abs(const Vec<T> &a){\n return sqrtl(a.x*a.x+a.y*a.y);\n}\n\ntemplate<typename T>\nT norm(const Vec<T> &a){\n return a.x*a.x+a.y*a.y;\n}\n\ntemplate<typename T>\nstruct Line {\n Vec<T> p, q;\n};\n\ntemplate<typename T>\nint intersection(const Line<T> &a, const Line<T> &b){\n if (cross(a.p-a.q,b.p-b.q) == 0){\n if (cross(a.p-b.p,a.q-b.p) == 0) return 2;\n return 0;\n }\n return 1;\n}\n\n// intersection == 1\ntemplate<typename T>\nVec<T> cross_point(const Line<T> &a, const Line<T> &b){\n Vec<T> va = a.p-a.q, vb = b.p-b.q;\n Vec<T> ba = b.p-a.q;\n T alpha = cross(ba,vb) / cross(va,vb);\n return alpha * a.p + (1 - alpha) * a.q;\n}\n\n\n} // namespace lib\n#line 6 \"test/geometry/base_rational.test.cpp\"\n\nusing namespace lib;\nusing vec = Vec<rational>;\nusing line = Line<rational>;\n\nconst vector<vector<int>> order = {{0,1,2},{0,2,1},{1,0,2},{1,2,0},{2,0,1},{2,1,0}};\n\nint main(){\n while (true){\n vector<vec> ia(3), b(3);\n rep(i,0,6){\n ll x, y; cin >> x >> y;\n if (!cin) return 0;\n (i < 3 ? ia[i] : b[i-3]) = vec(x,y);\n }\n int ans = 5;\n for (auto fid : order) for (auto tid : order) rep(j,0,2){\n auto a = ia;\n int cur = 0;\n rep(i,0,3){\n int f = fid[i], t = tid[i];\n if (a[f] == b[t]) continue;\n cur++;\n int p = (f+1)%3, q = (f+2)%3;\n if (cross(a[p]-a[q],b[t]-a[f]) == 0){\n a[f] = b[t];\n continue;\n }\n cur++;\n if (j == 1) swap(p,q);\n line l1({a[p],a[p]+a[f]-b[t]}), l2({a[q],a[q]+a[f]-a[p]});\n if (intersection(l1,l2) == 1){\n a[q] = cross_point(l1,l2);\n a[f] = b[t];\n }\n else {\n cur = 5;\n break;\n }\n }\n chmin(ans,cur);\n }\n if (ans == 5) cout << \"Many\" << endl;\n else cout << ans << endl;\n }\n}","accuracy":1,"time_ms":1530,"memory_kb":3316,"score_of_the_acc":-0.6637,"final_rank":3},{"submission_id":"aoj_1623_7782179","code_snippet":"#line 1 \"f.cpp\"\n#include<bits/stdc++.h>\n#define rep(i,n) for (int i = 0; i < int(n); ++i)\n#define repp(i,n,m) for (int i = m; i < int(n); ++i)\n#define reb(i,n) for (int i = int(n)-1; i >= 0; --i)\n#define all(v) v.begin(),v.end()\n\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing P = pair<int,int>;\nusing PL = pair<ll,ll>;\n\ntemplate<class T>istream &operator>>(istream &is,vector<T> &v){for(auto &e:v)is>>e;return is;}\ntemplate<typename T1, typename T2>void print(pair<T1,T2> a);\ntemplate<typename T>void print(vector<T> v);\ntemplate<typename T>void print(vector<vector<T>> v);\nvoid print(){ putchar(' '); }\nvoid print(bool a){ printf(\"%d\", a); }\nvoid print(int a){ printf(\"%d\", a); }\nvoid print(long a){ printf(\"%ld\", a); }\nvoid print(long long a){ printf(\"%lld\", a); }\nvoid print(char a){ printf(\"%c\", a); }\nvoid print(char a[]){ printf(\"%s\", a); }\nvoid print(const char a[]){ printf(\"%s\", a); }\nvoid print(long double a){ printf(\"%.15Lf\", a); }\nvoid print(const string& a){ for(auto&& i : a) print(i); }\nvoid print(unsigned int a){ printf(\"%u\", a); }\nvoid print(__int128_t a){print((long long)(a));}\ntemplate<class T> void print(const T& a){ cout << a;}\nint out(){ putchar('\\n'); return 0; }\ntemplate<class T> int out(const T& t){ print(t); putchar('\\n'); return 0; }\ntemplate<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }\ntemplate<typename T1,typename T2>void print(pair<T1,T2> a){print(a.first);print(),print(a.second);}\ntemplate<typename T>void print(vector<T> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())print();}}\ntemplate<typename T>void print(vector<vector<T>> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())out();}}\n\ntemplate<typename T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}\ntemplate<typename T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}\n\nvoid fast_io(){cin.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(20);}\n\nnamespace noya2{\n\nconst int INF = 1001001007;\nconst long long mod1 = 998244353;\nconst long long mod2 = 1000000007;\nconst long long inf = 2e18;\nconst long double pi = 3.14159265358979323;\nconst long double eps = 1e-7;\nvector<int> dx = {0,1,0,-1,1,1,-1,-1};\nvector<int> dy = {1,0,-1,0,1,-1,-1,1};\nconst string ALP = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst string alp = \"abcdefghijklmnopqrstuvwxyz\";\nconst string NUM = \"0123456789\";\nvoid o(){out(\"!?\");}\nvoid yn(bool f){out(f ? \"Yes\" : \"No\");}\nvoid YN(bool F){out(F ? \"YES\" : \"NO\");}\ntemplate<typename T>bool range(T a,T b,T x){return (a<=x&&x<b);}\ntemplate<typename T>bool rrange(T a,T b,T c,T d,T x,T y){return (range(a,c,x)&&range(b,d,y));}\n\n} // namespace noya2\nusing namespace noya2;\n\n#line 2 \"rational.hpp\"\n\nnamespace noya2{\n\ntemplate<typename T>\nstruct rational{\n rational() : p(T(0)), q(T(1)) {}\n rational(T n) : p(n), q(T(1)) {}\n rational(T n, T m){\n assert(m != T(0));\n if (m < T(0)) n = -n, m = -m;\n T g = gcd(n,m);\n p = n / g; q = m / g;\n }\n T num(){return p;}\n T den(){return q;}\n void set_num(T n){\n p = n;\n T g = gcd(p,q);\n p /= g, q /= g;\n }\n void set_den(T n){\n assert(n != T(0));\n q = n;\n T g = gcd(p,q);\n p /= g, q /= g;\n }\n long double val(){\n return (long double)(p) / (long double)(q);\n }\n rational& operator+=(const rational& rhs){\n T g = gcd(q,rhs.q);\n T np = rhs.q / g * p + q / g * rhs.p;\n T nq = q / g * rhs.q;\n T ng = gcd(np,nq);\n p = np/ng, q = nq/ng;\n return *this; \n }\n rational& operator-=(const rational& rhs){\n T g = gcd(q,rhs.q);\n T np = rhs.q / g * p - q / g * rhs.p;\n T nq = q / g * rhs.q;\n T ng = gcd(np,nq);\n p = np/ng, q = nq/ng;\n return *this;\n }\n rational& operator*=(const rational& rhs){\n T g1 = gcd(q,rhs.p), g2 = gcd(p,rhs.q);\n T np = p / g2 * rhs.p / g1;\n T nq = q / g1 * rhs.q / g2;\n p = np, q = nq;\n return *this;\n }\n rational& operator/=(const rational& rhs){\n assert(rhs.p != T(0));\n T g1 = gcd(q,rhs.q), g2 = gcd(p,rhs.p);\n T np = p / g2 * rhs.q / g1;\n T nq = q / g1 * rhs.p / g2;\n p = np, q = nq;\n return *this;\n }\n rational operator+() const {return *this;}\n rational operator-() const {return rational() - *this;}\n friend rational operator+(const rational& lhs, const rational& rhs) {\n return rational(lhs) += rhs;\n }\n friend rational operator-(const rational& lhs, const rational& rhs) {\n return rational(lhs) -= rhs;\n }\n friend rational operator*(const rational& lhs, const rational& rhs) {\n return rational(lhs) *= rhs;\n }\n friend rational operator/(const rational& lhs, const rational& rhs) {\n return rational(lhs) /= rhs;\n }\n friend bool operator==(const rational& lhs, const rational& rhs) {\n return lhs.p == rhs.p && lhs.q == rhs.q;\n }\n friend bool operator!=(const rational& lhs, const rational& rhs) {\n return lhs.p != rhs.p || lhs.q != rhs.q;\n }\n friend bool operator< (const rational lhs, const rational rhs) {\n return less_than(lhs,rhs);\n }\n friend bool operator> (const rational lhs, const rational rhs) {\n return less_than(rhs,lhs);\n }\n friend bool operator<= (const rational lhs, const rational rhs) {\n return lhs == rhs || lhs < rhs;\n }\n friend bool operator>= (const rational lhs, const rational rhs) {\n return lhs == rhs || lhs > rhs;\n }\n friend std::ostream &operator<<(std::ostream &os,const rational&r) {\n return os << r.p << \" / \" << r.q;\n }\n private:\n T p, q;\n T gcd(T a,T b){if(a<T(0))return gcd(-a,b);if(b<T(0))return gcd(a,-b);return _gcd(a,b);}\n T _gcd(T a,T b){return b?_gcd(b,a%b):a;}\n static bool less_than(rational lhs, rational rhs){\n __int128_t lv = __int128_t(lhs.p) * __int128_t(rhs.q);\n __int128_t rv = __int128_t(lhs.q) * __int128_t(rhs.p);\n return lv < rv;\n }\n};\n\nusing rat = rational<long long>;\n\n} // namespace noya2\n#line 2 \"geometry2D.hpp\"\n\n#line 6 \"geometry2D.hpp\"\n\n#line 2 \"math.hpp\"\n\n#line 6 \"math.hpp\"\n\nnamespace noya2{\n\nusing namespace std;\nusing ll = long long;\n\ntemplate<typename T> T sqrt_safe(T x){ // floor(sqrt(x))\n assert(x >= T(0));\n if (x <= T(1)) return x;\n T tmp = (T)(sqrtl((long double)(x))) + T(2);\n while (tmp--){\n if (tmp * tmp <= x) break;\n }\n return tmp;\n}\n\nll mod_safe(ll a, ll m){ // m >= 1, 0 <= mod_safe(a,m) < m, mod_safe(a,m) = a (mod m)\n ll res = a % m;\n if (res < 0) res += m;\n return res;\n}\nll modpow(ll x, ll n, ll mod){\n x = mod_safe(x,mod);\n if (n == 0) return 1;\n ll res = modpow(x,n/2,mod);\n res = (res * res) % mod;\n if (n % 2 == 1) res = (res * x) % mod;\n return res;\n}\n\nll naive_gcd(ll a, ll b){ return b ? naive_gcd(b, a % b) : a; }\n\n// gcd(N >= 0, 0) = N, especialy gcd(0, 0) = 0\nll gcd_safe(ll a, ll b){ return naive_gcd(abs(a),abs(b)); }\nll lcm_safe(ll a, ll b){ return a / gcd_safe(a,b) * b; }\n\nvoid ext_gcd1_plus(ll a, ll b, ll &x, ll &y){ // gcd(a,b) = 1, a >= 0, b >= 0, ax + by = 1\n if (b == 0){ // a = 1\n x = 1, y = 0;\n return ;\n }\n ext_gcd1_plus(b, a%b, y, x);\n x = mod_safe(x,b);\n y = (1 - a * x) / b;\n}\nvoid ext_gcd1_minus(ll a, ll b, ll &x, ll &y){ // gcd(a,b) = 1, a >= 0, b >= 0, ax - by = 1\n if (b == 0){ // a = 1\n x = 1, y = 0;\n return ;\n }\n ext_gcd1_plus(b, a%b, y, x);\n x = mod_safe(x,b);\n y = (a * x - 1) / b;\n}\n\npair<ll,ll> ext_gcd(ll a, ll b, ll c){ // ax + by = c, |a|,|b|,|c| < 1e9, x <= max(|B|,|C|), y <= max(|A|,|C|)\n if (a < 0) return ext_gcd(-a,-b,-c);\n if (c < 0){\n pair<ll,ll> res = ext_gcd(a,b,-c);\n res.first = -res.first, res.second = -res.second;\n return res;\n }\n if (c == 0) return pair<ll,ll>(0,0);\n if (a == 0 && b == 0) return pair<ll,ll>(0,0); // answer not exist\n ll g = gcd_safe(a,b);\n if (c % g != 0) return pair<ll,ll>(0,0); // answer not exist\n a /= g, b /= g, c /= g;\n ll x, y;\n if (b == 0) return pair<ll,ll>(c,0);\n if (b > 0) ext_gcd1_plus(a,b,x,y);\n else ext_gcd1_minus(a,-b,x,y);\n x = mod_safe(x*c,abs(b));\n y = (c - a * x) / b;\n return pair<ll,ll>(x,y);\n}\n\ntemplate<typename T>\nT ceil_safe(T p, T q);\n\ntemplate<typename T>\nT floor_safe(T p, T q){\n if (q < T(0)) return floor_safe(-p,-q);\n if (p >= T(0)) return p / q;\n return -ceil_safe(-p,q);\n}\n\ntemplate<typename T>\nT ceil_safe(T p, T q){\n if (q < T(0)) return ceil_safe(-p,-q);\n if (p >= T(0)) return (p + q - 1) / q;\n return -floor_safe(-p,q);\n}\n\nstruct Eratosthenes{\n static vector<int> table;\n Eratosthenes (int Nmax = -1) {init(Nmax);}\n static void init(int Nmax){\n if (!table.empty()) return ;\n table.resize(Nmax+1,0);\n table[0] = 1, table[1] = 1;\n for (int p = 2; p <= Nmax; p++){\n if (table[p] != 0) continue;\n for (int j = p; j <= Nmax; j += p){\n table[j] = p;\n }\n }\n }\n};\nvector<int>Eratosthenes::table = vector<int>(0);\n\nvoid build_eratosthenes(const int Nmax){Eratosthenes::init(Nmax);}\n\nvector<pair<int,int>> fast_prime_factorization(int N){\n int pre = -1, cnt = 0;\n vector<pair<int,int>> res;\n while(true) {\n if (N == 1){\n if (cnt > 0) res.emplace_back(pre,cnt);\n break;\n }\n int div = Eratosthenes::table[N];\n if (pre != div){\n if (cnt > 0) res.emplace_back(pre,cnt);\n pre = div, cnt = 1;\n }\n else cnt++;\n N /= div;\n }\n return res;\n}\n\nvector<int> fast_divisor_enumeration(int N){\n auto pes = fast_prime_factorization(N);\n vector<int> res = {1};\n for (auto pe : pes){\n vector<int> nres;\n for (auto x : res){\n for (int _t = 0; _t <= pe.second; _t++){\n nres.emplace_back(x);\n x *= pe.first;\n }\n }\n swap(res,nres);\n }\n return res;\n}\n\nbool fast_is_prime(int N){\n if (N <= 1) return false;\n return Eratosthenes::table[N] == N;\n}\n\nvector<int> mobius(int N){\n vector<int> res(N+1,0);\n res[1] = 1;\n for (int p = 2; p <= N; p++){\n if (fast_is_prime(p)){\n for (int i = N/p; i > 0; i--){\n res[i*p] = -res[i];\n }\n }\n }\n return res;\n};\n\nvector<pair<ll,int>> prime_factorization(ll N){\n vector<pair<ll,int>> res;\n ll iN = N;\n for (ll d = 2; d * d <= N; d++){\n if (iN % d != 0) continue;\n if (iN == 1) break;\n int ie = 0;\n while (iN % d == 0) iN /= d, ie++;\n res.emplace_back(d,ie);\n }\n if (iN != 1) res.emplace_back(iN,1);\n return res;\n}\n\nvector<ll> divisor_enumeration(ll N){\n vector<ll> res;\n for (ll d = 1; d * d <= N; d++){\n if (N % d != 0) continue;\n res.emplace_back(d);\n if (d * d != N) res.emplace_back(N/d);\n }\n return res;\n}\n\nbool is_prime(ll N){\n if (N <= 1) return false;\n if (N <= 3) return true;\n if (N % 2 == 0) return false;\n for (ll d = 3; d * d <= N; d += 2){\n if (N % d == 0) return false;\n }\n return true;\n}\n\n}// namespace noya2\n#line 8 \"geometry2D.hpp\"\n\nnamespace noya2{\n\nusing namespace std;\nusing ld = long double;\n\ntemplate<typename T>\nstruct Vec {\n T x, y;\n Vec (T _x = T(0), T _y = T(0)) : x(_x), y(_y) {}\n Vec& operator*=(const T& a){\n x *= a;\n y *= a;\n return *this;\n }\n Vec& operator/=(const T& a){\n x /= a;\n y /= a;\n return *this;\n }\n Vec& operator+=(const Vec& rhs) {\n x += rhs.x;\n y += rhs.y;\n return *this;\n }\n Vec& operator-=(const Vec& rhs) {\n x -= rhs.x;\n y -= rhs.y;\n return *this;\n }\n friend Vec operator+(const Vec& lhs, const Vec& rhs) {\n return Vec(lhs) += rhs;\n }\n friend Vec operator-(const Vec& lhs, const Vec& rhs) {\n return Vec(lhs) -= rhs;\n }\n friend Vec operator*(const Vec& lhs, const T& rhs) {\n return Vec(lhs) *= rhs;\n }\n friend Vec operator*(const T& rhs, const Vec& lhs) {\n return Vec(lhs) *= rhs;\n }\n friend Vec operator/(const Vec& lhs, const T& rhs) {\n return Vec(lhs) /= rhs;\n }\n friend Vec operator/(const T& rhs, const Vec& lhs) {\n return Vec(lhs) /= rhs;\n }\n ld norm(){\n return sqrtl(ld(x*x+y*y));\n }\n T norm2(){\n return x*x+y*y;\n }\n};\n\ntemplate<typename T>\nT dot(const Vec<T> &a, const Vec<T> &b){\n return a.x * b.x + a.y * b.y;\n}\n\n// cross > 0 : counter clockwise a -> b\ntemplate<typename T>\nT cross(const Vec<T> &a, const Vec<T> &b){\n return a.x * b.y - a.y * b.x;\n}\n\n// T = int, ll\n// number of lattice points ( point(x,y) s.t. x in Z and y in Z ) on Vec a\ntemplate<typename T>\nT lattice_points(const Vec<T> &a){\n return gcd_safe(a.x,a.y) + 1;\n}\n\n// e : vec(OX)\n// orthant k : [ pi/2 * k, pi/2 * (k+1) ) rad\n// orthant 4 is NOT expected\ntemplate<typename T>\nint orthant(const Vec<T> &e, const Vec<T> &p){\n T _dot = dot(e,p), _cross = cross(e,p);\n if (_dot > 0 && _cross >= 0) return 0;\n if (_dot <= 0 && _cross > 0) return 1;\n if (_dot < 0 && _cross <= 0) return 2;\n if (_dot >= 0 && _cross < 0) return 3;\n return 4;\n}\n\n// usage : \n// vector<Vec<ll>> vec;\n// sort(vec.begin(),vec.end(),comp_for_argument_sort<ll>);\ntemplate<typename T>\nbool comp_for_argument_sort(const Vec<T> &lhs, const Vec<T> &rhs){\n int pl = orthant(Vec<T>(1,0),lhs), pr = orthant(Vec<T>(1,0),rhs);\n if (pl == pr){\n return cross(lhs,rhs) > 0;\n }\n return pl < pr;\n}\n\n// DISTINCT points are given\n// ans[0] --- ans[1] --- ... --- ans[k-1] --- ans[k] --- ans[0]\n// upper_hull --- lower_hull\n// upper_hull : x is from small to large\n// lower hull : x is from large to small\n// points rearranged counter clockwise\ntemplate<typename T>\nvector<Vec<T>> convex_hull(vector<Vec<T>> a){\n int n = a.size();\n if (n <= 2) return a;\n using vec = Vec<T>;\n auto comp = [&](vec lhs, vec rhs){\n if (lhs.x == rhs.x) return lhs.y < rhs.y;\n return lhs.x < rhs.x;\n };\n sort(a.begin(),a.end(),comp);\n stack<int> uid, did;\n uid.push(0);\n vec ri = a[n-1];\n for (int i = 1; i < n-1; i++){\n vec le = a[uid.top()];\n if (cross(ri-le,a[i]-le) > 0){\n while (uid.size() >= 2){\n int test = uid.top(); uid.pop();\n vec from = a[uid.top()];\n if (cross(a[i]-from,a[test]-from) > 0){\n uid.push(test);\n break;\n }\n }\n uid.push(i);\n }\n }\n did.push(0);\n for (int i = 1; i < n-1; i++){\n vec le = a[did.top()];\n if (cross(ri-le,a[i]-le) < 0){\n while (did.size() >= 2){\n int test = did.top(); did.pop();\n vec from = a[did.top()];\n if (cross(a[i]-from,a[test]-from) < 0){\n did.push(test);\n break;\n }\n }\n did.push(i);\n }\n }\n vector<int> ids(1,n-1);\n while (!did.empty()) ids.emplace_back(did.top()), did.pop();\n reverse(ids.begin(),ids.end());\n while (!uid.empty()) ids.emplace_back(uid.top()), uid.pop();\n ids.pop_back();\n vector<vec> ans(ids.size());\n for (int i = 0; i < (int)(ids.size()); i++){\n ans[i] = a[ids[i]];\n }\n return ans;\n}\n\nusing ll = long long;\nstruct Line{\n ll a, b, c; // ax + by = c\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 }\n static Line get_Line(ll x1, ll y1, ll ex, ll ey){ // y = ey/ex (x - x1) + y1 \n return Line(ey,-ex,ey*x1-ex*y1);\n }\n static Line vertical_Line(ll x1, ll y1, ll x2, ll y2){ // perpendicular bisector\n ll ex = y2 - y1, ey = x1 - x2;\n return Line(ey*2,-ex*2,ey*(x1+x2)-ex*(y1+y2));\n }\n void slide(const Vec<ll> &v){ // ax + by = c -> a(x - vx) + b(y - vy) = c\n c += a * v.x + b * v.y;\n }\n //Vec<ll> normal_Vec(const Vec<ll> &from){}\n ld dist_from_point(const Vec<ll> &from){\n return abs(ld(a) * ld(from.x) + ld(b) * ld(from.y) - ld(c)) / sqrtl(ld(a*a+b*b));\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\nstruct Directed_Line{\n Vec<ll> from, direct; // Line : from + k * direct\n void normalize(){\n ll g = gcd_safe(direct.x,direct.y);\n direct /= g;\n }\n Directed_Line (ll x_from = 0, ll y_from = 0, ll x_to = 1, ll y_to = 0){\n from.x = x_from, from.y = y_from;\n direct.x = x_to - x_from;\n direct.y = y_to - y_from;\n normalize();\n }\n Directed_Line (Vec<ll> _from, Vec<ll> _to){\n from = _from;\n direct = _to - _from;\n normalize();\n }\n bool in(const Vec<ll> &r, bool on){\n ll z = cross(direct,r-from);\n if (z == 0) return on;\n return z > 0;\n }\n bool slide_if_smaller(const Vec<ll> &v){\n if (in(from+v,false)){\n from += v;\n return true;\n }\n return false;\n }\n Directed_Line slide(const Vec<ll> &v){\n auto res = *this;\n res.from += v;\n return res;\n }\n};\n\n\n// two line segments AB and CD shared at least one point\nbool check_intersection(ll ax, ll ay, ll bx, ll by, ll cx, ll cy, ll dx, ll dy){\n // both AB and CD are parallel to y-axis \n if (ax == bx && cx == dx){\n if (ax != cx) return false;\n return (min(ay,by) <= max(cy,dy)) && (min(cy,dy) <= max(ay,by));\n }\n // change to cx != dx \n if (cx == dx){\n swap(ax,cx), swap(ay,cy);\n swap(bx,dx), swap(by,dy);\n }\n // change to ax >= bx\n if (ax < bx){\n swap(ax,bx), swap(ay,by);\n }\n // change to cx >= dx\n if (cx < dx){\n swap(cx,dx), swap(cy,dy);\n }\n // AB is parallel to y-axis\n if (ax == bx){\n __int128_t lv = __int128_t(cx - dx) * __int128_t(min(ay,by) - dy);\n __int128_t mv = __int128_t(cy - dy) * __int128_t(ax - dx);\n __int128_t rv = __int128_t(cx - dx) * __int128_t(max(ay,by) - dy);\n return lv <= mv && mv <= rv;\n }\n // both AB and CD are NOT parallel to y-axis\n ll gAB = gcd_safe(ay-by,ax-bx);\n ll pAB = (ax-bx) / gAB, qAB = (ay-by) / gAB;\n ll gCD = gcd_safe(cy-dy,cx-dx);\n ll pCD = (cx-dx) / gCD, qCD = (cy-dy) / gCD;\n // AB and CD are parallel\n if (pAB == pCD && qAB == qCD){\n if (bx == dx){\n return by == dy;\n }\n ll gDB = gcd_safe(dy-by,dx-bx);\n ll pDB = (dx-bx) / gDB, qDB = (dy-by) / gDB;\n if (bx > dx){\n pDB = -pDB;\n qDB = -qDB;\n }\n // Line AB = Line CD\n if (pDB == pAB && qDB == qAB){\n return bx <= cx && dx <= ax;\n }\n return false;\n }\n // AB and CD are NOT parallel\n __int128_t tal = __int128_t(cx - dx) * __int128_t(ay - cy); // ta = tal - tar\n __int128_t tar = __int128_t(cy - dy) * __int128_t(ax - cx); // ta <=> 0 == tal <=> tar\n __int128_t tbl = __int128_t(cx - dx) * __int128_t(by - cy); // tb = tbl - tbr\n __int128_t tbr = __int128_t(cy - dy) * __int128_t(bx - cx); // tb <=> 0 == tbl <=> tbr\n __int128_t tcl = __int128_t(ax - bx) * __int128_t(cy - ay); // tc = tcl - tcr\n __int128_t tcr = __int128_t(ay - by) * __int128_t(cx - ax); // tc <=> 0 == tcl <=> tcr\n __int128_t tdl = __int128_t(ax - bx) * __int128_t(dy - ay); // td = tdl - tdr\n __int128_t tdr = __int128_t(ay - by) * __int128_t(dx - ax); // td <=> 0 == tdl <=> tdr\n // ta * tb <= 0 && tc * td <= 0 -> true\n // ta > 0 && tb > 0 -> false\n if ((tal > tar && tbl > tbr) || (tal < tar && tbl < tbr)){\n return false;\n }\n // tc > 0 && td > 0 -> false\n if ((tcl > tcr && tdl > tdr) || (tcl < tcr && tdl < tdr)){\n return false;\n }\n return true;\n}\n\n} // namespace noya2\n#line 66 \"f.cpp\"\n\nusing vec = Vec<rat>;\n\nconst vector<vector<int>> order = {{0,1,2},{0,2,1},{1,0,2},{1,2,0},{2,0,1},{2,1,0}};\n\nbool mat2(vec a0, vec a1, vec b, vec &res){\n res = vec(b.x * a1.y - b.y * a1.x, b.y * a0.x - b.x * a0.y);\n rat d = cross(a0,a1);\n if (d == 0) return false;\n res /= d;\n return true;\n}\n\nvoid solve(){\n while (true){\n vector<vec> ia(3), b(3);\n rep(i,6){\n ll x, y; cin >> x >> y;\n if (!cin) return ;\n (i < 3 ? ia[i] : b[i-3]) = vec(x,y);\n }\n \n int ans = 5;\n for (auto fid : order) for (auto tid : order) rep(j,2){\n auto a = ia;\n int cur = 3;\n rep(i,3){\n int f = fid[i], t = tid[i];\n int p = (f+1)%3, q = (f+2)%3;\n if (cross(a[p]-a[q],b[t]-a[f]) == 0){\n a[f] = b[t];\n continue;\n }\n cur++;\n if (cur == 5) break;\n if (j == 1) swap(p,q);\n vec ab;\n if (mat2(a[f]-b[t],a[p]-a[f],a[q]-a[p],ab)){\n a[q] += ab.y * (a[f]-a[p]);\n a[f] = b[t];\n }\n else {\n cur = 5;\n break;\n }\n }\n chmin(ans,cur);\n }\n if (ans == 5) cout << \"Many\" << endl;\n else cout << ans << endl;\n if (cin.eof()) break;\n }\n}\n\nint main(){\n fast_io();\n int t = 1; //cin >> t;\n while(t--) solve();\n}","accuracy":1,"time_ms":260,"memory_kb":3416,"score_of_the_acc":-0.7292,"final_rank":5},{"submission_id":"aoj_1623_7780703","code_snippet":"#line 1 \"f.cpp\"\n#include<bits/stdc++.h>\n#define rep(i,n) for (int i = 0; i < int(n); ++i)\n#define repp(i,n,m) for (int i = m; i < int(n); ++i)\n#define reb(i,n) for (int i = int(n)-1; i >= 0; --i)\n#define all(v) v.begin(),v.end()\n\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing P = pair<int,int>;\nusing PL = pair<ll,ll>;\n\ntemplate<class T>istream &operator>>(istream &is,vector<T> &v){for(auto &e:v)is>>e;return is;}\ntemplate<typename T1, typename T2>void print(pair<T1,T2> a);\ntemplate<typename T>void print(vector<T> v);\ntemplate<typename T>void print(vector<vector<T>> v);\nvoid print(){ putchar(' '); }\nvoid print(bool a){ printf(\"%d\", a); }\nvoid print(int a){ printf(\"%d\", a); }\nvoid print(long a){ printf(\"%ld\", a); }\nvoid print(long long a){ printf(\"%lld\", a); }\nvoid print(char a){ printf(\"%c\", a); }\nvoid print(char a[]){ printf(\"%s\", a); }\nvoid print(const char a[]){ printf(\"%s\", a); }\nvoid print(long double a){ printf(\"%.15Lf\", a); }\nvoid print(const string& a){ for(auto&& i : a) print(i); }\nvoid print(unsigned int a){ printf(\"%u\", a); }\nvoid print(__int128_t a){print((long long)(a));}\ntemplate<class T> void print(const T& a){ cout << a;}\nint out(){ putchar('\\n'); return 0; }\ntemplate<class T> int out(const T& t){ print(t); putchar('\\n'); return 0; }\ntemplate<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }\ntemplate<typename T1,typename T2>void print(pair<T1,T2> a){print(a.first);print(),print(a.second);}\ntemplate<typename T>void print(vector<T> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())print();}}\ntemplate<typename T>void print(vector<vector<T>> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())out();}}\n\ntemplate<typename T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}\ntemplate<typename T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}\n\nvoid fast_io(){cin.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(20);}\n\nnamespace noya2{\n\nconst int INF = 1001001007;\nconst long long mod1 = 998244353;\nconst long long mod2 = 1000000007;\nconst long long inf = 2e18;\nconst long double pi = 3.14159265358979323;\nconst long double eps = 1e-7;\nvector<int> dx = {0,1,0,-1,1,1,-1,-1};\nvector<int> dy = {1,0,-1,0,1,-1,-1,1};\nconst string ALP = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\";\nconst string alp = \"abcdefghijklmnopqrstuvwxyz\";\nconst string NUM = \"0123456789\";\nvoid o(){out(\"!?\");}\nvoid yn(bool f){out(f ? \"Yes\" : \"No\");}\nvoid YN(bool F){out(F ? \"YES\" : \"NO\");}\ntemplate<typename T>bool range(T a,T b,T x){return (a<=x&&x<b);}\ntemplate<typename T>bool rrange(T a,T b,T c,T d,T x,T y){return (range(a,c,x)&&range(b,d,y));}\n\n} // namespace noya2\nusing namespace noya2;\n\n#line 2 \"rational.hpp\"\n\nnamespace noya2{\n\ntemplate<typename T>\nstruct rational{\n rational() : p(T(0)), q(T(1)) {}\n rational(T n) : p(n), q(T(1)) {}\n rational(T n, T m){\n assert(m != T(0));\n if (m < T(0)) n = -n, m = -m;\n T g = gcd(n,m);\n p = n / g; q = m / g;\n }\n T num(){return p;}\n T den(){return q;}\n void set_num(T n){\n p = n;\n T g = gcd(p,q);\n p /= g, q /= g;\n }\n void set_den(T n){\n assert(n != T(0));\n q = n;\n T g = gcd(p,q);\n p /= g, q /= g;\n }\n long double val(){\n return (long double)(p) / (long double)(q);\n }\n rational& operator+=(const rational& rhs){\n T g = gcd(q,rhs.q);\n T np = rhs.q / g * p + q / g * rhs.p;\n T nq = q / g * rhs.q;\n T ng = gcd(np,nq);\n p = np/ng, q = nq/ng;\n return *this; \n }\n rational& operator-=(const rational& rhs){\n T g = gcd(q,rhs.q);\n T np = rhs.q / g * p - q / g * rhs.p;\n T nq = q / g * rhs.q;\n T ng = gcd(np,nq);\n p = np/ng, q = nq/ng;\n return *this;\n }\n rational& operator*=(const rational& rhs){\n T g1 = gcd(q,rhs.p), g2 = gcd(p,rhs.q);\n T np = p / g2 * rhs.p / g1;\n T nq = q / g1 * rhs.q / g2;\n p = np, q = nq;\n return *this;\n }\n rational& operator/=(const rational& rhs){\n assert(rhs.p != T(0));\n T g1 = gcd(q,rhs.q), g2 = gcd(p,rhs.p);\n T np = p / g2 * rhs.q / g1;\n T nq = q / g1 * rhs.p / g2;\n p = np, q = nq;\n return *this;\n }\n rational operator+() const {return *this;}\n rational operator-() const {return rational() - *this;}\n friend rational operator+(const rational& lhs, const rational& rhs) {\n return rational(lhs) += rhs;\n }\n friend rational operator-(const rational& lhs, const rational& rhs) {\n return rational(lhs) -= rhs;\n }\n friend rational operator*(const rational& lhs, const rational& rhs) {\n return rational(lhs) *= rhs;\n }\n friend rational operator/(const rational& lhs, const rational& rhs) {\n return rational(lhs) /= rhs;\n }\n friend bool operator==(const rational& lhs, const rational& rhs) {\n return lhs.p == rhs.p && lhs.q == rhs.q;\n }\n friend bool operator!=(const rational& lhs, const rational& rhs) {\n return lhs.p != rhs.p || lhs.q != rhs.q;\n }\n friend bool operator< (const rational lhs, const rational rhs) {\n return less_than(lhs,rhs);\n }\n friend bool operator> (const rational lhs, const rational rhs) {\n return less_than(rhs,lhs);\n }\n friend bool operator<= (const rational lhs, const rational rhs) {\n return lhs == rhs || lhs < rhs;\n }\n friend bool operator>= (const rational lhs, const rational rhs) {\n return lhs == rhs || lhs > rhs;\n }\n friend std::ostream &operator<<(std::ostream &os,const rational&r) {\n return os << r.p << \" / \" << r.q;\n }\n private:\n T p, q;\n T gcd(T a,T b){if(a<T(0))return gcd(-a,b);if(b<T(0))return gcd(a,-b);return _gcd(a,b);}\n T _gcd(T a,T b){return b?_gcd(b,a%b):a;}\n static bool less_than(rational lhs, rational rhs){\n __int128_t lv = __int128_t(lhs.p) * __int128_t(rhs.q);\n __int128_t rv = __int128_t(lhs.q) * __int128_t(rhs.p);\n return lv < rv;\n }\n};\n\nusing rat = rational<long long>;\n\n} // namespace noya2\n#line 2 \"geometry2D.hpp\"\n\n#line 6 \"geometry2D.hpp\"\n\n#line 2 \"math.hpp\"\n\n#line 6 \"math.hpp\"\n\nnamespace noya2{\n\nusing namespace std;\nusing ll = long long;\n\ntemplate<typename T> T sqrt_safe(T x){ // floor(sqrt(x))\n assert(x >= T(0));\n if (x <= T(1)) return x;\n T tmp = (T)(sqrtl((long double)(x))) + T(2);\n while (tmp--){\n if (tmp * tmp <= x) break;\n }\n return tmp;\n}\n\nll mod_safe(ll a, ll m){ // m >= 1, 0 <= mod_safe(a,m) < m, mod_safe(a,m) = a (mod m)\n ll res = a % m;\n if (res < 0) res += m;\n return res;\n}\nll modpow(ll x, ll n, ll mod){\n x = mod_safe(x,mod);\n if (n == 0) return 1;\n ll res = modpow(x,n/2,mod);\n res = (res * res) % mod;\n if (n % 2 == 1) res = (res * x) % mod;\n return res;\n}\n\nll naive_gcd(ll a, ll b){ return b ? naive_gcd(b, a % b) : a; }\n\n// gcd(N >= 0, 0) = N, especialy gcd(0, 0) = 0\nll gcd_safe(ll a, ll b){ return naive_gcd(abs(a),abs(b)); }\nll lcm_safe(ll a, ll b){ return a / gcd_safe(a,b) * b; }\n\nvoid ext_gcd1_plus(ll a, ll b, ll &x, ll &y){ // gcd(a,b) = 1, a >= 0, b >= 0, ax + by = 1\n if (b == 0){ // a = 1\n x = 1, y = 0;\n return ;\n }\n ext_gcd1_plus(b, a%b, y, x);\n x = mod_safe(x,b);\n y = (1 - a * x) / b;\n}\nvoid ext_gcd1_minus(ll a, ll b, ll &x, ll &y){ // gcd(a,b) = 1, a >= 0, b >= 0, ax - by = 1\n if (b == 0){ // a = 1\n x = 1, y = 0;\n return ;\n }\n ext_gcd1_plus(b, a%b, y, x);\n x = mod_safe(x,b);\n y = (a * x - 1) / b;\n}\n\npair<ll,ll> ext_gcd(ll a, ll b, ll c){ // ax + by = c, |a|,|b|,|c| < 1e9, x <= max(|B|,|C|), y <= max(|A|,|C|)\n if (a < 0) return ext_gcd(-a,-b,-c);\n if (c < 0){\n pair<ll,ll> res = ext_gcd(a,b,-c);\n res.first = -res.first, res.second = -res.second;\n return res;\n }\n if (c == 0) return pair<ll,ll>(0,0);\n if (a == 0 && b == 0) return pair<ll,ll>(0,0); // answer not exist\n ll g = gcd_safe(a,b);\n if (c % g != 0) return pair<ll,ll>(0,0); // answer not exist\n a /= g, b /= g, c /= g;\n ll x, y;\n if (b == 0) return pair<ll,ll>(c,0);\n if (b > 0) ext_gcd1_plus(a,b,x,y);\n else ext_gcd1_minus(a,-b,x,y);\n x = mod_safe(x*c,abs(b));\n y = (c - a * x) / b;\n return pair<ll,ll>(x,y);\n}\n\ntemplate<typename T>\nT ceil_safe(T p, T q);\n\ntemplate<typename T>\nT floor_safe(T p, T q){\n if (q < T(0)) return floor_safe(-p,-q);\n if (p >= T(0)) return p / q;\n return -ceil_safe(-p,q);\n}\n\ntemplate<typename T>\nT ceil_safe(T p, T q){\n if (q < T(0)) return ceil_safe(-p,-q);\n if (p >= T(0)) return (p + q - 1) / q;\n return -floor_safe(-p,q);\n}\n\nstruct Eratosthenes{\n static vector<int> table;\n Eratosthenes (int Nmax = -1) {init(Nmax);}\n static void init(int Nmax){\n if (!table.empty()) return ;\n table.resize(Nmax+1,0);\n table[0] = 1, table[1] = 1;\n for (int p = 2; p <= Nmax; p++){\n if (table[p] != 0) continue;\n for (int j = p; j <= Nmax; j += p){\n table[j] = p;\n }\n }\n }\n};\nvector<int>Eratosthenes::table = vector<int>(0);\n\nvoid build_eratosthenes(const int Nmax){Eratosthenes::init(Nmax);}\n\nvector<pair<int,int>> fast_prime_factorization(int N){\n int pre = -1, cnt = 0;\n vector<pair<int,int>> res;\n while(true) {\n if (N == 1){\n if (cnt > 0) res.emplace_back(pre,cnt);\n break;\n }\n int div = Eratosthenes::table[N];\n if (pre != div){\n if (cnt > 0) res.emplace_back(pre,cnt);\n pre = div, cnt = 1;\n }\n else cnt++;\n N /= div;\n }\n return res;\n}\n\nvector<int> fast_divisor_enumeration(int N){\n auto pes = fast_prime_factorization(N);\n vector<int> res = {1};\n for (auto pe : pes){\n vector<int> nres;\n for (auto x : res){\n for (int _t = 0; _t <= pe.second; _t++){\n nres.emplace_back(x);\n x *= pe.first;\n }\n }\n swap(res,nres);\n }\n return res;\n}\n\nbool fast_is_prime(int N){\n if (N <= 1) return false;\n return Eratosthenes::table[N] == N;\n}\n\nvector<int> mobius(int N){\n vector<int> res(N+1,0);\n res[1] = 1;\n for (int p = 2; p <= N; p++){\n if (fast_is_prime(p)){\n for (int i = N/p; i > 0; i--){\n res[i*p] = -res[i];\n }\n }\n }\n return res;\n};\n\nvector<pair<ll,int>> prime_factorization(ll N){\n vector<pair<ll,int>> res;\n ll iN = N;\n for (ll d = 2; d * d <= N; d++){\n if (iN % d != 0) continue;\n if (iN == 1) break;\n int ie = 0;\n while (iN % d == 0) iN /= d, ie++;\n res.emplace_back(d,ie);\n }\n if (iN != 1) res.emplace_back(iN,1);\n return res;\n}\n\nvector<ll> divisor_enumeration(ll N){\n vector<ll> res;\n for (ll d = 1; d * d <= N; d++){\n if (N % d != 0) continue;\n res.emplace_back(d);\n if (d * d != N) res.emplace_back(N/d);\n }\n return res;\n}\n\nbool is_prime(ll N){\n if (N <= 1) return false;\n if (N <= 3) return true;\n if (N % 2 == 0) return false;\n for (ll d = 3; d * d <= N; d += 2){\n if (N % d == 0) return false;\n }\n return true;\n}\n\n}// namespace noya2\n#line 8 \"geometry2D.hpp\"\n\nnamespace noya2{\n\nusing namespace std;\nusing ld = long double;\n\ntemplate<typename T>\nstruct Vec {\n T x, y;\n Vec (T _x = T(0), T _y = T(0)) : x(_x), y(_y) {}\n Vec& operator*=(const T& a){\n x *= a;\n y *= a;\n return *this;\n }\n Vec& operator/=(const T& a){\n x /= a;\n y /= a;\n return *this;\n }\n Vec& operator+=(const Vec& rhs) {\n x += rhs.x;\n y += rhs.y;\n return *this;\n }\n Vec& operator-=(const Vec& rhs) {\n x -= rhs.x;\n y -= rhs.y;\n return *this;\n }\n friend bool operator==(const Vec& lhs, const Vec& rhs) {\n return lhs.x == rhs.x && lhs.y == rhs.y;\n }\n friend bool operator!=(const Vec& lhs, const Vec& rhs) {\n return lhs.x != rhs.x || lhs.y != rhs.y;\n }\n friend Vec operator+(const Vec& lhs, const Vec& rhs) {\n return Vec(lhs) += rhs;\n }\n friend Vec operator-(const Vec& lhs, const Vec& rhs) {\n return Vec(lhs) -= rhs;\n }\n friend Vec operator*(const Vec& lhs, const T& rhs) {\n return Vec(lhs) *= rhs;\n }\n friend Vec operator*(const T& rhs, const Vec& lhs) {\n return Vec(lhs) *= rhs;\n }\n friend Vec operator/(const Vec& lhs, const T& rhs) {\n return Vec(lhs) /= rhs;\n }\n friend Vec operator/(const T& rhs, const Vec& lhs) {\n return Vec(lhs) /= rhs;\n }\n ld norm(){\n return sqrtl(ld(x*x+y*y));\n }\n T norm2(){\n return x*x+y*y;\n }\n};\n\ntemplate<typename T>\nT dot(const Vec<T> &a, const Vec<T> &b){\n return a.x * b.x + a.y * b.y;\n}\n\n// cross > 0 : counter clockwise a -> b\ntemplate<typename T>\nT cross(const Vec<T> &a, const Vec<T> &b){\n return a.x * b.y - a.y * b.x;\n}\n\n// T = int, ll\n// number of lattice points ( point(x,y) s.t. x in Z and y in Z ) on Vec a\ntemplate<typename T>\nT lattice_points(const Vec<T> &a){\n return gcd_safe(a.x,a.y) + 1;\n}\n\n// e : vec(OX)\n// orthant k : [ pi/2 * k, pi/2 * (k+1) ) rad\n// orthant 4 is NOT expected\ntemplate<typename T>\nint orthant(const Vec<T> &e, const Vec<T> &p){\n T _dot = dot(e,p), _cross = cross(e,p);\n if (_dot > 0 && _cross >= 0) return 0;\n if (_dot <= 0 && _cross > 0) return 1;\n if (_dot < 0 && _cross <= 0) return 2;\n if (_dot >= 0 && _cross < 0) return 3;\n return 4;\n}\n\n// usage : \n// vector<Vec<ll>> vec;\n// sort(vec.begin(),vec.end(),comp_for_argument_sort<ll>);\ntemplate<typename T>\nbool comp_for_argument_sort(const Vec<T> &lhs, const Vec<T> &rhs){\n int pl = orthant(Vec<T>(1,0),lhs), pr = orthant(Vec<T>(1,0),rhs);\n if (pl == pr){\n return cross(lhs,rhs) > 0;\n }\n return pl < pr;\n}\n\n// DISTINCT points are given\n// ans[0] --- ans[1] --- ... --- ans[k-1] --- ans[k] --- ans[0]\n// upper_hull --- lower_hull\n// upper_hull : x is from small to large\n// lower hull : x is from large to small\n// points rearranged counter clockwise\ntemplate<typename T>\nvector<Vec<T>> convex_hull(vector<Vec<T>> a){\n int n = a.size();\n if (n <= 2) return a;\n using vec = Vec<T>;\n auto comp = [&](vec lhs, vec rhs){\n if (lhs.x == rhs.x) return lhs.y < rhs.y;\n return lhs.x < rhs.x;\n };\n sort(a.begin(),a.end(),comp);\n stack<int> uid, did;\n uid.push(0);\n vec ri = a[n-1];\n for (int i = 1; i < n-1; i++){\n vec le = a[uid.top()];\n if (cross(ri-le,a[i]-le) > 0){\n while (uid.size() >= 2){\n int test = uid.top(); uid.pop();\n vec from = a[uid.top()];\n if (cross(a[i]-from,a[test]-from) > 0){\n uid.push(test);\n break;\n }\n }\n uid.push(i);\n }\n }\n did.push(0);\n for (int i = 1; i < n-1; i++){\n vec le = a[did.top()];\n if (cross(ri-le,a[i]-le) < 0){\n while (did.size() >= 2){\n int test = did.top(); did.pop();\n vec from = a[did.top()];\n if (cross(a[i]-from,a[test]-from) < 0){\n did.push(test);\n break;\n }\n }\n did.push(i);\n }\n }\n vector<int> ids(1,n-1);\n while (!did.empty()) ids.emplace_back(did.top()), did.pop();\n reverse(ids.begin(),ids.end());\n while (!uid.empty()) ids.emplace_back(uid.top()), uid.pop();\n ids.pop_back();\n vector<vec> ans(ids.size());\n for (int i = 0; i < (int)(ids.size()); i++){\n ans[i] = a[ids[i]];\n }\n return ans;\n}\n\nusing ll = long long;\nstruct Line{\n ll a, b, c; // ax + by = c\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 }\n static Line get_Line(ll x1, ll y1, ll ex, ll ey){ // y = ey/ex (x - x1) + y1 \n return Line(ey,-ex,ey*x1-ex*y1);\n }\n static Line vertical_Line(ll x1, ll y1, ll x2, ll y2){ // perpendicular bisector\n ll ex = y2 - y1, ey = x1 - x2;\n return Line(ey*2,-ex*2,ey*(x1+x2)-ex*(y1+y2));\n }\n void slide(const Vec<ll> &v){ // ax + by = c -> a(x - vx) + b(y - vy) = c\n c += a * v.x + b * v.y;\n }\n //Vec<ll> normal_Vec(const Vec<ll> &from){}\n ld dist_from_point(const Vec<ll> &from){\n return abs(ld(a) * ld(from.x) + ld(b) * ld(from.y) - ld(c)) / sqrtl(ld(a*a+b*b));\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\nstruct Directed_Line{\n Vec<ll> from, direct; // Line : from + k * direct\n void normalize(){\n ll g = gcd_safe(direct.x,direct.y);\n direct /= g;\n }\n Directed_Line (ll x_from = 0, ll y_from = 0, ll x_to = 1, ll y_to = 0){\n from.x = x_from, from.y = y_from;\n direct.x = x_to - x_from;\n direct.y = y_to - y_from;\n normalize();\n }\n Directed_Line (Vec<ll> _from, Vec<ll> _to){\n from = _from;\n direct = _to - _from;\n normalize();\n }\n bool in(const Vec<ll> &r, bool on){\n ll z = cross(direct,r-from);\n if (z == 0) return on;\n return z > 0;\n }\n bool slide_if_smaller(const Vec<ll> &v){\n if (in(from+v,false)){\n from += v;\n return true;\n }\n return false;\n }\n Directed_Line slide(const Vec<ll> &v){\n auto res = *this;\n res.from += v;\n return res;\n }\n};\n\n\n// two line segments AB and CD shared at least one point\nbool check_intersection(ll ax, ll ay, ll bx, ll by, ll cx, ll cy, ll dx, ll dy){\n // both AB and CD are parallel to y-axis \n if (ax == bx && cx == dx){\n if (ax != cx) return false;\n return (min(ay,by) <= max(cy,dy)) && (min(cy,dy) <= max(ay,by));\n }\n // change to cx != dx \n if (cx == dx){\n swap(ax,cx), swap(ay,cy);\n swap(bx,dx), swap(by,dy);\n }\n // change to ax >= bx\n if (ax < bx){\n swap(ax,bx), swap(ay,by);\n }\n // change to cx >= dx\n if (cx < dx){\n swap(cx,dx), swap(cy,dy);\n }\n // AB is parallel to y-axis\n if (ax == bx){\n __int128_t lv = __int128_t(cx - dx) * __int128_t(min(ay,by) - dy);\n __int128_t mv = __int128_t(cy - dy) * __int128_t(ax - dx);\n __int128_t rv = __int128_t(cx - dx) * __int128_t(max(ay,by) - dy);\n return lv <= mv && mv <= rv;\n }\n // both AB and CD are NOT parallel to y-axis\n ll gAB = gcd_safe(ay-by,ax-bx);\n ll pAB = (ax-bx) / gAB, qAB = (ay-by) / gAB;\n ll gCD = gcd_safe(cy-dy,cx-dx);\n ll pCD = (cx-dx) / gCD, qCD = (cy-dy) / gCD;\n // AB and CD are parallel\n if (pAB == pCD && qAB == qCD){\n if (bx == dx){\n return by == dy;\n }\n ll gDB = gcd_safe(dy-by,dx-bx);\n ll pDB = (dx-bx) / gDB, qDB = (dy-by) / gDB;\n if (bx > dx){\n pDB = -pDB;\n qDB = -qDB;\n }\n // Line AB = Line CD\n if (pDB == pAB && qDB == qAB){\n return bx <= cx && dx <= ax;\n }\n return false;\n }\n // AB and CD are NOT parallel\n __int128_t tal = __int128_t(cx - dx) * __int128_t(ay - cy); // ta = tal - tar\n __int128_t tar = __int128_t(cy - dy) * __int128_t(ax - cx); // ta <=> 0 == tal <=> tar\n __int128_t tbl = __int128_t(cx - dx) * __int128_t(by - cy); // tb = tbl - tbr\n __int128_t tbr = __int128_t(cy - dy) * __int128_t(bx - cx); // tb <=> 0 == tbl <=> tbr\n __int128_t tcl = __int128_t(ax - bx) * __int128_t(cy - ay); // tc = tcl - tcr\n __int128_t tcr = __int128_t(ay - by) * __int128_t(cx - ax); // tc <=> 0 == tcl <=> tcr\n __int128_t tdl = __int128_t(ax - bx) * __int128_t(dy - ay); // td = tdl - tdr\n __int128_t tdr = __int128_t(ay - by) * __int128_t(dx - ax); // td <=> 0 == tdl <=> tdr\n // ta * tb <= 0 && tc * td <= 0 -> true\n // ta > 0 && tb > 0 -> false\n if ((tal > tar && tbl > tbr) || (tal < tar && tbl < tbr)){\n return false;\n }\n // tc > 0 && td > 0 -> false\n if ((tcl > tcr && tdl > tdr) || (tcl < tcr && tdl < tdr)){\n return false;\n }\n return true;\n}\n\n} // namespace noya2\n#line 66 \"f.cpp\"\n\nusing vec = Vec<rat>;\n\nconst vector<vector<int>> order = {{0,1,2},{0,2,1},{1,0,2},{1,2,0},{2,0,1},{2,1,0}};\n\nbool mat2(vec a0, vec a1, vec b, vec &res){\n res = vec(b.x * a1.y - b.y * a1.x, b.y * a0.x - b.x * a0.y);\n rat d = cross(a0,a1);\n if (d == 0) return false;\n res /= d;\n return true;\n}\n\nvoid solve(){\n ll xx;\n while (std::cin >> xx){\n vector<vec> ia(3), b(3);\n {\n ll y;\n std::cin >> y;\n ia[0] = {xx, y};\n }\n rep(i,6){\n if(i == 0) continue;\n ll x, y; cin >> x >> y;\n (i < 3 ? ia[i] : b[i-3]) = vec(x,y);\n }\n int ans = 5;\n for (auto fid : order) for (auto tid : order) rep(j,2){\n auto a = ia;\n int cur = 0;\n rep(i,3){\n int f = fid[i], t = tid[i];\n if (a[f] == b[t]) continue;\n cur++;\n int p = (f+1)%3, q = (f+2)%3;\n if (cross(a[p]-a[q],b[t]-a[f]) == 0){\n a[f] = b[t];\n continue;\n }\n cur++;\n if (j == 1) swap(p,q);\n vec ab;\n if (mat2(a[f]-b[t],a[p]-a[f],a[q]-a[p],ab)){\n a[q] += ab.y * (a[f]-a[p]);\n a[f] = b[t];\n }\n else {\n cur = 1000;\n break;\n }\n }\n chmin(ans,cur);\n }\n if (ans == 5) out(\"Many\");\n else out(ans);\n }\n}\n\nint main(){\n fast_io();\n int t = 1; //cin >> t;\n while(t--) solve();\n}","accuracy":1,"time_ms":850,"memory_kb":3520,"score_of_the_acc":-1.057,"final_rank":19},{"submission_id":"aoj_1623_7780702","code_snippet":"#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <chrono>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstddef>\n#include <cstdint>\n#include <cstdlib>\n#include <cstring>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <limits>\n#include <map>\n#include <memory>\n#include <numeric>\n#include <optional>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <type_traits>\n#include <unordered_map>\n#include <unordered_set>\n#include <utility>\n#include <vector>\n\n/* macro */\n\n#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)\n#define rrep(i, a, n) for (int i = ((int)(n - 1)); i >= (int)(a); i--)\n#define Rep(i, a, n) for (i64 i = (i64)(a); i < (i64)(n); i++)\n#define RRep(i, a, n) for (i64 i = ((i64)(n - i64(1))); i >= (i64)(a); i--)\n#define all(v) (v).begin(), (v).end()\n#define rall(v) (v).rbegin(), (v).rend()\n#define Bit(n) (1LL << (n))\n\n/* macro end */\n\n/* template */\n\nnamespace ebi {\n\n#ifdef LOCAL\n#define debug(...) \\\n std::cerr << \"LINE: \" << __LINE__ << \" [\" << #__VA_ARGS__ << \"]:\", \\\n debug_out(__VA_ARGS__)\n#else\n#define debug(...)\n#endif\n\nvoid debug_out() { std::cerr << std::endl; }\n\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head h, Tail... t) {\n std::cerr << \" \" << h;\n if (sizeof...(t) > 0) std::cout << \" :\";\n debug_out(t...);\n}\n\ntemplate <typename T1, typename T2>\nstd::ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &pa) {\n return os << pa.first << \" \" << pa.second;\n}\n\ntemplate <typename T1, typename T2>\nstd::istream &operator>>(std::istream &os, std::pair<T1, T2> &pa) {\n return os >> pa.first >> pa.second;\n}\n\ntemplate <typename T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &vec) {\n for (std::size_t i = 0; i < vec.size(); i++)\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \" \");\n return os;\n}\n\ntemplate <typename T>\nstd::istream &operator>>(std::istream &os, std::vector<T> &vec) {\n for (T &e : vec) std::cin >> e;\n return os;\n}\n\ntemplate <typename T>\nstd::ostream &operator<<(std::ostream &os, const std::optional<T> &opt) {\n if (opt) {\n os << opt.value();\n } else {\n os << \"invalid value\";\n }\n return os;\n}\n\nusing std::size_t;\nusing i32 = std::int32_t;\nusing u32 = std::uint32_t;\nusing i64 = std::int64_t;\nusing u64 = std::uint64_t;\n\ntemplate <class T, T init>\nauto make_vector(int n) {\n return std::vector<T>(n, init);\n}\n\ntemplate <class T, T init, typename Head, typename... Tail>\nauto make_vector(Head n, Tail... ts) {\n return std::vector(n, make_vector<T, init>(ts...));\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\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>\nT pow(T x, i64 n) {\n T res = 1;\n while (n > 0) {\n if (n & 1) res = res * x;\n x = x * x;\n n >>= 1;\n }\n return res;\n}\n\ntemplate <class T>\nT mod_pow(T x, i64 n, i64 mod) {\n T res = 1;\n while (n > 0) {\n if (n & 1) res = (res * x) % mod;\n x = (x * x) % mod;\n n >>= 1;\n }\n return res;\n}\n\ntemplate <class T>\nT scan() {\n T val;\n std::cin >> val;\n return val;\n}\n\ntemplate <class T>\nstruct Edge {\n int to;\n T cost;\n Edge(int _to, T _cost = 1) : to(_to), cost(_cost) {}\n};\n\ntemplate <class T>\nstruct Graph : std::vector<std::vector<Edge<T>>> {\n using std::vector<std::vector<Edge<T>>>::vector;\n void add_edge(int u, int v, T w, bool directed = false) {\n (*this)[u].emplace_back(v, w);\n if (directed) return;\n (*this)[v].emplace_back(u, w);\n }\n};\n\nstruct graph : std::vector<std::vector<int>> {\n using std::vector<std::vector<int>>::vector;\n void add_edge(int u, int v, bool directed = false) {\n (*this)[u].emplace_back(v);\n if (directed) return;\n (*this)[v].emplace_back(u);\n }\n};\n\nconstexpr i64 LNF = std::numeric_limits<i64>::max() / 4;\n\nconstexpr int INF = std::numeric_limits<int>::max() / 2;\n\nconst std::vector<int> dy = {1, 0, -1, 0, 1, 1, -1, -1};\nconst std::vector<int> dx = {0, 1, 0, -1, 1, -1, 1, -1};\n\n} // namespace ebi\n\nnamespace ebi {\n\nconstexpr long double EPS = 1e-7;\n\nconst long double PI = std::acos(-1);\n\nnamespace internal {\n\nint sgn(long double a) {\n return (a<-EPS) ? -1 : (a>EPS) ? 1 : 0;\n}\n\nlong double add(long double a, long double b) {\n if(std::abs(a+b) < EPS*(std::abs(a) + std::abs(b))) return 0;\n return a+b;\n}\n\n} // namespace internal\n\n\nlong double arg_to_radian(long double arg) {\n return PI * arg / (long double)(180);\n}\n\nstruct point {\n long double x,y;\n\n point() = default;\n\n point(long double x, long double y) : x(x), y(y) { }\n\n point &operator+=(const point rhs) noexcept {\n x = internal::add(x, rhs.x);\n y = internal::add(y, rhs.y);\n return *this;\n }\n\n point &operator-=(const point rhs) noexcept {\n x = internal::add(x, -rhs.x);\n y = internal::add(y, -rhs.y);\n return *this;\n }\n\n point &operator*=(const point rhs) noexcept {\n long double _x = internal::add(x*rhs.x, -y*rhs.y);\n long double _y = internal::add(x*rhs.y, y*rhs.x);\n x = _x;\n y = _y;\n return *this;\n }\n\n point &operator*=(const long double k) noexcept {\n x *= k;\n y *= k;\n return *this;\n }\n\n point &operator/=(const long double k) {\n assert(internal::sgn(k)!=0);\n x /= k;\n y /= k;\n return *this;\n }\n\n point operator+(const point &rhs) const noexcept {\n return point(*this) += rhs;\n }\n\n point operator-(const point &rhs) const noexcept {\n return point(*this) -= rhs;\n }\n\n point operator*(const point &rhs) const noexcept {\n return point(*this) *= rhs;\n }\n\n point operator*(const long double rhs) const noexcept {\n return point(*this) *= rhs;\n }\n\n point operator/(const long double rhs) const {\n return point(*this) /= rhs;\n }\n\n point operator-() const noexcept {\n return point(0, 0) - *this;\n }\n\n long double abs() const noexcept {\n return std::sqrt(internal::add(x*x, y*y));\n }\n\n long double dot(const point rhs) const noexcept {\n return internal::add(x*rhs.x, y*rhs.y);\n }\n\n long double det(const point rhs) const noexcept {\n return internal::add(x*rhs.y, -y*rhs.x);\n }\n\n // arctan(y/x) (単位はラジアン)\n\n long double arg() const {\n return std::atan2(y, x);\n }\n\n // x昇順, その後y昇順\n\n bool operator<(const point &rhs) const noexcept {\n if(internal::sgn(x-rhs.x)) return internal::sgn(x-rhs.x)<0;\n return internal::sgn(y-rhs.y)<0;\n }\n\n bool operator==(const point &rhs) const noexcept {\n if(internal::sgn(x - rhs.x) == 0 && internal::sgn(y - rhs.y) == 0) return true;\n else return false;\n }\n\n bool operator!=(const point &rhs) const noexcept {\n return !(*this == rhs);\n }\n};\n\nstd::ostream& operator<<(std::ostream& os, const point &a) {\n return os << a.x << \" \" << a.y;\n}\n\nstd::istream& operator>>(std::istream& os, point &a) {\n return os >> a.x >> a.y;\n}\n\npoint conj(const point &a) {\n return point(a.x, -a.y);\n}\n\n// 点a をang(ラジアン)回転する\n\npoint rot(const point &a, long double ang) {\n return point(std::cos(ang) * a.x - std::sin(ang) * a.y, std::sin(ang) * a.x + std::cos(ang) * a.y);\n} \n\npoint rot90(const point &a) {\n return point(-a.y, a.x);\n}\n\nlong double dot(const point &a, const point &b) {\n return a.dot(b);\n}\n\nlong double det(const point &a, const point &b) {\n return a.det(b);\n}\n\nlong double abs(const point &a) {\n return a.abs();\n}\n\nlong double norm(const point &a) {\n return internal::add(a.x*a.x, a.y*a.y);\n}\n\nint isp(const point &a, const point &b, const point &c) {\n int flag = internal::sgn(det(b-a,c-a));\n if(flag == 0) {\n if(internal::sgn(dot(b-a, c-a))<0) return -2;\n if(internal::sgn(dot(a-b, c-b))<0) return +2;\n }\n return flag;\n}\n\n// 分割統治で最近点対を求める O(N log N)\n\nlong double closest_pair(std::vector<point> p) {\n std::sort(p.begin(), p.end());\n int n = p.size();\n auto f = [&](auto &&self, int l, int r) -> long double {\n if(r-l == 1) {\n return 1e9;\n }\n int mid = (l+r)/2;\n long double x = p[mid].x;\n long double d = std::min(self(self, l, mid), self(self, mid, r));\n std::vector<point> b;\n b.reserve(r-l);\n int j = mid;\n for(int i = l; i < mid; i++) {\n while(j < r && p[j].y <= p[i].y) {\n b.emplace_back(p[j++]);\n }\n b.emplace_back(p[i]);\n }\n while(j < r) {\n b.emplace_back(p[j++]);\n }\n for(int i = 0; i < r-l; i++) {\n p[l+i] = b[i];\n }\n b.clear();\n for(int i = l; i < r; i++) {\n if(std::abs(p[i].x - x) >= d) continue;\n for(int j = int(b.size())-1; j >= 0; j--) {\n if(p[i].y - b[j].y >= d) break;\n d = std::min(d, abs(p[i]-b[j]));\n }\n b.emplace_back(p[i]);\n }\n return d;\n };\n return f(f, 0, n);\n}\n\n// ∠ABCを求める(ラジアン)\n\nlong double angle(const point &A, const point &B, const point &C) {\n long double a = (B - C).abs(), b = (C - A).abs(), c = (A - B).abs();\n long double cos = internal::add(internal::add(a*a, c*c), -b*b)/(2.0*c*a);\n return std::acos(cos);\n}\n\nvoid arg_sort(std::vector<point> &a) {\n int n = a.size();\n std::vector ps(4, std::vector<point>());\n auto idx = [](point v) -> int {\n if(v.y >= 0) return (v.x >= 0) ? 0 : 1;\n else return (v.x >= 0) ? 3 : 2;\n };\n for(auto p: a) {\n assert(!(p.x == 0 && p.y == 0));\n ps[idx(p)].emplace_back(p);\n }\n a.clear();\n a.reserve(n);\n for(int i = 0; i < 4; i++) {\n std::sort(ps[i].begin(), ps[i].end(), \n [](point &p1, point &p2) -> bool {\n int flag = internal::sgn(internal::add(p1.x * p2.y, - p2.x * p1.y));\n return flag == 0 ? (norm(p1) < norm(p2)) : flag > 0;\n });\n for(auto &p: ps[i]) a.emplace_back(p);\n }\n return;\n}\n\ntemplate<class T>\nvoid arg_sort_ll(std::vector<std::pair<T , T>> &a) {\n using Point = std::pair<T, T>;\n int n = a.size();\n std::vector ps(4, std::vector<Point>());\n auto idx = [](Point v) -> int {\n if(v.second >= 0) return (v.first >= 0) ? 0 : 1;\n else return (v.first >= 0) ? 3 : 2;\n };\n for(auto p: a) {\n assert(!(p.first == 0 && p.second == 0));\n ps[idx(p)].emplace_back(p);\n }\n a.clear();\n a.reserve(n);\n for(int i = 0; i < 4; i++) {\n std::sort(ps[i].begin(), ps[i].end(), \n [](Point &p1, Point &p2) -> bool { \n T flag = p1.first * p2.second - p2.first * p1.second;\n return flag == 0 ? (p1.first * p1.first + p1.second * p1.second < p2.first * p2.first + p2.second * p2.second) : flag > 0;\n });\n for(auto &p: ps[i]) a.emplace_back(p);\n }\n return;\n}\n\n}\n\nnamespace ebi {\n\nstruct line {\n point a,b;\n\n line(long double x1, long double y1, long double x2, long double y2) : a(x1, y1), b(x2, y2) { }\n\n line(const point &a, const point &b) : a(a), b(b) { }\n\n point proj(const point &p) const {\n return a + (b-a)*(dot(b-a,p-a)/norm(b-a));\n }\n\n point relf(const point &p) const {\n return proj(p)*double(2) - p;\n }\n\n long double distance(const point &c) const {\n return std::abs(det(c - a, b - a)/abs(b-a));\n }\n};\n\nint intersection(const line &a, const line &b) {\n if(internal::sgn(det(a.b-a.a, b.a-b.b)) != 0) {\n if(internal::sgn(dot(a.b-a.a, b.b-b.a)) == 0) { // 垂直\n return 1;\n }\n return 0; // 交差\n }\n else if(internal::sgn(det(a.b-a.a, b.a-a.a)) != 0) { // 平行\n return 2;\n }\n else { // 同一直線\n return 3;\n }\n}\n\npoint cross_point(const point &a, const point &b, const point &c, const point &d) {\n return a + (b-a) * det(c - a, d - c) / det(b - a, d - c);\n}\n\n// 交点があるか確認する！\npoint cross_point(const line &s, const line &t) {\n assert(intersection(s, t) < 2);\n return s.a + (s.b - s.a) * det(t.a - s.a, t.b - t.a) / det(s.b - s.a, t.b - t.a);\n}\n\n// 直線aと点cの距離\nlong double distance(const line &a, const point &c) {\n return std::abs(det(c-a.a, a.b - a.a)/abs(a.b-a.a));\n}\n\nlong double distance(const line &a, const line &b) {\n if(intersection(a, b) < 2) {\n return 0;\n }\n else {\n return distance(a, b.a);\n }\n}\n\n}\n\nnamespace ebi {\n\nstruct line_segment {\n point a, b;\n\n line_segment() = default;\n\n line_segment(long double x1, long double y1, long double x2, long double y2) : a(x1, y1), b(x2, y2) { }\n\n line_segment(const point &a, const point &b) : a(a), b(b) { }\n};\n\n// 線分ab, cd が交わるか判定\nbool intersection_line_segment(const point &a, const point &b, const point &c, const point &d) {\n if(internal::sgn(isp(a,b,c)*isp(a,b,d)) <= 0 && internal::sgn(isp(c,d,a)*isp(c,d,b)) <= 0) {\n return true;\n }\n return false;\n}\n\n// 線分ab, cd が交わるか判定\nbool intersection(const line_segment &a, const line_segment &b) {\n return intersection_line_segment(a.a, a.b, b.a, b.b);\n}\n\nbool intersection(const line &a, const line_segment &b) {\n if(internal::sgn(det(a.b - a.a, b.a - a.a)) * internal::sgn(det(a.b - a.a, b.b - a.a)) < 0) {\n return true;\n }\n else {\n return false;\n }\n}\n\npoint cross_point(const line_segment &s, const line_segment &t) {\n assert(intersection(s, t));\n return s.a + (s.b - s.a) * det(t.a - s.a, t.b - t.a) / det(s.b - s.a, t.b - t.a);\n}\n\nlong double distance(const line_segment &a, const point &c) {\n if(internal::sgn(dot(a.b - a.a, c - a.a)) < 0) {\n return abs(c-a.a);\n }\n else if(internal::sgn(dot(a.a - a.b, c - a.b)) < 0) {\n return abs(c-a.b);\n }\n else {\n return std::abs(det(c - a.a, a.b - a.a)/abs(a.b-a.a));\n }\n}\n\nlong double distance(const line_segment &a, const line_segment &b) {\n if(intersection(a, b)) {\n return 0;\n }\n else {\n return std::min(std::min(distance(a, b.a), distance(a, b.b)), std::min(distance(b, a.a), distance(b, a.b)));\n }\n}\n\nlong double distance(const line &a, const line_segment &b) {\n if(intersection(a, b)) {\n return 0;\n }\n else {\n return std::min(distance(a, b.a), distance(a, b.b));\n }\n}\n\n}\n\nnamespace ebi {\n\nvoid main_() {\n long double x;\n while (std::cin >> x) {\n long double y;\n std::vector<point> t1(3), t2(3);\n std::cin >> y;\n t1[0] = {x, y};\n std::cin >> t1[1] >> t1[2] >> t2;\n std::vector<int> idx(3), jdx(3);\n std::iota(all(idx), 0);\n std::iota(all(jdx), 0);\n int ans = INF;\n\n auto move = [&](int i, int j, int k, std::vector<point> &t, point target) -> int {\n if(t[i] == target) return 0;\n int cnt = 0;\n line l1(t[j], t[j] + target - t[i]);\n line l2(t[k], t[k] + t[i] - t[j]);\n if(intersection(l1, l2) >= 2) return 1000;\n point p = cross_point(l1, l2);\n if(p != t[k]) cnt++;\n t[k] = p;\n t[i] = target;\n cnt++;\n return cnt;\n };\n do {\n do {\n {\n int cnt = 0;\n auto t = t1;\n cnt += move(idx[0], idx[1], idx[2], t, t2[jdx[0]]);\n cnt += move(idx[1], idx[0], idx[2], t, t2[jdx[1]]);\n line_segment lseg(t[idx[2]], t2[jdx[2]]);\n if(intersection(line(t[idx[0]], t[idx[1]]), lseg)) cnt = 1000;\n if(t[idx[2]] != t2[jdx[2]]) cnt++;\n chmin(ans, cnt);\n }\n {\n int cnt = 0;\n auto t = t1;\n cnt += move(idx[0], idx[2], idx[1], t, t2[jdx[0]]);\n cnt += move(idx[1], idx[0], idx[2], t, t2[jdx[1]]);\n line_segment lseg(t[idx[2]], t2[jdx[2]]);\n if(intersection(line(t[idx[0]], t[idx[1]]), lseg)) cnt = 1000;\n if(t[idx[2]] != t2[jdx[2]]) cnt++;\n chmin(ans, cnt);\n }\n } while(std::next_permutation(all(jdx)));\n } while(std::next_permutation(all(idx)));\n if(ans >= 5) {\n std::cout << \"Many\\n\";\n continue;\n }\n std::cout << ans << '\\n';\n }\n\n}\n\n} // namespace ebi\n\nint main() {\n std::cout << std::fixed << std::setprecision(15);\n std::cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n int t = 1;\n // std::cin >> t;\n while (t--) {\n ebi::main_();\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3432,"score_of_the_acc":-0.7374,"final_rank":6},{"submission_id":"aoj_1623_7111722","code_snippet":"#include <cmath>\n#include <string>\n#include <vector>\n#include <cassert>\n#include <iostream>\n#include <algorithm>\nusing namespace std;\n\nint gcd(int x, int y) {\n\tif (y == 0) return x;\n\treturn gcd(y, x % y);\n}\n\nclass fraction {\npublic:\n\tint a, b;\n\tfraction() : a(0), b(1) {};\n\tfraction(int a_, int b_) {\n\t\tassert(b_ != 0);\n\t\tint g = gcd(abs(a_), abs(b_));\n\t\ta = a_ / g;\n\t\tb = b_ / g;\n\t\tif (b < 0) {\n\t\t\ta *= -1;\n\t\t\tb *= -1;\n\t\t}\n\t};\n\tbool operator==(const fraction& f) const {\n\t\treturn a == f.a && b == f.b;\n\t}\n\tbool operator!=(const fraction& f) const {\n\t\treturn a != f.a || b != f.b;\n\t}\n\tfraction operator+=(const fraction& f) {\n\t\t(*this) = fraction(a * f.b + f.a * b, b * f.b);\n\t\treturn (*this);\n\t}\n\tfraction operator-=(const fraction& f) {\n\t\t(*this) = fraction(a * f.b - f.a * b, b * f.b);\n\t\treturn (*this);\n\t}\n\tfraction operator*=(const fraction& f) {\n\t\t(*this) = fraction(a * f.a, b * f.b);\n\t\treturn (*this);\n\t}\n\tfraction operator/=(const fraction& f) {\n\t\tassert(f.a != 0);\n\t\t(*this) = fraction(a * f.b, b * f.a);\n\t\treturn (*this);\n\t}\n\tfraction operator+(const fraction& f) const {\n\t\treturn fraction(*this) += f;\n\t}\n\tfraction operator-(const fraction& f) const {\n\t\treturn fraction(*this) -= f;\n\t}\n\tfraction operator*(const fraction& f) const {\n\t\treturn fraction(*this) *= f;\n\t}\n\tfraction operator/(const fraction& f) const {\n\t\treturn fraction(*this) /= f;\n\t}\n\tstring to_string() const {\n\t\treturn std::to_string(a) + \"/\" + std::to_string(b);\n\t}\n};\n\nclass point2d {\npublic:\n\tfraction x, y;\n\tpoint2d() : x(fraction()), y(fraction()) {};\n\tpoint2d(const fraction& x_, const fraction& y_) : x(x_), y(y_) {};\n\tbool operator==(const point2d& p) const {\n\t\treturn x == p.x && y == p.y;\n\t}\n\tbool operator!=(const point2d& p) const {\n\t\treturn x != p.x || y != p.y;\n\t}\n\tpoint2d& operator+=(const point2d& p) {\n\t\tx += p.x;\n\t\ty += p.y;\n\t\treturn (*this);\n\t}\n\tpoint2d& operator-=(const point2d& p) {\n\t\tx -= p.x;\n\t\ty -= p.y;\n\t\treturn (*this);\n\t}\n\tpoint2d& operator*=(const fraction& f) {\n\t\tx *= f;\n\t\ty *= f;\n\t\treturn (*this);\n\t}\n\tpoint2d& operator/=(const fraction& f) {\n\t\tx /= f;\n\t\ty /= f;\n\t\treturn (*this);\n\t}\n\tpoint2d operator+(const point2d& p) const {\n\t\treturn point2d(*this) += p;\n\t}\n\tpoint2d operator-(const point2d& p) const {\n\t\treturn point2d(*this) -= p;\n\t}\n\tpoint2d operator*(const fraction& f) const {\n\t\treturn point2d(*this) *= f;\n\t}\n\tpoint2d operator/(const fraction& f) const {\n\t\treturn point2d(*this) /= f;\n\t}\n\tfraction dot(const point2d& p) const {\n\t\treturn x * p.x + y * p.y;\n\t}\n\tfraction cross(const point2d& p) const {\n\t\treturn x * p.y - y * p.x;\n\t}\n};\n\nconst int INF = 1012345678;\n\n// find status of crossing of two lines [p1 + v1 * t and p2 + v2 * t]\nint cross_status(const point2d& p1, const point2d& v1, const point2d& p2, const point2d& v2) {\n\tassert(!(v1.x == fraction(0, 1) && v1.y == fraction(0, 1)) && !(v2.x == fraction(0, 1) && v2.y == fraction(0, 1)));\n\tif (v1.cross(v2) != fraction(0, 1)) {\n\t\treturn 100; // one cross point\n\t}\n\tif ((p2 - p1).cross(v1) != fraction(0, 1)) {\n\t\treturn 101; // no cross point\n\t}\n\treturn 102; // cross line\n}\n\n// find cross point of two lines [p1 + v1 * t and p2 + v2 * t]\npoint2d cross_point(const point2d& p1, const point2d& v1, const point2d& p2, const point2d& v2) {\n\tassert(cross_status(p1, v1, p2, v2) == 100);\n\t// p1 + v1 * t1 = p2 + v2 * t2\n\t// ==> (-v1) * t1 + v2 * t2 = p1 - p2\n\t// ==> [ -v1, v2 ] * [ [ t1 ], [ t2 ] ] = p1 - p2\n\t// ==> [ [ t1 ], [ t2 ] ] = [ -v1, v2 ]^-1 * (p1 - p2) = 1/(-v1.x*v2.y+v1.y*v2.x) * [ [ v2.y, -v2.x ], [ v1.y, -v1.x ] ] * (p1 - p2)\n\tfraction detinv = fraction(1, 1) / (v1.y * v2.x - v1.x * v2.y);\n\tfraction t1 = detinv * (v2.y * (p1 - p2).x - v2.x * (p1 - p2).y);\n\treturn p1 + v1 * t1;\n}\n\n// solve for 0->1->0 case\nbool solve_010(const vector<point2d>& TA, const vector<point2d>& TB) {\n\tassert(TA[2] == TB[2]);\n\tint status = cross_status(TA[0], TA[2] - TA[1], TB[0], TB[2] - TB[1]);\n\tif (status == 100) {\n\t\tpoint2d p = cross_point(TA[0], TA[2] - TA[1], TB[0], TB[2] - TB[1]);\n\t\treturn ((TB[1] - TA[1]).cross(TA[2] - p) == fraction(0, 1));\n\t}\n\tif (status == 101) {\n\t\treturn false;\n\t}\n\tif (status == 102) {\n\t\treturn false;\n\t}\n\treturn false;\n}\n\n// solve for specific case\nint solve_target(const vector<point2d>& TA, const vector<point2d>& TB) {\n\t// step #1. check for 0->1->2\n\tbool flag1 = true;\n\tif ((TB[0] - TA[0]).cross(TA[2] - TA[1]) != fraction(0, 1)) flag1 = false;\n\tif ((TB[1] - TA[1]).cross(TA[2] - TB[0]) != fraction(0, 1)) flag1 = false;\n\tif ((TB[2] - TA[2]).cross(TB[1] - TB[0]) != fraction(0, 1)) flag1 = false;\n\tif (flag1 == true) {\n\t\treturn 3;\n\t}\n\n\t// step #2. check for 0->1->0->2\n\tif ((TB[2] - TA[2]).cross(TB[1] - TB[0]) == fraction(0, 1)) {\n\t\tbool flag2 = solve_010(TA, vector<point2d>({ TB[0], TB[1], TA[2] }));\n\t\tif (flag2 == true) {\n\t\t\treturn 4;\n\t\t}\n\t}\n\n\t// step #3. check for 2->0->1->0\n\tif ((TB[2] - TA[2]).cross(TA[1] - TA[0]) == fraction(0, 1)) {\n\t\tbool flag3 = solve_010(vector<point2d>({ TA[0], TA[1], TB[2] }), TB);\n\t\tif (flag3 == true) {\n\t\t\treturn 4;\n\t\t}\n\t}\n\n\t// step #4. check for 0->1->2->0\n\tint status = cross_status(TA[0], TA[2] - TA[1], TB[0], TB[2] - TB[1]);\n\tif (status == 100) {\n\t\tpoint2d p = cross_point(TA[0], TA[2] - TA[1], TB[0], TB[2] - TB[1]);\n\t\tbool flag4 = true;\n\t\tif ((TB[1] - TA[1]).cross(TA[2] - p) != fraction(0, 1)) flag4 = false;\n\t\tif ((TB[2] - TA[2]).cross(TB[1] - p) != fraction(0, 1)) flag4 = false;\n\t\tif (flag4 == true) {\n\t\t\treturn 4;\n\t\t}\n\t}\n\tif (status == 101) {\n\t\t// NO CHANCE!\n\t}\n\tif (status == 102) {\n\t\tfraction c1 = (TB[0] - TA[0]).cross(TA[1] - TA[0]);\n\t\tfraction c2 = (TB[0] - TA[0]).cross(TB[1] - TB[0]);\n\t\tfraction c3 = (TA[2] - TA[1]).cross(TB[1] - TA[1]);\n\t\tif ((c1.a > 0) == (c2.a > 0) && c3.a != 0) {\n\t\t\treturn 4;\n\t\t}\n\t}\n\n\t// no chance\n\treturn INF;\n}\n\n// solve for general case\nint solve(const vector<point2d>& TA, const vector<point2d>& TB) {\n\tconst vector<vector<int> > perms = { { 0, 1, 2 }, { 0, 2, 1 }, { 1, 0, 2 }, { 1, 2, 0 }, { 2, 0, 1 }, { 2, 1, 0 } };\n\tint res = INF;\n\tfor (int i = 0; i < 6; i++) {\n\t\tfor (int j = 0; j < 6; j++) {\n\t\t\tint subres = solve_target(vector<point2d>({ TA[perms[i][0]], TA[perms[i][1]], TA[perms[i][2]] }), vector<point2d>({ TB[perms[j][0]], TB[perms[j][1]], TB[perms[j][2]] }));\n\t\t\t// cout << i << ' ' << j << ' ' << subres << endl;\n\t\t\tres = min(res, subres);\n\t\t}\n\t}\n\treturn res;\n}\n\nint main() {\n\tint x, y;\n\twhile (cin >> x >> y) {\n\t\tvector<point2d> TA(3), TB(3);\n\t\tTA[0].x = fraction(x, 1);\n\t\tTA[0].y = fraction(y, 1);\n\t\tfor (int i = 1; i < 3; i++) {\n\t\t\tcin >> x >> y;\n\t\t\tTA[i].x = fraction(x, 1);\n\t\t\tTA[i].y = fraction(y, 1);\n\t\t}\n\t\tfor (int i = 0; i < 3; i++) {\n\t\t\tcin >> x >> y;\n\t\t\tTB[i].x = fraction(x, 1);\n\t\t\tTB[i].y = fraction(y, 1);\n\t\t}\n\t\tint res = solve(TA, TB);\n\t\tif (res != INF) {\n\t\t\tcout << res << endl;\n\t\t}\n\t\telse {\n\t\t\tcout << \"Many\" << endl;\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":60,"memory_kb":3348,"score_of_the_acc":-0.5401,"final_rank":2},{"submission_id":"aoj_1623_6788750","code_snippet":"#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <chrono>\n#include <climits>\n#include <cmath>\n#include <complex>\n#include <cstddef>\n#include <cstdint>\n#include <cstdlib>\n#include <cstring>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <limits>\n#include <map>\n#include <memory>\n#include <numeric>\n#include <optional>\n#include <queue>\n#include <random>\n#include <set>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <type_traits>\n#include <unordered_map>\n#include <unordered_set>\n#include <utility>\n#include <vector>\n\n/* macro */\n\n#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)\n#define rrep(i, a, n) for (int i = ((int)(n - 1)); i >= (int)(a); i--)\n#define Rep(i, a, n) for (i64 i = (i64)(a); i < (i64)(n); i++)\n#define RRep(i, a, n) for (i64 i = ((i64)(n - i64(1))); i >= (i64)(a); i--)\n#define all(v) (v).begin(), (v).end()\n#define rall(v) (v).rbegin(), (v).rend()\n#define Bit(n) (1LL << (n))\n\n/* macro end */\n\n/* template */\n\nnamespace ebi {\n\n#ifdef LOCAL\n#define debug(...) \\\n std::cerr << \"LINE: \" << __LINE__ << \" [\" << #__VA_ARGS__ << \"]:\", \\\n debug_out(__VA_ARGS__)\n#else\n#define debug(...)\n#endif\n\nvoid debug_out() { std::cerr << std::endl; }\n\ntemplate <typename Head, typename... Tail>\nvoid debug_out(Head h, Tail... t) {\n std::cerr << \" \" << h;\n if (sizeof...(t) > 0) std::cout << \" :\";\n debug_out(t...);\n}\n\ntemplate <typename T1, typename T2>\nstd::ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &pa) {\n return os << pa.first << \" \" << pa.second;\n}\n\ntemplate <typename T1, typename T2>\nstd::istream &operator>>(std::istream &os, std::pair<T1, T2> &pa) {\n return os >> pa.first >> pa.second;\n}\n\ntemplate <typename T>\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &vec) {\n for (std::size_t i = 0; i < vec.size(); i++)\n os << vec[i] << (i + 1 == vec.size() ? \"\" : \" \");\n return os;\n}\n\ntemplate <typename T>\nstd::istream &operator>>(std::istream &os, std::vector<T> &vec) {\n for (T &e : vec) std::cin >> e;\n return os;\n}\n\ntemplate <typename T>\nstd::ostream &operator<<(std::ostream &os, const std::optional<T> &opt) {\n if (opt) {\n os << opt.value();\n } else {\n os << \"invalid value\";\n }\n return os;\n}\n\nusing std::size_t;\nusing i32 = std::int32_t;\nusing u32 = std::uint32_t;\nusing i64 = std::int64_t;\nusing u64 = std::uint64_t;\n\ntemplate <class T, T init>\nauto make_vector(int n) {\n return std::vector<T>(n, init);\n}\n\ntemplate <class T, T init, typename Head, typename... Tail>\nauto make_vector(Head n, Tail... ts) {\n return std::vector(n, make_vector<T, init>(ts...));\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\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>\nT pow(T x, i64 n) {\n T res = 1;\n while (n > 0) {\n if (n & 1) res = res * x;\n x = x * x;\n n >>= 1;\n }\n return res;\n}\n\ntemplate <class T>\nT mod_pow(T x, i64 n, i64 mod) {\n T res = 1;\n while (n > 0) {\n if (n & 1) res = (res * x) % mod;\n x = (x * x) % mod;\n n >>= 1;\n }\n return res;\n}\n\ntemplate <class T>\nT scan() {\n T val;\n std::cin >> val;\n return val;\n}\n\ntemplate <class T>\nstruct Edge {\n int to;\n T cost;\n Edge(int _to, T _cost = 1) : to(_to), cost(_cost) {}\n};\n\ntemplate <class T>\nstruct Graph : std::vector<std::vector<Edge<T>>> {\n using std::vector<std::vector<Edge<T>>>::vector;\n void add_edge(int u, int v, T w, bool directed = false) {\n (*this)[u].emplace_back(v, w);\n if (directed) return;\n (*this)[v].emplace_back(u, w);\n }\n};\n\nstruct graph : std::vector<std::vector<int>> {\n using std::vector<std::vector<int>>::vector;\n void add_edge(int u, int v, bool directed = false) {\n (*this)[u].emplace_back(v);\n if (directed) return;\n (*this)[v].emplace_back(u);\n }\n};\n\nconstexpr i64 LNF = std::numeric_limits<i64>::max() / 4;\n\nconstexpr int INF = std::numeric_limits<int>::max() / 2;\n\nconst std::vector<int> dy = {1, 0, -1, 0, 1, 1, -1, -1};\nconst std::vector<int> dx = {0, 1, 0, -1, 1, -1, 1, -1};\n\n} // namespace ebi\n\nnamespace ebi {\n\nconstexpr long double EPS = 1e-7;\n\nconst long double PI = std::acos(-1);\n\nnamespace internal {\n\nint sgn(long double a) {\n return (a<-EPS) ? -1 : (a>EPS) ? 1 : 0;\n}\n\nlong double add(long double a, long double b) {\n if(std::abs(a+b) < EPS*(std::abs(a) + std::abs(b))) return 0;\n return a+b;\n}\n\n} // namespace internal\n\n\nlong double arg_to_radian(long double arg) {\n return PI * arg / (long double)(180);\n}\n\nstruct point {\n long double x,y;\n\n point() = default;\n\n point(long double x, long double y) : x(x), y(y) { }\n\n point &operator+=(const point rhs) noexcept {\n x = internal::add(x, rhs.x);\n y = internal::add(y, rhs.y);\n return *this;\n }\n\n point &operator-=(const point rhs) noexcept {\n x = internal::add(x, -rhs.x);\n y = internal::add(y, -rhs.y);\n return *this;\n }\n\n point &operator*=(const point rhs) noexcept {\n long double _x = internal::add(x*rhs.x, -y*rhs.y);\n long double _y = internal::add(x*rhs.y, y*rhs.x);\n x = _x;\n y = _y;\n return *this;\n }\n\n point &operator*=(const long double k) noexcept {\n x *= k;\n y *= k;\n return *this;\n }\n\n point &operator/=(const long double k) {\n assert(internal::sgn(k)!=0);\n x /= k;\n y /= k;\n return *this;\n }\n\n point operator+(const point &rhs) const noexcept {\n return point(*this) += rhs;\n }\n\n point operator-(const point &rhs) const noexcept {\n return point(*this) -= rhs;\n }\n\n point operator*(const point &rhs) const noexcept {\n return point(*this) *= rhs;\n }\n\n point operator*(const long double rhs) const noexcept {\n return point(*this) *= rhs;\n }\n\n point operator/(const long double rhs) const {\n return point(*this) /= rhs;\n }\n\n point operator-() const noexcept {\n return point(0, 0) - *this;\n }\n\n long double abs() const noexcept {\n return std::sqrt(internal::add(x*x, y*y));\n }\n\n long double dot(const point rhs) const noexcept {\n return internal::add(x*rhs.x, y*rhs.y);\n }\n\n long double det(const point rhs) const noexcept {\n return internal::add(x*rhs.y, -y*rhs.x);\n }\n\n // arctan(y/x) (単位はラジアン)\n\n long double arg() const {\n return std::atan2(y, x);\n }\n\n // x昇順, その後y昇順\n\n bool operator<(const point &rhs) const noexcept {\n if(internal::sgn(x-rhs.x)) return internal::sgn(x-rhs.x)<0;\n return internal::sgn(y-rhs.y)<0;\n }\n\n bool operator==(const point &rhs) const noexcept {\n if(internal::sgn(x - rhs.x) == 0 && internal::sgn(y - rhs.y) == 0) return true;\n else return false;\n }\n\n bool operator!=(const point &rhs) const noexcept {\n return !(*this == rhs);\n }\n};\n\nstd::ostream& operator<<(std::ostream& os, const point &a) {\n return os << a.x << \" \" << a.y;\n}\n\nstd::istream& operator>>(std::istream& os, point &a) {\n return os >> a.x >> a.y;\n}\n\npoint conj(const point &a) {\n return point(a.x, -a.y);\n}\n\n// 点a をang(ラジアン)回転する\n\npoint rot(const point &a, long double ang) {\n return point(std::cos(ang) * a.x - std::sin(ang) * a.y, std::sin(ang) * a.x + std::cos(ang) * a.y);\n} \n\npoint rot90(const point &a) {\n return point(-a.y, a.x);\n}\n\nlong double dot(const point &a, const point &b) {\n return a.dot(b);\n}\n\nlong double det(const point &a, const point &b) {\n return a.det(b);\n}\n\nlong double abs(const point &a) {\n return a.abs();\n}\n\nlong double norm(const point &a) {\n return internal::add(a.x*a.x, a.y*a.y);\n}\n\nint isp(const point &a, const point &b, const point &c) {\n int flag = internal::sgn(det(b-a,c-a));\n if(flag == 0) {\n if(internal::sgn(dot(b-a, c-a))<0) return -2;\n if(internal::sgn(dot(a-b, c-b))<0) return +2;\n }\n return flag;\n}\n\n// 分割統治で最近点対を求める O(N log N)\n\nlong double closest_pair(std::vector<point> p) {\n std::sort(p.begin(), p.end());\n int n = p.size();\n auto f = [&](auto &&self, int l, int r) -> long double {\n if(r-l == 1) {\n return 1e9;\n }\n int mid = (l+r)/2;\n long double x = p[mid].x;\n long double d = std::min(self(self, l, mid), self(self, mid, r));\n std::vector<point> b;\n b.reserve(r-l);\n int j = mid;\n for(int i = l; i < mid; i++) {\n while(j < r && p[j].y <= p[i].y) {\n b.emplace_back(p[j++]);\n }\n b.emplace_back(p[i]);\n }\n while(j < r) {\n b.emplace_back(p[j++]);\n }\n for(int i = 0; i < r-l; i++) {\n p[l+i] = b[i];\n }\n b.clear();\n for(int i = l; i < r; i++) {\n if(std::abs(p[i].x - x) >= d) continue;\n for(int j = int(b.size())-1; j >= 0; j--) {\n if(p[i].y - b[j].y >= d) break;\n d = std::min(d, abs(p[i]-b[j]));\n }\n b.emplace_back(p[i]);\n }\n return d;\n };\n return f(f, 0, n);\n}\n\n// ∠ABCを求める(ラジアン)\n\nlong double angle(const point &A, const point &B, const point &C) {\n long double a = (B - C).abs(), b = (C - A).abs(), c = (A - B).abs();\n long double cos = internal::add(internal::add(a*a, c*c), -b*b)/(2.0*c*a);\n return std::acos(cos);\n}\n\nvoid arg_sort(std::vector<point> &a) {\n int n = a.size();\n std::vector ps(4, std::vector<point>());\n auto idx = [](point v) -> int {\n if(v.y >= 0) return (v.x >= 0) ? 0 : 1;\n else return (v.x >= 0) ? 3 : 2;\n };\n for(auto p: a) {\n assert(!(p.x == 0 && p.y == 0));\n ps[idx(p)].emplace_back(p);\n }\n a.clear();\n a.reserve(n);\n for(int i = 0; i < 4; i++) {\n std::sort(ps[i].begin(), ps[i].end(), \n [](point &p1, point &p2) -> bool {\n int flag = internal::sgn(internal::add(p1.x * p2.y, - p2.x * p1.y));\n return flag == 0 ? (norm(p1) < norm(p2)) : flag > 0;\n });\n for(auto &p: ps[i]) a.emplace_back(p);\n }\n return;\n}\n\ntemplate<class T>\nvoid arg_sort_ll(std::vector<std::pair<T , T>> &a) {\n using Point = std::pair<T, T>;\n int n = a.size();\n std::vector ps(4, std::vector<Point>());\n auto idx = [](Point v) -> int {\n if(v.second >= 0) return (v.first >= 0) ? 0 : 1;\n else return (v.first >= 0) ? 3 : 2;\n };\n for(auto p: a) {\n assert(!(p.first == 0 && p.second == 0));\n ps[idx(p)].emplace_back(p);\n }\n a.clear();\n a.reserve(n);\n for(int i = 0; i < 4; i++) {\n std::sort(ps[i].begin(), ps[i].end(), \n [](Point &p1, Point &p2) -> bool { \n T flag = p1.first * p2.second - p2.first * p1.second;\n return flag == 0 ? (p1.first * p1.first + p1.second * p1.second < p2.first * p2.first + p2.second * p2.second) : flag > 0;\n });\n for(auto &p: ps[i]) a.emplace_back(p);\n }\n return;\n}\n\n}\n\nnamespace ebi {\n\nstruct line {\n point a,b;\n\n line(long double x1, long double y1, long double x2, long double y2) : a(x1, y1), b(x2, y2) { }\n\n line(const point &a, const point &b) : a(a), b(b) { }\n\n point proj(const point &p) const {\n return a + (b-a)*(dot(b-a,p-a)/norm(b-a));\n }\n\n point relf(const point &p) const {\n return proj(p)*double(2) - p;\n }\n\n long double distance(const point &c) const {\n return std::abs(det(c - a, b - a)/abs(b-a));\n }\n};\n\nint intersection(const line &a, const line &b) {\n if(internal::sgn(det(a.b-a.a, b.a-b.b)) != 0) {\n if(internal::sgn(dot(a.b-a.a, b.b-b.a)) == 0) { // 垂直\n return 1;\n }\n return 0; // 交差\n }\n else if(internal::sgn(det(a.b-a.a, b.a-a.a)) != 0) { // 平行\n return 2;\n }\n else { // 同一直線\n return 3;\n }\n}\n\npoint cross_point(const point &a, const point &b, const point &c, const point &d) {\n return a + (b-a) * det(c - a, d - c) / det(b - a, d - c);\n}\n\n// 交点があるか確認する！\npoint cross_point(const line &s, const line &t) {\n assert(intersection(s, t) < 2);\n return s.a + (s.b - s.a) * det(t.a - s.a, t.b - t.a) / det(s.b - s.a, t.b - t.a);\n}\n\n// 直線aと点cの距離\nlong double distance(const line &a, const point &c) {\n return std::abs(det(c-a.a, a.b - a.a)/abs(a.b-a.a));\n}\n\nlong double distance(const line &a, const line &b) {\n if(intersection(a, b) < 2) {\n return 0;\n }\n else {\n return distance(a, b.a);\n }\n}\n\n}\n\nnamespace ebi {\n\nstruct line_segment {\n point a, b;\n\n line_segment() = default;\n\n line_segment(long double x1, long double y1, long double x2, long double y2) : a(x1, y1), b(x2, y2) { }\n\n line_segment(const point &a, const point &b) : a(a), b(b) { }\n};\n\n// 線分ab, cd が交わるか判定\nbool intersection_line_segment(const point &a, const point &b, const point &c, const point &d) {\n if(internal::sgn(isp(a,b,c)*isp(a,b,d)) <= 0 && internal::sgn(isp(c,d,a)*isp(c,d,b)) <= 0) {\n return true;\n }\n return false;\n}\n\n// 線分ab, cd が交わるか判定\nbool intersection(const line_segment &a, const line_segment &b) {\n return intersection_line_segment(a.a, a.b, b.a, b.b);\n}\n\nbool intersection(const line &a, const line_segment &b) {\n if(internal::sgn(det(a.b - a.a, b.a - a.a)) * internal::sgn(det(a.b - a.a, b.b - a.a)) < 0) {\n return true;\n }\n else {\n return false;\n }\n}\n\npoint cross_point(const line_segment &s, const line_segment &t) {\n assert(intersection(s, t));\n return s.a + (s.b - s.a) * det(t.a - s.a, t.b - t.a) / det(s.b - s.a, t.b - t.a);\n}\n\nlong double distance(const line_segment &a, const point &c) {\n if(internal::sgn(dot(a.b - a.a, c - a.a)) < 0) {\n return abs(c-a.a);\n }\n else if(internal::sgn(dot(a.a - a.b, c - a.b)) < 0) {\n return abs(c-a.b);\n }\n else {\n return std::abs(det(c - a.a, a.b - a.a)/abs(a.b-a.a));\n }\n}\n\nlong double distance(const line_segment &a, const line_segment &b) {\n if(intersection(a, b)) {\n return 0;\n }\n else {\n return std::min(std::min(distance(a, b.a), distance(a, b.b)), std::min(distance(b, a.a), distance(b, a.b)));\n }\n}\n\nlong double distance(const line &a, const line_segment &b) {\n if(intersection(a, b)) {\n return 0;\n }\n else {\n return std::min(distance(a, b.a), distance(a, b.b));\n }\n}\n\n}\n\nnamespace ebi {\n\nvoid main_() {\n long double x;\n while (std::cin >> x) {\n long double y;\n std::vector<point> t1(3), t2(3);\n std::cin >> y;\n t1[0] = {x, y};\n std::cin >> t1[1] >> t1[2] >> t2;\n std::vector<int> idx(3), jdx(3);\n std::iota(all(idx), 0);\n std::iota(all(jdx), 0);\n int ans = INF;\n\n auto move = [&](int i, int j, int k, std::vector<point> &t, point target) -> int {\n if(t[i] == target) return 0;\n int cnt = 0;\n line l1(t[j], t[j] + target - t[i]);\n line l2(t[k], t[k] + t[i] - t[j]);\n if(intersection(l1, l2) >= 2) return 1000;\n point p = cross_point(l1, l2);\n if(p != t[k]) cnt++;\n t[k] = p;\n t[i] = target;\n cnt++;\n return cnt;\n };\n do {\n do {\n {\n int cnt = 0;\n auto t = t1;\n cnt += move(idx[0], idx[1], idx[2], t, t2[jdx[0]]);\n cnt += move(idx[1], idx[0], idx[2], t, t2[jdx[1]]);\n line_segment lseg(t[idx[2]], t2[jdx[2]]);\n if(intersection(line(t[idx[0]], t[idx[1]]), lseg)) cnt = 1000;\n if(t[idx[2]] != t2[jdx[2]]) cnt++;\n chmin(ans, cnt);\n }\n {\n int cnt = 0;\n auto t = t1;\n cnt += move(idx[0], idx[2], idx[1], t, t2[jdx[0]]);\n cnt += move(idx[1], idx[0], idx[2], t, t2[jdx[1]]);\n line_segment lseg(t[idx[2]], t2[jdx[2]]);\n if(intersection(line(t[idx[0]], t[idx[1]]), lseg)) cnt = 1000;\n if(t[idx[2]] != t2[jdx[2]]) cnt++;\n chmin(ans, cnt);\n }\n } while(std::next_permutation(all(jdx)));\n } while(std::next_permutation(all(idx)));\n if(ans >= 5) {\n std::cout << \"Many\\n\";\n continue;\n }\n std::cout << ans << '\\n';\n }\n\n}\n\n} // namespace ebi\n\nint main() {\n std::cout << std::fixed << std::setprecision(15);\n std::cin.tie(nullptr);\n std::ios::sync_with_stdio(false);\n int t = 1;\n // std::cin >> t;\n while (t--) {\n ebi::main_();\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3492,"score_of_the_acc":-0.8803,"final_rank":13},{"submission_id":"aoj_1623_6681940","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<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\n}\n\nconst double eps=1e-8;\n\nstruct point{\n double x,y;\n point() {}\n point(double x,double y): x(x), y(y) {}\n point& operator-=(const point &p){\n x -= p.x; y -= p.y;\n return *this;\n }\n point& operator+=(const point &p){\n x += p.x; y += p.y;\n return *this;\n }\n point& operator*=(double d){\n x *= d; y *= d;\n return *this;\n }\n point& operator/=(double d){\n x /= d; y /= d;\n return *this;\n }\n const point operator+ (const point& p) const;\n const point operator- (const point& p) const;\n const point operator* (double d) const;\n const point operator/ (double d) const;\n const bool operator == (const point& p) const;\n};\nconst point point::operator+ (const point& p) const{\n point res(*this); return res += p;\n}\nconst point point::operator- (const point& p) const{\n point res(*this); return res -= p;\n}\nconst point point::operator* (double d) const{\n point res(*this); return res *= d;\n}\nconst point point::operator/ (double d) const{\n point res(*this); return res /= d;\n}\nconst bool point::operator == (const point& p) const{\n point pp(*this);\n return (p.x == pp.x and p.y == pp.y);\n}\nstruct line{\n point A,B;\n line() {}\n line(point A, point B): A(A), B(B) {}\n};\n\n// BOJ-6487\n// 平行判定\nbool is_parallel(line l1, line l2){\n double dx1 = l1.B.x - l1.A.x;\n double dy1 = l1.B.y - l1.A.y;\n double dx2 = l2.B.x - l2.A.x;\n double dy2 = l2.B.y - l2.A.y;\n return abs(dy1*dx2 - dy2*dx1) < eps;\n}\n\npoint vec(line L){\n return (L.B - L.A);\n}\ndouble cross(point a,point b){\n return a.x*b.y-a.y*b.x;\n}\n// AOJ 2596\n// 直線の交点\npoint line_intersection(line l1, line l2){\n return l1.A + vec(l1) * cross(l2.A - l1.A, vec(l2)) / cross(vec(l1), vec(l2));\n}\n\nint main(){\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n array<point, 3> P,Q;\n while(cin >> P[0].x >> P[0].y >> P[1].x >> P[1].y >> P[2].x >> P[2].y){\n cin >> Q[0].x >> Q[0].y >> Q[1].x >> Q[1].y >> Q[2].x >> Q[2].y;\n int res = 5;\n auto dfs=[&](auto dfs,array<point,3> s,int cnt)->void{\n\n auto check=[&]()->int{\n vector<int> p={0,1,2};\n int mx = 0;\n do{\n int cnt = 0;\n for(int i=0;i<3;i++){\n if(s[p[i]] == Q[i])cnt++;\n }\n mx = max(mx, cnt);\n }while(next_permutation(p.begin(), p.end()));\n return mx;\n };\n\n int u = check();\n // 揃った\n if(u == 3){\n res = min(res, cnt); return;\n }\n // 枝刈り\n if(cnt+3-u >= res) return;\n\n // s[i]をQ[j]に揃えたい\n for(int i=0;i<3;i++){\n for(int j=0;j<3;j++){\n if(s[i] == Q[j])continue;\n\n // 直接揃えられる\n {\n line L1 = {s[i], Q[j]};\n line L2;\n if(i == 0) L2 = {s[1], s[2]};\n else if(i == 1) L2 = {s[0], s[2]};\n else L2 = {s[0], s[1]};\n\n if(is_parallel(L1, L2)){\n auto p = s[i];\n s[i] = Q[j];\n dfs(dfs,s,cnt+1);\n s[i] = p;\n }\n }\n // 1点経由\n if(3-u+1 < res){\n int k1 = -1, k2 = -1;\n for(int k=0;k<3;k++){\n if(i == k)continue;\n if(k1 == -1) k1 = k;\n else k2 = k;\n }\n // k2をずらす\n {\n line L1 = {s[k1], Q[j]-s[i]+s[k1]};\n line L2 = {s[k2], s[i]-s[k1]+s[k2]};\n auto p = line_intersection(L1, L2);\n auto pp = s[k2];\n s[k2] = p;\n dfs(dfs,s,cnt+1);\n s[k2] = pp;\n }\n swap(k1,k2);\n // k1をずらす\n {\n line L1 = {s[k1], Q[j]-s[i]+s[k1]};\n line L2 = {s[k2], s[i]-s[k1]+s[k2]};\n auto p = line_intersection(L1, L2);\n auto pp = s[k2];\n s[k2] = p;\n dfs(dfs,s,cnt+1);\n s[k2] = pp;\n } \n }\n }\n }\n\n };\n dfs(dfs,P,0);\n if(res >= 5){\n cout << \"Many\" << \"\\n\";\n }\n else{\n cout << res << \"\\n\";\n }\n }\n}","accuracy":1,"time_ms":30,"memory_kb":3484,"score_of_the_acc":-0.8599,"final_rank":11},{"submission_id":"aoj_1623_6598121","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 <typename T> bool chmax(T& a, const T& b) { return a < b ? (a = b, 1) : 0; }\ntemplate <typename T> bool chmin(T& a, const T& b) { return a > b ? (a = b, 1) : 0; }\n\nusing T = double;\nusing Vec = std::complex<T>;\n\nconst T PI = std::acos(-1);\n\nconstexpr T eps = 1e-8;\ninline bool eq(T a, T b) { return std::abs(a - b) < eps; }\ninline bool eq(Vec a, Vec b) { return std::abs(a - b) < eps; }\ninline bool lt(T a, T b) { return a < b - eps; }\ninline bool leq(T a, T b) { return a < b + eps; }\n\nstd::istream& operator>>(std::istream& is, Vec& p) {\n T x, y;\n is >> x >> y;\n p = {x, y};\n return is;\n}\n\nstruct Line {\n Vec p1, p2;\n Line() = default;\n Line(const Vec& p1, const Vec& p2) : p1(p1), p2(p2) {}\n Vec dir() const { return p2 - p1; }\n};\n\nstruct Segment {\n Vec p1, p2;\n Segment() = default;\n Segment(const Vec& p1, const Vec& p2) : p1(p1), p2(p2) {}\n Vec dir() const { return p2 - p1; }\n};\n\nstruct Circle {\n Vec c;\n T r;\n Circle() = default;\n Circle(const Vec& c, T r) : c(c), r(r) {}\n};\n\nusing Polygon = std::vector<Vec>;\n\nT dot(const Vec& a, const Vec& b) {\n return (std::conj(a) * b).real();\n}\n\nT cross(const Vec& a, const Vec& b) {\n return (std::conj(a) * b).imag();\n}\n\nVec rot(const Vec& a, T ang) {\n return a * Vec(std::cos(ang), std::sin(ang));\n}\n\nVec perp(const Vec& a) {\n return Vec(-a.imag(), a.real());\n}\n\nVec projection(const Line& l, const Vec& p) {\n return l.p1 + dot(p - l.p1, l.dir()) * l.dir() / std::norm(l.dir());\n}\n\nVec reflection(const Line& l, const Vec& p) {\n return T(2) * projection(l, p) - p;\n}\n\n// 0: collinear\n// 1: counter-clockwise\n// 2: clockwise\nint ccw(const Vec& a, const Vec& b, const Vec& c) {\n if (eq(cross(b - a, c - a), 0)) return 0;\n if (lt(cross(b - a, c - a), 0)) return -1;\n return 1;\n}\n\nvoid sort_by_arg(std::vector<Vec>& pts) {\n std::sort(pts.begin(), pts.end(), [&](auto& p, auto& q) {\n if ((p.imag() < 0) != (q.imag() < 0)) return (p.imag() < 0);\n if (cross(p, q) == 0) {\n if (p == Vec(0, 0)) return !(q.imag() < 0 || (q.imag() == 0 && q.real() > 0));\n if (q == Vec(0, 0)) return (p.imag() < 0 || (p.imag() == 0 && p.real() > 0));\n return (p.real() > q.real());\n }\n return (cross(p, q) > 0);\n });\n}\n\nVec intersection(const Line& l, const Line& m) {\n Vec r = m.p1 - l.p1;\n assert(!eq(cross(l.dir(), m.dir()), 0)); // not parallel\n return l.p1 + cross(m.dir(), r) / cross(m.dir(), l.dir()) * l.dir();\n}\n\ntemplate <typename T>\nostream& operator<<(ostream& os, const vector<T>& v) {\n for (int i = 0; i < (int) v.size(); ++i) os << v[i] << \" \";\n return os;\n}\n\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n cout << fixed << setprecision(15);\n\n auto check2 = [&](vector<Vec> a, vector<Vec> b) {\n if (!eq(a[0], b[0])) {\n return false;\n }\n Line l(b[1], b[1]+b[2]-b[0]);\n if (!eq(cross(l.p1 - a[1], l.p2 - a[1]), 0)) return false;\n b[1] = a[1];\n return ccw(a[0], a[1], a[2]) == ccw(b[0], b[1], b[2]);\n };\n\n auto check3 = [&](vector<Vec> a, vector<Vec> b) {\n if (eq(a[0], b[0])) {\n Line m(b[0], b[0]+b[1]-a[1]);\n Line n(b[2], b[2]+b[1]-b[0]);\n if (!eq(cross(m.dir(), n.dir()), 0)) {\n auto p = intersection(m, n);\n b[2] = p;\n return check2(a, b);\n }\n return false;\n } else {\n Line l(b[0], b[0]+b[2]-b[1]);\n if (!eq(cross(l.p1 - a[0], l.p2 - a[0]), 0)) return false;\n b[0] = a[0];\n return check2(a, b);\n }\n };\n\n auto check4 = [&](vector<Vec> a, vector<Vec> b) {\n Line l(b[0], b[0]+b[2]-b[1]);\n if (eq(cross(l.p1 - a[0], l.p2 - a[0]), 0)) {\n auto tmp = b[0];\n b[0] = a[0];\n if (check3(a, b)) return true;\n b[0] = tmp;\n }\n // move b[2]\n {\n Line m(b[1], b[1]+b[0]-a[0]);\n Line n(b[2], b[2]+b[1]-b[0]);\n if (!eq(cross(m.dir(), n.dir()), 0)) {\n auto p = intersection(m, n);\n auto tmp = b[2];\n b[2] = p;\n if (check3(a, b)) return true;\n b[2] = tmp;\n }\n }\n // move b[1]\n {\n Line m(b[2], b[2]+b[0]-a[0]);\n Line n(b[1], b[1]+b[2]-b[0]);\n if (!eq(cross(m.dir(), n.dir()), 0)) {\n auto p = intersection(m, n);\n auto tmp = b[1];\n b[1] = p;\n if (check3(a, b)) return true;\n b[1] = tmp;\n }\n }\n return false;\n };\n\n while (true) {\n vector<Vec> a(3), b(3);\n for (auto& x : a) cin >> x;\n for (auto& x : b) cin >> x;\n swap(a, b);\n vector<int> perm1 = {0, 1, 2};\n int ans = 5;\n do {\n vector<Vec> aa(3);\n rep(i,0,3) aa[i] = a[perm1[i]];\n vector<int> perm2 = {0, 1, 2};\n do {\n vector<Vec> bb(3);\n rep(i,0,3) bb[i] = b[perm2[i]];\n\n if (check3(aa, bb)) {\n chmin(ans, 3);\n } else if (check4(aa, bb)) {\n chmin(ans, 4);\n }\n } while (next_permutation(all(perm2)));\n } while (next_permutation(all(perm1)));\n if (ans < 5) cout << ans;\n else cout << \"Many\";\n cout << \"\\n\";\n string s;\n getline(cin, s);\n if (!getline(cin, s)) break;\n }\n}","accuracy":1,"time_ms":20,"memory_kb":3544,"score_of_the_acc":-1.0014,"final_rank":16},{"submission_id":"aoj_1623_6030341","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\nusing namespace std;\n\n//constexpr long long int MOD = 1000000007;\nconstexpr long long int MOD = 998244353;\nconstexpr long double EPS = 1e-7;\n\n//int N, M, K, T, H, W, L, R;\nlong long int N, M, K, T, H, W, L, R;\n\nvector<long double>Sx;\nvector<long double>Sy;\n\nstruct Point {\n\tlong double x;\n\tlong double y;\n\tPoint(long double xx, long double yy) {\n\t\tx = xx, y = yy;\n\t}\n\tPoint() {\n\n\t}\n\tvoid Input() {\n\t\tcin >> x >> y;\n\t}\n\tPoint operator + (const Point& c)const {\n\t\tPoint box;\n\t\tbox.x = x + c.x;\n\t\tbox.y = y + c.y;\n\t\treturn box;\n\t}\n\tPoint operator - (const Point& c)const {\n\t\tPoint box;\n\t\tbox.x = x - c.x;\n\t\tbox.y = y - c.y;\n\t\treturn box;\n\t}\n\tPoint operator * (const long double& b)const {\n\t\tPoint box;\n\t\tbox.x = x * b;\n\t\tbox.y = y * b;\n\t\treturn box;\n\t}\n\tbool operator <(const Point& c)const {\n\t\tif (y < c.y)return true;\n\t\tif (y > c.y)return false;\n\t\tif (x < c.x)return true;\n\t\treturn false;\n\t}\n\tbool operator >(const Point& c)const {\n\t\tif (y > c.y)return true;\n\t\tif (y < c.y)return false;\n\t\tif (x > c.x)return true;\n\t\treturn false;\n\t}\n\tbool operator ==(const Point& c)const {\n\t\treturn abs(x - c.x) <= EPS && abs(y - c.y) <= EPS;\n\t}\n\tlong double det(Point a) {\n\t\treturn x * a.y - y * a.x;\n\t}\n};\n\nstruct Line {\n\tlong double a, b, c;\n\tLine(const int aa, const int bb, const int cc) {\n\t\ta = aa, b = bb, c = cc;\n\t}\n\tLine(const Point s, const Point t) {\n\t\tif (abs(s.x - t.x) < EPS) {\n\t\t\ta = 1;\n\t\t\tb = 0;\n\t\t}\n\t\telse {\n\t\t\tb = 1;\n\t\t\ta = (t.y - s.y) / (s.x - t.x);\n\t\t}\n\t\tc = s.x * a + s.y * b;\n\t}\n};\n\nlong double dot(Point a, Point b) {\n\treturn a.x * b.x + a.y * b.y;\n}\n\nlong double cross(Point a, Point b) {\n\treturn a.x * b.y - b.x * a.y;\n}\n\nlong double Distance(Point a, Point b) {\n\treturn sqrtl((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y));\n}\n\nlong double Distance(Point a, pair<Point, Point>b) {\n\tLine l = Line(b.first, b.second);\n\tif (abs(l.a * a.x + l.b * a.y - l.c) < EPS) {\n\t\tif (abs(Distance(a, b.first) + Distance(a, b.second) - Distance(b.second, b.first)) <= sqrtl(EPS))return 0;\n\t\treturn min(Distance(a, b.first), Distance(a, b.second));\n\t}\n\tlong double A = powl((b.first.x - b.second.x), 2) + powl((b.first.y - b.second.y), 2);\n\tlong double B = 2 * (a.x - b.first.x) * (b.first.x - b.second.x) + 2 * (a.y - b.first.y) * (b.first.y - b.second.y);\n\tlong double r = B / 2 / A;\n\tr = -r;\n\tif (r >= 0 && r <= 1) {\n\t\treturn Distance(a, Point(b.first.x + r * (b.second.x - b.first.x), b.first.y + r * (b.second.y - b.first.y)));\n\t}\n\telse {\n\t\treturn min(Distance(a, b.first), Distance(a, b.second));\n\t}\n}\n\nbool LineCross(Point a1, Point a2, Point b1, Point b2) {\n\treturn cross(a2 - a1, b1 - a1) * cross(a2 - a1, b2 - a1) < EPS && cross(b2 - b1, a1 - b1) * cross(b2 - b1, a2 - b1) < EPS && !(abs((a1 - a2).x * (a1 - b1).y - (a1 - a2).y * (a1 - b1).x) < EPS && abs((a1 - a2).x * (a1 - b2).y - (a1 - a2).y * (a1 - b2).x) < EPS && abs(Distance(a1, a2) - Distance(a1, b1) - Distance(a2, b1)) > EPS && abs(Distance(a1, a2) - Distance(a2, b2) - Distance(a1, b2)) > EPS && abs(Distance(b1, b2) - Distance(a1, b1) - Distance(a1, b2)) > EPS && abs(Distance(b1, b2) - Distance(a2, b1) - Distance(a2, b2)) > EPS);\n}\n\nlong double Distance(pair<Point, Point>a, pair<Point, Point>b) {\n\tif (LineCross(a.first, a.second, b.first, b.second))return 0;\n\treturn min({ Distance(a.first,b),Distance(a.second,b),Distance(b.first,a),Distance(b.second,a) });\n}\n\nPoint LineCross(Line a, Line b) {\n\tPoint ret;\n\tret.x = (a.c * b.b - a.b * b.c) / (a.a * b.b - a.b * b.a);\n\tret.y = -(a.c * b.a - a.a * b.c) / (a.a * b.b - a.b * b.a);\n\treturn ret;\n}\n\nlong double TriangleArea(Point a, Point b, Point c) {\n\tlong double A, B, C;\n\tA = Distance(a, b);\n\tB = Distance(a, c);\n\tC = Distance(b, c);\n\tlong double S = (A + B + C) / 2;\n\treturn sqrtl(S * (S - A) * (S - B) * (S - C));\n}\n\nvoid func(vector<Point>s, vector<Point>g, vector<int>oks, vector<int>okg, int& ans, int step = 0) {\n\tif (step >= 5)return;\n\t//cout << endl;\n\t//for (auto i : s)cout << i.x << \" \" << i.y << endl;\n\t//for (auto i : g)cout << i.x << \" \" << i.y << endl;\n\t//cout << step << \" \" << oks[0] << \" \" << oks[1] << \" \" << oks[2] << endl;\n\tif (oks[0] && oks[1] && oks[2]) {\n\t\tans = min(ans, step);\n\t\treturn;\n\t}\n\tauto ns = s;\n\tfor (int i = 0; i < 3; i++) {\n\t\tif (oks[i])continue;\n\t\tfor (int j = 0; j < 3; j++) {\n\t\t\tif (okg[j])continue;\n\t\t\tfor (int k = 0; k < 3; k++) {\n\t\t\t\ts = ns;\n\t\t\t\tif (i == k)continue;\n\t\t\t\tLine a(s[k], s[k] + s[i] - s[3 - i - k]);\n\t\t\t\tLine b(s[3 - i - k], g[j] - s[i] + s[3 - i - k]);\n\t\t\t\t//\tcout << a.a << \" \" << a.b << \" \" << b.a << \" \" << b.b << endl;\n\t\t\t\tauto p = LineCross(a, b);\n\t\t\t\tif (isinf(p.x) || isinf(p.y))continue;\n\t\t\t\tif (isnan(p.x) || isnan(p.y))continue;\n\t\t\t\toks[i] = 1;\n\t\t\t\tokg[j] = 1;\n\t\t\t\tint add = 1;\n\t\t\t\tif (Distance(s[k], p) <= EPS) {\n\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\ts[k] = p;\n\t\t\t\t\tadd++;\n\t\t\t\t}\n\t\t\t\ts[i] = g[j];\n\t\t\t\tif (add == 1 || !oks[k])func(s, g, oks, okg, ans, step + add);\n\t\t\t\toks[i] = 0;\n\t\t\t\tokg[j] = 0;\n\t\t\t}\n\t\t}\n\t}\n}\n\nvoid Solve() {\n\tvector<long double>Gx(3);\n\tvector<long double>Gy(3);\n\tfor (int i = 0; i < 3; i++) {\n\t\tcin >> Gx[i] >> Gy[i];\n\t}\n\tint ans = 100;\n\tvector<int>oks(3);\n\tvector<int>okg(3);\n\tvector<Point>S;\n\tvector<Point>G;\n\tfor(int i=0;i<3;i++){\n\t\tS.push_back(Point(Sx[i], Sy[i]));\n\t\tG.push_back(Point(Gx[i], Gy[i]));\n\t}\n\tfunc(S, G, oks, okg, ans);\n\tif (ans >= 5)cout << \"Many\\n\";\n\telse cout << ans << endl;\n}\n\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\n\tSx.resize(3);\n\tSy.resize(3);\n\twhile (cin >> Sx[0] >> Sy[0]) {\n\t\tfor (int i = 1; i < 3; i++) {\n\t\t\tcin >> Sx[i] >> Sy[i];\n\t\t}\n\t\tSolve();\n\t}\n}","accuracy":1,"time_ms":40,"memory_kb":3476,"score_of_the_acc":-0.8422,"final_rank":10},{"submission_id":"aoj_1623_6014736","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\n// arg(x) : argment,[-PI,PI]\nusing CP = complex<long double>;\n#define X real()\n#define Y imag()\nconst long double PI = acos(-1.0L);\nconst long double EPS = 1e-7;\nbool operator==(const CP &l, const CP &r) { return norm(l - r) <= EPS; }\nstruct Circle {\n CP o;\n long double r;\n Circle(long double _x = 0.0L, long double _y = 0.0L, long double _r = 0.0L)\n : o(CP(_x, _y)), r(_r) {}\n Circle(CP _o, long double _r = 0.0) : o(_o), r(_r) {}\n bool operator<(const Circle &cr) const { return r < cr.r; }\n};\n\nstruct Line {\n CP s, t;\n Line(long double sx = 0.0L, long double sy = 0.0L, long double tx = 0.0L,\n long double ty = 0.0L)\n : s(CP(sx, sy)), t(CP(tx, ty)) {}\n Line(CP _s, CP _t) : s(_s), t(_t) {}\n};\n\n// cos a\nlong double costh(const long double &a, const long double &b,\n const long double &c) {\n return (b * b - a * a + c * c) / (2.0L * b * c);\n}\n\n// dot(a,b) = |a||b|cos x\nlong double dot(const CP &a, const CP &b) { return (conj(a) * b).X; }\n// cross(a,b) : area of parallelogram\n// sign : a-> b ,counter clockwise? + : -\nlong double cross(const CP &a, const CP &b) { return (conj(a) * b).Y; }\nlong double corner(const CP &a, const CP &b) {\n //[0,PI]\n return acos(dot(a, b) / (abs(a) * abs(b)));\n}\n\nCP projectionLP(const CP &s, const CP &t, const CP &p) {\n if (s == t) return s;\n CP base = t - s;\n long double r = dot(p - s, base) / norm(base);\n return s + base * r;\n}\nCP projectionLP(const Line &l, const CP &p) {\n return projectionLP(l.s, l.t, p);\n}\n\nCP reflectionLP(const CP &s, const CP &t, const CP &p) {\n CP tmp = (projectionLP(s, t, p) - p);\n tmp *= 2;\n return p + tmp;\n}\nCP reflectionLP(const Line &l, const CP &p) {\n return reflectionLP(l.s, l.t, p);\n}\n\nint calc_clockwiseSP(const CP &s, CP t, CP p) {\n t -= s, p -= s;\n if (cross(t, p) > EPS) return 1; // \"COUNTER_CLOCKWISE\"\n if (cross(t, p) < -EPS) return -1; //\"CLOCK_WISE\"\n if (dot(t, p) < 0) return 2; // \"ONLINE_BACK\"\n if (norm(t) < norm(p)) return -2; // \"ONLINE_FRONT\"\n return 0; // \"ON_SEGMENT\"\n}\nint calc_clockwiseSP(const Line &l, const CP &p) {\n return calc_clockwiseSP(l.s, l.t, p);\n}\n\nint parallel_orthogonalLL(const CP &s, CP t, const CP &a, CP b) {\n t -= s;\n b -= a;\n if (abs(cross(t, b)) <= EPS) return 2; // \"parallel\"\n if (abs(dot(t, b)) <= EPS) return 1; // \"orthogonal\"\n return 0;\n}\nint parallel_orthogonalLL(const Line &ll, const Line &lr) {\n return parallel_orthogonalLL(ll.s, ll.t, lr.s, lr.t);\n}\n\nCP intersectionLL(const CP &a, const CP &b, const CP &c, const CP &d) {\n return a + (b - a) * (cross(d - c, d - a) / cross(d - c, b - a));\n}\nCP intersectionLL(const Line &ll, const Line &lr) {\n return intersectionLL(ll.s, ll.t, lr.s, lr.t);\n}\n\nbool on_segSP(const CP &s, const CP &t, const CP &p) {\n // if not use end point, dot(s - p, t - p) < 0\n return abs(cross(s - p, t - p)) <= EPS && dot(s - p, t - p) <= 0;\n}\nbool on_segSP(const Line &l, const CP &p) { return on_segSP(l.s, l.t, p); }\n\n// crossing segments? (a,b) and (c,d)\nbool iscrossSS(const CP &a, const CP &b, const CP &c, const CP &d) {\n // parallel\n return calc_clockwiseSP(a, b, c) * calc_clockwiseSP(a, b, d) <= 0 &&\n calc_clockwiseSP(c, d, a) * calc_clockwiseSP(c, d, b) <= 0;\n // if (abs(cross(a - b, c - d)) <= EPS) {\n // return on_segSP(a, b, c) || on_segSP(a, b, d) || on_segSP(c, d, a) ||\n // on_segSP(c, d, b);\n // }\n // CP isp = intersectionLL(a, b, c, d);\n // return on_segSP(a, b, isp) && on_segSP(c, d, isp);\n}\n\nbool iscrossSS(const Line &ll, const Line &lr) {\n return iscrossSS(ll.s, ll.t, lr.s, lr.t);\n}\n\nlong double distLP(const CP &s, const CP &t, const CP &p) {\n return abs(cross(t - s, p - s) / abs(t - s));\n}\nlong double distLP(const Line &l, const CP &p) { return distLP(l.s, l.t, p); }\n\nlong double distSP(const CP &s, const CP &t, const CP &p) {\n if (dot(t - s, p - s) < 0) return abs(p - s);\n if (dot(s - t, p - t) < 0) return abs(p - t);\n return distLP(s, t, p);\n}\nlong double distSP(const Line &l, const CP &p) { return distSP(l.s, l.t, p); }\n\nlong double distSS(const CP &a, const CP &b, const CP &c, const CP &d) {\n long double res = 1e18;\n if (iscrossSS(a, b, c, d)) return 0.0L;\n res = min(res, distSP(a, b, c));\n res = min(res, distSP(a, b, d));\n res = min(res, distSP(c, d, a));\n res = min(res, distSP(c, d, b));\n return res;\n}\nlong double distSS(const Line &ll, const Line &lr) {\n return distSS(ll.s, ll.t, lr.s, lr.t);\n}\n\n// counter clockwise\nbool is_convex(const vector<CP> &pol) {\n int n = pol.size();\n for (int i = 0; i < n; ++i)\n if (cross(pol[(i + 1) % n] - pol[i], pol[(i + 2) % n] - pol[(i + 1) % n]) <\n -EPS)\n return 0;\n return 1;\n}\n\nvector<CP> convex_hull(vector<CP> &ps) {\n auto lmd = [&](const CP &l, const CP &r) {\n if (l.X != r.X) return l.X < r.X;\n return l.Y < r.Y;\n };\n vector<CP> res;\n int psize = ps.size();\n sort(ps.begin(), ps.end(), lmd);\n int k = 0;\n res.resize(psize * 2);\n for (int i = 0; i < psize; ++i) {\n while (k > 1 && cross(res[k - 1] - res[k - 2], ps[i] - res[k - 1]) <= 0)\n --k;\n res[k++] = ps[i];\n }\n for (int i = psize - 2, t = k; i >= 0; --i) {\n while (k > t && cross(res[k - 1] - res[k - 2], ps[i] - res[k - 1]) <= 0)\n --k;\n res[k++] = ps[i];\n }\n res.resize(k - 1);\n return res;\n}\n\nlong double convex_diameter(const vector<CP> &pol) {\n vector<CP> ps = pol;\n ps = convex_hull(ps);\n int n = ps.size(), i = 0, j = 0;\n if (n < 2) return 0.0L;\n if (n == 2) return abs(ps[0] - ps[1]);\n for (int k = 0; k < n; ++k) {\n if (ps[k].X < ps[i].X) i = k;\n if (ps[k].X > ps[j].X) j = k;\n }\n long double res = 0;\n int si = i, sj = j;\n while (i != sj || j != si) {\n res = max(res, abs(ps[i] - ps[j]));\n if (cross(ps[(i + 1) % n] - ps[i], ps[(j + 1) % n] - ps[j]) < 0)\n (++i) %= n;\n else\n (++j) %= n;\n }\n return res;\n}\n\nvector<CP> convex_cut(const vector<CP> &pol, const CP &s, const CP &t) {\n vector<CP> res;\n int n = pol.size();\n for (int i = 0; i < n; ++i) {\n CP nows = pol[i], nowt = pol[(i + 1) % n];\n if (cross(t - s, nows - s) >= -EPS) res.push_back(nows);\n if (cross(t - s, nows - s) * cross(t - s, nowt - s) < 0)\n res.push_back(intersectionLL(s, t, nows, nowt));\n }\n return res;\n}\nvector<CP> convex_cut(const vector<CP> &pol, const Line &l) {\n return convex_cut(pol, l.s, l.t);\n}\n\n// number of tangents\nint iscrossCC(Circle l, Circle r) {\n if (l.r < r.r) swap(l, r);\n long double distlr = abs(l.o - r.o);\n if (l.r + r.r < distlr)\n return 4; // not touch\n else if (abs(distlr - l.r - r.r) <= EPS)\n return 3; // circumscription\n else if (l.r - r.r < distlr)\n return 2; // cross\n else if (abs(distlr - l.r + r.r) <= EPS)\n return 1; // inscribed\n else // contain\n return 0;\n}\n\nvector<CP> intersectionCC(const Circle &c1, const Circle &c2) {\n vector<CP> res;\n if (iscrossCC(c1, c2) == 4) return res;\n\n long double d = abs(c1.o - c2.o);\n long double a = acos(costh(c2.r, c1.r, d));\n long double t = atan2(c2.o.imag() - c1.o.imag(), c2.o.real() - c1.o.real());\n res.push_back(c1.o + CP(cos(t + a) * c1.r, sin(t + a) * c1.r));\n res.push_back(c1.o + CP(cos(t - a) * c1.r, sin(t - a) * c1.r));\n if (res[0].X > res[1].X || (res[0].X == res[1].X && res[0].Y > res[1].Y))\n swap(res[0], res[1]);\n return res;\n}\n\nvector<CP> intersectionCL(const Circle &ci, const CP &s, CP t) {\n vector<CP> res(2, projectionLP(s, t, ci.o));\n long double r = sqrt(ci.r * ci.r - norm(res[0] - ci.o));\n if (r <= EPS || t == s) return res;\n t -= s;\n t *= r / abs(t);\n res[0] += t;\n res[1] -= t;\n if (res[0].X > res[1].X || (res[0].X == res[1].X && res[0].Y > res[1].Y))\n swap(res[0], res[1]);\n return res;\n}\nvector<CP> intersectionCL(const Circle &ci, const Line &l) {\n return intersectionCL(ci, l.s, l.t);\n}\n\nvector<CP> contactCP(const Circle &ci, const CP &p) {\n vector<CP> res;\n long double d = abs(ci.o - p);\n if (abs(d - ci.r) <= EPS) {\n res.push_back(p);\n return res;\n } else if (d < ci.r)\n return res;\n long double arg = asin(ci.r / d);\n res.push_back((ci.o - p) * CP(cos(arg), sin(arg)));\n res[0] *= (d * cos(arg)) / abs(res[0]);\n res[0] += p;\n res.push_back(reflectionLP(p, ci.o, res[0]));\n if (res[0].X > res[1].X || (res[0].X == res[1].X && res[0].Y > res[1].Y))\n swap(res[0], res[1]);\n return res;\n}\n\nvector<Line> tangentCC(Circle cl, Circle cr) {\n vector<Line> res;\n if (cl.r < cr.r) swap(cl, cr);\n long double g = abs(cl.o - cr.o);\n if (abs(g - 0.0L) <= EPS) return res;\n CP hor = (cr.o - cl.o) / g, ver;\n ver = hor * (CP(cos(PI * 0.5L), sin(PI * 0.5L)));\n for (int s : {-1, 1}) {\n long double h = (cl.r + s * cr.r) / g;\n if (abs(1 - h * h) <= EPS) {\n res.emplace_back(cl.o + hor * cl.r, cl.o + (hor + ver) * cl.r);\n } else if (1 - h * h > 0) {\n CP nhor = hor * h, nver = ver * sqrtl(1 - h * h);\n res.emplace_back(cl.o + (nhor + nver) * cl.r,\n cr.o - (nhor + nver) * (cr.r * s));\n res.emplace_back(cl.o + (nhor - nver) * cl.r,\n cr.o - (nhor - nver) * (cr.r * s));\n }\n }\n return res;\n}\n\nlong double areaPol(const vector<CP> &pol) {\n int n = pol.size();\n long double res = 0;\n for (int i = 0; i < n; ++i)\n res += (pol[(i - 1 + n) % n].X - pol[(i + 1) % n].X) * pol[i].Y;\n return res / 2.0L;\n}\n\nint containPolP(const vector<CP> &pol, CP p) {\n bool con = 0, onseg = 0;\n int n = pol.size();\n for (int i = 0; i < n; ++i) {\n onseg |= on_segSP(pol[i], pol[(i + 1) % n], p);\n CP s = pol[i] - p, t = pol[(i + 1) % n] - p;\n if (s.Y > t.Y) swap(s, t);\n if (s.Y * t.Y <= 0 && t.Y > 0 && cross(s, t) < 0) con = !con;\n }\n if (onseg) return 1;\n if (con) return 2;\n return 0;\n}\n\nlong double closest_pair(vector<CP> &ps, int l = -1, int r = -1,\n bool reqsqrt = 0) {\n if (l == r && l == -1) {\n l = 0;\n r = ps.size();\n reqsqrt = 1;\n auto lmd = [&](const CP &l, const CP &r) {\n if (l.X != r.X) return l.X < r.X;\n return l.Y < r.Y;\n };\n sort(ps.begin(), ps.end(), lmd);\n }\n if (r - l < 2) return 1e18;\n if (r - l == 2) {\n if (ps[l].Y > ps[l + 1].Y) swap(ps[l], ps[l + 1]);\n if (reqsqrt) return abs(ps[l] - ps[l + 1]);\n return norm(ps[l] - ps[l + 1]);\n }\n int mid = (l + r) / 2;\n long double x = ps[mid].X,\n res = min(closest_pair(ps, l, mid), closest_pair(ps, mid, r));\n auto f = [](CP pl, CP pr) { return pl.Y < pr.Y; };\n inplace_merge(ps.begin() + l, ps.begin() + mid, ps.begin() + r, f);\n vector<CP> tmp;\n for (int i = l; i < r; ++i) {\n long double dx = abs(ps[i].X - x);\n int tsize = tmp.size();\n if (dx * dx >= res) continue;\n for (int j = 0; j < tsize; ++j) {\n CP delta = ps[i] - tmp[tsize - 1 - j];\n if (delta.Y * delta.Y >= res) break;\n res = min(res, norm(delta));\n }\n tmp.push_back(ps[i]);\n }\n if (reqsqrt) res = sqrtl(res);\n return res;\n}\n\nCircle min_ball(vector<CP> ps) {\n int n = ps.size();\n if (n == 1) return Circle(ps[0], 0.0L);\n mt19937 mt(int(time(0)));\n shuffle(ps.begin(), ps.end(), mt);\n auto make3 = [](const CP &a, const CP &b, const CP &c) {\n long double A = norm(b - c), B = norm(c - a), C = norm(a - b),\n S = cross(b - a, c - a);\n CP p = (A * (B + C - A) * a + B * (C + A - B) * b + C * (A + B - C) * c) /\n (4 * S * S);\n long double nowr = norm(p - a);\n return Circle(p, nowr);\n };\n auto make2 = [](const CP &a, const CP &b) {\n CP c = (a + b) / 2.0L;\n long double nowr = norm(a - c);\n return Circle(c, nowr);\n };\n auto in_circle = [](const CP &a, const Circle &c) {\n return norm(a - c.o) <= c.r + EPS;\n };\n Circle res = make2(ps[0], ps[1]);\n for (int i = 2; i < n; ++i)\n if (!in_circle(ps[i], res)) {\n res = make2(ps[0], ps[i]);\n for (int j = 1; j < i; ++j)\n if (!in_circle(ps[j], res)) {\n res = make2(ps[i], ps[j]);\n for (int k = 0; k < j; ++k)\n if (!in_circle(ps[k], res)) res = make3(ps[i], ps[j], ps[k]);\n }\n }\n res.r = sqrtl(res.r);\n return res;\n}\n\nbool arg_comp(CP a, CP b) {\n int up_down_a = a.Y > 0 || (abs(a.Y) <= EPS && a.X >= 0);\n int up_down_b = b.Y > 0 || (abs(b.Y) <= EPS && b.X >= 0);\n if (up_down_a != up_down_b) return up_down_a < up_down_b;\n if (a.X * b.Y == a.Y * b.X) return norm(a) < norm(b);\n return calc_clockwiseSP(CP(0, 0), a, b) == 1;\n}\nbool operator<(const Line &l, const Line &r) {\n CP lp = l.t - l.s, rp = r.t - r.s;\n return arg_comp(lp, rp);\n}\n\nvector<CP> s, t;\nvector<int> ps(3), pt(3), pf = {1, 2};\n\nint solve();\nint calc();\n\nint main() {\n int x, y;\n while (cin >> x) {\n s.clear(), t.clear();\n pf = {1, 2};\n cin >> y;\n s.emplace_back(x, y);\n for (int i = 0; i < 2; ++i) {\n cin >> x >> y;\n s.emplace_back(x, y);\n }\n for (int i = 0; i < 3; ++i) {\n cin >> x >> y;\n t.emplace_back(x, y);\n }\n int res = solve();\n if (res >= 5)\n cout << \"Many\" << endl;\n else\n cout << res << endl;\n }\n return 0;\n}\n\nint solve() {\n int res = 5;\n vector<CP> vs = s, vt = t;\n do {\n iota(ps.begin(), ps.end(), 0);\n do {\n iota(pt.begin(), pt.end(), 0);\n do {\n for (int i = 0; i < 3; ++i) s[i] = vs[ps[i]], t[i] = vt[pt[i]];\n res = min(res, calc());\n } while (next_permutation(pt.begin(), pt.end()));\n } while (next_permutation(ps.begin(), ps.end()));\n } while (next_permutation(pf.begin(), pf.end()));\n return res;\n}\n\nint calc() {\n int res = 0;\n if (abs(t[0] - s[0]) > EPS) {\n CP veca = t[0] - s[0], tar = s[pf[0]], vecb = s[0] - tar;\n veca /= abs(veca), vecb /= abs(vecb);\n CP x = tar + veca, y = s[pf[1]], z = y + vecb;\n if (abs(calc_clockwiseSP(s[0], t[0], tar)) != 1) return 5;\n assert(parallel_orthogonalLL(s[0], tar, z, y) == 2);\n CP is = intersectionLL(tar, x, y, z);\n if (abs(is - y) > EPS) s[pf[1]] = is, ++res;\n ++res, s[0] = t[0];\n }\n if (abs(t[1] - s[1]) > EPS) {\n CP veca = t[1] - s[1], vecb = s[0] - s[1];\n veca /= abs(veca), vecb /= abs(vecb);\n CP x = s[0] + veca, y = s[2] + vecb;\n CP is = intersectionLL(s[0], x, s[2], y);\n if (abs(is - s[2]) > EPS) s[2] = is, ++res;\n ++res, s[1] = t[1];\n }\n if (abs(t[2] - s[2]) > EPS) {\n if (parallel_orthogonalLL(s[2], t[2], s[0], s[1]) != 2) return 5;\n ++res;\n }\n return res;\n}","accuracy":1,"time_ms":60,"memory_kb":3504,"score_of_the_acc":-0.9116,"final_rank":14},{"submission_id":"aoj_1623_6006303","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()\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;\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-9;\nconst int mod = 1e9 + 7;\n//const int mod = 998244353;\n\nnamespace geometry {\n // Point : 複素数型を位置ベクトルとして扱う\n // 実軸(real)をx軸、挙軸(imag)をy軸として見る\n using D = long double;\n using Point = complex<D>;\n const D EPS = 1e-7;\n const D PI = acosl(-1);\n\n inline bool equal(const D &a, const D &b) { return fabs(a - b) < EPS; }\n\n // 単位ベクトル(unit vector)を求める\n Point unitVector(const Point &a) { return a / abs(a); }\n\n // 法線ベクトル(normal vector)を求める\n // 90度回転した単位ベクトルをかける\n // -90度がよければPoint(0, -1)をかける\n Point normalVector(const Point &a) { return a * Point(0, 1); }\n\n // 内積(dot product) : a・b = |a||b|cosΘ\n D dot(const Point &a, const Point &b) {\n return (a.real() * b.real() + a.imag() * b.imag());\n }\n\n // 外積(cross product) : a×b = |a||b|sinΘ\n D cross(const Point &a, const Point &b) {\n return (a.real() * b.imag() - a.imag() * b.real());\n }\n\n // 点pを反時計回りにtheta度回転\n // thetaはラジアン！！！\n Point rotate(const Point &p, const D &theta) {\n return Point(cos(theta) * p.real() - sin(theta) * p.imag(),\n sin(theta) * p.real() + cos(theta) * p.imag());\n }\n\n // ラジアン->度\n D radianToDegree(const D &radian) { return radian * 180.0 / PI; }\n\n // 度->ラジアン\n D degreeToRadian(const D °ree) { return degree * PI / 180.0; }\n\n // 点の回転方向\n // 点a, b, cの位置関係について(aが基準点)\n int ccw(const Point &a, Point b, Point c) {\n b -= a, c -= a;\n // 点a, b, c が\n // 反時計回りの時、\n if(cross(b, c) > EPS) return 1;\n // 時計回りの時、\n if(cross(b, c) < -EPS) return -1;\n // c, a, bがこの順番で同一直線上にある時、\n if(dot(b, c) < 0) return 2;\n // a, b, cがこの順番で同一直線上にある場合、\n if(norm(b) < norm(c)) return -2;\n // cが線分ab上にある場合、\n return 0;\n }\n\n // Line : 直線を表す構造体\n // b - a で直線・線分を表せる\n struct Line {\n Point a, b;\n Line() = default;\n Line(Point a, Point b) : a(a), b(b) {}\n // Ax+By=C\n Line(D A, D B, D C) {\n if(equal(A, 0)) {\n a = Point(0, C / B), b = Point(1, C / B);\n } else if(equal(B, 0)) {\n b = Point(C / A, 0), b = Point(C / A, 1);\n } else {\n a = Point(0, C / B), b = Point(C / A, 0);\n }\n }\n };\n\n // Segment : 線分を表す構造体\n // Lineと同じ\n struct Segment : Line {\n Segment() = default;\n\n Segment(Point a, Point b) : Line(a, b) {}\n };\n\n // Circle : 円を表す構造体\n // pが中心の位置ベクトル、rは半径\n struct Circle {\n Point p;\n D r;\n\n Circle() = default;\n\n Circle(Point p, D r) : p(p), r(r) {}\n };\n\n // 2直線の直交判定 : a⊥b <=> dot(a, b) = 0\n bool isOrthogonal(const Line &a, const Line &b) {\n return equal(dot(a.b - a.a, b.b - b.a), 0);\n }\n // 2直線の平行判定 : a//b <=> cross(a, b) = 0\n bool isParallel(const Line &a, const Line &b) {\n return equal(cross(a.b - a.a, b.b - b.a), 0);\n }\n\n // 点cが直線ab上にあるか\n bool isPointOnLine(const Point &a, const Point &b, const Point &c) {\n return isParallel(Line(a, b), Line(a, c));\n }\n\n // 点cが\"線分\"ab上にあるか\n bool isPointOnSegment(const Point &a, const Point &b, const Point &c) {\n // |a-c| + |c-b| <= |a-b| なら線分上\n return (abs(a - c) + abs(c - b) < abs(a - b) + EPS);\n }\n\n // 直線lと点pの距離を求める\n D distanceBetweenLineAndPoint(const Line &l, const Point &p) {\n return abs(cross(l.b - l.a, p - l.a)) / abs(l.b - l.a);\n }\n\n // 線分lと点pの距離を求める\n // 定義：点pから「線分lのどこか」への最短距離\n D distanceBetweenSegmentAndPoint(const Segment &l, const Point &p) {\n if(dot(l.b - l.a, p - l.a) < EPS) return abs(p - l.a);\n if(dot(l.a - l.b, p - l.b) < EPS) return abs(p - l.b);\n return abs(cross(l.b - l.a, p - l.a)) / abs(l.b - l.a);\n }\n\n // 直線s, tの交点の計算\n Point crossPoint(const Line &s, const Line &t) {\n D d1 = cross(s.b - s.a, t.b - t.a);\n D d2 = cross(s.b - s.a, s.b - t.a);\n if(equal(abs(d1), 0) && equal(abs(d2), 0)) return t.a;\n return t.a + (t.b - t.a) * (d2 / d1);\n }\n\n // 線分s, tの交点の計算\n Point crossPoint(const Segment &s, const Segment &t) {\n return crossPoint(Line(s), Line(t));\n }\n\n // 線分sと線分tが交差しているかどうか\n // bound:線分の端点を含むか\n bool isIntersect(const Segment &s, const Segment &t, bool bound) {\n return ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) < bound &&\n ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) < bound;\n }\n\n // 線分sとtの距離\n D distanceBetweenSegments(const Segment &s, const Segment &t) {\n if(isIntersect(s, t, 1)) return (D)(0);\n D ans = distanceBetweenSegmentAndPoint(s, t.a);\n chmin(ans, distanceBetweenSegmentAndPoint(s, t.b));\n chmin(ans, distanceBetweenSegmentAndPoint(t, s.a));\n chmin(ans, distanceBetweenSegmentAndPoint(t, s.b));\n return ans;\n }\n\n // 射影(projection)\n // 直線(線分)lに点pから引いた垂線の足を求める\n Point projection(const Line &l, const Point &p) {\n D 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 Point projection(const Segment &l, const Point &p) {\n D 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 // 反射(reflection)\n // 直線lを対称軸として点pと線対称の位置にある点を求める\n Point reflection(const Line &l, const Point &p) {\n return p + (projection(l, p) - p) * (D)2.0;\n }\n\n // 2つの円の交差判定\n // 返り値は共通接線の数\n int isIntersect(const Circle &c1, const Circle &c2) {\n D d = abs(c1.p - c2.p);\n // 2つの円が離れている場合\n if(d > c1.r + c2.r + EPS) return 4;\n // 外接している場合\n if(equal(d, c1.r + c2.r)) return 3;\n // 内接している場合\n if(equal(d, abs(c1.r - c2.r))) return 1;\n // 内包している場合\n if(d < abs(c1.r - c2.r) - EPS) return 0;\n return 2;\n }\n\n // 2つの円の交点\n vector<Point> crossPoint(const Circle &c1, const Circle &c2) {\n vector<Point> res;\n int mode = isIntersect(c1, c2);\n // 2つの中心の距離\n D d = abs(c1.p - c2.p);\n // 2円が離れている場合\n if(mode == 4) return res;\n // 1つの円がもう1つの円に内包されている場合\n if(mode == 0) return res;\n // 2円が外接する場合\n if(mode == 3) {\n D t = c1.r / (c1.r + c2.r);\n res.emplace_back(c1.p + (c2.p - c1.p) * t);\n return res;\n }\n // 内接している場合\n if(mode == 1) {\n if(c2.r < c1.r - EPS) {\n res.emplace_back(c1.p + (c2.p - c1.p) * (c1.r / d));\n } else {\n res.emplace_back(c2.p + (c1.p - c2.p) * (c2.r / d));\n }\n return res;\n }\n // 2円が重なる場合\n D rc1 = (c1.r * c1.r + d * d - c2.r * c2.r) / (2 * d);\n D rs1 = sqrt(c1.r * c1.r - rc1 * rc1);\n if(c1.r - abs(rc1) < EPS) rs1 = 0;\n Point e12 = (c2.p - c1.p) / abs(c2.p - c1.p);\n res.emplace_back(c1.p + rc1 * e12 + rs1 * e12 * Point(0, 1));\n res.emplace_back(c1.p + rc1 * e12 + rs1 * e12 * Point(0, -1));\n return res;\n }\n\n // 点pが円cの内部(円周上も含む)に入っているかどうか\n bool isInCircle(const Circle &c, const Point &p) {\n D d = abs(c.p - p);\n return (equal(d, c.r) || d < c.r - EPS);\n }\n\n // 円cと直線lの交点\n vector<Point> crossPoint(const Circle &c, const Line &l) {\n vector<Point> res;\n D d = distanceBetweenLineAndPoint(l, c.p);\n // 交点を持たない\n if(d > c.r + EPS) return res;\n // 接する\n Point h = projection(l, c.p);\n if(equal(d, c.r)) {\n res.emplace_back(h);\n return res;\n }\n Point e = unitVector(l.b - l.a);\n D ph = sqrt(c.r * c.r - d * d);\n res.emplace_back(h - e * ph);\n res.emplace_back(h + e * ph);\n return res;\n }\n\n // 点pを通る円cの接線\n // 2本あるので、接点のみを返す\n vector<Point> tangentToCircle(const Point &p, const Circle &c) {\n return crossPoint(c, Circle(p, sqrt(norm(c.p - p) - c.r * c.r)));\n }\n\n // 円の共通接線\n vector<Line> tangent(const Circle &a, const Circle &b) {\n vector<Line> ret;\n // 2円の中心間の距離\n D g = abs(a.p - b.p);\n // 円が内包されている場合\n if(equal(g, 0)) return ret;\n Point u = unitVector(b.p - a.p);\n Point v = rotate(u, PI / 2);\n for(int s : {-1, 1}) {\n D h = (a.r + b.r * s) / g;\n if(equal(h * h, 1)) {\n ret.emplace_back(a.p + (h > 0 ? u : -u) * a.r,\n a.p + (h > 0 ? u : -u) * a.r + v);\n\n } else if(1 - h * h > 0) {\n Point U = u * h, V = v * sqrt(1 - h * h);\n ret.emplace_back(a.p + (U + V) * a.r,\n b.p - (U + V) * (b.r * s));\n ret.emplace_back(a.p + (U - V) * a.r,\n b.p - (U - V) * (b.r * s));\n }\n }\n return ret;\n }\n\n // 多角形の面積を求める\n D PolygonArea(const vector<Point> &p) {\n D res = 0;\n int n = p.size();\n for(int i = 0; i < n - 1; i++) res += cross(p[i], p[i + 1]);\n res += cross(p[n - 1], p[0]);\n return res * 0.5;\n }\n\n // 凸多角形かどうか\n bool isConvex(const vector<Point> &p) {\n int n = p.size();\n int now, pre, nxt;\n for(int i = 0; i < n; i++) {\n pre = (i - 1 + n) % n;\n nxt = (i + 1) % n;\n now = i;\n if(ccw(p[pre], p[now], p[nxt]) == -1) return false;\n }\n return true;\n }\n\n // 凸包 O(NlogN)\n vector<Point> ConvexHull(vector<Point> &p) {\n int n = (int)p.size(), k = 0;\n sort(all(p), [](const Point &a, const Point &b) {\n return (real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b));\n });\n vector<Point> ch(2 * n);\n // 一直線上の3点を含める -> (< -EPS)\n // 含め無い -> (< EPS)\n for(int i = 0; i < n; ch[k++] = p[i++]) { // lower\n while(k >= 2 &&\n cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < EPS)\n --k;\n }\n for(int i = n - 2, t = k + 1; i >= 0; ch[k++] = p[i--]) { // upper\n while(k >= t &&\n cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < EPS)\n --k;\n }\n ch.resize(k - 1);\n return ch;\n }\n\n // 多角形gに点pが含まれているか?\n // 含まれる:2, 辺上にある:1, 含まれない:0\n int isContained(const vector<Point> &g, const Point &p) {\n bool in = false;\n int n = (int)g.size();\n for(int i = 0; i < n; i++) {\n Point a = g[i] - p, b = g[(i + 1) % n] - p;\n if(imag(a) > imag(b)) swap(a, b);\n if(imag(a) <= EPS && EPS < imag(b) && cross(a, b) < -EPS) in = !in;\n if(cross(a, b) == 0 && dot(a, b) <= 0) return 1;\n }\n return (in ? 2 : 0);\n }\n\n vector<Point> convex_cut(const vector<Point> &g, Line l){\n vector<Point> ret;\n for(int i=0; i<g.size(); i++){\n Point now = g[i], nxt = g[(i+1)%g.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 bool equal (const Point &a, const Point &b) {\n return equal(a.real(),b.real()) && equal(a.imag(),b.imag());\n }\n\n D circlesIntersectArea(Circle &a, Circle &b){\n double d = abs(a.p - b.p);\n if(d >= a.r + b.r - EPS) return 0; //2円が離れている\n auto R = minmax(a.r,b.r);\n if(d <= R.second - R.first + EPS) return R.first*R.first*pi; //円が円を内包する\n D theta1 = acos((d*d + a.r*a.r - b.r*b.r)/(2*a.r*d));\n D theta2 = acos((d*d + b.r*b.r - a.r*a.r)/(2*b.r*d));\n D ret = a.r*a.r*(theta1-cos(theta1)*sin(theta1)) + b.r*b.r*(theta2-cos(theta2)*sin(theta2));\n return ret;\n }\n} // namespace geometry\n\nusing namespace geometry;\n\n\nint main(){\n int x,y;\n while(cin >> x){\n cin >> y;\n vector<Point> a(3),b(3);\n a[0] = Point(x,y);\n rep(i,2){\n int x,y; cin >> x >> y;\n a[i+1] = Point(x,y);\n }\n rep(i,3){\n int x,y; cin >> x >> y;\n b[i] = Point(x,y);\n }\n vl nxt(3); rep(i,3) nxt[i] = i;\n vl nxt2(3); rep(i,3) nxt2[i] = i;\n\n //3回\n bool f = false;\n bool h = false;\n do{\n do{\n auto c = a;\n bool g = true;\n rep(i,3){\n int id = nxt[i];\n int u = (id+1) % 3;\n int v = (id+2) % 3;\n if(isParallel(Line(c[u],c[v]), Line(c[id],b[nxt2[i]]))){\n c[id] = b[nxt2[i]];\n if(i == 0) h = true;\n }else{\n g = false; break;\n }\n }\n if(g) f = true;\n }while(next_permutation(all(nxt2)));\n }while(next_permutation(all(nxt)));\n if(f){\n cout << \"3\\n\";\n continue;\n }\n\n //4回\n if(h){\n cout << \"4\\n\";\n continue;\n }\n rep(j,3){ //最初に動かすもの\n do{\n if(j == nxt[0]) continue;\n do{\n auto c = a;\n Point vec = Point(c[(j+1)%3]-c[(j+2)%3]);\n Line l1(c[j],c[j]+vec);\n Point vec2(c[nxt[0]]-b[nxt2[0]]);\n Line l2(c[3-j-nxt[0]]+vec2,c[3-j-nxt[0]]);\n if(isParallel(l1,l2)) continue;\n c[j] = crossPoint(l1,l2);\n\n //3回のときと同じ\n bool g = true;\n rep(i,3){\n int id = nxt[i];\n int u = (id+1) % 3;\n int v = (id+2) % 3;\n if(isParallel(Line(c[u],c[v]), Line(c[id],b[nxt2[i]]))){\n c[id] = b[nxt2[i]];\n }else{\n if(i == 0) assert(false);\n g = false; break;\n }\n }\n if(g) f = true;\n }while(next_permutation(all(nxt2)));\n }while(next_permutation(all(nxt)));\n }\n if(f){\n cout << \"4\\n\";\n }else{\n cout << \"Many\\n\";\n }\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3468,"score_of_the_acc":-0.819,"final_rank":9},{"submission_id":"aoj_1623_5347461","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nconst double EPS = 0.00001;\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 point operator -(point P){\n return point(x - P.x, y - P.y);\n }\n point operator *(double k){\n return point(x * k, y * k);\n }\n point operator /(double k){\n return point(x / k, y / k);\n }\n};\ndouble abs(point P){\n return sqrt(P.x * P.x + P.y * P.y);\n}\ndouble cross(point P, point Q){\n return P.x * Q.y - P.y * Q.x;\n}\nstruct line{\n point A, B;\n line(point A, point B): A(A), B(B){\n }\n};\npoint vec(line L){\n return L.B - L.A;\n}\nbool is_parallel(line L1, line L2){\n return abs(cross(vec(L1), vec(L2))) <= EPS;\n}\nline parallel(point P, line L){\n return line(P, P + vec(L));\n}\npoint line_intersection(line L1, line L2){\n return L1.A + vec(L1) * cross(L2.A - L1.A, vec(L2)) / cross(vec(L1), vec(L2));\n}\nbool ok(vector<point> A, vector<point> B){\n vector<int> p = {0, 1, 2}, q = {0, 1, 2};\n while (true){\n while (true){\n if (is_parallel(line(A[p[0]], B[q[0]]), line(A[p[1]], A[p[2]]))){\n if (is_parallel(line(A[p[1]], B[q[1]]), line(B[q[0]], A[p[2]]))){\n if (is_parallel(line(A[p[2]], B[q[2]]), line(B[q[0]], B[q[1]]))){\n return true;\n }\n }\n }\n if (!next_permutation(q.begin(), q.end())){\n break;\n }\n }\n if (!next_permutation(p.begin(), p.end())){\n break;\n }\n }\n return false;\n}\nint main(){\n while (true){\n vector<point> A(3);\n cin >> A[0].x;\n if (!cin){\n break;\n }\n cin >> A[0].y;\n for (int i = 1; i < 3; i++){\n cin >> A[i].x >> A[i].y;\n }\n vector<point> B(3);\n for (int i = 0; i < 3; i++){\n cin >> B[i].x >> B[i].y;\n }\n vector<point> C = {A[0], A[1], A[2], B[0], B[1], B[2]};\n if (ok(A, B)){\n cout << 3 << endl;\n } else {\n bool P = false;\n for (int i = 0; i < 2; i++){\n for (int j = 0; j < 3; j++){\n line L1 = parallel(A[j], line(A[(j + 1) % 3], A[(j + 2) % 3]));\n for (int k = 0; k < 6; k++){\n for (int l = 0; l < 6; l++){\n for (int m = l + 1; m < 6; m++){\n line L2 = parallel(C[k], line(C[l], C[m]));\n if (!is_parallel(L1, L2)){\n vector<point> A2 = A;\n A2[j] = line_intersection(L1, L2);\n if (ok(A2, B) || ok(B, A2)){\n P = true;\n }\n }\n }\n }\n }\n }\n swap(A, B);\n }\n if (P){\n cout << 4 << endl;\n } else {\n cout << \"Many\" << endl;\n }\n }\n }\n}","accuracy":1,"time_ms":450,"memory_kb":3124,"score_of_the_acc":-0.0598,"final_rank":1}],"string":"[\n {\n \"submission_id\": \"aoj_1623_9769018\",\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\\nusing T = double;\\nconst T eps = 1e-6;\\nusing Point = complex<T>;\\nusing Poly = vector<Point>;\\n#define X real()\\n#define Y imag()\\ntemplate <typename T> inline bool eq(const T &a, const T &b) {\\n return fabs(a - b) < eps;\\n}\\nbool cmp(const Point &a, const Point &b) {\\n auto sub = [&](Point a) {\\n return (a.Y < 0 ? -1 : (a.Y == 0 && a.X >= 0 ? 0 : 1));\\n };\\n if (sub(a) != sub(b))\\n return sub(a) < sub(b);\\n return a.Y * b.X < a.X * b.Y;\\n}\\nstruct Line {\\n Point a, b, dir;\\n Line() {}\\n Line(Point _a, Point _b) : a(_a), b(_b), dir(b - a) {}\\n Line(T A, T B, T C) {\\n if (eq(A, .0)) {\\n a = Point(0, C / B), b = Point(1 / C / B);\\n } else if (eq(B, .0)) {\\n a = Point(C / A, 0), b = Point(C / A, 1);\\n } else {\\n a = Point(0, C / B), b = Point(C / A, 0);\\n }\\n }\\n};\\nstruct Segment : Line {\\n Segment() {}\\n Segment(Point _a, Point _b) : Line(_a, _b) {}\\n};\\nstruct Circle {\\n Point p;\\n T r;\\n Circle() {}\\n Circle(Point _p, T _r) : p(_p), r(_r) {}\\n};\\n\\nistream &operator>>(istream &is, Point &p) {\\n T x, y;\\n is >> x >> y;\\n p = Point(x, y);\\n return is;\\n}\\nostream &operator<<(ostream &os, Point &p) {\\n os << fixed << setprecision(12) << p.X << ' ' << p.Y;\\n return os;\\n}\\nPoint unit(const Point &a) {\\n return a / abs(a);\\n}\\nT dot(const Point &a, const Point &b) {\\n return a.X * b.X + a.Y * b.Y;\\n}\\nT cross(const Point &a, const Point &b) {\\n return a.X * b.Y - a.Y * b.X;\\n}\\nPoint rot(const Point &a, const T &theta) {\\n return Point(cos(theta) * a.X - sin(theta) * a.Y,\\n sin(theta) * a.X + cos(theta) * a.Y);\\n}\\nPoint rot90(const Point &a) {\\n return Point(-a.Y, a.X);\\n}\\nT arg(const Point &a, const Point &b, const Point &c) {\\n double ret = acos(dot(a - b, c - b) / abs(a - b) / abs(c - b));\\n if (cross(a - b, c - b) < 0)\\n ret = -ret;\\n return ret;\\n}\\n\\nPoint Projection(const Line &l, const Point &p) {\\n T t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n return l.a + (l.a - l.b) * t;\\n}\\nPoint Projection(const Segment &l, const Point &p) {\\n T t = dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n return l.a + (l.a - l.b) * t;\\n}\\nPoint Reflection(const Line &l, const Point &p) {\\n return p + (Projection(l, p) - p) * 2.;\\n}\\nint ccw(const Point &a, Point b, Point c) {\\n b -= a;\\n c -= a;\\n if (cross(b, c) > eps)\\n return 1; // ccw\\n\\n if (cross(b, c) < -eps)\\n return -1; // cw\\n\\n if (dot(b, c) < 0)\\n return 2; // c,a,b\\n\\n if (norm(b) < norm(c))\\n return -2; // a,b,c\\n\\n return 0; // a,c,b\\n\\n}\\nbool isOrthogonal(const Line &a, const Line &b) {\\n return eq(dot(a.b - a.a, b.b - b.a), .0);\\n}\\nbool isParallel(const Line &a, const Line &b) {\\n return eq(cross(a.b - a.a, b.b - b.a), .0);\\n}\\nbool isIntersect(const Segment &a, const Segment &b) {\\n return ccw(a.a, a.b, b.a) * ccw(a.a, a.b, b.b) <= 0 and\\n ccw(b.a, b.b, a.a) * ccw(b.a, b.b, a.b) <= 0;\\n}\\nint isIntersect(const Circle &a, const Circle &b) {\\n T d = abs(a.p - b.p);\\n if (d > a.r + b.r + eps)\\n return 4;\\n if (eq(d, a.r + b.r))\\n return 3;\\n if (eq(d, abs(a.r - b.r)))\\n return 1;\\n if (d < abs(a.r - b.r) - eps)\\n return 0;\\n return 2;\\n}\\nT Dist(const Line &a, const Point &b) {\\n Point c = Projection(a, b);\\n return abs(c - b);\\n}\\nT Dist(const Segment &a, const Point &b) {\\n if (dot(a.b - a.a, b - a.a) < eps)\\n return abs(b - a.a);\\n if (dot(a.a - a.b, b - a.b) < eps)\\n return abs(b - a.b);\\n return abs(cross(a.b - a.a, b - a.a)) / abs(a.b - a.a);\\n}\\nT Dist(const Segment &a, const Segment &b) {\\n if (isIntersect(a, b))\\n return .0;\\n T res = min({Dist(a, b.a), Dist(a, b.b), Dist(b, a.a), Dist(b, a.b)});\\n return res;\\n}\\nPoint Intersection(const Line &a, const Line &b) {\\n T d1 = cross(a.b - a.a, b.b - b.a);\\n T d2 = cross(a.b - a.a, a.b - b.a);\\n if (eq(d1, 0.) and eq(d2, 0.))\\n return b.a;\\n return b.a + (b.b - b.a) * (d2 / d1);\\n}\\nPoly Intersection(const Circle &a, const Line &b) {\\n Poly res;\\n T d = Dist(b, a.p);\\n if (d > a.r + eps)\\n return res;\\n Point h = Projection(b, a.p);\\n if (eq(d, a.r)) {\\n res.push_back(h);\\n return res;\\n }\\n Point e = unit(b.b - b.a);\\n T ph = sqrt(a.r * a.r - d * d);\\n res.push_back(h - e * ph);\\n res.push_back(h + e * ph);\\n return res;\\n}\\nPoly Intersection(const Circle &a, const Segment &b) {\\n Line c(b.a, b.b);\\n Poly sub = Intersection(a, c);\\n double xmi = min(b.a.X, b.b.X), xma = max(b.a.X, b.b.X);\\n double ymi = min(b.a.Y, b.b.Y), yma = max(b.a.Y, b.b.Y);\\n Poly res;\\n rep(i, 0, sub.size()) {\\n if (xmi <= sub[i].X + eps and sub[i].X - eps <= xma and\\n ymi <= sub[i].Y + eps and sub[i].Y - eps <= yma) {\\n res.push_back(sub[i]);\\n }\\n }\\n return res;\\n}\\nPoly Intersection(const Circle &a, const Circle &b) {\\n Poly res;\\n int mode = isIntersect(a, b);\\n T d = abs(a.p - b.p);\\n if (mode == 4 or mode == 0)\\n return res;\\n if (mode == 3) {\\n T t = a.r / (a.r + b.r);\\n res.push_back(a.p + (b.p - a.p) * t);\\n return res;\\n }\\n if (mode == 1) {\\n if (b.r < a.r - eps) {\\n res.push_back(a.p + (b.p - a.p) * (a.r / d));\\n } else {\\n res.push_back(b.p + (a.p - b.p) * (b.r / d));\\n }\\n return res;\\n }\\n T rc = (a.r * a.r + d * d - b.r * b.r) / d / 2.;\\n T rs = sqrt(a.r * a.r - rc * rc);\\n if (a.r - abs(rc) < eps)\\n rs = 0;\\n Point e = unit(b.p - a.p);\\n res.push_back(a.p + rc * e + rs * e * Point(0, 1));\\n res.push_back(a.p + rc * e + rs * e * Point(0, -1));\\n return res;\\n}\\nPoly HalfplaneIntersection(vector<Line> &H) {\\n sort(ALL(H), [&](Line &l1, Line &l2) { return cmp(l1.dir, l2.dir); });\\n auto outside = [&](Line &L, Point p) -> bool {\\n return cross(L.dir, p - L.a) < -eps;\\n };\\n deque<Line> deq;\\n int sz = 0;\\n rep(i, 0, SZ(H)) {\\n while (sz > 1 and\\n outside(H[i], Intersection(deq[sz - 1], deq[sz - 2]))) {\\n deq.pop_back();\\n sz--;\\n }\\n while (sz > 1 and outside(H[i], Intersection(deq[0], deq[1]))) {\\n deq.pop_front();\\n sz--;\\n }\\n if (sz > 0 and fabs(cross(H[i].dir, deq[sz - 1].dir)) < eps) {\\n if (dot(H[i].dir, deq[sz - 1].dir) < 0) {\\n return {};\\n }\\n if (outside(H[i], deq[sz - 1].a)) {\\n deq.pop_back();\\n sz--;\\n } else\\n continue;\\n }\\n deq.push_back(H[i]);\\n sz++;\\n }\\n\\n while (sz > 2 and outside(deq[0], Intersection(deq[sz - 1], deq[sz - 2]))) {\\n deq.pop_back();\\n sz--;\\n }\\n while (sz > 2 and outside(deq[sz - 1], Intersection(deq[0], deq[1]))) {\\n deq.pop_front();\\n sz--;\\n }\\n if (sz < 3)\\n return {};\\n deq.push_back(deq.front());\\n Poly ret;\\n rep(i, 0, sz) ret.push_back(Intersection(deq[i], deq[i + 1]));\\n return ret;\\n}\\n\\nT Area(const Poly &a) {\\n T res = 0;\\n int n = a.size();\\n rep(i, 0, n) res += cross(a[i], a[(i + 1) % n]);\\n return fabs(res / 2.);\\n}\\nT Area(const Poly &a, const Circle &b) {\\n int n = a.size();\\n if (n < 3)\\n return .0;\\n auto rec = [&](auto self, const Circle &c, const Point &p1,\\n const Point &p2) {\\n Point va = c.p - p1, vb = c.p - p2;\\n T f = cross(va, vb), res = .0;\\n if (eq(f, .0))\\n return res;\\n if (max(abs(va), abs(vb)) < c.r + eps)\\n return f;\\n if (Dist(Segment(p1, p2), c.p) > c.r - eps)\\n return c.r * c.r * arg(vb * conj(va));\\n auto u = Intersection(c, Segment(p1, p2));\\n Poly sub;\\n sub.push_back(p1);\\n for (auto &x : u)\\n sub.push_back(x);\\n sub.push_back(p2);\\n rep(i, 0, sub.size() - 1) res += self(self, c, sub[i], sub[i + 1]);\\n return res;\\n };\\n T res = .0;\\n rep(i, 0, n) res += rec(rec, b, a[i], a[(i + 1) % n]);\\n return fabs(res / 2.);\\n}\\nT Area(const Circle &a, const Circle &b) {\\n T d = abs(a.p - b.p);\\n if (d >= a.r + b.r - eps)\\n return .0;\\n if (d <= abs(a.r - b.r) + eps) {\\n T r = min(a.r, b.r);\\n return M_PI * r * r;\\n }\\n T ath = acos((a.r * a.r + d * d - b.r * b.r) / d / a.r / 2.);\\n T res = a.r * a.r * (ath - sin(ath * 2) / 2.);\\n T bth = acos((b.r * b.r + d * d - a.r * a.r) / d / b.r / 2.);\\n res += b.r * b.r * (bth - sin(bth * 2) / 2.);\\n return fabs(res);\\n}\\nbool isConvex(const Poly &a) {\\n int n = a.size();\\n int cur, pre, nxt;\\n rep(i, 0, n) {\\n pre = (i - 1 + n) % n;\\n nxt = (i + 1) % n;\\n cur = i;\\n if (ccw(a[pre], a[cur], a[nxt]) == -1)\\n return 0;\\n }\\n return 1;\\n}\\nint isContained(const Poly &a,\\n const Point &b) { // 0:not contain,1:on edge,2:contain\\n\\n bool res = 0;\\n int n = a.size();\\n rep(i, 0, n) {\\n Point p = a[i] - b, q = a[(i + 1) % n] - b;\\n if (p.Y > q.Y)\\n swap(p, q);\\n if (p.Y < eps and eps < q.Y and cross(p, q) > eps)\\n res ^= 1;\\n if (eq(cross(p, q), .0) and dot(p, q) < eps)\\n return 1;\\n }\\n return (res ? 2 : 0);\\n}\\nPoly ConvexHull(Poly &a) {\\n sort(ALL(a), [](const Point &p, const Point &q) {\\n return (eq(p.Y, q.Y) ? p.X < q.X : p.Y < q.Y);\\n });\\n a.erase(unique(ALL(a)), a.end());\\n int n = a.size(), k = 0;\\n Poly res(n * 2);\\n for (int i = 0; i < n; res[k++] = a[i++]) {\\n while (k >= 2 and\\n cross(res[k - 1] - res[k - 2], a[i] - res[k - 1]) < eps)\\n k--;\\n }\\n for (int i = n - 2, t = k + 1; i >= 0; res[k++] = a[i--]) {\\n while (k >= t and\\n cross(res[k - 1] - res[k - 2], a[i] - res[k - 1]) < eps)\\n k--;\\n }\\n res.resize(k - 1);\\n return res;\\n}\\nT Diam(const Poly &a) {\\n int n = a.size();\\n int x = 0, y = 0;\\n rep(i, 1, n) {\\n if (a[i].Y > a[x].Y)\\n x = i;\\n if (a[i].Y < a[y].Y)\\n y = i;\\n }\\n T res = abs(a[x] - a[y]);\\n int i = x, j = y;\\n do {\\n if (cross(a[(i + 1) % n] - a[i], a[(j + 1) % n] - a[j]) < 0)\\n i = (i + 1) % n;\\n else\\n j = (j + 1) % n;\\n chmax(res, abs(a[i] - a[j]));\\n } while (i != x or j != y);\\n return res;\\n}\\nPoly Cut(const Poly &a, const Line &l) {\\n int n = a.size();\\n Poly res;\\n rep(i, 0, n) {\\n Point p = a[i], q = a[(i + 1) % n];\\n if (ccw(l.a, l.b, p) != -1)\\n res.push_back(p);\\n if (ccw(l.a, l.b, p) * ccw(l.a, l.b, q) < 0)\\n res.push_back(Intersection(Line(p, q), l));\\n }\\n return res;\\n}\\n\\nT Closest(Poly &a) {\\n int n = a.size();\\n if (n <= 1)\\n return 0;\\n sort(ALL(a), [&](Point a, Point b) {\\n return (eq(a.X, b.X) ? a.Y < b.Y : a.X < b.X);\\n });\\n Poly buf(n);\\n auto rec = [&](auto self, int lb, int rb) -> T {\\n if (rb - lb <= 1)\\n return (T)INF;\\n int mid = (lb + rb) >> 1;\\n auto x = a[mid].X;\\n T res = min(self(self, lb, mid), self(self, mid, rb));\\n inplace_merge(a.begin() + lb, a.begin() + mid, a.begin() + rb,\\n [&](auto p, auto q) { return p.Y < q.Y; });\\n int ptr = 0;\\n rep(i, lb, rb) {\\n if (abs(a[i].X - x) >= res)\\n continue;\\n rep(j, 0, ptr) {\\n auto sub = a[i] - buf[ptr - 1 - j];\\n if (sub.Y >= res)\\n break;\\n chmin(res, abs(sub));\\n }\\n buf[ptr++] = a[i];\\n }\\n return res;\\n };\\n return rec(rec, 0, n);\\n}\\n\\nCircle Incircle(const Point &a, const Point &b, const Point &c) {\\n T A = abs(b - c), B = abs(c - a), C = abs(a - b);\\n Point p(A * a.X + B * b.X + C * c.X, A * a.Y + B * b.Y + C * c.Y);\\n p /= (A + B + C);\\n T r = Dist(Line(a, b), p);\\n return Circle(p, r);\\n}\\nCircle Circumcircle(const Point &a, const Point &b, const Point &c) {\\n Line l1((a + b) / 2., (a + b) / 2. + (b - a) * Point(0, 1));\\n Line l2((b + c) / 2., (b + c) / 2. + (c - b) * Point(0, 1));\\n Point p = Intersection(l1, l2);\\n return Circle(p, abs(p - a));\\n}\\nPoly tangent(const Point &a, const Circle &b) {\\n return Intersection(b, Circle(a, sqrt(norm(b.p - a) - b.r * b.r)));\\n}\\nvector<Line> tangent(const Circle &a, const Circle &b) {\\n vector<Line> res;\\n T d = abs(a.p - b.p);\\n if (eq(d, 0.))\\n return res;\\n Point u = unit(b.p - a.p);\\n Point v = u * Point(0, 1);\\n for (int t : {-1, 1}) {\\n T h = (a.r + b.r * t) / d;\\n if (eq(h * h, 1.)) {\\n res.push_back(Line(a.p + (h > 0 ? u : -u) * a.r,\\n a.p + (h > 0 ? u : -u) * a.r + v));\\n } else if (1 > h * h) {\\n Point U = u * h, V = v * sqrt(1 - h * h);\\n res.push_back(Line(a.p + (U + V) * a.r, b.p - (U + V) * (b.r * t)));\\n res.push_back(Line(a.p + (U - V) * a.r, b.p - (U - V) * (b.r * t)));\\n }\\n }\\n return res;\\n}\\n\\n/**\\n * @brief Geometry\\n */\\n\\nint main() {\\n Point P[2][3];\\n double x,y;\\nwhile(cin >> x >> y) {\\n P[0][0] = Point(x,y);\\n rep(i,0,2) {\\n rep(j,0,3) {\\n if (i == 0 && j == 0) continue;\\n cin >> x >> y;\\n P[i][j] = Point(x,y);\\n }\\n }\\n auto DFS = [&](auto self, vector<Point> match, vector<Point> tmp, int id, int Dep) -> int {\\n if (Dep >= 5) return 5;\\n if (id == 3) {\\n rep(i,0,3) {\\n if (!eq(tmp[i],match[i])) return 5;\\n }\\n return Dep;\\n }\\n int Ret = 5;\\n Point P1 = tmp[id], P2 = tmp[(id+1)%3], P3 = tmp[(id+2)%3];\\n Point Q = match[id];\\n if (isParallel(Line(P1,Q),Line(P2,P3))) {\\n vector<Point> next = tmp;\\n next[id] = Q;\\n chmin(Ret,self(self,match,next,id+1,Dep+1));\\n }\\n else {\\n {\\n vector<Point> next = tmp;\\n next[id] = Q;\\n next[(id+1)%3] = Intersection(Line(P2,P2+P3-P1),Line(P3,P3+P1-Q));\\n chmin(Ret,self(self,match,next,id+1,Dep+2));\\n }\\n {\\n vector<Point> next = tmp;\\n next[id] = Q;\\n next[(id+2)%3] = Intersection(Line(P3,P3+P2-P1),Line(P2,P2+P1-Q));\\n chmin(Ret,self(self,match,next,id+1,Dep+2));\\n }\\n }\\n return Ret;\\n };\\n int ANS = 5;\\n vector<int> ord1(3);\\n iota(ALL(ord1),0);\\n do {\\n vector<int> ord2(3);\\n iota(ALL(ord2),0);\\n do {\\n vector<Point> match(3);\\n rep(i,0,3) match[i] = P[0][ord1[i]];\\n vector<Point> tmp(3);\\n rep(i,0,3) tmp[i] = P[1][ord2[i]];\\n chmin(ANS, DFS(DFS,match,tmp,0,0));\\n } while(next_permutation(ALL(ord2)));\\n } while(next_permutation(ALL(ord1)));\\n if (ANS == 5) cout << \\\"Many\\\" << endl;\\n else cout << ANS << endl;\\n}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3488,\n \"score_of_the_acc\": -0.8721,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1623_9283785\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing P = pair<ll, ll>;\\n#define rep(i, a, b) for(ll i = a; i < b; ++i)\\n#define rrep(i, a, b) for(ll i = a; i >= b; --i)\\nconstexpr ll inf = 4e18;\\nusing Real = long double;\\nconst Real EPS = 1e-8, PI = acos(Real(-1.0));\\nint sign(const Real& r) {\\n if(r <= -EPS) return -1;\\n if(r >= +EPS) return +1;\\n return 0;\\n}\\nbool eq(const Real& a, const Real& b) {\\n return sign(a - b) == 0;\\n}\\nusing Point = complex<Real>;\\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, const Point& p) {\\n return os << p.real() << ' ' << p.imag();\\n}\\nReal dot(const Point& p1, const Point& p2) {\\n return (conj(p1) * p2).real();\\n}\\nReal cross(const Point& p1, const Point& p2) {\\n return (conj(p1) * p2).imag();\\n}\\nint ccw(const Point& a, Point b, Point c) {\\n b -= a;\\n c -= a;\\n if(sign(cross(b, c)) == 1) return 1;\\n if(sign(cross(b, c)) == -1) return -1;\\n if(sign(dot(b, c)) == -1) return +2;\\n if(norm(b) < norm(c)) return -2;\\n return 0;\\n}\\nstruct Line {\\n Point a, b;\\n Line() = default;\\n Line(const Point& a, const Point& b)\\n : a(a), b(b) {}\\n};\\nusing Segment = Line;\\nbool is_parallel(const Line& a, const Line& b) {\\n return eq(cross(a.b - a.a, b.b - b.a), 0.0);\\n}\\nbool is_intersect_ll(const Line& l1, const Line& l2) {\\n if(!eq(cross(l1.b - l1.a, l2.b - l2.a), 0.0)) return true;\\n return eq(cross(l1.b - l1.a, l2.b - l1.a), 0.0);\\n}\\nvector<Point> intersection_ll(const Line& l1, const Line& l2) {\\n vector<Point> res;\\n if(!is_intersect_ll(l1, l2)) return res;\\n Real a = cross(l1.b - l1.a, l2.b - l2.a);\\n Real b = cross(l1.b - l1.a, l1.b - l2.a);\\n if(eq(a, 0.0) and eq(b, 0.0)) {\\n res.push_back(l2.a);\\n } else {\\n res.push_back(l2.a + (l2.b - l2.a) * b / a);\\n }\\n return res;\\n}\\nint main(void) {\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n vector<Point> p1(3), p2(3);\\n while(cin >> p1[0]) {\\n rep(i, 1, 3) cin >> p1[i];\\n rep(i, 0, 3) cin >> p2[i];\\n auto is_three = [&](vector<Point> t1, vector<Point> t2, vector<int> ord) -> bool {\\n rep(i, 0, 3) {\\n Line l1 = Line(t1[ord[i]], t2[ord[i]]);\\n Line l2 = Line(t1[ord[(i + 1) % 3]], t1[ord[(i + 2) % 3]]);\\n if(!is_parallel(l1, l2)) return false;\\n t1[ord[i]] = t2[ord[i]];\\n }\\n return true;\\n };\\n auto is_four = [&](vector<Point> t1, vector<Point> t2, vector<int> ord) -> bool {\\n Line l1 = Line(t1[ord[0]], t2[ord[0]]);\\n Line l2 = Line(t1[ord[1]], t1[ord[2]]);\\n if(is_parallel(l1, l2)) {\\n vector<Point> t3 = t1;\\n t3[ord[0]] = t2[ord[0]];\\n\\n Point dir1 = t3[ord[1]] - t2[ord[1]];\\n Line l3 = Line(t3[ord[0]], t3[ord[0]] + dir1);\\n Point dir2 = t3[ord[0]] - t3[ord[1]];\\n Line l4 = Line(t3[ord[2]], t3[ord[2]] + dir2);\\n if(is_intersect_ll(l3, l4)) return true;\\n\\n return false;\\n }\\n\\n Point dir1 = t1[ord[0]] - t1[ord[2]];\\n Line l3 = Line(t1[ord[1]], t1[ord[1]] + dir1);\\n Point dir2 = t1[ord[0]] - t2[ord[0]];\\n Line l4 = Line(t1[ord[2]], t1[ord[2]] + dir2);\\n vector<Point> cand1 = intersection_ll(l3, l4);\\n if(!cand1.empty()) {\\n vector<Point> t3 = t1;\\n t3[ord[1]] = cand1[0];\\n vector<int> ord2(3);\\n rep(i, 0, 3) ord2[i] = i;\\n do {\\n if(is_three(t3, t2, ord2)) return true;\\n } while(next_permutation(ord2.begin(), ord2.end()));\\n }\\n\\n Point dir3 = t1[ord[0]] - t1[ord[1]];\\n Line l5 = Line(t1[ord[2]], t1[ord[2]] + dir3);\\n Point dir4 = t1[ord[0]] - t2[ord[0]];\\n Line l6 = Line(t1[ord[1]], t1[ord[1]] + dir4);\\n vector<Point> cand2 = intersection_ll(l5, l6);\\n if(!cand2.empty()) {\\n vector<Point> t3 = t1;\\n t3[ord[2]] = cand2[0];\\n vector<int> ord2(3);\\n rep(i, 0, 3) ord2[i] = i;\\n do {\\n if(is_three(t3, t2, ord2)) return true;\\n } while(next_permutation(ord2.begin(), ord2.end()));\\n }\\n\\n return false;\\n };\\n vector<int> perm(3);\\n rep(i, 0, 3) perm[i] = i;\\n int ans = 5;\\n do {\\n vector<Point> t2 = p2;\\n vector<Point> t1(3);\\n rep(i, 0, 3) {\\n t1[i] = p1[perm[i]];\\n }\\n if(ccw(t1[0], t1[1], t1[2]) != ccw(t2[0], t2[1], t2[2])) continue;\\n vector<int> ord(3);\\n rep(i, 0, 3) ord[i] = i;\\n do {\\n if(is_three(t1, t2, ord)) ans = min(ans, 3);\\n if(is_four(t1, t2, ord)) ans = min(ans, 4);\\n } while(next_permutation(ord.begin(), ord.end()));\\n } while(next_permutation(perm.begin(), perm.end()));\\n if(ans == 5) {\\n cout << \\\"Many\\\" << '\\\\n';\\n } else {\\n cout << ans << '\\\\n';\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3544,\n \"score_of_the_acc\": -1.0041,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1623_9283770\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing P = pair<ll, ll>;\\n#define rep(i, a, b) for(ll i = a; i < b; ++i)\\n#define rrep(i, a, b) for(ll i = a; i >= b; --i)\\nconstexpr ll inf = 4e18;\\nusing Real = long double;\\nconst Real EPS = 1e-8, PI = acos(Real(-1.0));\\nint sign(const Real& r) {\\n if(r <= -EPS) return -1;\\n if(r >= +EPS) return +1;\\n return 0;\\n}\\nbool eq(const Real& a, const Real& b) {\\n return sign(a - b) == 0;\\n}\\nusing Point = complex<Real>;\\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, const Point& p) {\\n return os << p.real() << ' ' << p.imag();\\n}\\nReal dot(const Point& p1, const Point& p2) {\\n return (conj(p1) * p2).real();\\n}\\nReal cross(const Point& p1, const Point& p2) {\\n return (conj(p1) * p2).imag();\\n}\\nint ccw(const Point& a, Point b, Point c) {\\n b -= a;\\n c -= a;\\n if(sign(cross(b, c)) == 1) return 1;\\n if(sign(cross(b, c)) == -1) return -1;\\n if(sign(dot(b, c)) == -1) return +2;\\n if(norm(b) < norm(c)) return -2;\\n return 0;\\n}\\nstruct Line {\\n Point a, b;\\n Line() = default;\\n Line(const Point& a, const Point& b)\\n : a(a), b(b) {}\\n};\\nusing Segment = Line;\\nbool is_parallel(const Line& a, const Line& b) {\\n return eq(cross(a.b - a.a, b.b - b.a), 0.0);\\n}\\nbool is_intersect_ll(const Line& l1, const Line& l2) {\\n if(!eq(cross(l1.b - l1.a, l2.b - l2.a), 0.0)) return true;\\n return eq(cross(l1.b - l1.a, l2.b - l1.a), 0.0);\\n}\\nvector<Point> intersection_ll(const Line& l1, const Line& l2) {\\n vector<Point> res;\\n if(!is_intersect_ll(l1, l2)) return res;\\n Real a = cross(l1.b - l1.a, l2.b - l2.a);\\n Real b = cross(l1.b - l1.a, l1.b - l2.a);\\n if(eq(a, 0.0) and eq(b, 0.0)) {\\n res.push_back(l2.a);\\n } else {\\n res.push_back(l2.a + (l2.b - l2.a) * b / a);\\n }\\n return res;\\n}\\nint main(void) {\\n cin.tie(0);\\n ios::sync_with_stdio(0);\\n while(1) {\\n vector<Point> p1(3), p2(3);\\n rep(i, 0, 3) cin >> p1[i];\\n if(cin.eof()) break;\\n rep(i, 0, 3) cin >> p2[i];\\n if(cin.eof()) break;\\n auto is_three = [&](vector<Point> t1, vector<Point> t2, vector<int> ord) -> bool {\\n rep(i, 0, 3) {\\n Line l1 = Line(t1[ord[i]], t2[ord[i]]);\\n Line l2 = Line(t1[ord[(i + 1) % 3]], t1[ord[(i + 2) % 3]]);\\n if(!is_parallel(l1, l2)) return false;\\n t1[ord[i]] = t2[ord[i]];\\n }\\n return true;\\n };\\n auto is_four = [&](vector<Point> t1, vector<Point> t2, vector<int> ord) -> bool {\\n Line l1 = Line(t1[ord[0]], t2[ord[0]]);\\n Line l2 = Line(t1[ord[1]], t1[ord[2]]);\\n if(is_parallel(l1, l2)) {\\n vector<Point> t3 = t1;\\n t3[ord[0]] = t2[ord[0]];\\n\\n Point dir1 = t3[ord[1]] - t2[ord[1]];\\n Line l3 = Line(t3[ord[0]], t3[ord[0]] + dir1);\\n Point dir2 = t3[ord[0]] - t3[ord[1]];\\n Line l4 = Line(t3[ord[2]], t3[ord[2]] + dir2);\\n if(is_intersect_ll(l3, l4)) return true;\\n\\n return false;\\n }\\n\\n Point dir1 = t1[ord[0]] - t1[ord[2]];\\n Line l3 = Line(t1[ord[1]], t1[ord[1]] + dir1);\\n Point dir2 = t1[ord[0]] - t2[ord[0]];\\n Line l4 = Line(t1[ord[2]], t1[ord[2]] + dir2);\\n vector<Point> cand1 = intersection_ll(l3, l4);\\n if(!cand1.empty()) {\\n vector<Point> t3 = t1;\\n t3[ord[1]] = cand1[0];\\n vector<int> ord2(3);\\n rep(i, 0, 3) ord2[i] = i;\\n do {\\n if(is_three(t3, t2, ord2)) return true;\\n } while(next_permutation(ord2.begin(), ord2.end()));\\n }\\n\\n Point dir3 = t1[ord[0]] - t1[ord[1]];\\n Line l5 = Line(t1[ord[2]], t1[ord[2]] + dir3);\\n Point dir4 = t1[ord[0]] - t2[ord[0]];\\n Line l6 = Line(t1[ord[1]], t1[ord[1]] + dir4);\\n vector<Point> cand2 = intersection_ll(l5, l6);\\n if(!cand2.empty()) {\\n vector<Point> t3 = t1;\\n t3[ord[2]] = cand2[0];\\n vector<int> ord2(3);\\n rep(i, 0, 3) ord2[i] = i;\\n do {\\n if(is_three(t3, t2, ord2)) return true;\\n } while(next_permutation(ord2.begin(), ord2.end()));\\n }\\n\\n return false;\\n };\\n vector<int> perm(3);\\n rep(i, 0, 3) perm[i] = i;\\n int ans = 5;\\n do {\\n vector<Point> t2 = p2;\\n vector<Point> t1(3);\\n rep(i, 0, 3) {\\n t1[i] = p1[perm[i]];\\n }\\n if(ccw(t1[0], t1[1], t1[2]) != ccw(t2[0], t2[1], t2[2])) continue;\\n vector<int> ord(3);\\n rep(i, 0, 3) ord[i] = i;\\n do {\\n if(is_three(t1, t2, ord)) ans = min(ans, 3);\\n if(is_four(t1, t2, ord)) ans = min(ans, 4);\\n } while(next_permutation(ord.begin(), ord.end()));\\n } while(next_permutation(perm.begin(), perm.end()));\\n if(ans == 5) {\\n cout << \\\"Many\\\";\\n } else {\\n cout << ans;\\n }\\n if(cin.eof()) break;\\n cout << '\\\\n';\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3424,\n \"score_of_the_acc\": -0.7184,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1623_9282361\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing vll = vector<ll>;\\n#define all(A) A.begin(),A.end()\\n#define rep(i, n) for (int i = 0; i < (int) (n); i++)\\n\\nbool OK = 1;\\nbool is_diff(vll& PX, vll& PY, vll& QX, vll& QY, ll a, ll b, bool DIFF) {\\n ll dx = PX[(a + 1) % 3] - PX[(a + 2) % 3];\\n ll dy = PY[(a + 1) % 3] - PY[(a + 2) % 3];\\n\\n ll DX = PX[a] - QX[b];\\n ll DY = PY[a] - QY[b];\\n\\n ll g = gcd(dx, dy);\\n dx /= g;\\n dy /= g;\\n if (dx < 0) {\\n dx *= -1;\\n dy *= -1;\\n }\\n if (dx == 0 && dy <= 0)dy *= -1;\\n\\n ll G = gcd(DX, DY);\\n DX /= G;\\n DY /= G;\\n if (DX < 0) {\\n DX *= -1;\\n DY *= -1;\\n }\\n if (DX == 0 && DY < 0)DY *= -1;\\n if (dx == DX && dy == DY) {\\n PX[a] = QX[b];\\n PY[a] = QY[b];\\n return 0;\\n }\\n\\n\\n\\n\\n if (DIFF)return 1;\\n DX = QX[(b + 1) % 3] - QX[(b + 2) % 3];\\n DY = QY[(b + 1) % 3] - QY[(b + 2) % 3];\\n\\n G = gcd(DX, DY);\\n DX /= G;\\n DY /= G;\\n if (DX < 0) {\\n DX *= -1;\\n DY *= -1;\\n }\\n if (DX == 0 && DY < 0)DY *= -1;\\n if (dx == DX && dy == DY) {\\n OK = 0;\\n return 1;\\n }\\n\\n\\n\\n\\n ll RHS = dy * DX - dx * DY;\\n ll LHS = dy * DX * PX[a] - dx * DX * PY[a] - DY * dx * QX[b] + dx * DX * QY[b];\\n ll GHS = gcd(RHS, LHS);\\n RHS /= GHS;\\n LHS /= GHS;\\n // if (RHS < 0) {\\n // RHS *= -1;\\n // LHS *= -1;\\n // }\\n //nx=LHS/RHS\\n //ny=dy/dx*(nx-PX[a])+PY[a]\\n //ny=DY/DX*(nx-QX[b])+QY[b]\\n if (dx != 0) {\\n rep(i, 3) {\\n if (i != a) {\\n PX[i] *= (RHS * dx);\\n PY[i] *= (RHS * dx);\\n }\\n if (i != b) {\\n QX[i] *= (RHS * dx);\\n QY[i] *= (RHS * dx);\\n }\\n }\\n ll u = PX[a];\\n ll v = PY[a];\\n PX[a] = QX[b] = LHS * dx;\\n //DY*(LHS-u*RHS)+v*DX*RHS;\\n PY[a] = QY[b] = dy * (LHS - u * RHS) + v * dx * RHS;\\n }\\n else {\\n rep(i, 3) {\\n if (i != a) {\\n PX[i] *= (RHS * DX);\\n PY[i] *= (RHS * DX);\\n }\\n if (i != b) {\\n QX[i] *= (RHS * DX);\\n QY[i] *= (RHS * DX);\\n }\\n }\\n //ny=DY/DX*(nx-QX[b])+QY[b]\\n ll u = QX[b];\\n ll v = QY[b];\\n PX[a] = QX[b] = LHS * DX;\\n PY[a] = QY[b] = DY * (LHS - u * RHS) + v * DX * RHS;\\n }\\n return 1;\\n}\\n\\nbool eq(vll& PX, vll& PY, vll& QX, vll& QY) {\\n vector<pair<ll, ll>> P(3), Q(3);\\n rep(i, 3) {\\n P[i] = { PX[i],PY[i] };\\n Q[i] = { QX[i],QY[i] };\\n }\\n sort(all(P));\\n sort(all(Q));\\n return P == Q;\\n}\\n\\nint main() {\\n\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n\\n\\n\\n vector<ll> X(6), Y(6);\\n while (cin >> X[0] >> Y[0]) {\\n rep(i, 5)cin >> X[i + 1] >> Y[i + 1];\\n\\n ll an = 5;\\n\\n rep(uu,2){\\n rep(aa, 9)rep(bb, 9)rep(cc, 9)rep(dd, 9) {\\n if (aa / 3 == bb / 3 || bb / 3 == cc / 3 || dd / 3 == cc / 3)continue;\\n vector<ll> PX, PY, QX, QY;\\n rep(i, 3) {\\n PX.push_back(X[i]);\\n PY.push_back(Y[i]);\\n QX.push_back(X[i + 3]);\\n QY.push_back(Y[i + 3]);\\n }\\n bool DIFF = 0;\\n vll MV = { aa,bb,cc,dd };\\n rep(p, 4) {\\n if (aa == 0 && bb == 3 && cc <= 16) {\\n cout << \\\"\\\";\\n }\\n if (!eq(PX, PY, QX, QY)) {\\n ll a = MV[p] / 3;\\n ll b = MV[p] % 3;\\n OK = 1;\\n if (PX[a] != QX[b] || PY[a] != QY[b]) {\\n bool dif = is_diff(PX, PY, QX, QY, a, b, DIFF);\\n if (DIFF && dif)OK = 0;\\n if (dif)DIFF = 1;\\n if (!OK) {\\n continue;\\n }\\n }\\n }\\n }\\n\\n if (eq(PX, PY, QX, QY)) {\\n // if (!DIFF)cout << aa << \\\" \\\" << bb << \\\" \\\" << cc << \\\" \\\" << dd << endl;\\n if (!DIFF)an = min(an, 3ll);\\n else an = min(an, 4ll);\\n }\\n\\n }\\n rep(i,3){\\n swap(X[i],X[i+3]);\\n swap(Y[i],Y[i+3]);\\n }\\n\\n }\\n if (an > 4)cout << \\\"Many\\\" << endl;\\n else cout << an << endl;\\n\\n }\\n\\n\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 7370,\n \"memory_kb\": 3460,\n \"score_of_the_acc\": -1.8,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1623_9072252\",\n \"code_snippet\": \"#line 2 \\\"cp-library/src/cp-template.hpp\\\"\\n#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nusing i32 = int;\\nusing u32 = unsigned int;\\nusing i64 = long long;\\nusing u64 = unsigned long long;\\nusing i128 = __int128_t;\\ntemplate < class T > bool chmin(T& a, T b) { if(a > b) { a = b; return true; } return false; }\\ntemplate < class T > bool chmax(T& a, T b) { if(a < b) { a = b; return true; } return false; }\\ntemplate < class T, class U > T ceil (T x, U y) { return (x > 0 ? (x + y - 1) / y : x / y); }\\ntemplate < class T, class U > T floor(T x, U y) { return (x > 0 ? x / y : (x - y + 1) / y); }\\nint popcnt(i32 x) { return __builtin_popcount(x); }\\nint popcnt(u32 x) { return __builtin_popcount(x); }\\nint popcnt(i64 x) { return __builtin_popcountll(x); }\\nint popcnt(u64 x) { return __builtin_popcountll(x); }\\n\\n#line 2 \\\"cp-library/src/utility/rep_itr.hpp\\\"\\ntemplate < class T > struct itr_rep {\\n T i, d;\\n constexpr itr_rep(const T i) noexcept : i(i), d(1) {}\\n constexpr itr_rep(const T i, const T d) noexcept : i(i), d(d) {}\\n void operator++() noexcept { i += d; }\\n constexpr int operator*() const noexcept { return i; }\\n constexpr bool operator!=(const itr_rep x) const noexcept { return d > 0 ? i < x.i : i > x.i; }\\n};\\n\\ntemplate < class T > struct rep {\\n const itr_rep< T > s, t;\\n constexpr rep(const T t) noexcept : s(0), t(t) {}\\n constexpr rep(const T s, const T t) noexcept : s(s), t(t) {}\\n constexpr rep(const T s, const T t, const T d) noexcept : s(s, d), t(t, d) {}\\n constexpr auto begin() const noexcept { return s; }\\n constexpr auto end () const noexcept { return t; }\\n};\\n\\ntemplate < class T > struct revrep {\\n const itr_rep < T > s, t;\\n constexpr revrep(const T t) noexcept : s(t - 1, -1), t(-1, -1) {}\\n constexpr revrep(const T s, const T t) noexcept : s(t - 1, -1), t(s - 1, -1) {}\\n constexpr revrep(const T s, const T t, const T d) noexcept : s(t - 1, -d), t(s - 1, -d) {}\\n constexpr auto begin() const noexcept { return s; }\\n constexpr auto end () const noexcept { return t; }\\n};\\n#line 3 \\\"cp-library/src/utility/io.hpp\\\"\\n\\n/* 128bit integer */\\nistream& operator>>(istream& is, i128& x) {\\n std::string s; is >> s;\\n int pm = (s[0] == '-');\\n x = 0;\\n for(int i : rep(pm, int(s.size()))) x = x * 10 + (s[i] - '0');\\n if(pm) x *= -1;\\n return is;\\n}\\nostream& operator<<(ostream& os, const i128& x) {\\n if(x == 0) return os << '0';\\n i128 y = x;\\n if(y < 0) { os << '-'; y *= -1; }\\n std::vector<int> ny;\\n while(y > 0) { ny.push_back(y % 10); y /= 10; }\\n for(int i : revrep(ny.size())) os << ny[i];\\n return os;\\n}\\n\\ntemplate < class S, class T > istream& operator>>(istream& is, std::pair< S, T >& x) { is >> x.first >> x.second; return is; }\\ntemplate < class S, class T > ostream& operator<<(ostream& os, const std::pair< S, T >& x) { os << x.first << \\\" \\\" << x.second; return os; }\\n\\nnamespace scanner {\\n struct sca {\\n template < class T > operator T() {\\n T s; std::cin >> s; return s;\\n }\\n };\\n struct vec {\\n int n;\\n vec(int n) : n(n) {}\\n template < class T > operator std::vector< T >() {\\n std::vector< T > v(n);\\n for(T& x : v) std::cin >> x;\\n return v;\\n }\\n };\\n struct mat {\\n int h, w;\\n mat(int h, int w) : h(h), w(w) {}\\n template < class T > operator std::vector< std::vector< T > >() {\\n std::vector m(h, std::vector< T >(w));\\n for(std::vector< T >& v : m) for(T& x : v) std::cin >> x;\\n return m;\\n }\\n };\\n struct speedup {\\n speedup() {\\n std::cin.tie(0);\\n std::ios::sync_with_stdio(0);\\n }\\n } speedup_instance;\\n}\\nscanner::sca in() { return scanner::sca(); }\\nscanner::vec in(int n) { return scanner::vec(n); }\\nscanner::mat in(int h, int w) { return scanner::mat(h, w); }\\n\\nnamespace printer {\\n void precision(int d) { std::cout << std::fixed << std::setprecision(d); }\\n void flush() { std::cout.flush(); }\\n}\\n\\ntemplate < class T >\\nostream& operator<<(ostream& os, const std::vector< T > a) {\\n int n = a.size();\\n for(int i : rep(n)) { os << a[i]; if(i != n - 1) os << ' '; }\\n return os;\\n}\\n\\nint print() { std::cout << '\\\\n'; return 0; }\\ntemplate < class head, class... tail > int print(head&& h, tail&&... t) {\\n std::cout << h; if(sizeof...(tail)) std::cout << ' ';\\n return print(std::forward<tail>(t)...);\\n}\\ntemplate < class T > int print_n(const std::vector< T > a) {\\n int n = a.size();\\n for(int i : rep(n)) std::cout << a[i] << \\\"\\\\n\\\";\\n return 0;\\n}\\n\\n\\n#line 2 \\\"cp-library/src/utility/key_val.hpp\\\"\\n\\ntemplate < class K, class V >\\nstruct key_val {\\n K key; V val;\\n key_val() {}\\n key_val(K key, V val) : key(key), val(val) {}\\n template < std::size_t Index >\\n std::tuple_element_t< Index, key_val >& get() {\\n if constexpr (Index == 0) return key;\\n if constexpr (Index == 1) return val;\\n }\\n};\\n\\nnamespace std {\\n\\ntemplate < class K, class V > struct tuple_size < key_val< K, V > > : integral_constant< size_t, 2 > {};\\ntemplate < class K, class V > struct tuple_element < 0, key_val< K, V > > { using type = K; };\\ntemplate < class K, class V > struct tuple_element < 1, key_val< K, V > > { using type = V; };\\n\\n}\\n#line 2 \\\"cp-library/src/utility/vec_op.hpp\\\"\\ntemplate < class T > key_val< int, T > max_of(const vector< T >& a) {\\n int i = std::max_element(a.begin(), a.end()) - a.begin();\\n return {i, a[i]};\\n}\\ntemplate < class T > key_val< int, T > min_of(const vector< T >& a) {\\n int i = std::min_element(a.begin(), a.end()) - a.begin();\\n return {i, a[i]};\\n}\\ntemplate < class S, class T > S sum_of(const vector< T >& a) {\\n S sum = 0;\\n for(const T x : a) sum += x;\\n return sum;\\n}\\ntemplate < class S, class T > vector< S > freq_of(const vector< T >& a, T L, T R) {\\n vector< S > res(R - L, S(0));\\n for(const T x : a) res[x - L] += 1;\\n return res;\\n}\\ntemplate < class S, class T > struct prefix_sum {\\n vector< S > s;\\n prefix_sum(const vector< T >& a) : s(a) {\\n s.insert(s.begin(), S(0));\\n for(int i : rep(a.size())) s[i + 1] += s[i];\\n }\\n // [L, R)\\n S sum(int L, int R) { return s[R] - s[L]; }\\n};\\n#line 3 \\\"cp-library/src/utility/heap.hpp\\\"\\n\\ntemplate < class T > using heap_min = std::priority_queue< T, std::vector< T >, std::greater< T > >;\\ntemplate < class T > using heap_max = std::priority_queue< T, std::vector< T >, std::less< T > >;\\n\\n#line 27 \\\"cp-library/src/cp-template.hpp\\\"\\n\\n#line 1 \\\"cp-library/src/algorithm/bin_search.hpp\\\"\\ntemplate < class T, class F >\\nT bin_search(T ok, T ng, F f) {\\n while(abs(ng - ok) > 1) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n\\ntemplate < class T, class F >\\nT bin_search_real(T ok, T ng, F f, int step = 80) {\\n while(step--) {\\n T mid = (ok + ng) / 2;\\n (f(mid) ? ok : ng) = mid;\\n }\\n return ok;\\n}\\n#line 2 \\\"cp-library/src/algorithm/argsort.hpp\\\"\\n\\ntemplate < class T > std::vector< int > argsort(const std::vector< T > &a) {\\n std::vector< int > ids((int)a.size());\\n std::iota(ids.begin(), ids.end(), 0);\\n std::sort(ids.begin(), ids.end(), [&](int i, int j) {\\n return a[i] < a[j] || (a[i] == a[j] && i < j);\\n });\\n return ids;\\n}\\n#line 1 \\\"macro.hpp\\\"\\nnamespace macro {\\n\\nusing size_type = int;\\ntemplate < class container > void sort(container& a) { std::sort(std:: begin(a), std:: end(a)); }\\ntemplate < class container > void rsort(container& a) { std::sort(std::rbegin(a), std::rend(a)); }\\ntemplate < class container > void reverse(container& a) { std::reverse(std::begin(a), std::end(a)); }\\ntemplate < class container > void unique(container& a) {\\n std::sort(std::begin(a), std::end(a));\\n a.erase(std::unique(std::begin(a), std::end(a)), std::end(a));\\n}\\ntemplate < class container > container sorted(const container& a) { container b = a; sort(b); return std::move(b); }\\ntemplate < class container > container rsorted(const container& a) { container b = a; rsort(b); return std::move(b); }\\ntemplate < class container, class compare > void sort(container& a, const compare& cmp) { std::sort(std::begin(a), std::end(a), cmp); }\\ntemplate < class container, class compare > container sorted(const container& a, const compare& cmp) { container b = a; sort(b, cmp); return std::move(b); }\\ntemplate < class container, class value > size_type lower_bound(const container& a, const value& x) { return std::lower_bound(std::begin(a), std::end(a), x) - std::begin(a); }\\ntemplate < class container, class value > size_type upper_bound(const container& a, const value& x) { return std::upper_bound(std::begin(a), std::end(a), x) - std::begin(a); }\\n\\nconst std::vector<std::pair<size_type, size_type>> dir4 = { {+1, 0}, {-1, 0}, { 0, +1}, { 0, -1} };\\nconst std::vector<std::pair<size_type, size_type>> dir8 = { {-1, -1}, {-1, 0}, {-1, +1}, { 0, -1}, { 0, +1}, {+1, -1}, {+1, 0}, {+1, +1} };\\n\\n#ifdef _DEBUG\\n#define debug(x) std::cout << \\\"[\\\" << __LINE__ << \\\"] \\\" << #x << \\\": \\\" << x << std::endl\\n#else\\n#define debug(x)\\n#endif\\n\\ntemplate < class container > void concat(container& a, const container& b) {\\n a.insert(std::end(a), std::begin(b), std::end(b));\\n}\\nstd::vector<size_type> iota(const size_type n) {\\n std::vector<size_type> I(n);\\n std::iota(std::begin(I), std::end(I), 0);\\n return I;\\n}\\ntemplate < class container > std::vector<size_type> sort_idx(const container& a) {\\n const size_type n = a.size();\\n std::vector<size_type> I = iota(n);\\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return a[i] < a[j] or (a[i] == a[j] and i < j); });\\n return I;\\n}\\ntemplate < class container, class compare > std::vector<size_type> sort_idx(const container& a, const compare& cmp) {\\n const size_type n = a.size();\\n std::vector<size_type> I = iota(n);\\n std::sort(std::begin(I), std::end(I), [&](size_type i, size_type j) { return cmp(a[i], a[j]) or (a[i] == a[j] and i < j); });\\n return std::move(I);\\n}\\n\\nstruct grid {\\n using size_type = int;\\n size_type H, W;\\n grid(const size_type H, const size_type W) : H(H), W(W) {}\\n bool contains(const size_type i, const size_type j) {\\n return 0 <= i and i < H and 0 <= j and j < W;\\n }\\n};\\n\\nusing f64 = long double;\\n\\n} // namespace macro\\n\\nusing namespace macro;\\n#line 3 \\\"A.cpp\\\"\\n\\ntemplate < class T > int sign(const T x) {\\n T e = (is_integral_v< T > ? 1 : 1e-8);\\n if(x <= -e) return -1;\\n if(x >= +e) return +1;\\n return 0;\\n}\\ntemplate < class T > bool equals(const T& a, const T& b) { return sign(a - b) == 0; }\\ntemplate < class T > struct point {\\n T x, y;\\n point() : x(0), y(0) {}\\n point(T x, T y) : x(x), y(y) {}\\n point(std::pair< T, T > p) : x(p.first), y(p.second) {}\\n point& operator+=(const point& p) { x += p.x, y += p.y; return *this; }\\n point& operator-=(const point& p) { x -= p.x, y -= p.y; return *this; }\\n point& operator*=(const T r) { x *= r, y *= r; return *this; }\\n point& operator/=(const T r) { x /= r, y /= r; return *this; }\\n point operator+(const point& p) const { return point(*this) += p; }\\n point operator-(const point& p) const { return point(*this) -= p; }\\n point operator*(const T r) const { return point(*this) *= r; }\\n point operator/(const T r) const { return point(*this) /= r; }\\n point operator-() const { return {-x, -y}; }\\n bool operator==(const point& p) const { return equals(x, p.x) and equals(y, p.y); }\\n bool operator!=(const point& p) const { return !equals(x, p.x) or !equals(y, p.y); }\\n bool operator<(const point& p) const { return x == p.x ? y < p.y : x < p.x; }\\n point< T > rot(double theta) {\\n static_assert(is_floating_point_v< T >);\\n double cos_ = std::cos(theta), sin_ = std::sin(theta);\\n return {cos_ * x - sin_ * y, sin_ * x + cos_ * y};\\n }\\n};\\ntemplate < class T > istream& operator>>(istream& is, point< T >& p) { return is >> p.x >> p.y; }\\ntemplate < class T > ostream& operator<<(ostream& os, point< T >& p) { return os << p.x << \\\" \\\" << p.y; }\\ntemplate < class T > T dot(const point< T >& a, const point< T >& b) { return a.x * b.x + a.y * b.y; }\\ntemplate < class T > T det(const point< T >& a, const point< T >& b) { return a.x * b.y - a.y * b.x; }\\ntemplate < class T > T norm(const point< T >& p) { return p.x * p.x + p.y * p.y; }\\ntemplate < class T > double abs(const point< T >& p) { return std::sqrt(norm(p)); }\\ntemplate < class T > double angle(const point< T >& p) { return std::atan2(p.y, p.x); }\\n\\ntemplate < class T > int ccw(const point< T >& a, point< T > b, point< T > c) {\\n b -= a, c -= a;\\n if(sign(det(b, c)) == +1) return +1; // counter clockwise\\n if(sign(det(b, c)) == -1) return -1; // clockwise\\n if(sign(dot(b, c)) == -1) return +2; // c-a-b\\n if(norm(b) < norm(c)) return -2; // a-b-c\\n return 0; // a-c-b\\n}\\n\\ntemplate < class T > struct line {\\n point< T > a, b;\\n line() {}\\n line(point< T > a, point< T > b) : a(a), b(b) {}\\n};\\ntemplate < class T > point< T > projection(const line< T >& l, const point< T >& p) {\\n static_assert(is_floating_point_v< T >);\\n return l.a + (l.a - l.b) * dot(p - l.a, l.a - l.b) / norm(l.a - l.b);\\n}\\ntemplate < class T > point< T > reflection(const line< T >& l, const point< T >& p) {\\n static_assert(is_floating_point_v< T >);\\n return p + (projection(l, p) - p) * T(2);\\n}\\ntemplate < class T > bool orthogonal(const line< T >& a, const line< T >& b) { return equals(dot(a.b - a.a, b.b - b.a), T(0)); }\\ntemplate < class T > bool parallel (const line< T >& a, const line< T >& b) { return equals(det(a.b - a.a, b.b - b.a), T(0)); }\\ntemplate < class T > point< T > cross_point_ll(const line< T >& l, const line< T >& m) {\\n static_assert(is_floating_point_v< T >);\\n T A = det(l.b - l.a, m.b - m.a);\\n T B = det(l.b - l.a, l.b - m.a);\\n if(equals(abs(A), T(0)) and equals(abs(B), T(0))) return m.a;\\n return m.a + (m.b - m.a) * B / A;\\n}\\n\\ntemplate < class T > using segment = line< T >;\\ntemplate < class T > bool intersect_ss(const segment< T >& s, const segment< T >& t) {\\n return ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) <= 0 and ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) <= 0;\\n}\\ntemplate < class T > double distance_sp(const segment< T >& s, const point< T >& p) {\\n static_assert(is_floating_point_v< T >);\\n point r = projection(s, p);\\n if(ccw(s.a, s.b, r) == 0) return abs(r - p);\\n return std::min(abs(s.a - p), abs(s.b - p));\\n}\\ntemplate < class T > double distance_ss(const segment< T >& a, const segment< T >& b) {\\n if(intersect_ss(a, b)) return 0;\\n return std::min({ distance_sp(a, b.a), distance_sp(a, b.b), distance_sp(b, a.a), distance_sp(b, a.b) });\\n}\\n\\ntemplate < class T > using polygon = std::vector< point< T > >;\\ntemplate < class T > T area2(const polygon< T >& p) {\\n T s = 0;\\n int n = p.size();\\n for(int i = 0; i < n; i++) s += det(p[i], p[(i + 1) % n]);\\n return s;\\n}\\ntemplate < class T > T area(const polygon< T >& p) { return area2(p) / T(2); }\\n\\ntemplate < class T > bool is_convex(const polygon< T >& p) {\\n int n = p.size();\\n for(int i = 0; i < n; i++) if(ccw(p[(i - 1 + n) % n], p[i], p[(i + 1) % n]) == -1) return false;\\n return true;\\n}\\ntemplate < class T > int contains(const polygon< T >& g, const point< T >& p) {\\n int n = g.size();\\n bool in = false;\\n for(int i = 0; i < n; i++) {\\n point a = g[i] - p, b = g[(i + 1) % n] - p;\\n if(sign(a.y - b.y) == +1) std::swap(a, b);\\n if(sign(a.y) <= 0 and sign(b.y) ==+1 and sign(det(a, b)) == -1) in = !in;\\n if(sign(det(a, b)) == 0 and sign(dot(a, b)) <= 0) return 1; // ON\\n }\\n return in ? 2 : 0;\\n}\\ntemplate < class T > polygon< T > convex_cut(const polygon< T >& p, const line< T >& l) {\\n int n = p.size();\\n polygon< T > res;\\n for(int i = 0; i < n; i++) {\\n point now = p[i], nxt = p[(i + 1) % n];\\n if(ccw(l.a, l.b, now) != -1) res.push_back(now);\\n if(ccw(l.a, l.b, now) * ccw(l.a, l.b, nxt) < 0) res.push_back(cross_point_ll(line(now, nxt), l));\\n }\\n return res;\\n}\\ntemplate < class T > polygon< T > convex_hull(polygon< T >& p) {\\n int n = p.size(), k = 0;\\n if(n <= 2) return p;\\n std::sort(p.begin(), p.end());\\n polygon< T > ch(n + n);\\n for(int i = 0; i < n; ch[k++] = p[i++])\\n while(k >= 2 and sign(det(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1])) == -1) k--;\\n for(int i = n - 2, t = k + 1; i >= 0; ch[k++] = p[i--])\\n while(k >= t and sign(det(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1])) == -1) k--;\\n ch.resize(k - 1);\\n return ch;\\n}\\ntemplate < class T > T diameter2(const polygon< T >& p) {\\n static_assert(is_floating_point_v< T >);\\n int n = p.size(), is = 0, js = 0;\\n for(int i = 1; i < n; i++) {\\n if(sign(p[i].y - p[is].y) == +1) is = i;\\n if(sign(p[i].y - p[js].y) == -1) js = i;\\n }\\n T dist_max = norm(p[is] - p[js]);\\n int maxi = is, i = is, maxj = js, j = js;\\n do {\\n if(sign(det(p[(i + 1) % n] - p[i], p[(j + 1) % n] - p[j])) >= 0) j = (j + 1) % n; else i = (i + 1) % n;\\n if(norm(p[i] - p[j]) > dist_max) {\\n dist_max = norm(p[i] - p[j]);\\n maxi = i, maxj = j;\\n }\\n } while(i != is or j != js);\\n return dist_max;\\n}\\ntemplate < class T > double diameter(const polygon< T >& p) {\\n static_assert(is_floating_point_v< T >);\\n return std::sqrt(diameter2(p));\\n}\\n\\ntemplate < class T > struct circle {\\n point< T > p;\\n T r;\\n circle() = default;\\n circle(point< T > p, T r) : p(p), r(r) {}\\n};\\ntemplate < class T > istream& operator>>(istream& is, circle< T >& c) { return is >> c.p >> c.r; }\\ntemplate < class T > int intersect_cc(circle< T > c1, circle< T > c2) {\\n if(c1.r < c2.r) std::swap(c1, c2);\\n T d = abs(c1.p - c2.p);\\n if(sign(c1.r + c2.r - d) == -1) return 4;\\n if(equals(c1.r + c2.r, d)) return 3;\\n if(sign(c1.r - c2.r - d) == -1) return 2;\\n if(equals(c1.r - c2.r, d)) return 1;\\n return 0;\\n}\\ntemplate < class T > std::pair<point< T >, point< T >> cross_point_cc(const circle< T >& c1, const circle< T >& c2) {\\n T d = abs(c1.p - c2.p);\\n T a = std::acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d));\\n T t = angle(c2.p - c1.p);\\n point< T > p1 = c1.p + point< T >(std::cos(t + a), std::sin(t + a)) * c1.r;\\n point< T > p2 = c1.p + point< T >(std::cos(t - a), std::sin(t - a)) * c1.r;\\n return {p1, p2};\\n}\\n\\nint solve(vector<point<f64>> P_, vector<point<f64>> Q_) {\\n int ans = 5;\\n vector<int> I = {0, 1, 2}, J = {0, 1, 2};\\n do { do {\\n auto dfs = [&](auto self, vector<point<f64>> P, vector<point<f64>> Q, int i) -> int {\\n if(i == 0) {\\n if(P[0] == Q[0]) return 0 + self(self, P, Q, i + 1);\\n if(parallel(line<f64>(P[0], Q[0]), line<f64>(P[1], P[2]))) {\\n P[0] = Q[0];\\n return 1 + self(self, P, Q, i + 1);\\n } else {\\n int ans = 100;\\n for(int j : {1, 2}) {\\n const int k = 3 - j;\\n line<f64> l0(P[j], P[j] + (P[k] - P[0]));\\n line<f64> l1(P[k], P[k] + (P[0] - Q[0]));\\n if(parallel(l0, l1)) continue;\\n point<f64> p = cross_point_ll<f64>(l0, l1);\\n vector<point<f64>> nP = P;\\n nP[j] = p;\\n nP[0] = Q[0];\\n chmin(ans, 2 + self(self, nP, Q, i + 1));\\n }\\n return ans;\\n }\\n }\\n\\n if(i == 1) {\\n if(P[1] == Q[1]) return 0 + self(self, P, Q, i + 1);\\n if(parallel(line<f64>(P[1], Q[1]), line<f64>(P[0], P[2]))) {\\n P[1] = Q[1];\\n return 1 + self(self, P, Q, i + 1);\\n } else {\\n line<f64> l0(P[2], P[2] + (P[0] - P[1]));\\n line<f64> l1(P[0], P[0] + (P[1] - Q[1]));\\n if(parallel(l0, l1)) return 100;\\n point<f64> p = cross_point_ll<f64>(l0, l1);\\n P[2] = p;\\n P[1] = Q[1];\\n return 2 + self(self, P, Q, i + 1);\\n }\\n }\\n\\n if(i == 2) {\\n if(P[2] == Q[2]) return 0;\\n if(parallel(line<f64>(P[2], Q[2]), line<f64>(P[0], P[1]))) {\\n return 1;\\n } else {\\n return 100;\\n }\\n }\\n\\n assert(0);\\n };\\n\\n vector<point<f64>> P(3), Q(3);\\n for(int i : rep(3)) {\\n P[i] = P_[I[i]];\\n Q[i] = Q_[J[i]];\\n }\\n chmin(ans, dfs(dfs, P, Q, 0));\\n } while(next_permutation(I.begin(), I.end())); } while(next_permutation(J.begin(), J.end()));\\n return ans;\\n}\\n\\nint main() {\\n vector<point<f64>> P(3), Q(3);\\n while(cin >> P[0].x) {\\n cin >> P[0].y;\\n for(int i : rep(1, 3)) cin >> P[i].x >> P[i].y;\\n for(int i : rep(0, 3)) cin >> Q[i].x >> Q[i].y;\\n int ans = solve(P, Q);\\n print(ans == 5 ? \\\"Many\\\" : to_string(ans));\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3452,\n \"score_of_the_acc\": -0.7837,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1623_8016820\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define rng(i, a, b) for (int i = (a); i < (b); i++)\\n#define rep(i, n) rng(i, 0, (n))\\n#define vec vector\\nusing namespace std;\\ntypedef long double D;\\ntypedef complex<D> P;\\ntypedef pair<P, P> L;\\ntypedef vector<P> VP;\\nconst D EPS = 1e-9;\\n#define X real()\\n#define Y imag()\\n#define EQ(n, m) (abs((n) - (m)) < EPS)\\nD dot(P a, P b)\\n{\\n return (conj(a) * b).X;\\n}\\nD cross(P a, P b)\\n{\\n return (conj(a) * b).Y;\\n}\\nP crosspointLL(P a1, P a2, P b1, P b2)\\n{\\n D d1 = cross(b2 - b1, b1 - a1);\\n D d2 = cross(b2 - b1, a2 - a1);\\n if (EQ(d1, 0) && EQ(d2, 0))\\n return a1;\\n if (EQ(d2, 0))\\n return P(5000, 5000);\\n return a1 + d1 / d2 * (a2 - a1);\\n}\\nVP inx, y;\\nint solve(VP x, int cnt)\\n{\\n\\n vector<bool> okx(3, false), oky(3, false);\\n rep(i, 3) rep(j, 3)\\n {\\n if (oky[j])\\n continue;\\n if (EQ(x[i], y[j]))\\n {\\n okx[i] = true;\\n oky[j] = true;\\n }\\n }\\n bool ok = true;\\n rep(i, 3)\\n {\\n if (okx[i] == false)\\n ok = false;\\n }\\n if (ok)\\n {\\n return 0;\\n }\\n int res = 5;\\n rep(i, 3) rep(j, 3)\\n {\\n if (okx[i] || oky[j])\\n continue;\\n // x[i]をy[j]に移動\\n if (EQ(cross(x[(i + 1) % 3] - x[(i + 2) % 3], y[j] - x[i]), 0))\\n {\\n VP v = x;\\n v[i] = y[j];\\n res = min(res, 1 + solve(v, cnt));\\n }\\n else\\n {\\n if (okx[(i + 1) % 3] == false)\\n {\\n VP v = x;\\n P z = crosspointLL(x[(i + 2) % 3], x[(i + 2) % 3] + y[j] - x[i], x[(i + 1) % 3], x[(i + 1) % 3] + x[i] - x[(i + 2) % 3]);\\n v[(i + 1) % 3] = z;\\n if (cnt == 0)\\n res = min(res, 1 + solve(v, cnt + 1));\\n }\\n if (okx[(i + 2) % 3] == false)\\n {\\n VP v = x;\\n P z = crosspointLL(x[(i + 1) % 3], x[(i + 1) % 3] + y[j] - x[i], x[(i + 2) % 3], x[(i + 2) % 3] + x[i] - x[(i + 1) % 3]);\\n v[(i + 2) % 3] = z;\\n if (cnt == 0)\\n res = min(res, 1 + solve(v, cnt + 1));\\n }\\n }\\n }\\n // rep(i, 3)\\n // {\\n // cout << x[i].X << \\\" \\\" << x[i].Y << endl;\\n // }\\n // cout << endl;\\n // cout << res << endl;\\n return res;\\n}\\n\\nsigned main()\\n{\\n int x0;\\n while (cin >> x0)\\n {\\n inx.clear();\\n y.clear();\\n for (int i = 0; i < 3; i++)\\n {\\n if (i == 0)\\n {\\n int v;\\n cin >> v;\\n inx.emplace_back(x0, v);\\n }\\n else\\n {\\n int u, v;\\n cin >> u >> v;\\n inx.emplace_back(u, v);\\n }\\n }\\n for (int i = 0; i < 3; i++)\\n {\\n int u, v;\\n cin >> u >> v;\\n y.emplace_back(u, v);\\n }\\n int ans = solve(inx, 0);\\n if (ans >= 5)\\n cout << \\\"Many\\\" << endl;\\n else\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 3436,\n \"score_of_the_acc\": -0.7537,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1623_8013089\",\n \"code_snippet\": \"#include <algorithm>\\n#include <climits>\\n#include <iostream>\\n#include <numeric>\\n#include <utility>\\n#include <vector>\\n\\nusing namespace std;\\nusing uint = unsigned int;\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing lint = ll;\\nusing ulint = ull;\\nusing pii = pair<int, int>;\\nusing pll = pair<lint, lint>;\\ntemplate <class T>\\nusing V = vector<T>;\\ntemplate <class T>\\nusing VV = V<V<T>>;\\n#define For(i, a, b) for (int i = int(a); i < int(b); ++i)\\n#define rep(i, n) For(i, 0, n)\\ntemplate <class T, class U>\\nbool chmin(T &a, const U &b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <class T, class U>\\nbool chmax(T &a, const U &b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <class T>\\nT div_floor(T a, T b) {\\n if (b < 0) a = -a, b = -b;\\n return a >= 0 ? a / b : (a + 1) / b - 1;\\n}\\ntemplate <class T>\\nT div_ceil(T a, T b) {\\n if (b < 0) a = -a, b = -b;\\n return a <= 0 ? a / b : (a - 1) / b + 1;\\n}\\n\\ntemplate <class T>\\nostream &operator<<(ostream &os, const V<T> &v) {\\n os << \\\"[\\\";\\n for (auto d : v) os << d << \\\", \\\";\\n return os << \\\"]\\\";\\n}\\n\\n#include <cmath>\\nusing re = long double;\\nre EPS = 1e-9;\\n\\nint sgn(re x) {\\n if (x < -EPS) return -1;\\n if (x > EPS) return 1;\\n return 0;\\n}\\nbool eq(re x, re y) { return sgn(x - y) == 0; }\\nbool ge(re x, re y) { return sgn(x - y) == 1; }\\nbool le(re x, re y) { return sgn(x - y) == -1; }\\nbool geq(re x, re y) { return sgn(x - y) >= 0; }\\nbool leq(re x, re y) { return sgn(x - y) <= 0; }\\n\\nstruct pt {\\n re x, y;\\n\\n pt(re x = 0, re y = 0) : x(x), y(y) {}\\n\\n bool operator==(const pt &p) const { return eq(x, p.x) && eq(y, p.y); }\\n bool operator<(const pt &p) const {\\n if (eq(x, p.x)) {\\n return le(y, p.y);\\n }\\n return le(x, p.x);\\n }\\n\\n pt &operator+=(const pt &r) {\\n this->x += r.x;\\n this->y += r.y;\\n return *this;\\n }\\n pt &operator-=(const pt &r) {\\n this->x -= r.x;\\n this->y -= r.y;\\n return *this;\\n }\\n pt &operator*=(const re &r) {\\n this->x *= r;\\n this->y *= r;\\n return *this;\\n }\\n pt &operator/=(const re &r) {\\n this->x /= r;\\n this->y /= r;\\n return *this;\\n }\\n\\n friend pt operator+(const pt &l, const pt &r) { return pt(l) += r; }\\n friend pt operator-(const pt &l, const pt &r) { return pt(l) -= r; }\\n friend pt operator*(const pt &l, const re &r) { return pt(l) *= r; }\\n friend pt operator/(const pt &l, const re &r) { return pt(l) /= r; }\\n\\n friend re operator*(const pt &l, const pt &r) {\\n return l.x * r.x + l.y * r.y;\\n }\\n friend re operator^(const pt &l, const pt &r) {\\n return l.x * r.y - l.y * r.x;\\n }\\n};\\nostream &operator<<(ostream &os, const pt &p) {\\n os << \\\"(\\\";\\n os << p.x << \\\", \\\" << p.y;\\n return os << \\\")\\\";\\n}\\n\\nusing Vec = pt;\\nusing Pts = V<pt>;\\n\\nre norm(pt p) { return p * p; }\\nre abs(pt p) { return sqrt(norm(p)); }\\nre arg(pt p) { return atan2(p.y, p.x); }\\nre angle(pt a, pt b) { return arg({a * b, a ^ b}); }\\n\\nstruct Line {\\n pt a;\\n Vec v;\\n\\n Line() {}\\n Line(pt a, Vec v) : a(a), v(v) {}\\n};\\n\\npt intersection(Line l1, Line l2) {\\n auto [a, v] = l1;\\n auto [b, w] = l2;\\n auto t = ((b - a) ^ w) / (v ^ w);\\n return a + v * t;\\n}\\n\\nint main() {\\n auto dfs = [&](auto self, int cur, Pts ps, Pts qs, int num, int &ans) {\\n if (cur == 3) {\\n chmin(ans, num);\\n return;\\n }\\n auto a = ps[cur], b = ps[(cur + 1) % 3], c = ps[(cur + 2) % 3];\\n if (a == qs[cur]) {\\n self(self, cur + 1, ps, qs, num, ans);\\n return;\\n }\\n\\n auto v = qs[cur] - a;\\n if (eq(v ^ (b - c), 0)) {\\n ps[cur] = qs[cur];\\n self(self, cur + 1, ps, qs, num + 1, ans);\\n return;\\n }\\n\\n {\\n auto vs = ps;\\n auto p = intersection(Line(c, v), Line(b, c - a));\\n ps[cur] = qs[cur];\\n ps[(cur + 1) % 3] = p;\\n self(self, cur + 1, vs, qs, num + 2, ans);\\n }\\n {\\n auto vs = ps;\\n auto p = intersection(Line(b, v), Line(c, b - a));\\n ps[cur] = qs[cur];\\n ps[(cur + 2) % 3] = p;\\n self(self, cur + 1, vs, qs, num + 2, ans);\\n }\\n };\\n\\n Pts ps(3), qs(3);\\n while (cin >> ps[0].x) {\\n cin >> ps[0].y;\\n For(i, 1, 3) cin >> ps[i].x >> ps[i].y;\\n rep(i, 3) cin >> qs[i].x >> qs[i].y;\\n\\n int ans = 100;\\n sort(ps.begin(), ps.end());\\n do {\\n sort(qs.begin(), qs.end());\\n do {\\n dfs(dfs, 0, ps, qs, 0, ans);\\n\\n } while (next_permutation(qs.begin(), qs.end()));\\n } while (next_permutation(ps.begin(), ps.end()));\\n\\n if (ans >= 5) {\\n puts(\\\"Many\\\");\\n } else {\\n printf(\\\"%d\\\\n\\\", ans);\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3536,\n \"score_of_the_acc\": -0.9891,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1623_7783144\",\n \"code_snippet\": \"#line 1 \\\"test/geometry/base_rational.test.cpp\\\"\\n#define PROBLEM \\\"https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1623&lang=jp\\\"\\n\\n#line 2 \\\"template/template.hpp\\\"\\n\\n#include <bits/stdc++.h>\\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 <typename T> bool chmin(T &a, const T &b) {\\n if (a <= b) return false;\\n a = b;\\n return true;\\n}\\ntemplate <typename T> 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\\n// using namespace lib;\\n#line 2 \\\"utility/rational.hpp\\\"\\n\\n#line 4 \\\"utility/rational.hpp\\\"\\n\\nnamespace lib{\\n\\nstruct rational{\\n rational() : p(0), q(1) {}\\n rational(ll n) : p(n), q(1) {}\\n rational(ll n, ll m){\\n assert(m != 0);\\n if (m < 0) n = -n, m = -m;\\n ll g = gcd(n,m);\\n p = n / g; q = m / g;\\n }\\n ld val(){\\n return ld(p) / ld(q);\\n }\\n rational& operator+=(const rational& rhs){\\n ll g = gcd(q,rhs.q);\\n ll np = rhs.q / g * p + q / g * rhs.p;\\n ll nq = q / g * rhs.q;\\n ll ng = gcd(np,nq);\\n p = np/ng, q = nq/ng;\\n return *this; \\n }\\n rational& operator-=(const rational& rhs){\\n (*this) += rational(-rhs.p,rhs.q);\\n return *this;\\n }\\n rational& operator*=(const rational& rhs){\\n ll g1 = gcd(q,rhs.p), g2 = gcd(p,rhs.q);\\n ll np = p / g2 * rhs.p / g1;\\n ll nq = q / g1 * rhs.q / g2;\\n p = np, q = nq;\\n return *this;\\n }\\n rational& operator/=(const rational& rhs){\\n (*this) *= rational(rhs.q,rhs.p);\\n return *this;\\n }\\n rational operator+() const {return *this;}\\n rational operator-() const {return rational() - *this;}\\n friend rational operator+(const rational& lhs, const rational& rhs) {\\n return rational(lhs) += rhs;\\n }\\n friend rational operator-(const rational& lhs, const rational& rhs) {\\n return rational(lhs) -= rhs;\\n }\\n friend rational operator*(const rational& lhs, const rational& rhs) {\\n return rational(lhs) *= rhs;\\n }\\n friend rational operator/(const rational& lhs, const rational& rhs) {\\n return rational(lhs) /= rhs;\\n }\\n friend bool operator==(const rational& lhs, const rational& rhs) {\\n return lhs.p == rhs.p && lhs.q == rhs.q;\\n }\\n friend bool operator!=(const rational& lhs, const rational& rhs) {\\n return lhs.p != rhs.p || lhs.q != rhs.q;\\n }\\n friend bool operator< (const rational lhs, const rational rhs) {\\n return less_than(lhs,rhs);\\n }\\n friend bool operator> (const rational lhs, const rational rhs) {\\n return less_than(rhs,lhs);\\n }\\n friend bool operator<= (const rational lhs, const rational rhs) {\\n return lhs == rhs || lhs < rhs;\\n }\\n friend bool operator>= (const rational lhs, const rational rhs) {\\n return lhs == rhs || lhs > rhs;\\n }\\n friend std::ostream &operator<<(std::ostream &os,const rational&r) {\\n return os << r.p << \\\" / \\\" << r.q;\\n }\\n private:\\n ll p, q;\\n static bool less_than(rational lhs, rational rhs){\\n __int128_t lv = __int128_t(lhs.p) * __int128_t(rhs.q);\\n __int128_t rv = __int128_t(lhs.q) * __int128_t(rhs.p);\\n return lv < rv;\\n }\\n};\\n\\n\\n} // namespace lib\\n#line 2 \\\"geometry/base_arbitary.hpp\\\"\\n\\n#line 4 \\\"geometry/base_arbitary.hpp\\\"\\n\\nnamespace lib {\\n\\ntemplate<typename T>\\nstruct Vec {\\n T x, y;\\n Vec (T _x = T(0), T _y = T(0)) : x(_x), y(_y) {}\\n Vec& operator*=(const T& a){\\n x *= a;\\n y *= a;\\n return *this;\\n }\\n Vec& operator/=(const T& a){\\n x /= a;\\n y /= a;\\n return *this;\\n }\\n Vec& operator+=(const Vec& rhs) {\\n x += rhs.x;\\n y += rhs.y;\\n return *this;\\n }\\n Vec& operator-=(const Vec& rhs) {\\n x -= rhs.x;\\n y -= rhs.y;\\n return *this;\\n }\\n friend bool operator==(const Vec& lhs, const Vec& rhs) {\\n return lhs.x == rhs.x && lhs.y == rhs.y;\\n }\\n friend bool operator!=(const Vec& lhs, const Vec& rhs) {\\n return lhs.x != rhs.x || lhs.y != rhs.y;\\n }\\n friend Vec operator+(const Vec& lhs, const Vec& rhs) {\\n return Vec(lhs) += rhs;\\n }\\n friend Vec operator-(const Vec& lhs, const Vec& rhs) {\\n return Vec(lhs) -= rhs;\\n }\\n friend Vec operator*(const Vec& lhs, const T& rhs) {\\n return Vec(lhs) *= rhs;\\n }\\n friend Vec operator*(const T& rhs, const Vec& lhs) {\\n return Vec(lhs) *= rhs;\\n }\\n friend Vec operator/(const Vec& lhs, const T& rhs) {\\n return Vec(lhs) /= rhs;\\n }\\n friend Vec operator/(const T& rhs, const Vec& lhs) {\\n return Vec(lhs) /= rhs;\\n }\\n};\\n\\ntemplate<typename T>\\nT dot(const Vec<T> &a, const Vec<T> &b){\\n return a.x * b.x + a.y * b.y;\\n}\\n\\n// cross > 0 : counter clockwise a -> b\\ntemplate<typename T>\\nT cross(const Vec<T> &a, const Vec<T> &b){\\n return a.x * b.y - a.y * b.x;\\n}\\n\\ntemplate<typename T>\\nld abs(const Vec<T> &a){\\n return sqrtl(a.x*a.x+a.y*a.y);\\n}\\n\\ntemplate<typename T>\\nT norm(const Vec<T> &a){\\n return a.x*a.x+a.y*a.y;\\n}\\n\\ntemplate<typename T>\\nstruct Line {\\n Vec<T> p, q;\\n};\\n\\ntemplate<typename T>\\nint intersection(const Line<T> &a, const Line<T> &b){\\n if (cross(a.p-a.q,b.p-b.q) == 0){\\n if (cross(a.p-b.p,a.q-b.p) == 0) return 2;\\n return 0;\\n }\\n return 1;\\n}\\n\\n// intersection == 1 (cross(a.p-a.q,b.p-b.q) != 0)\\ntemplate<typename T>\\nVec<T> cross_point(const Line<T> &a, const Line<T> &b){\\n Vec<T> va = a.p-a.q, vb = b.p-b.q;\\n Vec<T> ba = b.p-a.q;\\n T alpha = cross(ba,vb) / cross(va,vb);\\n return alpha * a.p + (1 - alpha) * a.q;\\n}\\n\\n\\n} // namespace lib\\n#line 6 \\\"test/geometry/base_rational.test.cpp\\\"\\n\\nusing namespace lib;\\nusing vec = Vec<rational>;\\nusing line = Line<rational>;\\n\\nconst vector<vector<int>> order = {{0,1,2},{0,2,1},{1,0,2},{1,2,0},{2,0,1},{2,1,0}};\\n\\nint main(){\\n while (true){\\n vector<vec> ia(3), b(3);\\n rep(i,0,6){\\n ll x, y; cin >> x >> y;\\n if (!cin) return 0;\\n (i < 3 ? ia[i] : b[i-3]) = vec(x,y);\\n }\\n int ans = 5;\\n for (auto fid : order) for (auto tid : order) rep(j,0,2){\\n auto a = ia;\\n int cur = 0;\\n rep(i,0,3){\\n int f = fid[i], t = tid[i];\\n if (a[f] == b[t]) continue;\\n cur++;\\n int p = (f+1)%3, q = (f+2)%3;\\n if (cross(a[p]-a[q],b[t]-a[f]) == 0){\\n a[f] = b[t];\\n continue;\\n }\\n cur++;\\n if (j == 1) swap(p,q);\\n line l1({a[p],a[p]+a[f]-b[t]}), l2({a[q],a[q]+a[f]-a[p]});\\n if (intersection(l1,l2) == 1){\\n a[q] = cross_point(l1,l2);\\n a[f] = b[t];\\n }\\n else {\\n cur = 5;\\n break;\\n }\\n }\\n chmin(ans,cur);\\n }\\n if (ans == 5) cout << \\\"Many\\\" << endl;\\n else cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1530,\n \"memory_kb\": 3460,\n \"score_of_the_acc\": -1.0065,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1623_7783133\",\n \"code_snippet\": \"#line 1 \\\"test/geometry/base_rational.test.cpp\\\"\\n#define PROBLEM \\\"https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=1623&lang=jp\\\"\\n\\n#line 2 \\\"template/template.hpp\\\"\\n\\n#include <bits/stdc++.h>\\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 <typename T> bool chmin(T &a, const T &b) {\\n if (a <= b) return false;\\n a = b;\\n return true;\\n}\\ntemplate <typename T> 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\\n// using namespace lib;\\n#line 2 \\\"utility/rational.hpp\\\"\\n\\n#line 4 \\\"utility/rational.hpp\\\"\\n\\nnamespace lib{\\n\\nstruct rational{\\n rational() : p(0), q(1) {}\\n rational(ll n) : p(n), q(1) {}\\n rational(ll n, ll m){\\n assert(m != 0);\\n if (m < 0) n = -n, m = -m;\\n ll g = gcd(n,m);\\n p = n / g; q = m / g;\\n }\\n ld val(){\\n return ld(p) / ld(q);\\n }\\n rational& operator+=(const rational& rhs){\\n ll g = gcd(q,rhs.q);\\n ll np = rhs.q / g * p + q / g * rhs.p;\\n ll nq = q / g * rhs.q;\\n ll ng = gcd(np,nq);\\n p = np/ng, q = nq/ng;\\n return *this; \\n }\\n rational& operator-=(const rational& rhs){\\n (*this) += rational(-rhs.p,rhs.q);\\n return *this;\\n }\\n rational& operator*=(const rational& rhs){\\n ll g1 = gcd(q,rhs.p), g2 = gcd(p,rhs.q);\\n ll np = p / g2 * rhs.p / g1;\\n ll nq = q / g1 * rhs.q / g2;\\n p = np, q = nq;\\n return *this;\\n }\\n rational& operator/=(const rational& rhs){\\n (*this) *= rational(rhs.q,rhs.p);\\n return *this;\\n }\\n rational operator+() const {return *this;}\\n rational operator-() const {return rational() - *this;}\\n friend rational operator+(const rational& lhs, const rational& rhs) {\\n return rational(lhs) += rhs;\\n }\\n friend rational operator-(const rational& lhs, const rational& rhs) {\\n return rational(lhs) -= rhs;\\n }\\n friend rational operator*(const rational& lhs, const rational& rhs) {\\n return rational(lhs) *= rhs;\\n }\\n friend rational operator/(const rational& lhs, const rational& rhs) {\\n return rational(lhs) /= rhs;\\n }\\n friend bool operator==(const rational& lhs, const rational& rhs) {\\n return lhs.p == rhs.p && lhs.q == rhs.q;\\n }\\n friend bool operator!=(const rational& lhs, const rational& rhs) {\\n return lhs.p != rhs.p || lhs.q != rhs.q;\\n }\\n friend bool operator< (const rational lhs, const rational rhs) {\\n return less_than(lhs,rhs);\\n }\\n friend bool operator> (const rational lhs, const rational rhs) {\\n return less_than(rhs,lhs);\\n }\\n friend bool operator<= (const rational lhs, const rational rhs) {\\n return lhs == rhs || lhs < rhs;\\n }\\n friend bool operator>= (const rational lhs, const rational rhs) {\\n return lhs == rhs || lhs > rhs;\\n }\\n friend std::ostream &operator<<(std::ostream &os,const rational&r) {\\n return os << r.p << \\\" / \\\" << r.q;\\n }\\n private:\\n ll p, q;\\n static bool less_than(rational lhs, rational rhs){\\n __int128_t lv = __int128_t(lhs.p) * __int128_t(rhs.q);\\n __int128_t rv = __int128_t(lhs.q) * __int128_t(rhs.p);\\n return lv < rv;\\n }\\n};\\n\\n\\n} // namespace lib\\n#line 2 \\\"geometry/base_arbitary.hpp\\\"\\n\\n#line 4 \\\"geometry/base_arbitary.hpp\\\"\\n\\nnamespace lib {\\n\\ntemplate<typename T>\\nstruct Vec {\\n T x, y;\\n Vec (T _x = T(0), T _y = T(0)) : x(_x), y(_y) {}\\n Vec& operator*=(const T& a){\\n x *= a;\\n y *= a;\\n return *this;\\n }\\n Vec& operator/=(const T& a){\\n x /= a;\\n y /= a;\\n return *this;\\n }\\n Vec& operator+=(const Vec& rhs) {\\n x += rhs.x;\\n y += rhs.y;\\n return *this;\\n }\\n Vec& operator-=(const Vec& rhs) {\\n x -= rhs.x;\\n y -= rhs.y;\\n return *this;\\n }\\n friend bool operator==(const Vec& lhs, const Vec& rhs) {\\n return lhs.x == rhs.x && lhs.y == rhs.y;\\n }\\n friend bool operator!=(const Vec& lhs, const Vec& rhs) {\\n return lhs.x != rhs.x || lhs.y != rhs.y;\\n }\\n friend Vec operator+(const Vec& lhs, const Vec& rhs) {\\n return Vec(lhs) += rhs;\\n }\\n friend Vec operator-(const Vec& lhs, const Vec& rhs) {\\n return Vec(lhs) -= rhs;\\n }\\n friend Vec operator*(const Vec& lhs, const T& rhs) {\\n return Vec(lhs) *= rhs;\\n }\\n friend Vec operator*(const T& rhs, const Vec& lhs) {\\n return Vec(lhs) *= rhs;\\n }\\n friend Vec operator/(const Vec& lhs, const T& rhs) {\\n return Vec(lhs) /= rhs;\\n }\\n friend Vec operator/(const T& rhs, const Vec& lhs) {\\n return Vec(lhs) /= rhs;\\n }\\n};\\n\\ntemplate<typename T>\\nT dot(const Vec<T> &a, const Vec<T> &b){\\n return a.x * b.x + a.y * b.y;\\n}\\n\\n// cross > 0 : counter clockwise a -> b\\ntemplate<typename T>\\nT cross(const Vec<T> &a, const Vec<T> &b){\\n return a.x * b.y - a.y * b.x;\\n}\\n\\ntemplate<typename T>\\nld abs(const Vec<T> &a){\\n return sqrtl(a.x*a.x+a.y*a.y);\\n}\\n\\ntemplate<typename T>\\nT norm(const Vec<T> &a){\\n return a.x*a.x+a.y*a.y;\\n}\\n\\ntemplate<typename T>\\nstruct Line {\\n Vec<T> p, q;\\n};\\n\\ntemplate<typename T>\\nint intersection(const Line<T> &a, const Line<T> &b){\\n if (cross(a.p-a.q,b.p-b.q) == 0){\\n if (cross(a.p-b.p,a.q-b.p) == 0) return 2;\\n return 0;\\n }\\n return 1;\\n}\\n\\n// intersection == 1\\ntemplate<typename T>\\nVec<T> cross_point(const Line<T> &a, const Line<T> &b){\\n Vec<T> va = a.p-a.q, vb = b.p-b.q;\\n Vec<T> ba = b.p-a.q;\\n T alpha = cross(ba,vb) / cross(va,vb);\\n return alpha * a.p + (1 - alpha) * a.q;\\n}\\n\\n\\n} // namespace lib\\n#line 6 \\\"test/geometry/base_rational.test.cpp\\\"\\n\\nusing namespace lib;\\nusing vec = Vec<rational>;\\nusing line = Line<rational>;\\n\\nconst vector<vector<int>> order = {{0,1,2},{0,2,1},{1,0,2},{1,2,0},{2,0,1},{2,1,0}};\\n\\nint main(){\\n while (true){\\n vector<vec> ia(3), b(3);\\n rep(i,0,6){\\n ll x, y; cin >> x >> y;\\n if (!cin) return 0;\\n (i < 3 ? ia[i] : b[i-3]) = vec(x,y);\\n }\\n int ans = 5;\\n for (auto fid : order) for (auto tid : order) rep(j,0,2){\\n auto a = ia;\\n int cur = 0;\\n rep(i,0,3){\\n int f = fid[i], t = tid[i];\\n if (a[f] == b[t]) continue;\\n cur++;\\n int p = (f+1)%3, q = (f+2)%3;\\n if (cross(a[p]-a[q],b[t]-a[f]) == 0){\\n a[f] = b[t];\\n continue;\\n }\\n cur++;\\n if (j == 1) swap(p,q);\\n line l1({a[p],a[p]+a[f]-b[t]}), l2({a[q],a[q]+a[f]-a[p]});\\n if (intersection(l1,l2) == 1){\\n a[q] = cross_point(l1,l2);\\n a[f] = b[t];\\n }\\n else {\\n cur = 5;\\n break;\\n }\\n }\\n chmin(ans,cur);\\n }\\n if (ans == 5) cout << \\\"Many\\\" << endl;\\n else cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1530,\n \"memory_kb\": 3316,\n \"score_of_the_acc\": -0.6637,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1623_7782179\",\n \"code_snippet\": \"#line 1 \\\"f.cpp\\\"\\n#include<bits/stdc++.h>\\n#define rep(i,n) for (int i = 0; i < int(n); ++i)\\n#define repp(i,n,m) for (int i = m; i < int(n); ++i)\\n#define reb(i,n) for (int i = int(n)-1; i >= 0; --i)\\n#define all(v) v.begin(),v.end()\\n\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing P = pair<int,int>;\\nusing PL = pair<ll,ll>;\\n\\ntemplate<class T>istream &operator>>(istream &is,vector<T> &v){for(auto &e:v)is>>e;return is;}\\ntemplate<typename T1, typename T2>void print(pair<T1,T2> a);\\ntemplate<typename T>void print(vector<T> v);\\ntemplate<typename T>void print(vector<vector<T>> v);\\nvoid print(){ putchar(' '); }\\nvoid print(bool a){ printf(\\\"%d\\\", a); }\\nvoid print(int a){ printf(\\\"%d\\\", a); }\\nvoid print(long a){ printf(\\\"%ld\\\", a); }\\nvoid print(long long a){ printf(\\\"%lld\\\", a); }\\nvoid print(char a){ printf(\\\"%c\\\", a); }\\nvoid print(char a[]){ printf(\\\"%s\\\", a); }\\nvoid print(const char a[]){ printf(\\\"%s\\\", a); }\\nvoid print(long double a){ printf(\\\"%.15Lf\\\", a); }\\nvoid print(const string& a){ for(auto&& i : a) print(i); }\\nvoid print(unsigned int a){ printf(\\\"%u\\\", a); }\\nvoid print(__int128_t a){print((long long)(a));}\\ntemplate<class T> void print(const T& a){ cout << a;}\\nint out(){ putchar('\\\\n'); return 0; }\\ntemplate<class T> int out(const T& t){ print(t); putchar('\\\\n'); return 0; }\\ntemplate<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }\\ntemplate<typename T1,typename T2>void print(pair<T1,T2> a){print(a.first);print(),print(a.second);}\\ntemplate<typename T>void print(vector<T> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())print();}}\\ntemplate<typename T>void print(vector<vector<T>> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())out();}}\\n\\ntemplate<typename T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}\\ntemplate<typename T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}\\n\\nvoid fast_io(){cin.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(20);}\\n\\nnamespace noya2{\\n\\nconst int INF = 1001001007;\\nconst long long mod1 = 998244353;\\nconst long long mod2 = 1000000007;\\nconst long long inf = 2e18;\\nconst long double pi = 3.14159265358979323;\\nconst long double eps = 1e-7;\\nvector<int> dx = {0,1,0,-1,1,1,-1,-1};\\nvector<int> dy = {1,0,-1,0,1,-1,-1,1};\\nconst string ALP = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\nconst string alp = \\\"abcdefghijklmnopqrstuvwxyz\\\";\\nconst string NUM = \\\"0123456789\\\";\\nvoid o(){out(\\\"!?\\\");}\\nvoid yn(bool f){out(f ? \\\"Yes\\\" : \\\"No\\\");}\\nvoid YN(bool F){out(F ? \\\"YES\\\" : \\\"NO\\\");}\\ntemplate<typename T>bool range(T a,T b,T x){return (a<=x&&x<b);}\\ntemplate<typename T>bool rrange(T a,T b,T c,T d,T x,T y){return (range(a,c,x)&&range(b,d,y));}\\n\\n} // namespace noya2\\nusing namespace noya2;\\n\\n#line 2 \\\"rational.hpp\\\"\\n\\nnamespace noya2{\\n\\ntemplate<typename T>\\nstruct rational{\\n rational() : p(T(0)), q(T(1)) {}\\n rational(T n) : p(n), q(T(1)) {}\\n rational(T n, T m){\\n assert(m != T(0));\\n if (m < T(0)) n = -n, m = -m;\\n T g = gcd(n,m);\\n p = n / g; q = m / g;\\n }\\n T num(){return p;}\\n T den(){return q;}\\n void set_num(T n){\\n p = n;\\n T g = gcd(p,q);\\n p /= g, q /= g;\\n }\\n void set_den(T n){\\n assert(n != T(0));\\n q = n;\\n T g = gcd(p,q);\\n p /= g, q /= g;\\n }\\n long double val(){\\n return (long double)(p) / (long double)(q);\\n }\\n rational& operator+=(const rational& rhs){\\n T g = gcd(q,rhs.q);\\n T np = rhs.q / g * p + q / g * rhs.p;\\n T nq = q / g * rhs.q;\\n T ng = gcd(np,nq);\\n p = np/ng, q = nq/ng;\\n return *this; \\n }\\n rational& operator-=(const rational& rhs){\\n T g = gcd(q,rhs.q);\\n T np = rhs.q / g * p - q / g * rhs.p;\\n T nq = q / g * rhs.q;\\n T ng = gcd(np,nq);\\n p = np/ng, q = nq/ng;\\n return *this;\\n }\\n rational& operator*=(const rational& rhs){\\n T g1 = gcd(q,rhs.p), g2 = gcd(p,rhs.q);\\n T np = p / g2 * rhs.p / g1;\\n T nq = q / g1 * rhs.q / g2;\\n p = np, q = nq;\\n return *this;\\n }\\n rational& operator/=(const rational& rhs){\\n assert(rhs.p != T(0));\\n T g1 = gcd(q,rhs.q), g2 = gcd(p,rhs.p);\\n T np = p / g2 * rhs.q / g1;\\n T nq = q / g1 * rhs.p / g2;\\n p = np, q = nq;\\n return *this;\\n }\\n rational operator+() const {return *this;}\\n rational operator-() const {return rational() - *this;}\\n friend rational operator+(const rational& lhs, const rational& rhs) {\\n return rational(lhs) += rhs;\\n }\\n friend rational operator-(const rational& lhs, const rational& rhs) {\\n return rational(lhs) -= rhs;\\n }\\n friend rational operator*(const rational& lhs, const rational& rhs) {\\n return rational(lhs) *= rhs;\\n }\\n friend rational operator/(const rational& lhs, const rational& rhs) {\\n return rational(lhs) /= rhs;\\n }\\n friend bool operator==(const rational& lhs, const rational& rhs) {\\n return lhs.p == rhs.p && lhs.q == rhs.q;\\n }\\n friend bool operator!=(const rational& lhs, const rational& rhs) {\\n return lhs.p != rhs.p || lhs.q != rhs.q;\\n }\\n friend bool operator< (const rational lhs, const rational rhs) {\\n return less_than(lhs,rhs);\\n }\\n friend bool operator> (const rational lhs, const rational rhs) {\\n return less_than(rhs,lhs);\\n }\\n friend bool operator<= (const rational lhs, const rational rhs) {\\n return lhs == rhs || lhs < rhs;\\n }\\n friend bool operator>= (const rational lhs, const rational rhs) {\\n return lhs == rhs || lhs > rhs;\\n }\\n friend std::ostream &operator<<(std::ostream &os,const rational&r) {\\n return os << r.p << \\\" / \\\" << r.q;\\n }\\n private:\\n T p, q;\\n T gcd(T a,T b){if(a<T(0))return gcd(-a,b);if(b<T(0))return gcd(a,-b);return _gcd(a,b);}\\n T _gcd(T a,T b){return b?_gcd(b,a%b):a;}\\n static bool less_than(rational lhs, rational rhs){\\n __int128_t lv = __int128_t(lhs.p) * __int128_t(rhs.q);\\n __int128_t rv = __int128_t(lhs.q) * __int128_t(rhs.p);\\n return lv < rv;\\n }\\n};\\n\\nusing rat = rational<long long>;\\n\\n} // namespace noya2\\n#line 2 \\\"geometry2D.hpp\\\"\\n\\n#line 6 \\\"geometry2D.hpp\\\"\\n\\n#line 2 \\\"math.hpp\\\"\\n\\n#line 6 \\\"math.hpp\\\"\\n\\nnamespace noya2{\\n\\nusing namespace std;\\nusing ll = long long;\\n\\ntemplate<typename T> T sqrt_safe(T x){ // floor(sqrt(x))\\n assert(x >= T(0));\\n if (x <= T(1)) return x;\\n T tmp = (T)(sqrtl((long double)(x))) + T(2);\\n while (tmp--){\\n if (tmp * tmp <= x) break;\\n }\\n return tmp;\\n}\\n\\nll mod_safe(ll a, ll m){ // m >= 1, 0 <= mod_safe(a,m) < m, mod_safe(a,m) = a (mod m)\\n ll res = a % m;\\n if (res < 0) res += m;\\n return res;\\n}\\nll modpow(ll x, ll n, ll mod){\\n x = mod_safe(x,mod);\\n if (n == 0) return 1;\\n ll res = modpow(x,n/2,mod);\\n res = (res * res) % mod;\\n if (n % 2 == 1) res = (res * x) % mod;\\n return res;\\n}\\n\\nll naive_gcd(ll a, ll b){ return b ? naive_gcd(b, a % b) : a; }\\n\\n// gcd(N >= 0, 0) = N, especialy gcd(0, 0) = 0\\nll gcd_safe(ll a, ll b){ return naive_gcd(abs(a),abs(b)); }\\nll lcm_safe(ll a, ll b){ return a / gcd_safe(a,b) * b; }\\n\\nvoid ext_gcd1_plus(ll a, ll b, ll &x, ll &y){ // gcd(a,b) = 1, a >= 0, b >= 0, ax + by = 1\\n if (b == 0){ // a = 1\\n x = 1, y = 0;\\n return ;\\n }\\n ext_gcd1_plus(b, a%b, y, x);\\n x = mod_safe(x,b);\\n y = (1 - a * x) / b;\\n}\\nvoid ext_gcd1_minus(ll a, ll b, ll &x, ll &y){ // gcd(a,b) = 1, a >= 0, b >= 0, ax - by = 1\\n if (b == 0){ // a = 1\\n x = 1, y = 0;\\n return ;\\n }\\n ext_gcd1_plus(b, a%b, y, x);\\n x = mod_safe(x,b);\\n y = (a * x - 1) / b;\\n}\\n\\npair<ll,ll> ext_gcd(ll a, ll b, ll c){ // ax + by = c, |a|,|b|,|c| < 1e9, x <= max(|B|,|C|), y <= max(|A|,|C|)\\n if (a < 0) return ext_gcd(-a,-b,-c);\\n if (c < 0){\\n pair<ll,ll> res = ext_gcd(a,b,-c);\\n res.first = -res.first, res.second = -res.second;\\n return res;\\n }\\n if (c == 0) return pair<ll,ll>(0,0);\\n if (a == 0 && b == 0) return pair<ll,ll>(0,0); // answer not exist\\n ll g = gcd_safe(a,b);\\n if (c % g != 0) return pair<ll,ll>(0,0); // answer not exist\\n a /= g, b /= g, c /= g;\\n ll x, y;\\n if (b == 0) return pair<ll,ll>(c,0);\\n if (b > 0) ext_gcd1_plus(a,b,x,y);\\n else ext_gcd1_minus(a,-b,x,y);\\n x = mod_safe(x*c,abs(b));\\n y = (c - a * x) / b;\\n return pair<ll,ll>(x,y);\\n}\\n\\ntemplate<typename T>\\nT ceil_safe(T p, T q);\\n\\ntemplate<typename T>\\nT floor_safe(T p, T q){\\n if (q < T(0)) return floor_safe(-p,-q);\\n if (p >= T(0)) return p / q;\\n return -ceil_safe(-p,q);\\n}\\n\\ntemplate<typename T>\\nT ceil_safe(T p, T q){\\n if (q < T(0)) return ceil_safe(-p,-q);\\n if (p >= T(0)) return (p + q - 1) / q;\\n return -floor_safe(-p,q);\\n}\\n\\nstruct Eratosthenes{\\n static vector<int> table;\\n Eratosthenes (int Nmax = -1) {init(Nmax);}\\n static void init(int Nmax){\\n if (!table.empty()) return ;\\n table.resize(Nmax+1,0);\\n table[0] = 1, table[1] = 1;\\n for (int p = 2; p <= Nmax; p++){\\n if (table[p] != 0) continue;\\n for (int j = p; j <= Nmax; j += p){\\n table[j] = p;\\n }\\n }\\n }\\n};\\nvector<int>Eratosthenes::table = vector<int>(0);\\n\\nvoid build_eratosthenes(const int Nmax){Eratosthenes::init(Nmax);}\\n\\nvector<pair<int,int>> fast_prime_factorization(int N){\\n int pre = -1, cnt = 0;\\n vector<pair<int,int>> res;\\n while(true) {\\n if (N == 1){\\n if (cnt > 0) res.emplace_back(pre,cnt);\\n break;\\n }\\n int div = Eratosthenes::table[N];\\n if (pre != div){\\n if (cnt > 0) res.emplace_back(pre,cnt);\\n pre = div, cnt = 1;\\n }\\n else cnt++;\\n N /= div;\\n }\\n return res;\\n}\\n\\nvector<int> fast_divisor_enumeration(int N){\\n auto pes = fast_prime_factorization(N);\\n vector<int> res = {1};\\n for (auto pe : pes){\\n vector<int> nres;\\n for (auto x : res){\\n for (int _t = 0; _t <= pe.second; _t++){\\n nres.emplace_back(x);\\n x *= pe.first;\\n }\\n }\\n swap(res,nres);\\n }\\n return res;\\n}\\n\\nbool fast_is_prime(int N){\\n if (N <= 1) return false;\\n return Eratosthenes::table[N] == N;\\n}\\n\\nvector<int> mobius(int N){\\n vector<int> res(N+1,0);\\n res[1] = 1;\\n for (int p = 2; p <= N; p++){\\n if (fast_is_prime(p)){\\n for (int i = N/p; i > 0; i--){\\n res[i*p] = -res[i];\\n }\\n }\\n }\\n return res;\\n};\\n\\nvector<pair<ll,int>> prime_factorization(ll N){\\n vector<pair<ll,int>> res;\\n ll iN = N;\\n for (ll d = 2; d * d <= N; d++){\\n if (iN % d != 0) continue;\\n if (iN == 1) break;\\n int ie = 0;\\n while (iN % d == 0) iN /= d, ie++;\\n res.emplace_back(d,ie);\\n }\\n if (iN != 1) res.emplace_back(iN,1);\\n return res;\\n}\\n\\nvector<ll> divisor_enumeration(ll N){\\n vector<ll> res;\\n for (ll d = 1; d * d <= N; d++){\\n if (N % d != 0) continue;\\n res.emplace_back(d);\\n if (d * d != N) res.emplace_back(N/d);\\n }\\n return res;\\n}\\n\\nbool is_prime(ll N){\\n if (N <= 1) return false;\\n if (N <= 3) return true;\\n if (N % 2 == 0) return false;\\n for (ll d = 3; d * d <= N; d += 2){\\n if (N % d == 0) return false;\\n }\\n return true;\\n}\\n\\n}// namespace noya2\\n#line 8 \\\"geometry2D.hpp\\\"\\n\\nnamespace noya2{\\n\\nusing namespace std;\\nusing ld = long double;\\n\\ntemplate<typename T>\\nstruct Vec {\\n T x, y;\\n Vec (T _x = T(0), T _y = T(0)) : x(_x), y(_y) {}\\n Vec& operator*=(const T& a){\\n x *= a;\\n y *= a;\\n return *this;\\n }\\n Vec& operator/=(const T& a){\\n x /= a;\\n y /= a;\\n return *this;\\n }\\n Vec& operator+=(const Vec& rhs) {\\n x += rhs.x;\\n y += rhs.y;\\n return *this;\\n }\\n Vec& operator-=(const Vec& rhs) {\\n x -= rhs.x;\\n y -= rhs.y;\\n return *this;\\n }\\n friend Vec operator+(const Vec& lhs, const Vec& rhs) {\\n return Vec(lhs) += rhs;\\n }\\n friend Vec operator-(const Vec& lhs, const Vec& rhs) {\\n return Vec(lhs) -= rhs;\\n }\\n friend Vec operator*(const Vec& lhs, const T& rhs) {\\n return Vec(lhs) *= rhs;\\n }\\n friend Vec operator*(const T& rhs, const Vec& lhs) {\\n return Vec(lhs) *= rhs;\\n }\\n friend Vec operator/(const Vec& lhs, const T& rhs) {\\n return Vec(lhs) /= rhs;\\n }\\n friend Vec operator/(const T& rhs, const Vec& lhs) {\\n return Vec(lhs) /= rhs;\\n }\\n ld norm(){\\n return sqrtl(ld(x*x+y*y));\\n }\\n T norm2(){\\n return x*x+y*y;\\n }\\n};\\n\\ntemplate<typename T>\\nT dot(const Vec<T> &a, const Vec<T> &b){\\n return a.x * b.x + a.y * b.y;\\n}\\n\\n// cross > 0 : counter clockwise a -> b\\ntemplate<typename T>\\nT cross(const Vec<T> &a, const Vec<T> &b){\\n return a.x * b.y - a.y * b.x;\\n}\\n\\n// T = int, ll\\n// number of lattice points ( point(x,y) s.t. x in Z and y in Z ) on Vec a\\ntemplate<typename T>\\nT lattice_points(const Vec<T> &a){\\n return gcd_safe(a.x,a.y) + 1;\\n}\\n\\n// e : vec(OX)\\n// orthant k : [ pi/2 * k, pi/2 * (k+1) ) rad\\n// orthant 4 is NOT expected\\ntemplate<typename T>\\nint orthant(const Vec<T> &e, const Vec<T> &p){\\n T _dot = dot(e,p), _cross = cross(e,p);\\n if (_dot > 0 && _cross >= 0) return 0;\\n if (_dot <= 0 && _cross > 0) return 1;\\n if (_dot < 0 && _cross <= 0) return 2;\\n if (_dot >= 0 && _cross < 0) return 3;\\n return 4;\\n}\\n\\n// usage : \\n// vector<Vec<ll>> vec;\\n// sort(vec.begin(),vec.end(),comp_for_argument_sort<ll>);\\ntemplate<typename T>\\nbool comp_for_argument_sort(const Vec<T> &lhs, const Vec<T> &rhs){\\n int pl = orthant(Vec<T>(1,0),lhs), pr = orthant(Vec<T>(1,0),rhs);\\n if (pl == pr){\\n return cross(lhs,rhs) > 0;\\n }\\n return pl < pr;\\n}\\n\\n// DISTINCT points are given\\n// ans[0] --- ans[1] --- ... --- ans[k-1] --- ans[k] --- ans[0]\\n// upper_hull --- lower_hull\\n// upper_hull : x is from small to large\\n// lower hull : x is from large to small\\n// points rearranged counter clockwise\\ntemplate<typename T>\\nvector<Vec<T>> convex_hull(vector<Vec<T>> a){\\n int n = a.size();\\n if (n <= 2) return a;\\n using vec = Vec<T>;\\n auto comp = [&](vec lhs, vec rhs){\\n if (lhs.x == rhs.x) return lhs.y < rhs.y;\\n return lhs.x < rhs.x;\\n };\\n sort(a.begin(),a.end(),comp);\\n stack<int> uid, did;\\n uid.push(0);\\n vec ri = a[n-1];\\n for (int i = 1; i < n-1; i++){\\n vec le = a[uid.top()];\\n if (cross(ri-le,a[i]-le) > 0){\\n while (uid.size() >= 2){\\n int test = uid.top(); uid.pop();\\n vec from = a[uid.top()];\\n if (cross(a[i]-from,a[test]-from) > 0){\\n uid.push(test);\\n break;\\n }\\n }\\n uid.push(i);\\n }\\n }\\n did.push(0);\\n for (int i = 1; i < n-1; i++){\\n vec le = a[did.top()];\\n if (cross(ri-le,a[i]-le) < 0){\\n while (did.size() >= 2){\\n int test = did.top(); did.pop();\\n vec from = a[did.top()];\\n if (cross(a[i]-from,a[test]-from) < 0){\\n did.push(test);\\n break;\\n }\\n }\\n did.push(i);\\n }\\n }\\n vector<int> ids(1,n-1);\\n while (!did.empty()) ids.emplace_back(did.top()), did.pop();\\n reverse(ids.begin(),ids.end());\\n while (!uid.empty()) ids.emplace_back(uid.top()), uid.pop();\\n ids.pop_back();\\n vector<vec> ans(ids.size());\\n for (int i = 0; i < (int)(ids.size()); i++){\\n ans[i] = a[ids[i]];\\n }\\n return ans;\\n}\\n\\nusing ll = long long;\\nstruct Line{\\n ll a, b, c; // ax + by = c\\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 }\\n static Line get_Line(ll x1, ll y1, ll ex, ll ey){ // y = ey/ex (x - x1) + y1 \\n return Line(ey,-ex,ey*x1-ex*y1);\\n }\\n static Line vertical_Line(ll x1, ll y1, ll x2, ll y2){ // perpendicular bisector\\n ll ex = y2 - y1, ey = x1 - x2;\\n return Line(ey*2,-ex*2,ey*(x1+x2)-ex*(y1+y2));\\n }\\n void slide(const Vec<ll> &v){ // ax + by = c -> a(x - vx) + b(y - vy) = c\\n c += a * v.x + b * v.y;\\n }\\n //Vec<ll> normal_Vec(const Vec<ll> &from){}\\n ld dist_from_point(const Vec<ll> &from){\\n return abs(ld(a) * ld(from.x) + ld(b) * ld(from.y) - ld(c)) / sqrtl(ld(a*a+b*b));\\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\\nstruct Directed_Line{\\n Vec<ll> from, direct; // Line : from + k * direct\\n void normalize(){\\n ll g = gcd_safe(direct.x,direct.y);\\n direct /= g;\\n }\\n Directed_Line (ll x_from = 0, ll y_from = 0, ll x_to = 1, ll y_to = 0){\\n from.x = x_from, from.y = y_from;\\n direct.x = x_to - x_from;\\n direct.y = y_to - y_from;\\n normalize();\\n }\\n Directed_Line (Vec<ll> _from, Vec<ll> _to){\\n from = _from;\\n direct = _to - _from;\\n normalize();\\n }\\n bool in(const Vec<ll> &r, bool on){\\n ll z = cross(direct,r-from);\\n if (z == 0) return on;\\n return z > 0;\\n }\\n bool slide_if_smaller(const Vec<ll> &v){\\n if (in(from+v,false)){\\n from += v;\\n return true;\\n }\\n return false;\\n }\\n Directed_Line slide(const Vec<ll> &v){\\n auto res = *this;\\n res.from += v;\\n return res;\\n }\\n};\\n\\n\\n// two line segments AB and CD shared at least one point\\nbool check_intersection(ll ax, ll ay, ll bx, ll by, ll cx, ll cy, ll dx, ll dy){\\n // both AB and CD are parallel to y-axis \\n if (ax == bx && cx == dx){\\n if (ax != cx) return false;\\n return (min(ay,by) <= max(cy,dy)) && (min(cy,dy) <= max(ay,by));\\n }\\n // change to cx != dx \\n if (cx == dx){\\n swap(ax,cx), swap(ay,cy);\\n swap(bx,dx), swap(by,dy);\\n }\\n // change to ax >= bx\\n if (ax < bx){\\n swap(ax,bx), swap(ay,by);\\n }\\n // change to cx >= dx\\n if (cx < dx){\\n swap(cx,dx), swap(cy,dy);\\n }\\n // AB is parallel to y-axis\\n if (ax == bx){\\n __int128_t lv = __int128_t(cx - dx) * __int128_t(min(ay,by) - dy);\\n __int128_t mv = __int128_t(cy - dy) * __int128_t(ax - dx);\\n __int128_t rv = __int128_t(cx - dx) * __int128_t(max(ay,by) - dy);\\n return lv <= mv && mv <= rv;\\n }\\n // both AB and CD are NOT parallel to y-axis\\n ll gAB = gcd_safe(ay-by,ax-bx);\\n ll pAB = (ax-bx) / gAB, qAB = (ay-by) / gAB;\\n ll gCD = gcd_safe(cy-dy,cx-dx);\\n ll pCD = (cx-dx) / gCD, qCD = (cy-dy) / gCD;\\n // AB and CD are parallel\\n if (pAB == pCD && qAB == qCD){\\n if (bx == dx){\\n return by == dy;\\n }\\n ll gDB = gcd_safe(dy-by,dx-bx);\\n ll pDB = (dx-bx) / gDB, qDB = (dy-by) / gDB;\\n if (bx > dx){\\n pDB = -pDB;\\n qDB = -qDB;\\n }\\n // Line AB = Line CD\\n if (pDB == pAB && qDB == qAB){\\n return bx <= cx && dx <= ax;\\n }\\n return false;\\n }\\n // AB and CD are NOT parallel\\n __int128_t tal = __int128_t(cx - dx) * __int128_t(ay - cy); // ta = tal - tar\\n __int128_t tar = __int128_t(cy - dy) * __int128_t(ax - cx); // ta <=> 0 == tal <=> tar\\n __int128_t tbl = __int128_t(cx - dx) * __int128_t(by - cy); // tb = tbl - tbr\\n __int128_t tbr = __int128_t(cy - dy) * __int128_t(bx - cx); // tb <=> 0 == tbl <=> tbr\\n __int128_t tcl = __int128_t(ax - bx) * __int128_t(cy - ay); // tc = tcl - tcr\\n __int128_t tcr = __int128_t(ay - by) * __int128_t(cx - ax); // tc <=> 0 == tcl <=> tcr\\n __int128_t tdl = __int128_t(ax - bx) * __int128_t(dy - ay); // td = tdl - tdr\\n __int128_t tdr = __int128_t(ay - by) * __int128_t(dx - ax); // td <=> 0 == tdl <=> tdr\\n // ta * tb <= 0 && tc * td <= 0 -> true\\n // ta > 0 && tb > 0 -> false\\n if ((tal > tar && tbl > tbr) || (tal < tar && tbl < tbr)){\\n return false;\\n }\\n // tc > 0 && td > 0 -> false\\n if ((tcl > tcr && tdl > tdr) || (tcl < tcr && tdl < tdr)){\\n return false;\\n }\\n return true;\\n}\\n\\n} // namespace noya2\\n#line 66 \\\"f.cpp\\\"\\n\\nusing vec = Vec<rat>;\\n\\nconst vector<vector<int>> order = {{0,1,2},{0,2,1},{1,0,2},{1,2,0},{2,0,1},{2,1,0}};\\n\\nbool mat2(vec a0, vec a1, vec b, vec &res){\\n res = vec(b.x * a1.y - b.y * a1.x, b.y * a0.x - b.x * a0.y);\\n rat d = cross(a0,a1);\\n if (d == 0) return false;\\n res /= d;\\n return true;\\n}\\n\\nvoid solve(){\\n while (true){\\n vector<vec> ia(3), b(3);\\n rep(i,6){\\n ll x, y; cin >> x >> y;\\n if (!cin) return ;\\n (i < 3 ? ia[i] : b[i-3]) = vec(x,y);\\n }\\n \\n int ans = 5;\\n for (auto fid : order) for (auto tid : order) rep(j,2){\\n auto a = ia;\\n int cur = 3;\\n rep(i,3){\\n int f = fid[i], t = tid[i];\\n int p = (f+1)%3, q = (f+2)%3;\\n if (cross(a[p]-a[q],b[t]-a[f]) == 0){\\n a[f] = b[t];\\n continue;\\n }\\n cur++;\\n if (cur == 5) break;\\n if (j == 1) swap(p,q);\\n vec ab;\\n if (mat2(a[f]-b[t],a[p]-a[f],a[q]-a[p],ab)){\\n a[q] += ab.y * (a[f]-a[p]);\\n a[f] = b[t];\\n }\\n else {\\n cur = 5;\\n break;\\n }\\n }\\n chmin(ans,cur);\\n }\\n if (ans == 5) cout << \\\"Many\\\" << endl;\\n else cout << ans << endl;\\n if (cin.eof()) break;\\n }\\n}\\n\\nint main(){\\n fast_io();\\n int t = 1; //cin >> t;\\n while(t--) solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 260,\n \"memory_kb\": 3416,\n \"score_of_the_acc\": -0.7292,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1623_7780703\",\n \"code_snippet\": \"#line 1 \\\"f.cpp\\\"\\n#include<bits/stdc++.h>\\n#define rep(i,n) for (int i = 0; i < int(n); ++i)\\n#define repp(i,n,m) for (int i = m; i < int(n); ++i)\\n#define reb(i,n) for (int i = int(n)-1; i >= 0; --i)\\n#define all(v) v.begin(),v.end()\\n\\nusing namespace std;\\nusing ll = long long;\\nusing ld = long double;\\nusing P = pair<int,int>;\\nusing PL = pair<ll,ll>;\\n\\ntemplate<class T>istream &operator>>(istream &is,vector<T> &v){for(auto &e:v)is>>e;return is;}\\ntemplate<typename T1, typename T2>void print(pair<T1,T2> a);\\ntemplate<typename T>void print(vector<T> v);\\ntemplate<typename T>void print(vector<vector<T>> v);\\nvoid print(){ putchar(' '); }\\nvoid print(bool a){ printf(\\\"%d\\\", a); }\\nvoid print(int a){ printf(\\\"%d\\\", a); }\\nvoid print(long a){ printf(\\\"%ld\\\", a); }\\nvoid print(long long a){ printf(\\\"%lld\\\", a); }\\nvoid print(char a){ printf(\\\"%c\\\", a); }\\nvoid print(char a[]){ printf(\\\"%s\\\", a); }\\nvoid print(const char a[]){ printf(\\\"%s\\\", a); }\\nvoid print(long double a){ printf(\\\"%.15Lf\\\", a); }\\nvoid print(const string& a){ for(auto&& i : a) print(i); }\\nvoid print(unsigned int a){ printf(\\\"%u\\\", a); }\\nvoid print(__int128_t a){print((long long)(a));}\\ntemplate<class T> void print(const T& a){ cout << a;}\\nint out(){ putchar('\\\\n'); return 0; }\\ntemplate<class T> int out(const T& t){ print(t); putchar('\\\\n'); return 0; }\\ntemplate<class Head, class... Tail> int out(const Head& head, const Tail&... tail){ print(head); putchar(' '); out(tail...); return 0; }\\ntemplate<typename T1,typename T2>void print(pair<T1,T2> a){print(a.first);print(),print(a.second);}\\ntemplate<typename T>void print(vector<T> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())print();}}\\ntemplate<typename T>void print(vector<vector<T>> v){for(auto ite=v.begin();ite!=v.end();){print(*ite);if(++ite!=v.end())out();}}\\n\\ntemplate<typename T>bool chmin(T &a,const T &b){if(a>b){a=b;return true;}return false;}\\ntemplate<typename T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}\\n\\nvoid fast_io(){cin.tie(0); ios::sync_with_stdio(0); cout<<fixed<<setprecision(20);}\\n\\nnamespace noya2{\\n\\nconst int INF = 1001001007;\\nconst long long mod1 = 998244353;\\nconst long long mod2 = 1000000007;\\nconst long long inf = 2e18;\\nconst long double pi = 3.14159265358979323;\\nconst long double eps = 1e-7;\\nvector<int> dx = {0,1,0,-1,1,1,-1,-1};\\nvector<int> dy = {1,0,-1,0,1,-1,-1,1};\\nconst string ALP = \\\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\\\";\\nconst string alp = \\\"abcdefghijklmnopqrstuvwxyz\\\";\\nconst string NUM = \\\"0123456789\\\";\\nvoid o(){out(\\\"!?\\\");}\\nvoid yn(bool f){out(f ? \\\"Yes\\\" : \\\"No\\\");}\\nvoid YN(bool F){out(F ? \\\"YES\\\" : \\\"NO\\\");}\\ntemplate<typename T>bool range(T a,T b,T x){return (a<=x&&x<b);}\\ntemplate<typename T>bool rrange(T a,T b,T c,T d,T x,T y){return (range(a,c,x)&&range(b,d,y));}\\n\\n} // namespace noya2\\nusing namespace noya2;\\n\\n#line 2 \\\"rational.hpp\\\"\\n\\nnamespace noya2{\\n\\ntemplate<typename T>\\nstruct rational{\\n rational() : p(T(0)), q(T(1)) {}\\n rational(T n) : p(n), q(T(1)) {}\\n rational(T n, T m){\\n assert(m != T(0));\\n if (m < T(0)) n = -n, m = -m;\\n T g = gcd(n,m);\\n p = n / g; q = m / g;\\n }\\n T num(){return p;}\\n T den(){return q;}\\n void set_num(T n){\\n p = n;\\n T g = gcd(p,q);\\n p /= g, q /= g;\\n }\\n void set_den(T n){\\n assert(n != T(0));\\n q = n;\\n T g = gcd(p,q);\\n p /= g, q /= g;\\n }\\n long double val(){\\n return (long double)(p) / (long double)(q);\\n }\\n rational& operator+=(const rational& rhs){\\n T g = gcd(q,rhs.q);\\n T np = rhs.q / g * p + q / g * rhs.p;\\n T nq = q / g * rhs.q;\\n T ng = gcd(np,nq);\\n p = np/ng, q = nq/ng;\\n return *this; \\n }\\n rational& operator-=(const rational& rhs){\\n T g = gcd(q,rhs.q);\\n T np = rhs.q / g * p - q / g * rhs.p;\\n T nq = q / g * rhs.q;\\n T ng = gcd(np,nq);\\n p = np/ng, q = nq/ng;\\n return *this;\\n }\\n rational& operator*=(const rational& rhs){\\n T g1 = gcd(q,rhs.p), g2 = gcd(p,rhs.q);\\n T np = p / g2 * rhs.p / g1;\\n T nq = q / g1 * rhs.q / g2;\\n p = np, q = nq;\\n return *this;\\n }\\n rational& operator/=(const rational& rhs){\\n assert(rhs.p != T(0));\\n T g1 = gcd(q,rhs.q), g2 = gcd(p,rhs.p);\\n T np = p / g2 * rhs.q / g1;\\n T nq = q / g1 * rhs.p / g2;\\n p = np, q = nq;\\n return *this;\\n }\\n rational operator+() const {return *this;}\\n rational operator-() const {return rational() - *this;}\\n friend rational operator+(const rational& lhs, const rational& rhs) {\\n return rational(lhs) += rhs;\\n }\\n friend rational operator-(const rational& lhs, const rational& rhs) {\\n return rational(lhs) -= rhs;\\n }\\n friend rational operator*(const rational& lhs, const rational& rhs) {\\n return rational(lhs) *= rhs;\\n }\\n friend rational operator/(const rational& lhs, const rational& rhs) {\\n return rational(lhs) /= rhs;\\n }\\n friend bool operator==(const rational& lhs, const rational& rhs) {\\n return lhs.p == rhs.p && lhs.q == rhs.q;\\n }\\n friend bool operator!=(const rational& lhs, const rational& rhs) {\\n return lhs.p != rhs.p || lhs.q != rhs.q;\\n }\\n friend bool operator< (const rational lhs, const rational rhs) {\\n return less_than(lhs,rhs);\\n }\\n friend bool operator> (const rational lhs, const rational rhs) {\\n return less_than(rhs,lhs);\\n }\\n friend bool operator<= (const rational lhs, const rational rhs) {\\n return lhs == rhs || lhs < rhs;\\n }\\n friend bool operator>= (const rational lhs, const rational rhs) {\\n return lhs == rhs || lhs > rhs;\\n }\\n friend std::ostream &operator<<(std::ostream &os,const rational&r) {\\n return os << r.p << \\\" / \\\" << r.q;\\n }\\n private:\\n T p, q;\\n T gcd(T a,T b){if(a<T(0))return gcd(-a,b);if(b<T(0))return gcd(a,-b);return _gcd(a,b);}\\n T _gcd(T a,T b){return b?_gcd(b,a%b):a;}\\n static bool less_than(rational lhs, rational rhs){\\n __int128_t lv = __int128_t(lhs.p) * __int128_t(rhs.q);\\n __int128_t rv = __int128_t(lhs.q) * __int128_t(rhs.p);\\n return lv < rv;\\n }\\n};\\n\\nusing rat = rational<long long>;\\n\\n} // namespace noya2\\n#line 2 \\\"geometry2D.hpp\\\"\\n\\n#line 6 \\\"geometry2D.hpp\\\"\\n\\n#line 2 \\\"math.hpp\\\"\\n\\n#line 6 \\\"math.hpp\\\"\\n\\nnamespace noya2{\\n\\nusing namespace std;\\nusing ll = long long;\\n\\ntemplate<typename T> T sqrt_safe(T x){ // floor(sqrt(x))\\n assert(x >= T(0));\\n if (x <= T(1)) return x;\\n T tmp = (T)(sqrtl((long double)(x))) + T(2);\\n while (tmp--){\\n if (tmp * tmp <= x) break;\\n }\\n return tmp;\\n}\\n\\nll mod_safe(ll a, ll m){ // m >= 1, 0 <= mod_safe(a,m) < m, mod_safe(a,m) = a (mod m)\\n ll res = a % m;\\n if (res < 0) res += m;\\n return res;\\n}\\nll modpow(ll x, ll n, ll mod){\\n x = mod_safe(x,mod);\\n if (n == 0) return 1;\\n ll res = modpow(x,n/2,mod);\\n res = (res * res) % mod;\\n if (n % 2 == 1) res = (res * x) % mod;\\n return res;\\n}\\n\\nll naive_gcd(ll a, ll b){ return b ? naive_gcd(b, a % b) : a; }\\n\\n// gcd(N >= 0, 0) = N, especialy gcd(0, 0) = 0\\nll gcd_safe(ll a, ll b){ return naive_gcd(abs(a),abs(b)); }\\nll lcm_safe(ll a, ll b){ return a / gcd_safe(a,b) * b; }\\n\\nvoid ext_gcd1_plus(ll a, ll b, ll &x, ll &y){ // gcd(a,b) = 1, a >= 0, b >= 0, ax + by = 1\\n if (b == 0){ // a = 1\\n x = 1, y = 0;\\n return ;\\n }\\n ext_gcd1_plus(b, a%b, y, x);\\n x = mod_safe(x,b);\\n y = (1 - a * x) / b;\\n}\\nvoid ext_gcd1_minus(ll a, ll b, ll &x, ll &y){ // gcd(a,b) = 1, a >= 0, b >= 0, ax - by = 1\\n if (b == 0){ // a = 1\\n x = 1, y = 0;\\n return ;\\n }\\n ext_gcd1_plus(b, a%b, y, x);\\n x = mod_safe(x,b);\\n y = (a * x - 1) / b;\\n}\\n\\npair<ll,ll> ext_gcd(ll a, ll b, ll c){ // ax + by = c, |a|,|b|,|c| < 1e9, x <= max(|B|,|C|), y <= max(|A|,|C|)\\n if (a < 0) return ext_gcd(-a,-b,-c);\\n if (c < 0){\\n pair<ll,ll> res = ext_gcd(a,b,-c);\\n res.first = -res.first, res.second = -res.second;\\n return res;\\n }\\n if (c == 0) return pair<ll,ll>(0,0);\\n if (a == 0 && b == 0) return pair<ll,ll>(0,0); // answer not exist\\n ll g = gcd_safe(a,b);\\n if (c % g != 0) return pair<ll,ll>(0,0); // answer not exist\\n a /= g, b /= g, c /= g;\\n ll x, y;\\n if (b == 0) return pair<ll,ll>(c,0);\\n if (b > 0) ext_gcd1_plus(a,b,x,y);\\n else ext_gcd1_minus(a,-b,x,y);\\n x = mod_safe(x*c,abs(b));\\n y = (c - a * x) / b;\\n return pair<ll,ll>(x,y);\\n}\\n\\ntemplate<typename T>\\nT ceil_safe(T p, T q);\\n\\ntemplate<typename T>\\nT floor_safe(T p, T q){\\n if (q < T(0)) return floor_safe(-p,-q);\\n if (p >= T(0)) return p / q;\\n return -ceil_safe(-p,q);\\n}\\n\\ntemplate<typename T>\\nT ceil_safe(T p, T q){\\n if (q < T(0)) return ceil_safe(-p,-q);\\n if (p >= T(0)) return (p + q - 1) / q;\\n return -floor_safe(-p,q);\\n}\\n\\nstruct Eratosthenes{\\n static vector<int> table;\\n Eratosthenes (int Nmax = -1) {init(Nmax);}\\n static void init(int Nmax){\\n if (!table.empty()) return ;\\n table.resize(Nmax+1,0);\\n table[0] = 1, table[1] = 1;\\n for (int p = 2; p <= Nmax; p++){\\n if (table[p] != 0) continue;\\n for (int j = p; j <= Nmax; j += p){\\n table[j] = p;\\n }\\n }\\n }\\n};\\nvector<int>Eratosthenes::table = vector<int>(0);\\n\\nvoid build_eratosthenes(const int Nmax){Eratosthenes::init(Nmax);}\\n\\nvector<pair<int,int>> fast_prime_factorization(int N){\\n int pre = -1, cnt = 0;\\n vector<pair<int,int>> res;\\n while(true) {\\n if (N == 1){\\n if (cnt > 0) res.emplace_back(pre,cnt);\\n break;\\n }\\n int div = Eratosthenes::table[N];\\n if (pre != div){\\n if (cnt > 0) res.emplace_back(pre,cnt);\\n pre = div, cnt = 1;\\n }\\n else cnt++;\\n N /= div;\\n }\\n return res;\\n}\\n\\nvector<int> fast_divisor_enumeration(int N){\\n auto pes = fast_prime_factorization(N);\\n vector<int> res = {1};\\n for (auto pe : pes){\\n vector<int> nres;\\n for (auto x : res){\\n for (int _t = 0; _t <= pe.second; _t++){\\n nres.emplace_back(x);\\n x *= pe.first;\\n }\\n }\\n swap(res,nres);\\n }\\n return res;\\n}\\n\\nbool fast_is_prime(int N){\\n if (N <= 1) return false;\\n return Eratosthenes::table[N] == N;\\n}\\n\\nvector<int> mobius(int N){\\n vector<int> res(N+1,0);\\n res[1] = 1;\\n for (int p = 2; p <= N; p++){\\n if (fast_is_prime(p)){\\n for (int i = N/p; i > 0; i--){\\n res[i*p] = -res[i];\\n }\\n }\\n }\\n return res;\\n};\\n\\nvector<pair<ll,int>> prime_factorization(ll N){\\n vector<pair<ll,int>> res;\\n ll iN = N;\\n for (ll d = 2; d * d <= N; d++){\\n if (iN % d != 0) continue;\\n if (iN == 1) break;\\n int ie = 0;\\n while (iN % d == 0) iN /= d, ie++;\\n res.emplace_back(d,ie);\\n }\\n if (iN != 1) res.emplace_back(iN,1);\\n return res;\\n}\\n\\nvector<ll> divisor_enumeration(ll N){\\n vector<ll> res;\\n for (ll d = 1; d * d <= N; d++){\\n if (N % d != 0) continue;\\n res.emplace_back(d);\\n if (d * d != N) res.emplace_back(N/d);\\n }\\n return res;\\n}\\n\\nbool is_prime(ll N){\\n if (N <= 1) return false;\\n if (N <= 3) return true;\\n if (N % 2 == 0) return false;\\n for (ll d = 3; d * d <= N; d += 2){\\n if (N % d == 0) return false;\\n }\\n return true;\\n}\\n\\n}// namespace noya2\\n#line 8 \\\"geometry2D.hpp\\\"\\n\\nnamespace noya2{\\n\\nusing namespace std;\\nusing ld = long double;\\n\\ntemplate<typename T>\\nstruct Vec {\\n T x, y;\\n Vec (T _x = T(0), T _y = T(0)) : x(_x), y(_y) {}\\n Vec& operator*=(const T& a){\\n x *= a;\\n y *= a;\\n return *this;\\n }\\n Vec& operator/=(const T& a){\\n x /= a;\\n y /= a;\\n return *this;\\n }\\n Vec& operator+=(const Vec& rhs) {\\n x += rhs.x;\\n y += rhs.y;\\n return *this;\\n }\\n Vec& operator-=(const Vec& rhs) {\\n x -= rhs.x;\\n y -= rhs.y;\\n return *this;\\n }\\n friend bool operator==(const Vec& lhs, const Vec& rhs) {\\n return lhs.x == rhs.x && lhs.y == rhs.y;\\n }\\n friend bool operator!=(const Vec& lhs, const Vec& rhs) {\\n return lhs.x != rhs.x || lhs.y != rhs.y;\\n }\\n friend Vec operator+(const Vec& lhs, const Vec& rhs) {\\n return Vec(lhs) += rhs;\\n }\\n friend Vec operator-(const Vec& lhs, const Vec& rhs) {\\n return Vec(lhs) -= rhs;\\n }\\n friend Vec operator*(const Vec& lhs, const T& rhs) {\\n return Vec(lhs) *= rhs;\\n }\\n friend Vec operator*(const T& rhs, const Vec& lhs) {\\n return Vec(lhs) *= rhs;\\n }\\n friend Vec operator/(const Vec& lhs, const T& rhs) {\\n return Vec(lhs) /= rhs;\\n }\\n friend Vec operator/(const T& rhs, const Vec& lhs) {\\n return Vec(lhs) /= rhs;\\n }\\n ld norm(){\\n return sqrtl(ld(x*x+y*y));\\n }\\n T norm2(){\\n return x*x+y*y;\\n }\\n};\\n\\ntemplate<typename T>\\nT dot(const Vec<T> &a, const Vec<T> &b){\\n return a.x * b.x + a.y * b.y;\\n}\\n\\n// cross > 0 : counter clockwise a -> b\\ntemplate<typename T>\\nT cross(const Vec<T> &a, const Vec<T> &b){\\n return a.x * b.y - a.y * b.x;\\n}\\n\\n// T = int, ll\\n// number of lattice points ( point(x,y) s.t. x in Z and y in Z ) on Vec a\\ntemplate<typename T>\\nT lattice_points(const Vec<T> &a){\\n return gcd_safe(a.x,a.y) + 1;\\n}\\n\\n// e : vec(OX)\\n// orthant k : [ pi/2 * k, pi/2 * (k+1) ) rad\\n// orthant 4 is NOT expected\\ntemplate<typename T>\\nint orthant(const Vec<T> &e, const Vec<T> &p){\\n T _dot = dot(e,p), _cross = cross(e,p);\\n if (_dot > 0 && _cross >= 0) return 0;\\n if (_dot <= 0 && _cross > 0) return 1;\\n if (_dot < 0 && _cross <= 0) return 2;\\n if (_dot >= 0 && _cross < 0) return 3;\\n return 4;\\n}\\n\\n// usage : \\n// vector<Vec<ll>> vec;\\n// sort(vec.begin(),vec.end(),comp_for_argument_sort<ll>);\\ntemplate<typename T>\\nbool comp_for_argument_sort(const Vec<T> &lhs, const Vec<T> &rhs){\\n int pl = orthant(Vec<T>(1,0),lhs), pr = orthant(Vec<T>(1,0),rhs);\\n if (pl == pr){\\n return cross(lhs,rhs) > 0;\\n }\\n return pl < pr;\\n}\\n\\n// DISTINCT points are given\\n// ans[0] --- ans[1] --- ... --- ans[k-1] --- ans[k] --- ans[0]\\n// upper_hull --- lower_hull\\n// upper_hull : x is from small to large\\n// lower hull : x is from large to small\\n// points rearranged counter clockwise\\ntemplate<typename T>\\nvector<Vec<T>> convex_hull(vector<Vec<T>> a){\\n int n = a.size();\\n if (n <= 2) return a;\\n using vec = Vec<T>;\\n auto comp = [&](vec lhs, vec rhs){\\n if (lhs.x == rhs.x) return lhs.y < rhs.y;\\n return lhs.x < rhs.x;\\n };\\n sort(a.begin(),a.end(),comp);\\n stack<int> uid, did;\\n uid.push(0);\\n vec ri = a[n-1];\\n for (int i = 1; i < n-1; i++){\\n vec le = a[uid.top()];\\n if (cross(ri-le,a[i]-le) > 0){\\n while (uid.size() >= 2){\\n int test = uid.top(); uid.pop();\\n vec from = a[uid.top()];\\n if (cross(a[i]-from,a[test]-from) > 0){\\n uid.push(test);\\n break;\\n }\\n }\\n uid.push(i);\\n }\\n }\\n did.push(0);\\n for (int i = 1; i < n-1; i++){\\n vec le = a[did.top()];\\n if (cross(ri-le,a[i]-le) < 0){\\n while (did.size() >= 2){\\n int test = did.top(); did.pop();\\n vec from = a[did.top()];\\n if (cross(a[i]-from,a[test]-from) < 0){\\n did.push(test);\\n break;\\n }\\n }\\n did.push(i);\\n }\\n }\\n vector<int> ids(1,n-1);\\n while (!did.empty()) ids.emplace_back(did.top()), did.pop();\\n reverse(ids.begin(),ids.end());\\n while (!uid.empty()) ids.emplace_back(uid.top()), uid.pop();\\n ids.pop_back();\\n vector<vec> ans(ids.size());\\n for (int i = 0; i < (int)(ids.size()); i++){\\n ans[i] = a[ids[i]];\\n }\\n return ans;\\n}\\n\\nusing ll = long long;\\nstruct Line{\\n ll a, b, c; // ax + by = c\\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 }\\n static Line get_Line(ll x1, ll y1, ll ex, ll ey){ // y = ey/ex (x - x1) + y1 \\n return Line(ey,-ex,ey*x1-ex*y1);\\n }\\n static Line vertical_Line(ll x1, ll y1, ll x2, ll y2){ // perpendicular bisector\\n ll ex = y2 - y1, ey = x1 - x2;\\n return Line(ey*2,-ex*2,ey*(x1+x2)-ex*(y1+y2));\\n }\\n void slide(const Vec<ll> &v){ // ax + by = c -> a(x - vx) + b(y - vy) = c\\n c += a * v.x + b * v.y;\\n }\\n //Vec<ll> normal_Vec(const Vec<ll> &from){}\\n ld dist_from_point(const Vec<ll> &from){\\n return abs(ld(a) * ld(from.x) + ld(b) * ld(from.y) - ld(c)) / sqrtl(ld(a*a+b*b));\\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\\nstruct Directed_Line{\\n Vec<ll> from, direct; // Line : from + k * direct\\n void normalize(){\\n ll g = gcd_safe(direct.x,direct.y);\\n direct /= g;\\n }\\n Directed_Line (ll x_from = 0, ll y_from = 0, ll x_to = 1, ll y_to = 0){\\n from.x = x_from, from.y = y_from;\\n direct.x = x_to - x_from;\\n direct.y = y_to - y_from;\\n normalize();\\n }\\n Directed_Line (Vec<ll> _from, Vec<ll> _to){\\n from = _from;\\n direct = _to - _from;\\n normalize();\\n }\\n bool in(const Vec<ll> &r, bool on){\\n ll z = cross(direct,r-from);\\n if (z == 0) return on;\\n return z > 0;\\n }\\n bool slide_if_smaller(const Vec<ll> &v){\\n if (in(from+v,false)){\\n from += v;\\n return true;\\n }\\n return false;\\n }\\n Directed_Line slide(const Vec<ll> &v){\\n auto res = *this;\\n res.from += v;\\n return res;\\n }\\n};\\n\\n\\n// two line segments AB and CD shared at least one point\\nbool check_intersection(ll ax, ll ay, ll bx, ll by, ll cx, ll cy, ll dx, ll dy){\\n // both AB and CD are parallel to y-axis \\n if (ax == bx && cx == dx){\\n if (ax != cx) return false;\\n return (min(ay,by) <= max(cy,dy)) && (min(cy,dy) <= max(ay,by));\\n }\\n // change to cx != dx \\n if (cx == dx){\\n swap(ax,cx), swap(ay,cy);\\n swap(bx,dx), swap(by,dy);\\n }\\n // change to ax >= bx\\n if (ax < bx){\\n swap(ax,bx), swap(ay,by);\\n }\\n // change to cx >= dx\\n if (cx < dx){\\n swap(cx,dx), swap(cy,dy);\\n }\\n // AB is parallel to y-axis\\n if (ax == bx){\\n __int128_t lv = __int128_t(cx - dx) * __int128_t(min(ay,by) - dy);\\n __int128_t mv = __int128_t(cy - dy) * __int128_t(ax - dx);\\n __int128_t rv = __int128_t(cx - dx) * __int128_t(max(ay,by) - dy);\\n return lv <= mv && mv <= rv;\\n }\\n // both AB and CD are NOT parallel to y-axis\\n ll gAB = gcd_safe(ay-by,ax-bx);\\n ll pAB = (ax-bx) / gAB, qAB = (ay-by) / gAB;\\n ll gCD = gcd_safe(cy-dy,cx-dx);\\n ll pCD = (cx-dx) / gCD, qCD = (cy-dy) / gCD;\\n // AB and CD are parallel\\n if (pAB == pCD && qAB == qCD){\\n if (bx == dx){\\n return by == dy;\\n }\\n ll gDB = gcd_safe(dy-by,dx-bx);\\n ll pDB = (dx-bx) / gDB, qDB = (dy-by) / gDB;\\n if (bx > dx){\\n pDB = -pDB;\\n qDB = -qDB;\\n }\\n // Line AB = Line CD\\n if (pDB == pAB && qDB == qAB){\\n return bx <= cx && dx <= ax;\\n }\\n return false;\\n }\\n // AB and CD are NOT parallel\\n __int128_t tal = __int128_t(cx - dx) * __int128_t(ay - cy); // ta = tal - tar\\n __int128_t tar = __int128_t(cy - dy) * __int128_t(ax - cx); // ta <=> 0 == tal <=> tar\\n __int128_t tbl = __int128_t(cx - dx) * __int128_t(by - cy); // tb = tbl - tbr\\n __int128_t tbr = __int128_t(cy - dy) * __int128_t(bx - cx); // tb <=> 0 == tbl <=> tbr\\n __int128_t tcl = __int128_t(ax - bx) * __int128_t(cy - ay); // tc = tcl - tcr\\n __int128_t tcr = __int128_t(ay - by) * __int128_t(cx - ax); // tc <=> 0 == tcl <=> tcr\\n __int128_t tdl = __int128_t(ax - bx) * __int128_t(dy - ay); // td = tdl - tdr\\n __int128_t tdr = __int128_t(ay - by) * __int128_t(dx - ax); // td <=> 0 == tdl <=> tdr\\n // ta * tb <= 0 && tc * td <= 0 -> true\\n // ta > 0 && tb > 0 -> false\\n if ((tal > tar && tbl > tbr) || (tal < tar && tbl < tbr)){\\n return false;\\n }\\n // tc > 0 && td > 0 -> false\\n if ((tcl > tcr && tdl > tdr) || (tcl < tcr && tdl < tdr)){\\n return false;\\n }\\n return true;\\n}\\n\\n} // namespace noya2\\n#line 66 \\\"f.cpp\\\"\\n\\nusing vec = Vec<rat>;\\n\\nconst vector<vector<int>> order = {{0,1,2},{0,2,1},{1,0,2},{1,2,0},{2,0,1},{2,1,0}};\\n\\nbool mat2(vec a0, vec a1, vec b, vec &res){\\n res = vec(b.x * a1.y - b.y * a1.x, b.y * a0.x - b.x * a0.y);\\n rat d = cross(a0,a1);\\n if (d == 0) return false;\\n res /= d;\\n return true;\\n}\\n\\nvoid solve(){\\n ll xx;\\n while (std::cin >> xx){\\n vector<vec> ia(3), b(3);\\n {\\n ll y;\\n std::cin >> y;\\n ia[0] = {xx, y};\\n }\\n rep(i,6){\\n if(i == 0) continue;\\n ll x, y; cin >> x >> y;\\n (i < 3 ? ia[i] : b[i-3]) = vec(x,y);\\n }\\n int ans = 5;\\n for (auto fid : order) for (auto tid : order) rep(j,2){\\n auto a = ia;\\n int cur = 0;\\n rep(i,3){\\n int f = fid[i], t = tid[i];\\n if (a[f] == b[t]) continue;\\n cur++;\\n int p = (f+1)%3, q = (f+2)%3;\\n if (cross(a[p]-a[q],b[t]-a[f]) == 0){\\n a[f] = b[t];\\n continue;\\n }\\n cur++;\\n if (j == 1) swap(p,q);\\n vec ab;\\n if (mat2(a[f]-b[t],a[p]-a[f],a[q]-a[p],ab)){\\n a[q] += ab.y * (a[f]-a[p]);\\n a[f] = b[t];\\n }\\n else {\\n cur = 1000;\\n break;\\n }\\n }\\n chmin(ans,cur);\\n }\\n if (ans == 5) out(\\\"Many\\\");\\n else out(ans);\\n }\\n}\\n\\nint main(){\\n fast_io();\\n int t = 1; //cin >> t;\\n while(t--) solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 850,\n \"memory_kb\": 3520,\n \"score_of_the_acc\": -1.057,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1623_7780702\",\n \"code_snippet\": \"#include <algorithm>\\n#include <bitset>\\n#include <cassert>\\n#include <chrono>\\n#include <climits>\\n#include <cmath>\\n#include <complex>\\n#include <cstddef>\\n#include <cstdint>\\n#include <cstdlib>\\n#include <cstring>\\n#include <functional>\\n#include <iomanip>\\n#include <iostream>\\n#include <limits>\\n#include <map>\\n#include <memory>\\n#include <numeric>\\n#include <optional>\\n#include <queue>\\n#include <random>\\n#include <set>\\n#include <stack>\\n#include <string>\\n#include <tuple>\\n#include <type_traits>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <utility>\\n#include <vector>\\n\\n/* macro */\\n\\n#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)\\n#define rrep(i, a, n) for (int i = ((int)(n - 1)); i >= (int)(a); i--)\\n#define Rep(i, a, n) for (i64 i = (i64)(a); i < (i64)(n); i++)\\n#define RRep(i, a, n) for (i64 i = ((i64)(n - i64(1))); i >= (i64)(a); i--)\\n#define all(v) (v).begin(), (v).end()\\n#define rall(v) (v).rbegin(), (v).rend()\\n#define Bit(n) (1LL << (n))\\n\\n/* macro end */\\n\\n/* template */\\n\\nnamespace ebi {\\n\\n#ifdef LOCAL\\n#define debug(...) \\\\\\n std::cerr << \\\"LINE: \\\" << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"]:\\\", \\\\\\n debug_out(__VA_ARGS__)\\n#else\\n#define debug(...)\\n#endif\\n\\nvoid debug_out() { std::cerr << std::endl; }\\n\\ntemplate <typename Head, typename... Tail>\\nvoid debug_out(Head h, Tail... t) {\\n std::cerr << \\\" \\\" << h;\\n if (sizeof...(t) > 0) std::cout << \\\" :\\\";\\n debug_out(t...);\\n}\\n\\ntemplate <typename T1, typename T2>\\nstd::ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &pa) {\\n return os << pa.first << \\\" \\\" << pa.second;\\n}\\n\\ntemplate <typename T1, typename T2>\\nstd::istream &operator>>(std::istream &os, std::pair<T1, T2> &pa) {\\n return os >> pa.first >> pa.second;\\n}\\n\\ntemplate <typename T>\\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &vec) {\\n for (std::size_t i = 0; i < vec.size(); i++)\\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\" \\\");\\n return os;\\n}\\n\\ntemplate <typename T>\\nstd::istream &operator>>(std::istream &os, std::vector<T> &vec) {\\n for (T &e : vec) std::cin >> e;\\n return os;\\n}\\n\\ntemplate <typename T>\\nstd::ostream &operator<<(std::ostream &os, const std::optional<T> &opt) {\\n if (opt) {\\n os << opt.value();\\n } else {\\n os << \\\"invalid value\\\";\\n }\\n return os;\\n}\\n\\nusing std::size_t;\\nusing i32 = std::int32_t;\\nusing u32 = std::uint32_t;\\nusing i64 = std::int64_t;\\nusing u64 = std::uint64_t;\\n\\ntemplate <class T, T init>\\nauto make_vector(int n) {\\n return std::vector<T>(n, init);\\n}\\n\\ntemplate <class T, T init, typename Head, typename... Tail>\\nauto make_vector(Head n, Tail... ts) {\\n return std::vector(n, make_vector<T, init>(ts...));\\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\\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>\\nT pow(T x, i64 n) {\\n T res = 1;\\n while (n > 0) {\\n if (n & 1) res = res * x;\\n x = x * x;\\n n >>= 1;\\n }\\n return res;\\n}\\n\\ntemplate <class T>\\nT mod_pow(T x, i64 n, i64 mod) {\\n T res = 1;\\n while (n > 0) {\\n if (n & 1) res = (res * x) % mod;\\n x = (x * x) % mod;\\n n >>= 1;\\n }\\n return res;\\n}\\n\\ntemplate <class T>\\nT scan() {\\n T val;\\n std::cin >> val;\\n return val;\\n}\\n\\ntemplate <class T>\\nstruct Edge {\\n int to;\\n T cost;\\n Edge(int _to, T _cost = 1) : to(_to), cost(_cost) {}\\n};\\n\\ntemplate <class T>\\nstruct Graph : std::vector<std::vector<Edge<T>>> {\\n using std::vector<std::vector<Edge<T>>>::vector;\\n void add_edge(int u, int v, T w, bool directed = false) {\\n (*this)[u].emplace_back(v, w);\\n if (directed) return;\\n (*this)[v].emplace_back(u, w);\\n }\\n};\\n\\nstruct graph : std::vector<std::vector<int>> {\\n using std::vector<std::vector<int>>::vector;\\n void add_edge(int u, int v, bool directed = false) {\\n (*this)[u].emplace_back(v);\\n if (directed) return;\\n (*this)[v].emplace_back(u);\\n }\\n};\\n\\nconstexpr i64 LNF = std::numeric_limits<i64>::max() / 4;\\n\\nconstexpr int INF = std::numeric_limits<int>::max() / 2;\\n\\nconst std::vector<int> dy = {1, 0, -1, 0, 1, 1, -1, -1};\\nconst std::vector<int> dx = {0, 1, 0, -1, 1, -1, 1, -1};\\n\\n} // namespace ebi\\n\\nnamespace ebi {\\n\\nconstexpr long double EPS = 1e-7;\\n\\nconst long double PI = std::acos(-1);\\n\\nnamespace internal {\\n\\nint sgn(long double a) {\\n return (a<-EPS) ? -1 : (a>EPS) ? 1 : 0;\\n}\\n\\nlong double add(long double a, long double b) {\\n if(std::abs(a+b) < EPS*(std::abs(a) + std::abs(b))) return 0;\\n return a+b;\\n}\\n\\n} // namespace internal\\n\\n\\nlong double arg_to_radian(long double arg) {\\n return PI * arg / (long double)(180);\\n}\\n\\nstruct point {\\n long double x,y;\\n\\n point() = default;\\n\\n point(long double x, long double y) : x(x), y(y) { }\\n\\n point &operator+=(const point rhs) noexcept {\\n x = internal::add(x, rhs.x);\\n y = internal::add(y, rhs.y);\\n return *this;\\n }\\n\\n point &operator-=(const point rhs) noexcept {\\n x = internal::add(x, -rhs.x);\\n y = internal::add(y, -rhs.y);\\n return *this;\\n }\\n\\n point &operator*=(const point rhs) noexcept {\\n long double _x = internal::add(x*rhs.x, -y*rhs.y);\\n long double _y = internal::add(x*rhs.y, y*rhs.x);\\n x = _x;\\n y = _y;\\n return *this;\\n }\\n\\n point &operator*=(const long double k) noexcept {\\n x *= k;\\n y *= k;\\n return *this;\\n }\\n\\n point &operator/=(const long double k) {\\n assert(internal::sgn(k)!=0);\\n x /= k;\\n y /= k;\\n return *this;\\n }\\n\\n point operator+(const point &rhs) const noexcept {\\n return point(*this) += rhs;\\n }\\n\\n point operator-(const point &rhs) const noexcept {\\n return point(*this) -= rhs;\\n }\\n\\n point operator*(const point &rhs) const noexcept {\\n return point(*this) *= rhs;\\n }\\n\\n point operator*(const long double rhs) const noexcept {\\n return point(*this) *= rhs;\\n }\\n\\n point operator/(const long double rhs) const {\\n return point(*this) /= rhs;\\n }\\n\\n point operator-() const noexcept {\\n return point(0, 0) - *this;\\n }\\n\\n long double abs() const noexcept {\\n return std::sqrt(internal::add(x*x, y*y));\\n }\\n\\n long double dot(const point rhs) const noexcept {\\n return internal::add(x*rhs.x, y*rhs.y);\\n }\\n\\n long double det(const point rhs) const noexcept {\\n return internal::add(x*rhs.y, -y*rhs.x);\\n }\\n\\n // arctan(y/x) (単位はラジアン)\\n\\n long double arg() const {\\n return std::atan2(y, x);\\n }\\n\\n // x昇順, その後y昇順\\n\\n bool operator<(const point &rhs) const noexcept {\\n if(internal::sgn(x-rhs.x)) return internal::sgn(x-rhs.x)<0;\\n return internal::sgn(y-rhs.y)<0;\\n }\\n\\n bool operator==(const point &rhs) const noexcept {\\n if(internal::sgn(x - rhs.x) == 0 && internal::sgn(y - rhs.y) == 0) return true;\\n else return false;\\n }\\n\\n bool operator!=(const point &rhs) const noexcept {\\n return !(*this == rhs);\\n }\\n};\\n\\nstd::ostream& operator<<(std::ostream& os, const point &a) {\\n return os << a.x << \\\" \\\" << a.y;\\n}\\n\\nstd::istream& operator>>(std::istream& os, point &a) {\\n return os >> a.x >> a.y;\\n}\\n\\npoint conj(const point &a) {\\n return point(a.x, -a.y);\\n}\\n\\n// 点a をang(ラジアン)回転する\\n\\npoint rot(const point &a, long double ang) {\\n return point(std::cos(ang) * a.x - std::sin(ang) * a.y, std::sin(ang) * a.x + std::cos(ang) * a.y);\\n} \\n\\npoint rot90(const point &a) {\\n return point(-a.y, a.x);\\n}\\n\\nlong double dot(const point &a, const point &b) {\\n return a.dot(b);\\n}\\n\\nlong double det(const point &a, const point &b) {\\n return a.det(b);\\n}\\n\\nlong double abs(const point &a) {\\n return a.abs();\\n}\\n\\nlong double norm(const point &a) {\\n return internal::add(a.x*a.x, a.y*a.y);\\n}\\n\\nint isp(const point &a, const point &b, const point &c) {\\n int flag = internal::sgn(det(b-a,c-a));\\n if(flag == 0) {\\n if(internal::sgn(dot(b-a, c-a))<0) return -2;\\n if(internal::sgn(dot(a-b, c-b))<0) return +2;\\n }\\n return flag;\\n}\\n\\n// 分割統治で最近点対を求める O(N log N)\\n\\nlong double closest_pair(std::vector<point> p) {\\n std::sort(p.begin(), p.end());\\n int n = p.size();\\n auto f = [&](auto &&self, int l, int r) -> long double {\\n if(r-l == 1) {\\n return 1e9;\\n }\\n int mid = (l+r)/2;\\n long double x = p[mid].x;\\n long double d = std::min(self(self, l, mid), self(self, mid, r));\\n std::vector<point> b;\\n b.reserve(r-l);\\n int j = mid;\\n for(int i = l; i < mid; i++) {\\n while(j < r && p[j].y <= p[i].y) {\\n b.emplace_back(p[j++]);\\n }\\n b.emplace_back(p[i]);\\n }\\n while(j < r) {\\n b.emplace_back(p[j++]);\\n }\\n for(int i = 0; i < r-l; i++) {\\n p[l+i] = b[i];\\n }\\n b.clear();\\n for(int i = l; i < r; i++) {\\n if(std::abs(p[i].x - x) >= d) continue;\\n for(int j = int(b.size())-1; j >= 0; j--) {\\n if(p[i].y - b[j].y >= d) break;\\n d = std::min(d, abs(p[i]-b[j]));\\n }\\n b.emplace_back(p[i]);\\n }\\n return d;\\n };\\n return f(f, 0, n);\\n}\\n\\n// ∠ABCを求める(ラジアン)\\n\\nlong double angle(const point &A, const point &B, const point &C) {\\n long double a = (B - C).abs(), b = (C - A).abs(), c = (A - B).abs();\\n long double cos = internal::add(internal::add(a*a, c*c), -b*b)/(2.0*c*a);\\n return std::acos(cos);\\n}\\n\\nvoid arg_sort(std::vector<point> &a) {\\n int n = a.size();\\n std::vector ps(4, std::vector<point>());\\n auto idx = [](point v) -> int {\\n if(v.y >= 0) return (v.x >= 0) ? 0 : 1;\\n else return (v.x >= 0) ? 3 : 2;\\n };\\n for(auto p: a) {\\n assert(!(p.x == 0 && p.y == 0));\\n ps[idx(p)].emplace_back(p);\\n }\\n a.clear();\\n a.reserve(n);\\n for(int i = 0; i < 4; i++) {\\n std::sort(ps[i].begin(), ps[i].end(), \\n [](point &p1, point &p2) -> bool {\\n int flag = internal::sgn(internal::add(p1.x * p2.y, - p2.x * p1.y));\\n return flag == 0 ? (norm(p1) < norm(p2)) : flag > 0;\\n });\\n for(auto &p: ps[i]) a.emplace_back(p);\\n }\\n return;\\n}\\n\\ntemplate<class T>\\nvoid arg_sort_ll(std::vector<std::pair<T , T>> &a) {\\n using Point = std::pair<T, T>;\\n int n = a.size();\\n std::vector ps(4, std::vector<Point>());\\n auto idx = [](Point v) -> int {\\n if(v.second >= 0) return (v.first >= 0) ? 0 : 1;\\n else return (v.first >= 0) ? 3 : 2;\\n };\\n for(auto p: a) {\\n assert(!(p.first == 0 && p.second == 0));\\n ps[idx(p)].emplace_back(p);\\n }\\n a.clear();\\n a.reserve(n);\\n for(int i = 0; i < 4; i++) {\\n std::sort(ps[i].begin(), ps[i].end(), \\n [](Point &p1, Point &p2) -> bool { \\n T flag = p1.first * p2.second - p2.first * p1.second;\\n return flag == 0 ? (p1.first * p1.first + p1.second * p1.second < p2.first * p2.first + p2.second * p2.second) : flag > 0;\\n });\\n for(auto &p: ps[i]) a.emplace_back(p);\\n }\\n return;\\n}\\n\\n}\\n\\nnamespace ebi {\\n\\nstruct line {\\n point a,b;\\n\\n line(long double x1, long double y1, long double x2, long double y2) : a(x1, y1), b(x2, y2) { }\\n\\n line(const point &a, const point &b) : a(a), b(b) { }\\n\\n point proj(const point &p) const {\\n return a + (b-a)*(dot(b-a,p-a)/norm(b-a));\\n }\\n\\n point relf(const point &p) const {\\n return proj(p)*double(2) - p;\\n }\\n\\n long double distance(const point &c) const {\\n return std::abs(det(c - a, b - a)/abs(b-a));\\n }\\n};\\n\\nint intersection(const line &a, const line &b) {\\n if(internal::sgn(det(a.b-a.a, b.a-b.b)) != 0) {\\n if(internal::sgn(dot(a.b-a.a, b.b-b.a)) == 0) { // 垂直\\n return 1;\\n }\\n return 0; // 交差\\n }\\n else if(internal::sgn(det(a.b-a.a, b.a-a.a)) != 0) { // 平行\\n return 2;\\n }\\n else { // 同一直線\\n return 3;\\n }\\n}\\n\\npoint cross_point(const point &a, const point &b, const point &c, const point &d) {\\n return a + (b-a) * det(c - a, d - c) / det(b - a, d - c);\\n}\\n\\n// 交点があるか確認する！\\npoint cross_point(const line &s, const line &t) {\\n assert(intersection(s, t) < 2);\\n return s.a + (s.b - s.a) * det(t.a - s.a, t.b - t.a) / det(s.b - s.a, t.b - t.a);\\n}\\n\\n// 直線aと点cの距離\\nlong double distance(const line &a, const point &c) {\\n return std::abs(det(c-a.a, a.b - a.a)/abs(a.b-a.a));\\n}\\n\\nlong double distance(const line &a, const line &b) {\\n if(intersection(a, b) < 2) {\\n return 0;\\n }\\n else {\\n return distance(a, b.a);\\n }\\n}\\n\\n}\\n\\nnamespace ebi {\\n\\nstruct line_segment {\\n point a, b;\\n\\n line_segment() = default;\\n\\n line_segment(long double x1, long double y1, long double x2, long double y2) : a(x1, y1), b(x2, y2) { }\\n\\n line_segment(const point &a, const point &b) : a(a), b(b) { }\\n};\\n\\n// 線分ab, cd が交わるか判定\\nbool intersection_line_segment(const point &a, const point &b, const point &c, const point &d) {\\n if(internal::sgn(isp(a,b,c)*isp(a,b,d)) <= 0 && internal::sgn(isp(c,d,a)*isp(c,d,b)) <= 0) {\\n return true;\\n }\\n return false;\\n}\\n\\n// 線分ab, cd が交わるか判定\\nbool intersection(const line_segment &a, const line_segment &b) {\\n return intersection_line_segment(a.a, a.b, b.a, b.b);\\n}\\n\\nbool intersection(const line &a, const line_segment &b) {\\n if(internal::sgn(det(a.b - a.a, b.a - a.a)) * internal::sgn(det(a.b - a.a, b.b - a.a)) < 0) {\\n return true;\\n }\\n else {\\n return false;\\n }\\n}\\n\\npoint cross_point(const line_segment &s, const line_segment &t) {\\n assert(intersection(s, t));\\n return s.a + (s.b - s.a) * det(t.a - s.a, t.b - t.a) / det(s.b - s.a, t.b - t.a);\\n}\\n\\nlong double distance(const line_segment &a, const point &c) {\\n if(internal::sgn(dot(a.b - a.a, c - a.a)) < 0) {\\n return abs(c-a.a);\\n }\\n else if(internal::sgn(dot(a.a - a.b, c - a.b)) < 0) {\\n return abs(c-a.b);\\n }\\n else {\\n return std::abs(det(c - a.a, a.b - a.a)/abs(a.b-a.a));\\n }\\n}\\n\\nlong double distance(const line_segment &a, const line_segment &b) {\\n if(intersection(a, b)) {\\n return 0;\\n }\\n else {\\n return std::min(std::min(distance(a, b.a), distance(a, b.b)), std::min(distance(b, a.a), distance(b, a.b)));\\n }\\n}\\n\\nlong double distance(const line &a, const line_segment &b) {\\n if(intersection(a, b)) {\\n return 0;\\n }\\n else {\\n return std::min(distance(a, b.a), distance(a, b.b));\\n }\\n}\\n\\n}\\n\\nnamespace ebi {\\n\\nvoid main_() {\\n long double x;\\n while (std::cin >> x) {\\n long double y;\\n std::vector<point> t1(3), t2(3);\\n std::cin >> y;\\n t1[0] = {x, y};\\n std::cin >> t1[1] >> t1[2] >> t2;\\n std::vector<int> idx(3), jdx(3);\\n std::iota(all(idx), 0);\\n std::iota(all(jdx), 0);\\n int ans = INF;\\n\\n auto move = [&](int i, int j, int k, std::vector<point> &t, point target) -> int {\\n if(t[i] == target) return 0;\\n int cnt = 0;\\n line l1(t[j], t[j] + target - t[i]);\\n line l2(t[k], t[k] + t[i] - t[j]);\\n if(intersection(l1, l2) >= 2) return 1000;\\n point p = cross_point(l1, l2);\\n if(p != t[k]) cnt++;\\n t[k] = p;\\n t[i] = target;\\n cnt++;\\n return cnt;\\n };\\n do {\\n do {\\n {\\n int cnt = 0;\\n auto t = t1;\\n cnt += move(idx[0], idx[1], idx[2], t, t2[jdx[0]]);\\n cnt += move(idx[1], idx[0], idx[2], t, t2[jdx[1]]);\\n line_segment lseg(t[idx[2]], t2[jdx[2]]);\\n if(intersection(line(t[idx[0]], t[idx[1]]), lseg)) cnt = 1000;\\n if(t[idx[2]] != t2[jdx[2]]) cnt++;\\n chmin(ans, cnt);\\n }\\n {\\n int cnt = 0;\\n auto t = t1;\\n cnt += move(idx[0], idx[2], idx[1], t, t2[jdx[0]]);\\n cnt += move(idx[1], idx[0], idx[2], t, t2[jdx[1]]);\\n line_segment lseg(t[idx[2]], t2[jdx[2]]);\\n if(intersection(line(t[idx[0]], t[idx[1]]), lseg)) cnt = 1000;\\n if(t[idx[2]] != t2[jdx[2]]) cnt++;\\n chmin(ans, cnt);\\n }\\n } while(std::next_permutation(all(jdx)));\\n } while(std::next_permutation(all(idx)));\\n if(ans >= 5) {\\n std::cout << \\\"Many\\\\n\\\";\\n continue;\\n }\\n std::cout << ans << '\\\\n';\\n }\\n\\n}\\n\\n} // namespace ebi\\n\\nint main() {\\n std::cout << std::fixed << std::setprecision(15);\\n std::cin.tie(nullptr);\\n std::ios::sync_with_stdio(false);\\n int t = 1;\\n // std::cin >> t;\\n while (t--) {\\n ebi::main_();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3432,\n \"score_of_the_acc\": -0.7374,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1623_7111722\",\n \"code_snippet\": \"#include <cmath>\\n#include <string>\\n#include <vector>\\n#include <cassert>\\n#include <iostream>\\n#include <algorithm>\\nusing namespace std;\\n\\nint gcd(int x, int y) {\\n\\tif (y == 0) return x;\\n\\treturn gcd(y, x % y);\\n}\\n\\nclass fraction {\\npublic:\\n\\tint a, b;\\n\\tfraction() : a(0), b(1) {};\\n\\tfraction(int a_, int b_) {\\n\\t\\tassert(b_ != 0);\\n\\t\\tint g = gcd(abs(a_), abs(b_));\\n\\t\\ta = a_ / g;\\n\\t\\tb = b_ / g;\\n\\t\\tif (b < 0) {\\n\\t\\t\\ta *= -1;\\n\\t\\t\\tb *= -1;\\n\\t\\t}\\n\\t};\\n\\tbool operator==(const fraction& f) const {\\n\\t\\treturn a == f.a && b == f.b;\\n\\t}\\n\\tbool operator!=(const fraction& f) const {\\n\\t\\treturn a != f.a || b != f.b;\\n\\t}\\n\\tfraction operator+=(const fraction& f) {\\n\\t\\t(*this) = fraction(a * f.b + f.a * b, b * f.b);\\n\\t\\treturn (*this);\\n\\t}\\n\\tfraction operator-=(const fraction& f) {\\n\\t\\t(*this) = fraction(a * f.b - f.a * b, b * f.b);\\n\\t\\treturn (*this);\\n\\t}\\n\\tfraction operator*=(const fraction& f) {\\n\\t\\t(*this) = fraction(a * f.a, b * f.b);\\n\\t\\treturn (*this);\\n\\t}\\n\\tfraction operator/=(const fraction& f) {\\n\\t\\tassert(f.a != 0);\\n\\t\\t(*this) = fraction(a * f.b, b * f.a);\\n\\t\\treturn (*this);\\n\\t}\\n\\tfraction operator+(const fraction& f) const {\\n\\t\\treturn fraction(*this) += f;\\n\\t}\\n\\tfraction operator-(const fraction& f) const {\\n\\t\\treturn fraction(*this) -= f;\\n\\t}\\n\\tfraction operator*(const fraction& f) const {\\n\\t\\treturn fraction(*this) *= f;\\n\\t}\\n\\tfraction operator/(const fraction& f) const {\\n\\t\\treturn fraction(*this) /= f;\\n\\t}\\n\\tstring to_string() const {\\n\\t\\treturn std::to_string(a) + \\\"/\\\" + std::to_string(b);\\n\\t}\\n};\\n\\nclass point2d {\\npublic:\\n\\tfraction x, y;\\n\\tpoint2d() : x(fraction()), y(fraction()) {};\\n\\tpoint2d(const fraction& x_, const fraction& y_) : x(x_), y(y_) {};\\n\\tbool operator==(const point2d& p) const {\\n\\t\\treturn x == p.x && y == p.y;\\n\\t}\\n\\tbool operator!=(const point2d& p) const {\\n\\t\\treturn x != p.x || y != p.y;\\n\\t}\\n\\tpoint2d& operator+=(const point2d& p) {\\n\\t\\tx += p.x;\\n\\t\\ty += p.y;\\n\\t\\treturn (*this);\\n\\t}\\n\\tpoint2d& operator-=(const point2d& p) {\\n\\t\\tx -= p.x;\\n\\t\\ty -= p.y;\\n\\t\\treturn (*this);\\n\\t}\\n\\tpoint2d& operator*=(const fraction& f) {\\n\\t\\tx *= f;\\n\\t\\ty *= f;\\n\\t\\treturn (*this);\\n\\t}\\n\\tpoint2d& operator/=(const fraction& f) {\\n\\t\\tx /= f;\\n\\t\\ty /= f;\\n\\t\\treturn (*this);\\n\\t}\\n\\tpoint2d operator+(const point2d& p) const {\\n\\t\\treturn point2d(*this) += p;\\n\\t}\\n\\tpoint2d operator-(const point2d& p) const {\\n\\t\\treturn point2d(*this) -= p;\\n\\t}\\n\\tpoint2d operator*(const fraction& f) const {\\n\\t\\treturn point2d(*this) *= f;\\n\\t}\\n\\tpoint2d operator/(const fraction& f) const {\\n\\t\\treturn point2d(*this) /= f;\\n\\t}\\n\\tfraction dot(const point2d& p) const {\\n\\t\\treturn x * p.x + y * p.y;\\n\\t}\\n\\tfraction cross(const point2d& p) const {\\n\\t\\treturn x * p.y - y * p.x;\\n\\t}\\n};\\n\\nconst int INF = 1012345678;\\n\\n// find status of crossing of two lines [p1 + v1 * t and p2 + v2 * t]\\nint cross_status(const point2d& p1, const point2d& v1, const point2d& p2, const point2d& v2) {\\n\\tassert(!(v1.x == fraction(0, 1) && v1.y == fraction(0, 1)) && !(v2.x == fraction(0, 1) && v2.y == fraction(0, 1)));\\n\\tif (v1.cross(v2) != fraction(0, 1)) {\\n\\t\\treturn 100; // one cross point\\n\\t}\\n\\tif ((p2 - p1).cross(v1) != fraction(0, 1)) {\\n\\t\\treturn 101; // no cross point\\n\\t}\\n\\treturn 102; // cross line\\n}\\n\\n// find cross point of two lines [p1 + v1 * t and p2 + v2 * t]\\npoint2d cross_point(const point2d& p1, const point2d& v1, const point2d& p2, const point2d& v2) {\\n\\tassert(cross_status(p1, v1, p2, v2) == 100);\\n\\t// p1 + v1 * t1 = p2 + v2 * t2\\n\\t// ==> (-v1) * t1 + v2 * t2 = p1 - p2\\n\\t// ==> [ -v1, v2 ] * [ [ t1 ], [ t2 ] ] = p1 - p2\\n\\t// ==> [ [ t1 ], [ t2 ] ] = [ -v1, v2 ]^-1 * (p1 - p2) = 1/(-v1.x*v2.y+v1.y*v2.x) * [ [ v2.y, -v2.x ], [ v1.y, -v1.x ] ] * (p1 - p2)\\n\\tfraction detinv = fraction(1, 1) / (v1.y * v2.x - v1.x * v2.y);\\n\\tfraction t1 = detinv * (v2.y * (p1 - p2).x - v2.x * (p1 - p2).y);\\n\\treturn p1 + v1 * t1;\\n}\\n\\n// solve for 0->1->0 case\\nbool solve_010(const vector<point2d>& TA, const vector<point2d>& TB) {\\n\\tassert(TA[2] == TB[2]);\\n\\tint status = cross_status(TA[0], TA[2] - TA[1], TB[0], TB[2] - TB[1]);\\n\\tif (status == 100) {\\n\\t\\tpoint2d p = cross_point(TA[0], TA[2] - TA[1], TB[0], TB[2] - TB[1]);\\n\\t\\treturn ((TB[1] - TA[1]).cross(TA[2] - p) == fraction(0, 1));\\n\\t}\\n\\tif (status == 101) {\\n\\t\\treturn false;\\n\\t}\\n\\tif (status == 102) {\\n\\t\\treturn false;\\n\\t}\\n\\treturn false;\\n}\\n\\n// solve for specific case\\nint solve_target(const vector<point2d>& TA, const vector<point2d>& TB) {\\n\\t// step #1. check for 0->1->2\\n\\tbool flag1 = true;\\n\\tif ((TB[0] - TA[0]).cross(TA[2] - TA[1]) != fraction(0, 1)) flag1 = false;\\n\\tif ((TB[1] - TA[1]).cross(TA[2] - TB[0]) != fraction(0, 1)) flag1 = false;\\n\\tif ((TB[2] - TA[2]).cross(TB[1] - TB[0]) != fraction(0, 1)) flag1 = false;\\n\\tif (flag1 == true) {\\n\\t\\treturn 3;\\n\\t}\\n\\n\\t// step #2. check for 0->1->0->2\\n\\tif ((TB[2] - TA[2]).cross(TB[1] - TB[0]) == fraction(0, 1)) {\\n\\t\\tbool flag2 = solve_010(TA, vector<point2d>({ TB[0], TB[1], TA[2] }));\\n\\t\\tif (flag2 == true) {\\n\\t\\t\\treturn 4;\\n\\t\\t}\\n\\t}\\n\\n\\t// step #3. check for 2->0->1->0\\n\\tif ((TB[2] - TA[2]).cross(TA[1] - TA[0]) == fraction(0, 1)) {\\n\\t\\tbool flag3 = solve_010(vector<point2d>({ TA[0], TA[1], TB[2] }), TB);\\n\\t\\tif (flag3 == true) {\\n\\t\\t\\treturn 4;\\n\\t\\t}\\n\\t}\\n\\n\\t// step #4. check for 0->1->2->0\\n\\tint status = cross_status(TA[0], TA[2] - TA[1], TB[0], TB[2] - TB[1]);\\n\\tif (status == 100) {\\n\\t\\tpoint2d p = cross_point(TA[0], TA[2] - TA[1], TB[0], TB[2] - TB[1]);\\n\\t\\tbool flag4 = true;\\n\\t\\tif ((TB[1] - TA[1]).cross(TA[2] - p) != fraction(0, 1)) flag4 = false;\\n\\t\\tif ((TB[2] - TA[2]).cross(TB[1] - p) != fraction(0, 1)) flag4 = false;\\n\\t\\tif (flag4 == true) {\\n\\t\\t\\treturn 4;\\n\\t\\t}\\n\\t}\\n\\tif (status == 101) {\\n\\t\\t// NO CHANCE!\\n\\t}\\n\\tif (status == 102) {\\n\\t\\tfraction c1 = (TB[0] - TA[0]).cross(TA[1] - TA[0]);\\n\\t\\tfraction c2 = (TB[0] - TA[0]).cross(TB[1] - TB[0]);\\n\\t\\tfraction c3 = (TA[2] - TA[1]).cross(TB[1] - TA[1]);\\n\\t\\tif ((c1.a > 0) == (c2.a > 0) && c3.a != 0) {\\n\\t\\t\\treturn 4;\\n\\t\\t}\\n\\t}\\n\\n\\t// no chance\\n\\treturn INF;\\n}\\n\\n// solve for general case\\nint solve(const vector<point2d>& TA, const vector<point2d>& TB) {\\n\\tconst vector<vector<int> > perms = { { 0, 1, 2 }, { 0, 2, 1 }, { 1, 0, 2 }, { 1, 2, 0 }, { 2, 0, 1 }, { 2, 1, 0 } };\\n\\tint res = INF;\\n\\tfor (int i = 0; i < 6; i++) {\\n\\t\\tfor (int j = 0; j < 6; j++) {\\n\\t\\t\\tint subres = solve_target(vector<point2d>({ TA[perms[i][0]], TA[perms[i][1]], TA[perms[i][2]] }), vector<point2d>({ TB[perms[j][0]], TB[perms[j][1]], TB[perms[j][2]] }));\\n\\t\\t\\t// cout << i << ' ' << j << ' ' << subres << endl;\\n\\t\\t\\tres = min(res, subres);\\n\\t\\t}\\n\\t}\\n\\treturn res;\\n}\\n\\nint main() {\\n\\tint x, y;\\n\\twhile (cin >> x >> y) {\\n\\t\\tvector<point2d> TA(3), TB(3);\\n\\t\\tTA[0].x = fraction(x, 1);\\n\\t\\tTA[0].y = fraction(y, 1);\\n\\t\\tfor (int i = 1; i < 3; i++) {\\n\\t\\t\\tcin >> x >> y;\\n\\t\\t\\tTA[i].x = fraction(x, 1);\\n\\t\\t\\tTA[i].y = fraction(y, 1);\\n\\t\\t}\\n\\t\\tfor (int i = 0; i < 3; i++) {\\n\\t\\t\\tcin >> x >> y;\\n\\t\\t\\tTB[i].x = fraction(x, 1);\\n\\t\\t\\tTB[i].y = fraction(y, 1);\\n\\t\\t}\\n\\t\\tint res = solve(TA, TB);\\n\\t\\tif (res != INF) {\\n\\t\\t\\tcout << res << endl;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tcout << \\\"Many\\\" << endl;\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3348,\n \"score_of_the_acc\": -0.5401,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1623_6788750\",\n \"code_snippet\": \"#include <algorithm>\\n#include <bitset>\\n#include <cassert>\\n#include <chrono>\\n#include <climits>\\n#include <cmath>\\n#include <complex>\\n#include <cstddef>\\n#include <cstdint>\\n#include <cstdlib>\\n#include <cstring>\\n#include <functional>\\n#include <iomanip>\\n#include <iostream>\\n#include <limits>\\n#include <map>\\n#include <memory>\\n#include <numeric>\\n#include <optional>\\n#include <queue>\\n#include <random>\\n#include <set>\\n#include <stack>\\n#include <string>\\n#include <tuple>\\n#include <type_traits>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <utility>\\n#include <vector>\\n\\n/* macro */\\n\\n#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)\\n#define rrep(i, a, n) for (int i = ((int)(n - 1)); i >= (int)(a); i--)\\n#define Rep(i, a, n) for (i64 i = (i64)(a); i < (i64)(n); i++)\\n#define RRep(i, a, n) for (i64 i = ((i64)(n - i64(1))); i >= (i64)(a); i--)\\n#define all(v) (v).begin(), (v).end()\\n#define rall(v) (v).rbegin(), (v).rend()\\n#define Bit(n) (1LL << (n))\\n\\n/* macro end */\\n\\n/* template */\\n\\nnamespace ebi {\\n\\n#ifdef LOCAL\\n#define debug(...) \\\\\\n std::cerr << \\\"LINE: \\\" << __LINE__ << \\\" [\\\" << #__VA_ARGS__ << \\\"]:\\\", \\\\\\n debug_out(__VA_ARGS__)\\n#else\\n#define debug(...)\\n#endif\\n\\nvoid debug_out() { std::cerr << std::endl; }\\n\\ntemplate <typename Head, typename... Tail>\\nvoid debug_out(Head h, Tail... t) {\\n std::cerr << \\\" \\\" << h;\\n if (sizeof...(t) > 0) std::cout << \\\" :\\\";\\n debug_out(t...);\\n}\\n\\ntemplate <typename T1, typename T2>\\nstd::ostream &operator<<(std::ostream &os, const std::pair<T1, T2> &pa) {\\n return os << pa.first << \\\" \\\" << pa.second;\\n}\\n\\ntemplate <typename T1, typename T2>\\nstd::istream &operator>>(std::istream &os, std::pair<T1, T2> &pa) {\\n return os >> pa.first >> pa.second;\\n}\\n\\ntemplate <typename T>\\nstd::ostream &operator<<(std::ostream &os, const std::vector<T> &vec) {\\n for (std::size_t i = 0; i < vec.size(); i++)\\n os << vec[i] << (i + 1 == vec.size() ? \\\"\\\" : \\\" \\\");\\n return os;\\n}\\n\\ntemplate <typename T>\\nstd::istream &operator>>(std::istream &os, std::vector<T> &vec) {\\n for (T &e : vec) std::cin >> e;\\n return os;\\n}\\n\\ntemplate <typename T>\\nstd::ostream &operator<<(std::ostream &os, const std::optional<T> &opt) {\\n if (opt) {\\n os << opt.value();\\n } else {\\n os << \\\"invalid value\\\";\\n }\\n return os;\\n}\\n\\nusing std::size_t;\\nusing i32 = std::int32_t;\\nusing u32 = std::uint32_t;\\nusing i64 = std::int64_t;\\nusing u64 = std::uint64_t;\\n\\ntemplate <class T, T init>\\nauto make_vector(int n) {\\n return std::vector<T>(n, init);\\n}\\n\\ntemplate <class T, T init, typename Head, typename... Tail>\\nauto make_vector(Head n, Tail... ts) {\\n return std::vector(n, make_vector<T, init>(ts...));\\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\\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>\\nT pow(T x, i64 n) {\\n T res = 1;\\n while (n > 0) {\\n if (n & 1) res = res * x;\\n x = x * x;\\n n >>= 1;\\n }\\n return res;\\n}\\n\\ntemplate <class T>\\nT mod_pow(T x, i64 n, i64 mod) {\\n T res = 1;\\n while (n > 0) {\\n if (n & 1) res = (res * x) % mod;\\n x = (x * x) % mod;\\n n >>= 1;\\n }\\n return res;\\n}\\n\\ntemplate <class T>\\nT scan() {\\n T val;\\n std::cin >> val;\\n return val;\\n}\\n\\ntemplate <class T>\\nstruct Edge {\\n int to;\\n T cost;\\n Edge(int _to, T _cost = 1) : to(_to), cost(_cost) {}\\n};\\n\\ntemplate <class T>\\nstruct Graph : std::vector<std::vector<Edge<T>>> {\\n using std::vector<std::vector<Edge<T>>>::vector;\\n void add_edge(int u, int v, T w, bool directed = false) {\\n (*this)[u].emplace_back(v, w);\\n if (directed) return;\\n (*this)[v].emplace_back(u, w);\\n }\\n};\\n\\nstruct graph : std::vector<std::vector<int>> {\\n using std::vector<std::vector<int>>::vector;\\n void add_edge(int u, int v, bool directed = false) {\\n (*this)[u].emplace_back(v);\\n if (directed) return;\\n (*this)[v].emplace_back(u);\\n }\\n};\\n\\nconstexpr i64 LNF = std::numeric_limits<i64>::max() / 4;\\n\\nconstexpr int INF = std::numeric_limits<int>::max() / 2;\\n\\nconst std::vector<int> dy = {1, 0, -1, 0, 1, 1, -1, -1};\\nconst std::vector<int> dx = {0, 1, 0, -1, 1, -1, 1, -1};\\n\\n} // namespace ebi\\n\\nnamespace ebi {\\n\\nconstexpr long double EPS = 1e-7;\\n\\nconst long double PI = std::acos(-1);\\n\\nnamespace internal {\\n\\nint sgn(long double a) {\\n return (a<-EPS) ? -1 : (a>EPS) ? 1 : 0;\\n}\\n\\nlong double add(long double a, long double b) {\\n if(std::abs(a+b) < EPS*(std::abs(a) + std::abs(b))) return 0;\\n return a+b;\\n}\\n\\n} // namespace internal\\n\\n\\nlong double arg_to_radian(long double arg) {\\n return PI * arg / (long double)(180);\\n}\\n\\nstruct point {\\n long double x,y;\\n\\n point() = default;\\n\\n point(long double x, long double y) : x(x), y(y) { }\\n\\n point &operator+=(const point rhs) noexcept {\\n x = internal::add(x, rhs.x);\\n y = internal::add(y, rhs.y);\\n return *this;\\n }\\n\\n point &operator-=(const point rhs) noexcept {\\n x = internal::add(x, -rhs.x);\\n y = internal::add(y, -rhs.y);\\n return *this;\\n }\\n\\n point &operator*=(const point rhs) noexcept {\\n long double _x = internal::add(x*rhs.x, -y*rhs.y);\\n long double _y = internal::add(x*rhs.y, y*rhs.x);\\n x = _x;\\n y = _y;\\n return *this;\\n }\\n\\n point &operator*=(const long double k) noexcept {\\n x *= k;\\n y *= k;\\n return *this;\\n }\\n\\n point &operator/=(const long double k) {\\n assert(internal::sgn(k)!=0);\\n x /= k;\\n y /= k;\\n return *this;\\n }\\n\\n point operator+(const point &rhs) const noexcept {\\n return point(*this) += rhs;\\n }\\n\\n point operator-(const point &rhs) const noexcept {\\n return point(*this) -= rhs;\\n }\\n\\n point operator*(const point &rhs) const noexcept {\\n return point(*this) *= rhs;\\n }\\n\\n point operator*(const long double rhs) const noexcept {\\n return point(*this) *= rhs;\\n }\\n\\n point operator/(const long double rhs) const {\\n return point(*this) /= rhs;\\n }\\n\\n point operator-() const noexcept {\\n return point(0, 0) - *this;\\n }\\n\\n long double abs() const noexcept {\\n return std::sqrt(internal::add(x*x, y*y));\\n }\\n\\n long double dot(const point rhs) const noexcept {\\n return internal::add(x*rhs.x, y*rhs.y);\\n }\\n\\n long double det(const point rhs) const noexcept {\\n return internal::add(x*rhs.y, -y*rhs.x);\\n }\\n\\n // arctan(y/x) (単位はラジアン)\\n\\n long double arg() const {\\n return std::atan2(y, x);\\n }\\n\\n // x昇順, その後y昇順\\n\\n bool operator<(const point &rhs) const noexcept {\\n if(internal::sgn(x-rhs.x)) return internal::sgn(x-rhs.x)<0;\\n return internal::sgn(y-rhs.y)<0;\\n }\\n\\n bool operator==(const point &rhs) const noexcept {\\n if(internal::sgn(x - rhs.x) == 0 && internal::sgn(y - rhs.y) == 0) return true;\\n else return false;\\n }\\n\\n bool operator!=(const point &rhs) const noexcept {\\n return !(*this == rhs);\\n }\\n};\\n\\nstd::ostream& operator<<(std::ostream& os, const point &a) {\\n return os << a.x << \\\" \\\" << a.y;\\n}\\n\\nstd::istream& operator>>(std::istream& os, point &a) {\\n return os >> a.x >> a.y;\\n}\\n\\npoint conj(const point &a) {\\n return point(a.x, -a.y);\\n}\\n\\n// 点a をang(ラジアン)回転する\\n\\npoint rot(const point &a, long double ang) {\\n return point(std::cos(ang) * a.x - std::sin(ang) * a.y, std::sin(ang) * a.x + std::cos(ang) * a.y);\\n} \\n\\npoint rot90(const point &a) {\\n return point(-a.y, a.x);\\n}\\n\\nlong double dot(const point &a, const point &b) {\\n return a.dot(b);\\n}\\n\\nlong double det(const point &a, const point &b) {\\n return a.det(b);\\n}\\n\\nlong double abs(const point &a) {\\n return a.abs();\\n}\\n\\nlong double norm(const point &a) {\\n return internal::add(a.x*a.x, a.y*a.y);\\n}\\n\\nint isp(const point &a, const point &b, const point &c) {\\n int flag = internal::sgn(det(b-a,c-a));\\n if(flag == 0) {\\n if(internal::sgn(dot(b-a, c-a))<0) return -2;\\n if(internal::sgn(dot(a-b, c-b))<0) return +2;\\n }\\n return flag;\\n}\\n\\n// 分割統治で最近点対を求める O(N log N)\\n\\nlong double closest_pair(std::vector<point> p) {\\n std::sort(p.begin(), p.end());\\n int n = p.size();\\n auto f = [&](auto &&self, int l, int r) -> long double {\\n if(r-l == 1) {\\n return 1e9;\\n }\\n int mid = (l+r)/2;\\n long double x = p[mid].x;\\n long double d = std::min(self(self, l, mid), self(self, mid, r));\\n std::vector<point> b;\\n b.reserve(r-l);\\n int j = mid;\\n for(int i = l; i < mid; i++) {\\n while(j < r && p[j].y <= p[i].y) {\\n b.emplace_back(p[j++]);\\n }\\n b.emplace_back(p[i]);\\n }\\n while(j < r) {\\n b.emplace_back(p[j++]);\\n }\\n for(int i = 0; i < r-l; i++) {\\n p[l+i] = b[i];\\n }\\n b.clear();\\n for(int i = l; i < r; i++) {\\n if(std::abs(p[i].x - x) >= d) continue;\\n for(int j = int(b.size())-1; j >= 0; j--) {\\n if(p[i].y - b[j].y >= d) break;\\n d = std::min(d, abs(p[i]-b[j]));\\n }\\n b.emplace_back(p[i]);\\n }\\n return d;\\n };\\n return f(f, 0, n);\\n}\\n\\n// ∠ABCを求める(ラジアン)\\n\\nlong double angle(const point &A, const point &B, const point &C) {\\n long double a = (B - C).abs(), b = (C - A).abs(), c = (A - B).abs();\\n long double cos = internal::add(internal::add(a*a, c*c), -b*b)/(2.0*c*a);\\n return std::acos(cos);\\n}\\n\\nvoid arg_sort(std::vector<point> &a) {\\n int n = a.size();\\n std::vector ps(4, std::vector<point>());\\n auto idx = [](point v) -> int {\\n if(v.y >= 0) return (v.x >= 0) ? 0 : 1;\\n else return (v.x >= 0) ? 3 : 2;\\n };\\n for(auto p: a) {\\n assert(!(p.x == 0 && p.y == 0));\\n ps[idx(p)].emplace_back(p);\\n }\\n a.clear();\\n a.reserve(n);\\n for(int i = 0; i < 4; i++) {\\n std::sort(ps[i].begin(), ps[i].end(), \\n [](point &p1, point &p2) -> bool {\\n int flag = internal::sgn(internal::add(p1.x * p2.y, - p2.x * p1.y));\\n return flag == 0 ? (norm(p1) < norm(p2)) : flag > 0;\\n });\\n for(auto &p: ps[i]) a.emplace_back(p);\\n }\\n return;\\n}\\n\\ntemplate<class T>\\nvoid arg_sort_ll(std::vector<std::pair<T , T>> &a) {\\n using Point = std::pair<T, T>;\\n int n = a.size();\\n std::vector ps(4, std::vector<Point>());\\n auto idx = [](Point v) -> int {\\n if(v.second >= 0) return (v.first >= 0) ? 0 : 1;\\n else return (v.first >= 0) ? 3 : 2;\\n };\\n for(auto p: a) {\\n assert(!(p.first == 0 && p.second == 0));\\n ps[idx(p)].emplace_back(p);\\n }\\n a.clear();\\n a.reserve(n);\\n for(int i = 0; i < 4; i++) {\\n std::sort(ps[i].begin(), ps[i].end(), \\n [](Point &p1, Point &p2) -> bool { \\n T flag = p1.first * p2.second - p2.first * p1.second;\\n return flag == 0 ? (p1.first * p1.first + p1.second * p1.second < p2.first * p2.first + p2.second * p2.second) : flag > 0;\\n });\\n for(auto &p: ps[i]) a.emplace_back(p);\\n }\\n return;\\n}\\n\\n}\\n\\nnamespace ebi {\\n\\nstruct line {\\n point a,b;\\n\\n line(long double x1, long double y1, long double x2, long double y2) : a(x1, y1), b(x2, y2) { }\\n\\n line(const point &a, const point &b) : a(a), b(b) { }\\n\\n point proj(const point &p) const {\\n return a + (b-a)*(dot(b-a,p-a)/norm(b-a));\\n }\\n\\n point relf(const point &p) const {\\n return proj(p)*double(2) - p;\\n }\\n\\n long double distance(const point &c) const {\\n return std::abs(det(c - a, b - a)/abs(b-a));\\n }\\n};\\n\\nint intersection(const line &a, const line &b) {\\n if(internal::sgn(det(a.b-a.a, b.a-b.b)) != 0) {\\n if(internal::sgn(dot(a.b-a.a, b.b-b.a)) == 0) { // 垂直\\n return 1;\\n }\\n return 0; // 交差\\n }\\n else if(internal::sgn(det(a.b-a.a, b.a-a.a)) != 0) { // 平行\\n return 2;\\n }\\n else { // 同一直線\\n return 3;\\n }\\n}\\n\\npoint cross_point(const point &a, const point &b, const point &c, const point &d) {\\n return a + (b-a) * det(c - a, d - c) / det(b - a, d - c);\\n}\\n\\n// 交点があるか確認する！\\npoint cross_point(const line &s, const line &t) {\\n assert(intersection(s, t) < 2);\\n return s.a + (s.b - s.a) * det(t.a - s.a, t.b - t.a) / det(s.b - s.a, t.b - t.a);\\n}\\n\\n// 直線aと点cの距離\\nlong double distance(const line &a, const point &c) {\\n return std::abs(det(c-a.a, a.b - a.a)/abs(a.b-a.a));\\n}\\n\\nlong double distance(const line &a, const line &b) {\\n if(intersection(a, b) < 2) {\\n return 0;\\n }\\n else {\\n return distance(a, b.a);\\n }\\n}\\n\\n}\\n\\nnamespace ebi {\\n\\nstruct line_segment {\\n point a, b;\\n\\n line_segment() = default;\\n\\n line_segment(long double x1, long double y1, long double x2, long double y2) : a(x1, y1), b(x2, y2) { }\\n\\n line_segment(const point &a, const point &b) : a(a), b(b) { }\\n};\\n\\n// 線分ab, cd が交わるか判定\\nbool intersection_line_segment(const point &a, const point &b, const point &c, const point &d) {\\n if(internal::sgn(isp(a,b,c)*isp(a,b,d)) <= 0 && internal::sgn(isp(c,d,a)*isp(c,d,b)) <= 0) {\\n return true;\\n }\\n return false;\\n}\\n\\n// 線分ab, cd が交わるか判定\\nbool intersection(const line_segment &a, const line_segment &b) {\\n return intersection_line_segment(a.a, a.b, b.a, b.b);\\n}\\n\\nbool intersection(const line &a, const line_segment &b) {\\n if(internal::sgn(det(a.b - a.a, b.a - a.a)) * internal::sgn(det(a.b - a.a, b.b - a.a)) < 0) {\\n return true;\\n }\\n else {\\n return false;\\n }\\n}\\n\\npoint cross_point(const line_segment &s, const line_segment &t) {\\n assert(intersection(s, t));\\n return s.a + (s.b - s.a) * det(t.a - s.a, t.b - t.a) / det(s.b - s.a, t.b - t.a);\\n}\\n\\nlong double distance(const line_segment &a, const point &c) {\\n if(internal::sgn(dot(a.b - a.a, c - a.a)) < 0) {\\n return abs(c-a.a);\\n }\\n else if(internal::sgn(dot(a.a - a.b, c - a.b)) < 0) {\\n return abs(c-a.b);\\n }\\n else {\\n return std::abs(det(c - a.a, a.b - a.a)/abs(a.b-a.a));\\n }\\n}\\n\\nlong double distance(const line_segment &a, const line_segment &b) {\\n if(intersection(a, b)) {\\n return 0;\\n }\\n else {\\n return std::min(std::min(distance(a, b.a), distance(a, b.b)), std::min(distance(b, a.a), distance(b, a.b)));\\n }\\n}\\n\\nlong double distance(const line &a, const line_segment &b) {\\n if(intersection(a, b)) {\\n return 0;\\n }\\n else {\\n return std::min(distance(a, b.a), distance(a, b.b));\\n }\\n}\\n\\n}\\n\\nnamespace ebi {\\n\\nvoid main_() {\\n long double x;\\n while (std::cin >> x) {\\n long double y;\\n std::vector<point> t1(3), t2(3);\\n std::cin >> y;\\n t1[0] = {x, y};\\n std::cin >> t1[1] >> t1[2] >> t2;\\n std::vector<int> idx(3), jdx(3);\\n std::iota(all(idx), 0);\\n std::iota(all(jdx), 0);\\n int ans = INF;\\n\\n auto move = [&](int i, int j, int k, std::vector<point> &t, point target) -> int {\\n if(t[i] == target) return 0;\\n int cnt = 0;\\n line l1(t[j], t[j] + target - t[i]);\\n line l2(t[k], t[k] + t[i] - t[j]);\\n if(intersection(l1, l2) >= 2) return 1000;\\n point p = cross_point(l1, l2);\\n if(p != t[k]) cnt++;\\n t[k] = p;\\n t[i] = target;\\n cnt++;\\n return cnt;\\n };\\n do {\\n do {\\n {\\n int cnt = 0;\\n auto t = t1;\\n cnt += move(idx[0], idx[1], idx[2], t, t2[jdx[0]]);\\n cnt += move(idx[1], idx[0], idx[2], t, t2[jdx[1]]);\\n line_segment lseg(t[idx[2]], t2[jdx[2]]);\\n if(intersection(line(t[idx[0]], t[idx[1]]), lseg)) cnt = 1000;\\n if(t[idx[2]] != t2[jdx[2]]) cnt++;\\n chmin(ans, cnt);\\n }\\n {\\n int cnt = 0;\\n auto t = t1;\\n cnt += move(idx[0], idx[2], idx[1], t, t2[jdx[0]]);\\n cnt += move(idx[1], idx[0], idx[2], t, t2[jdx[1]]);\\n line_segment lseg(t[idx[2]], t2[jdx[2]]);\\n if(intersection(line(t[idx[0]], t[idx[1]]), lseg)) cnt = 1000;\\n if(t[idx[2]] != t2[jdx[2]]) cnt++;\\n chmin(ans, cnt);\\n }\\n } while(std::next_permutation(all(jdx)));\\n } while(std::next_permutation(all(idx)));\\n if(ans >= 5) {\\n std::cout << \\\"Many\\\\n\\\";\\n continue;\\n }\\n std::cout << ans << '\\\\n';\\n }\\n\\n}\\n\\n} // namespace ebi\\n\\nint main() {\\n std::cout << std::fixed << std::setprecision(15);\\n std::cin.tie(nullptr);\\n std::ios::sync_with_stdio(false);\\n int t = 1;\\n // std::cin >> t;\\n while (t--) {\\n ebi::main_();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3492,\n \"score_of_the_acc\": -0.8803,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1623_6681940\",\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<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;\\n}\\n\\nconst double eps=1e-8;\\n\\nstruct point{\\n double x,y;\\n point() {}\\n point(double x,double y): x(x), y(y) {}\\n point& operator-=(const point &p){\\n x -= p.x; y -= p.y;\\n return *this;\\n }\\n point& operator+=(const point &p){\\n x += p.x; y += p.y;\\n return *this;\\n }\\n point& operator*=(double d){\\n x *= d; y *= d;\\n return *this;\\n }\\n point& operator/=(double d){\\n x /= d; y /= d;\\n return *this;\\n }\\n const point operator+ (const point& p) const;\\n const point operator- (const point& p) const;\\n const point operator* (double d) const;\\n const point operator/ (double d) const;\\n const bool operator == (const point& p) const;\\n};\\nconst point point::operator+ (const point& p) const{\\n point res(*this); return res += p;\\n}\\nconst point point::operator- (const point& p) const{\\n point res(*this); return res -= p;\\n}\\nconst point point::operator* (double d) const{\\n point res(*this); return res *= d;\\n}\\nconst point point::operator/ (double d) const{\\n point res(*this); return res /= d;\\n}\\nconst bool point::operator == (const point& p) const{\\n point pp(*this);\\n return (p.x == pp.x and p.y == pp.y);\\n}\\nstruct line{\\n point A,B;\\n line() {}\\n line(point A, point B): A(A), B(B) {}\\n};\\n\\n// BOJ-6487\\n// 平行判定\\nbool is_parallel(line l1, line l2){\\n double dx1 = l1.B.x - l1.A.x;\\n double dy1 = l1.B.y - l1.A.y;\\n double dx2 = l2.B.x - l2.A.x;\\n double dy2 = l2.B.y - l2.A.y;\\n return abs(dy1*dx2 - dy2*dx1) < eps;\\n}\\n\\npoint vec(line L){\\n return (L.B - L.A);\\n}\\ndouble cross(point a,point b){\\n return a.x*b.y-a.y*b.x;\\n}\\n// AOJ 2596\\n// 直線の交点\\npoint line_intersection(line l1, line l2){\\n return l1.A + vec(l1) * cross(l2.A - l1.A, vec(l2)) / cross(vec(l1), vec(l2));\\n}\\n\\nint main(){\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n array<point, 3> P,Q;\\n while(cin >> P[0].x >> P[0].y >> P[1].x >> P[1].y >> P[2].x >> P[2].y){\\n cin >> Q[0].x >> Q[0].y >> Q[1].x >> Q[1].y >> Q[2].x >> Q[2].y;\\n int res = 5;\\n auto dfs=[&](auto dfs,array<point,3> s,int cnt)->void{\\n\\n auto check=[&]()->int{\\n vector<int> p={0,1,2};\\n int mx = 0;\\n do{\\n int cnt = 0;\\n for(int i=0;i<3;i++){\\n if(s[p[i]] == Q[i])cnt++;\\n }\\n mx = max(mx, cnt);\\n }while(next_permutation(p.begin(), p.end()));\\n return mx;\\n };\\n\\n int u = check();\\n // 揃った\\n if(u == 3){\\n res = min(res, cnt); return;\\n }\\n // 枝刈り\\n if(cnt+3-u >= res) return;\\n\\n // s[i]をQ[j]に揃えたい\\n for(int i=0;i<3;i++){\\n for(int j=0;j<3;j++){\\n if(s[i] == Q[j])continue;\\n\\n // 直接揃えられる\\n {\\n line L1 = {s[i], Q[j]};\\n line L2;\\n if(i == 0) L2 = {s[1], s[2]};\\n else if(i == 1) L2 = {s[0], s[2]};\\n else L2 = {s[0], s[1]};\\n\\n if(is_parallel(L1, L2)){\\n auto p = s[i];\\n s[i] = Q[j];\\n dfs(dfs,s,cnt+1);\\n s[i] = p;\\n }\\n }\\n // 1点経由\\n if(3-u+1 < res){\\n int k1 = -1, k2 = -1;\\n for(int k=0;k<3;k++){\\n if(i == k)continue;\\n if(k1 == -1) k1 = k;\\n else k2 = k;\\n }\\n // k2をずらす\\n {\\n line L1 = {s[k1], Q[j]-s[i]+s[k1]};\\n line L2 = {s[k2], s[i]-s[k1]+s[k2]};\\n auto p = line_intersection(L1, L2);\\n auto pp = s[k2];\\n s[k2] = p;\\n dfs(dfs,s,cnt+1);\\n s[k2] = pp;\\n }\\n swap(k1,k2);\\n // k1をずらす\\n {\\n line L1 = {s[k1], Q[j]-s[i]+s[k1]};\\n line L2 = {s[k2], s[i]-s[k1]+s[k2]};\\n auto p = line_intersection(L1, L2);\\n auto pp = s[k2];\\n s[k2] = p;\\n dfs(dfs,s,cnt+1);\\n s[k2] = pp;\\n } \\n }\\n }\\n }\\n\\n };\\n dfs(dfs,P,0);\\n if(res >= 5){\\n cout << \\\"Many\\\" << \\\"\\\\n\\\";\\n }\\n else{\\n cout << res << \\\"\\\\n\\\";\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3484,\n \"score_of_the_acc\": -0.8599,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1623_6598121\",\n \"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 <typename T> bool chmax(T& a, const T& b) { return a < b ? (a = b, 1) : 0; }\\ntemplate <typename T> bool chmin(T& a, const T& b) { return a > b ? (a = b, 1) : 0; }\\n\\nusing T = double;\\nusing Vec = std::complex<T>;\\n\\nconst T PI = std::acos(-1);\\n\\nconstexpr T eps = 1e-8;\\ninline bool eq(T a, T b) { return std::abs(a - b) < eps; }\\ninline bool eq(Vec a, Vec b) { return std::abs(a - b) < eps; }\\ninline bool lt(T a, T b) { return a < b - eps; }\\ninline bool leq(T a, T b) { return a < b + eps; }\\n\\nstd::istream& operator>>(std::istream& is, Vec& p) {\\n T x, y;\\n is >> x >> y;\\n p = {x, y};\\n return is;\\n}\\n\\nstruct Line {\\n Vec p1, p2;\\n Line() = default;\\n Line(const Vec& p1, const Vec& p2) : p1(p1), p2(p2) {}\\n Vec dir() const { return p2 - p1; }\\n};\\n\\nstruct Segment {\\n Vec p1, p2;\\n Segment() = default;\\n Segment(const Vec& p1, const Vec& p2) : p1(p1), p2(p2) {}\\n Vec dir() const { return p2 - p1; }\\n};\\n\\nstruct Circle {\\n Vec c;\\n T r;\\n Circle() = default;\\n Circle(const Vec& c, T r) : c(c), r(r) {}\\n};\\n\\nusing Polygon = std::vector<Vec>;\\n\\nT dot(const Vec& a, const Vec& b) {\\n return (std::conj(a) * b).real();\\n}\\n\\nT cross(const Vec& a, const Vec& b) {\\n return (std::conj(a) * b).imag();\\n}\\n\\nVec rot(const Vec& a, T ang) {\\n return a * Vec(std::cos(ang), std::sin(ang));\\n}\\n\\nVec perp(const Vec& a) {\\n return Vec(-a.imag(), a.real());\\n}\\n\\nVec projection(const Line& l, const Vec& p) {\\n return l.p1 + dot(p - l.p1, l.dir()) * l.dir() / std::norm(l.dir());\\n}\\n\\nVec reflection(const Line& l, const Vec& p) {\\n return T(2) * projection(l, p) - p;\\n}\\n\\n// 0: collinear\\n// 1: counter-clockwise\\n// 2: clockwise\\nint ccw(const Vec& a, const Vec& b, const Vec& c) {\\n if (eq(cross(b - a, c - a), 0)) return 0;\\n if (lt(cross(b - a, c - a), 0)) return -1;\\n return 1;\\n}\\n\\nvoid sort_by_arg(std::vector<Vec>& pts) {\\n std::sort(pts.begin(), pts.end(), [&](auto& p, auto& q) {\\n if ((p.imag() < 0) != (q.imag() < 0)) return (p.imag() < 0);\\n if (cross(p, q) == 0) {\\n if (p == Vec(0, 0)) return !(q.imag() < 0 || (q.imag() == 0 && q.real() > 0));\\n if (q == Vec(0, 0)) return (p.imag() < 0 || (p.imag() == 0 && p.real() > 0));\\n return (p.real() > q.real());\\n }\\n return (cross(p, q) > 0);\\n });\\n}\\n\\nVec intersection(const Line& l, const Line& m) {\\n Vec r = m.p1 - l.p1;\\n assert(!eq(cross(l.dir(), m.dir()), 0)); // not parallel\\n return l.p1 + cross(m.dir(), r) / cross(m.dir(), l.dir()) * l.dir();\\n}\\n\\ntemplate <typename T>\\nostream& operator<<(ostream& os, const vector<T>& v) {\\n for (int i = 0; i < (int) v.size(); ++i) os << v[i] << \\\" \\\";\\n return os;\\n}\\n\\nint main() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n\\n auto check2 = [&](vector<Vec> a, vector<Vec> b) {\\n if (!eq(a[0], b[0])) {\\n return false;\\n }\\n Line l(b[1], b[1]+b[2]-b[0]);\\n if (!eq(cross(l.p1 - a[1], l.p2 - a[1]), 0)) return false;\\n b[1] = a[1];\\n return ccw(a[0], a[1], a[2]) == ccw(b[0], b[1], b[2]);\\n };\\n\\n auto check3 = [&](vector<Vec> a, vector<Vec> b) {\\n if (eq(a[0], b[0])) {\\n Line m(b[0], b[0]+b[1]-a[1]);\\n Line n(b[2], b[2]+b[1]-b[0]);\\n if (!eq(cross(m.dir(), n.dir()), 0)) {\\n auto p = intersection(m, n);\\n b[2] = p;\\n return check2(a, b);\\n }\\n return false;\\n } else {\\n Line l(b[0], b[0]+b[2]-b[1]);\\n if (!eq(cross(l.p1 - a[0], l.p2 - a[0]), 0)) return false;\\n b[0] = a[0];\\n return check2(a, b);\\n }\\n };\\n\\n auto check4 = [&](vector<Vec> a, vector<Vec> b) {\\n Line l(b[0], b[0]+b[2]-b[1]);\\n if (eq(cross(l.p1 - a[0], l.p2 - a[0]), 0)) {\\n auto tmp = b[0];\\n b[0] = a[0];\\n if (check3(a, b)) return true;\\n b[0] = tmp;\\n }\\n // move b[2]\\n {\\n Line m(b[1], b[1]+b[0]-a[0]);\\n Line n(b[2], b[2]+b[1]-b[0]);\\n if (!eq(cross(m.dir(), n.dir()), 0)) {\\n auto p = intersection(m, n);\\n auto tmp = b[2];\\n b[2] = p;\\n if (check3(a, b)) return true;\\n b[2] = tmp;\\n }\\n }\\n // move b[1]\\n {\\n Line m(b[2], b[2]+b[0]-a[0]);\\n Line n(b[1], b[1]+b[2]-b[0]);\\n if (!eq(cross(m.dir(), n.dir()), 0)) {\\n auto p = intersection(m, n);\\n auto tmp = b[1];\\n b[1] = p;\\n if (check3(a, b)) return true;\\n b[1] = tmp;\\n }\\n }\\n return false;\\n };\\n\\n while (true) {\\n vector<Vec> a(3), b(3);\\n for (auto& x : a) cin >> x;\\n for (auto& x : b) cin >> x;\\n swap(a, b);\\n vector<int> perm1 = {0, 1, 2};\\n int ans = 5;\\n do {\\n vector<Vec> aa(3);\\n rep(i,0,3) aa[i] = a[perm1[i]];\\n vector<int> perm2 = {0, 1, 2};\\n do {\\n vector<Vec> bb(3);\\n rep(i,0,3) bb[i] = b[perm2[i]];\\n\\n if (check3(aa, bb)) {\\n chmin(ans, 3);\\n } else if (check4(aa, bb)) {\\n chmin(ans, 4);\\n }\\n } while (next_permutation(all(perm2)));\\n } while (next_permutation(all(perm1)));\\n if (ans < 5) cout << ans;\\n else cout << \\\"Many\\\";\\n cout << \\\"\\\\n\\\";\\n string s;\\n getline(cin, s);\\n if (!getline(cin, s)) break;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3544,\n \"score_of_the_acc\": -1.0014,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1623_6030341\",\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\\nusing namespace std;\\n\\n//constexpr long long int MOD = 1000000007;\\nconstexpr long long int MOD = 998244353;\\nconstexpr long double EPS = 1e-7;\\n\\n//int N, M, K, T, H, W, L, R;\\nlong long int N, M, K, T, H, W, L, R;\\n\\nvector<long double>Sx;\\nvector<long double>Sy;\\n\\nstruct Point {\\n\\tlong double x;\\n\\tlong double y;\\n\\tPoint(long double xx, long double yy) {\\n\\t\\tx = xx, y = yy;\\n\\t}\\n\\tPoint() {\\n\\n\\t}\\n\\tvoid Input() {\\n\\t\\tcin >> x >> y;\\n\\t}\\n\\tPoint operator + (const Point& c)const {\\n\\t\\tPoint box;\\n\\t\\tbox.x = x + c.x;\\n\\t\\tbox.y = y + c.y;\\n\\t\\treturn box;\\n\\t}\\n\\tPoint operator - (const Point& c)const {\\n\\t\\tPoint box;\\n\\t\\tbox.x = x - c.x;\\n\\t\\tbox.y = y - c.y;\\n\\t\\treturn box;\\n\\t}\\n\\tPoint operator * (const long double& b)const {\\n\\t\\tPoint box;\\n\\t\\tbox.x = x * b;\\n\\t\\tbox.y = y * b;\\n\\t\\treturn box;\\n\\t}\\n\\tbool operator <(const Point& c)const {\\n\\t\\tif (y < c.y)return true;\\n\\t\\tif (y > c.y)return false;\\n\\t\\tif (x < c.x)return true;\\n\\t\\treturn false;\\n\\t}\\n\\tbool operator >(const Point& c)const {\\n\\t\\tif (y > c.y)return true;\\n\\t\\tif (y < c.y)return false;\\n\\t\\tif (x > c.x)return true;\\n\\t\\treturn false;\\n\\t}\\n\\tbool operator ==(const Point& c)const {\\n\\t\\treturn abs(x - c.x) <= EPS && abs(y - c.y) <= EPS;\\n\\t}\\n\\tlong double det(Point a) {\\n\\t\\treturn x * a.y - y * a.x;\\n\\t}\\n};\\n\\nstruct Line {\\n\\tlong double a, b, c;\\n\\tLine(const int aa, const int bb, const int cc) {\\n\\t\\ta = aa, b = bb, c = cc;\\n\\t}\\n\\tLine(const Point s, const Point t) {\\n\\t\\tif (abs(s.x - t.x) < EPS) {\\n\\t\\t\\ta = 1;\\n\\t\\t\\tb = 0;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tb = 1;\\n\\t\\t\\ta = (t.y - s.y) / (s.x - t.x);\\n\\t\\t}\\n\\t\\tc = s.x * a + s.y * b;\\n\\t}\\n};\\n\\nlong double dot(Point a, Point b) {\\n\\treturn a.x * b.x + a.y * b.y;\\n}\\n\\nlong double cross(Point a, Point b) {\\n\\treturn a.x * b.y - b.x * a.y;\\n}\\n\\nlong double Distance(Point a, Point b) {\\n\\treturn sqrtl((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y));\\n}\\n\\nlong double Distance(Point a, pair<Point, Point>b) {\\n\\tLine l = Line(b.first, b.second);\\n\\tif (abs(l.a * a.x + l.b * a.y - l.c) < EPS) {\\n\\t\\tif (abs(Distance(a, b.first) + Distance(a, b.second) - Distance(b.second, b.first)) <= sqrtl(EPS))return 0;\\n\\t\\treturn min(Distance(a, b.first), Distance(a, b.second));\\n\\t}\\n\\tlong double A = powl((b.first.x - b.second.x), 2) + powl((b.first.y - b.second.y), 2);\\n\\tlong double B = 2 * (a.x - b.first.x) * (b.first.x - b.second.x) + 2 * (a.y - b.first.y) * (b.first.y - b.second.y);\\n\\tlong double r = B / 2 / A;\\n\\tr = -r;\\n\\tif (r >= 0 && r <= 1) {\\n\\t\\treturn Distance(a, Point(b.first.x + r * (b.second.x - b.first.x), b.first.y + r * (b.second.y - b.first.y)));\\n\\t}\\n\\telse {\\n\\t\\treturn min(Distance(a, b.first), Distance(a, b.second));\\n\\t}\\n}\\n\\nbool LineCross(Point a1, Point a2, Point b1, Point b2) {\\n\\treturn cross(a2 - a1, b1 - a1) * cross(a2 - a1, b2 - a1) < EPS && cross(b2 - b1, a1 - b1) * cross(b2 - b1, a2 - b1) < EPS && !(abs((a1 - a2).x * (a1 - b1).y - (a1 - a2).y * (a1 - b1).x) < EPS && abs((a1 - a2).x * (a1 - b2).y - (a1 - a2).y * (a1 - b2).x) < EPS && abs(Distance(a1, a2) - Distance(a1, b1) - Distance(a2, b1)) > EPS && abs(Distance(a1, a2) - Distance(a2, b2) - Distance(a1, b2)) > EPS && abs(Distance(b1, b2) - Distance(a1, b1) - Distance(a1, b2)) > EPS && abs(Distance(b1, b2) - Distance(a2, b1) - Distance(a2, b2)) > EPS);\\n}\\n\\nlong double Distance(pair<Point, Point>a, pair<Point, Point>b) {\\n\\tif (LineCross(a.first, a.second, b.first, b.second))return 0;\\n\\treturn min({ Distance(a.first,b),Distance(a.second,b),Distance(b.first,a),Distance(b.second,a) });\\n}\\n\\nPoint LineCross(Line a, Line b) {\\n\\tPoint ret;\\n\\tret.x = (a.c * b.b - a.b * b.c) / (a.a * b.b - a.b * b.a);\\n\\tret.y = -(a.c * b.a - a.a * b.c) / (a.a * b.b - a.b * b.a);\\n\\treturn ret;\\n}\\n\\nlong double TriangleArea(Point a, Point b, Point c) {\\n\\tlong double A, B, C;\\n\\tA = Distance(a, b);\\n\\tB = Distance(a, c);\\n\\tC = Distance(b, c);\\n\\tlong double S = (A + B + C) / 2;\\n\\treturn sqrtl(S * (S - A) * (S - B) * (S - C));\\n}\\n\\nvoid func(vector<Point>s, vector<Point>g, vector<int>oks, vector<int>okg, int& ans, int step = 0) {\\n\\tif (step >= 5)return;\\n\\t//cout << endl;\\n\\t//for (auto i : s)cout << i.x << \\\" \\\" << i.y << endl;\\n\\t//for (auto i : g)cout << i.x << \\\" \\\" << i.y << endl;\\n\\t//cout << step << \\\" \\\" << oks[0] << \\\" \\\" << oks[1] << \\\" \\\" << oks[2] << endl;\\n\\tif (oks[0] && oks[1] && oks[2]) {\\n\\t\\tans = min(ans, step);\\n\\t\\treturn;\\n\\t}\\n\\tauto ns = s;\\n\\tfor (int i = 0; i < 3; i++) {\\n\\t\\tif (oks[i])continue;\\n\\t\\tfor (int j = 0; j < 3; j++) {\\n\\t\\t\\tif (okg[j])continue;\\n\\t\\t\\tfor (int k = 0; k < 3; k++) {\\n\\t\\t\\t\\ts = ns;\\n\\t\\t\\t\\tif (i == k)continue;\\n\\t\\t\\t\\tLine a(s[k], s[k] + s[i] - s[3 - i - k]);\\n\\t\\t\\t\\tLine b(s[3 - i - k], g[j] - s[i] + s[3 - i - k]);\\n\\t\\t\\t\\t//\\tcout << a.a << \\\" \\\" << a.b << \\\" \\\" << b.a << \\\" \\\" << b.b << endl;\\n\\t\\t\\t\\tauto p = LineCross(a, b);\\n\\t\\t\\t\\tif (isinf(p.x) || isinf(p.y))continue;\\n\\t\\t\\t\\tif (isnan(p.x) || isnan(p.y))continue;\\n\\t\\t\\t\\toks[i] = 1;\\n\\t\\t\\t\\tokg[j] = 1;\\n\\t\\t\\t\\tint add = 1;\\n\\t\\t\\t\\tif (Distance(s[k], p) <= EPS) {\\n\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\telse {\\n\\t\\t\\t\\t\\ts[k] = p;\\n\\t\\t\\t\\t\\tadd++;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\ts[i] = g[j];\\n\\t\\t\\t\\tif (add == 1 || !oks[k])func(s, g, oks, okg, ans, step + add);\\n\\t\\t\\t\\toks[i] = 0;\\n\\t\\t\\t\\tokg[j] = 0;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\n\\nvoid Solve() {\\n\\tvector<long double>Gx(3);\\n\\tvector<long double>Gy(3);\\n\\tfor (int i = 0; i < 3; i++) {\\n\\t\\tcin >> Gx[i] >> Gy[i];\\n\\t}\\n\\tint ans = 100;\\n\\tvector<int>oks(3);\\n\\tvector<int>okg(3);\\n\\tvector<Point>S;\\n\\tvector<Point>G;\\n\\tfor(int i=0;i<3;i++){\\n\\t\\tS.push_back(Point(Sx[i], Sy[i]));\\n\\t\\tG.push_back(Point(Gx[i], Gy[i]));\\n\\t}\\n\\tfunc(S, G, oks, okg, ans);\\n\\tif (ans >= 5)cout << \\\"Many\\\\n\\\";\\n\\telse cout << ans << endl;\\n}\\n\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\n\\tSx.resize(3);\\n\\tSy.resize(3);\\n\\twhile (cin >> Sx[0] >> Sy[0]) {\\n\\t\\tfor (int i = 1; i < 3; i++) {\\n\\t\\t\\tcin >> Sx[i] >> Sy[i];\\n\\t\\t}\\n\\t\\tSolve();\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3476,\n \"score_of_the_acc\": -0.8422,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1623_6014736\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\n// arg(x) : argment,[-PI,PI]\\nusing CP = complex<long double>;\\n#define X real()\\n#define Y imag()\\nconst long double PI = acos(-1.0L);\\nconst long double EPS = 1e-7;\\nbool operator==(const CP &l, const CP &r) { return norm(l - r) <= EPS; }\\nstruct Circle {\\n CP o;\\n long double r;\\n Circle(long double _x = 0.0L, long double _y = 0.0L, long double _r = 0.0L)\\n : o(CP(_x, _y)), r(_r) {}\\n Circle(CP _o, long double _r = 0.0) : o(_o), r(_r) {}\\n bool operator<(const Circle &cr) const { return r < cr.r; }\\n};\\n\\nstruct Line {\\n CP s, t;\\n Line(long double sx = 0.0L, long double sy = 0.0L, long double tx = 0.0L,\\n long double ty = 0.0L)\\n : s(CP(sx, sy)), t(CP(tx, ty)) {}\\n Line(CP _s, CP _t) : s(_s), t(_t) {}\\n};\\n\\n// cos a\\nlong double costh(const long double &a, const long double &b,\\n const long double &c) {\\n return (b * b - a * a + c * c) / (2.0L * b * c);\\n}\\n\\n// dot(a,b) = |a||b|cos x\\nlong double dot(const CP &a, const CP &b) { return (conj(a) * b).X; }\\n// cross(a,b) : area of parallelogram\\n// sign : a-> b ,counter clockwise? + : -\\nlong double cross(const CP &a, const CP &b) { return (conj(a) * b).Y; }\\nlong double corner(const CP &a, const CP &b) {\\n //[0,PI]\\n return acos(dot(a, b) / (abs(a) * abs(b)));\\n}\\n\\nCP projectionLP(const CP &s, const CP &t, const CP &p) {\\n if (s == t) return s;\\n CP base = t - s;\\n long double r = dot(p - s, base) / norm(base);\\n return s + base * r;\\n}\\nCP projectionLP(const Line &l, const CP &p) {\\n return projectionLP(l.s, l.t, p);\\n}\\n\\nCP reflectionLP(const CP &s, const CP &t, const CP &p) {\\n CP tmp = (projectionLP(s, t, p) - p);\\n tmp *= 2;\\n return p + tmp;\\n}\\nCP reflectionLP(const Line &l, const CP &p) {\\n return reflectionLP(l.s, l.t, p);\\n}\\n\\nint calc_clockwiseSP(const CP &s, CP t, CP p) {\\n t -= s, p -= s;\\n if (cross(t, p) > EPS) return 1; // \\\"COUNTER_CLOCKWISE\\\"\\n if (cross(t, p) < -EPS) return -1; //\\\"CLOCK_WISE\\\"\\n if (dot(t, p) < 0) return 2; // \\\"ONLINE_BACK\\\"\\n if (norm(t) < norm(p)) return -2; // \\\"ONLINE_FRONT\\\"\\n return 0; // \\\"ON_SEGMENT\\\"\\n}\\nint calc_clockwiseSP(const Line &l, const CP &p) {\\n return calc_clockwiseSP(l.s, l.t, p);\\n}\\n\\nint parallel_orthogonalLL(const CP &s, CP t, const CP &a, CP b) {\\n t -= s;\\n b -= a;\\n if (abs(cross(t, b)) <= EPS) return 2; // \\\"parallel\\\"\\n if (abs(dot(t, b)) <= EPS) return 1; // \\\"orthogonal\\\"\\n return 0;\\n}\\nint parallel_orthogonalLL(const Line &ll, const Line &lr) {\\n return parallel_orthogonalLL(ll.s, ll.t, lr.s, lr.t);\\n}\\n\\nCP intersectionLL(const CP &a, const CP &b, const CP &c, const CP &d) {\\n return a + (b - a) * (cross(d - c, d - a) / cross(d - c, b - a));\\n}\\nCP intersectionLL(const Line &ll, const Line &lr) {\\n return intersectionLL(ll.s, ll.t, lr.s, lr.t);\\n}\\n\\nbool on_segSP(const CP &s, const CP &t, const CP &p) {\\n // if not use end point, dot(s - p, t - p) < 0\\n return abs(cross(s - p, t - p)) <= EPS && dot(s - p, t - p) <= 0;\\n}\\nbool on_segSP(const Line &l, const CP &p) { return on_segSP(l.s, l.t, p); }\\n\\n// crossing segments? (a,b) and (c,d)\\nbool iscrossSS(const CP &a, const CP &b, const CP &c, const CP &d) {\\n // parallel\\n return calc_clockwiseSP(a, b, c) * calc_clockwiseSP(a, b, d) <= 0 &&\\n calc_clockwiseSP(c, d, a) * calc_clockwiseSP(c, d, b) <= 0;\\n // if (abs(cross(a - b, c - d)) <= EPS) {\\n // return on_segSP(a, b, c) || on_segSP(a, b, d) || on_segSP(c, d, a) ||\\n // on_segSP(c, d, b);\\n // }\\n // CP isp = intersectionLL(a, b, c, d);\\n // return on_segSP(a, b, isp) && on_segSP(c, d, isp);\\n}\\n\\nbool iscrossSS(const Line &ll, const Line &lr) {\\n return iscrossSS(ll.s, ll.t, lr.s, lr.t);\\n}\\n\\nlong double distLP(const CP &s, const CP &t, const CP &p) {\\n return abs(cross(t - s, p - s) / abs(t - s));\\n}\\nlong double distLP(const Line &l, const CP &p) { return distLP(l.s, l.t, p); }\\n\\nlong double distSP(const CP &s, const CP &t, const CP &p) {\\n if (dot(t - s, p - s) < 0) return abs(p - s);\\n if (dot(s - t, p - t) < 0) return abs(p - t);\\n return distLP(s, t, p);\\n}\\nlong double distSP(const Line &l, const CP &p) { return distSP(l.s, l.t, p); }\\n\\nlong double distSS(const CP &a, const CP &b, const CP &c, const CP &d) {\\n long double res = 1e18;\\n if (iscrossSS(a, b, c, d)) return 0.0L;\\n res = min(res, distSP(a, b, c));\\n res = min(res, distSP(a, b, d));\\n res = min(res, distSP(c, d, a));\\n res = min(res, distSP(c, d, b));\\n return res;\\n}\\nlong double distSS(const Line &ll, const Line &lr) {\\n return distSS(ll.s, ll.t, lr.s, lr.t);\\n}\\n\\n// counter clockwise\\nbool is_convex(const vector<CP> &pol) {\\n int n = pol.size();\\n for (int i = 0; i < n; ++i)\\n if (cross(pol[(i + 1) % n] - pol[i], pol[(i + 2) % n] - pol[(i + 1) % n]) <\\n -EPS)\\n return 0;\\n return 1;\\n}\\n\\nvector<CP> convex_hull(vector<CP> &ps) {\\n auto lmd = [&](const CP &l, const CP &r) {\\n if (l.X != r.X) return l.X < r.X;\\n return l.Y < r.Y;\\n };\\n vector<CP> res;\\n int psize = ps.size();\\n sort(ps.begin(), ps.end(), lmd);\\n int k = 0;\\n res.resize(psize * 2);\\n for (int i = 0; i < psize; ++i) {\\n while (k > 1 && cross(res[k - 1] - res[k - 2], ps[i] - res[k - 1]) <= 0)\\n --k;\\n res[k++] = ps[i];\\n }\\n for (int i = psize - 2, t = k; i >= 0; --i) {\\n while (k > t && cross(res[k - 1] - res[k - 2], ps[i] - res[k - 1]) <= 0)\\n --k;\\n res[k++] = ps[i];\\n }\\n res.resize(k - 1);\\n return res;\\n}\\n\\nlong double convex_diameter(const vector<CP> &pol) {\\n vector<CP> ps = pol;\\n ps = convex_hull(ps);\\n int n = ps.size(), i = 0, j = 0;\\n if (n < 2) return 0.0L;\\n if (n == 2) return abs(ps[0] - ps[1]);\\n for (int k = 0; k < n; ++k) {\\n if (ps[k].X < ps[i].X) i = k;\\n if (ps[k].X > ps[j].X) j = k;\\n }\\n long double res = 0;\\n int si = i, sj = j;\\n while (i != sj || j != si) {\\n res = max(res, abs(ps[i] - ps[j]));\\n if (cross(ps[(i + 1) % n] - ps[i], ps[(j + 1) % n] - ps[j]) < 0)\\n (++i) %= n;\\n else\\n (++j) %= n;\\n }\\n return res;\\n}\\n\\nvector<CP> convex_cut(const vector<CP> &pol, const CP &s, const CP &t) {\\n vector<CP> res;\\n int n = pol.size();\\n for (int i = 0; i < n; ++i) {\\n CP nows = pol[i], nowt = pol[(i + 1) % n];\\n if (cross(t - s, nows - s) >= -EPS) res.push_back(nows);\\n if (cross(t - s, nows - s) * cross(t - s, nowt - s) < 0)\\n res.push_back(intersectionLL(s, t, nows, nowt));\\n }\\n return res;\\n}\\nvector<CP> convex_cut(const vector<CP> &pol, const Line &l) {\\n return convex_cut(pol, l.s, l.t);\\n}\\n\\n// number of tangents\\nint iscrossCC(Circle l, Circle r) {\\n if (l.r < r.r) swap(l, r);\\n long double distlr = abs(l.o - r.o);\\n if (l.r + r.r < distlr)\\n return 4; // not touch\\n else if (abs(distlr - l.r - r.r) <= EPS)\\n return 3; // circumscription\\n else if (l.r - r.r < distlr)\\n return 2; // cross\\n else if (abs(distlr - l.r + r.r) <= EPS)\\n return 1; // inscribed\\n else // contain\\n return 0;\\n}\\n\\nvector<CP> intersectionCC(const Circle &c1, const Circle &c2) {\\n vector<CP> res;\\n if (iscrossCC(c1, c2) == 4) return res;\\n\\n long double d = abs(c1.o - c2.o);\\n long double a = acos(costh(c2.r, c1.r, d));\\n long double t = atan2(c2.o.imag() - c1.o.imag(), c2.o.real() - c1.o.real());\\n res.push_back(c1.o + CP(cos(t + a) * c1.r, sin(t + a) * c1.r));\\n res.push_back(c1.o + CP(cos(t - a) * c1.r, sin(t - a) * c1.r));\\n if (res[0].X > res[1].X || (res[0].X == res[1].X && res[0].Y > res[1].Y))\\n swap(res[0], res[1]);\\n return res;\\n}\\n\\nvector<CP> intersectionCL(const Circle &ci, const CP &s, CP t) {\\n vector<CP> res(2, projectionLP(s, t, ci.o));\\n long double r = sqrt(ci.r * ci.r - norm(res[0] - ci.o));\\n if (r <= EPS || t == s) return res;\\n t -= s;\\n t *= r / abs(t);\\n res[0] += t;\\n res[1] -= t;\\n if (res[0].X > res[1].X || (res[0].X == res[1].X && res[0].Y > res[1].Y))\\n swap(res[0], res[1]);\\n return res;\\n}\\nvector<CP> intersectionCL(const Circle &ci, const Line &l) {\\n return intersectionCL(ci, l.s, l.t);\\n}\\n\\nvector<CP> contactCP(const Circle &ci, const CP &p) {\\n vector<CP> res;\\n long double d = abs(ci.o - p);\\n if (abs(d - ci.r) <= EPS) {\\n res.push_back(p);\\n return res;\\n } else if (d < ci.r)\\n return res;\\n long double arg = asin(ci.r / d);\\n res.push_back((ci.o - p) * CP(cos(arg), sin(arg)));\\n res[0] *= (d * cos(arg)) / abs(res[0]);\\n res[0] += p;\\n res.push_back(reflectionLP(p, ci.o, res[0]));\\n if (res[0].X > res[1].X || (res[0].X == res[1].X && res[0].Y > res[1].Y))\\n swap(res[0], res[1]);\\n return res;\\n}\\n\\nvector<Line> tangentCC(Circle cl, Circle cr) {\\n vector<Line> res;\\n if (cl.r < cr.r) swap(cl, cr);\\n long double g = abs(cl.o - cr.o);\\n if (abs(g - 0.0L) <= EPS) return res;\\n CP hor = (cr.o - cl.o) / g, ver;\\n ver = hor * (CP(cos(PI * 0.5L), sin(PI * 0.5L)));\\n for (int s : {-1, 1}) {\\n long double h = (cl.r + s * cr.r) / g;\\n if (abs(1 - h * h) <= EPS) {\\n res.emplace_back(cl.o + hor * cl.r, cl.o + (hor + ver) * cl.r);\\n } else if (1 - h * h > 0) {\\n CP nhor = hor * h, nver = ver * sqrtl(1 - h * h);\\n res.emplace_back(cl.o + (nhor + nver) * cl.r,\\n cr.o - (nhor + nver) * (cr.r * s));\\n res.emplace_back(cl.o + (nhor - nver) * cl.r,\\n cr.o - (nhor - nver) * (cr.r * s));\\n }\\n }\\n return res;\\n}\\n\\nlong double areaPol(const vector<CP> &pol) {\\n int n = pol.size();\\n long double res = 0;\\n for (int i = 0; i < n; ++i)\\n res += (pol[(i - 1 + n) % n].X - pol[(i + 1) % n].X) * pol[i].Y;\\n return res / 2.0L;\\n}\\n\\nint containPolP(const vector<CP> &pol, CP p) {\\n bool con = 0, onseg = 0;\\n int n = pol.size();\\n for (int i = 0; i < n; ++i) {\\n onseg |= on_segSP(pol[i], pol[(i + 1) % n], p);\\n CP s = pol[i] - p, t = pol[(i + 1) % n] - p;\\n if (s.Y > t.Y) swap(s, t);\\n if (s.Y * t.Y <= 0 && t.Y > 0 && cross(s, t) < 0) con = !con;\\n }\\n if (onseg) return 1;\\n if (con) return 2;\\n return 0;\\n}\\n\\nlong double closest_pair(vector<CP> &ps, int l = -1, int r = -1,\\n bool reqsqrt = 0) {\\n if (l == r && l == -1) {\\n l = 0;\\n r = ps.size();\\n reqsqrt = 1;\\n auto lmd = [&](const CP &l, const CP &r) {\\n if (l.X != r.X) return l.X < r.X;\\n return l.Y < r.Y;\\n };\\n sort(ps.begin(), ps.end(), lmd);\\n }\\n if (r - l < 2) return 1e18;\\n if (r - l == 2) {\\n if (ps[l].Y > ps[l + 1].Y) swap(ps[l], ps[l + 1]);\\n if (reqsqrt) return abs(ps[l] - ps[l + 1]);\\n return norm(ps[l] - ps[l + 1]);\\n }\\n int mid = (l + r) / 2;\\n long double x = ps[mid].X,\\n res = min(closest_pair(ps, l, mid), closest_pair(ps, mid, r));\\n auto f = [](CP pl, CP pr) { return pl.Y < pr.Y; };\\n inplace_merge(ps.begin() + l, ps.begin() + mid, ps.begin() + r, f);\\n vector<CP> tmp;\\n for (int i = l; i < r; ++i) {\\n long double dx = abs(ps[i].X - x);\\n int tsize = tmp.size();\\n if (dx * dx >= res) continue;\\n for (int j = 0; j < tsize; ++j) {\\n CP delta = ps[i] - tmp[tsize - 1 - j];\\n if (delta.Y * delta.Y >= res) break;\\n res = min(res, norm(delta));\\n }\\n tmp.push_back(ps[i]);\\n }\\n if (reqsqrt) res = sqrtl(res);\\n return res;\\n}\\n\\nCircle min_ball(vector<CP> ps) {\\n int n = ps.size();\\n if (n == 1) return Circle(ps[0], 0.0L);\\n mt19937 mt(int(time(0)));\\n shuffle(ps.begin(), ps.end(), mt);\\n auto make3 = [](const CP &a, const CP &b, const CP &c) {\\n long double A = norm(b - c), B = norm(c - a), C = norm(a - b),\\n S = cross(b - a, c - a);\\n CP p = (A * (B + C - A) * a + B * (C + A - B) * b + C * (A + B - C) * c) /\\n (4 * S * S);\\n long double nowr = norm(p - a);\\n return Circle(p, nowr);\\n };\\n auto make2 = [](const CP &a, const CP &b) {\\n CP c = (a + b) / 2.0L;\\n long double nowr = norm(a - c);\\n return Circle(c, nowr);\\n };\\n auto in_circle = [](const CP &a, const Circle &c) {\\n return norm(a - c.o) <= c.r + EPS;\\n };\\n Circle res = make2(ps[0], ps[1]);\\n for (int i = 2; i < n; ++i)\\n if (!in_circle(ps[i], res)) {\\n res = make2(ps[0], ps[i]);\\n for (int j = 1; j < i; ++j)\\n if (!in_circle(ps[j], res)) {\\n res = make2(ps[i], ps[j]);\\n for (int k = 0; k < j; ++k)\\n if (!in_circle(ps[k], res)) res = make3(ps[i], ps[j], ps[k]);\\n }\\n }\\n res.r = sqrtl(res.r);\\n return res;\\n}\\n\\nbool arg_comp(CP a, CP b) {\\n int up_down_a = a.Y > 0 || (abs(a.Y) <= EPS && a.X >= 0);\\n int up_down_b = b.Y > 0 || (abs(b.Y) <= EPS && b.X >= 0);\\n if (up_down_a != up_down_b) return up_down_a < up_down_b;\\n if (a.X * b.Y == a.Y * b.X) return norm(a) < norm(b);\\n return calc_clockwiseSP(CP(0, 0), a, b) == 1;\\n}\\nbool operator<(const Line &l, const Line &r) {\\n CP lp = l.t - l.s, rp = r.t - r.s;\\n return arg_comp(lp, rp);\\n}\\n\\nvector<CP> s, t;\\nvector<int> ps(3), pt(3), pf = {1, 2};\\n\\nint solve();\\nint calc();\\n\\nint main() {\\n int x, y;\\n while (cin >> x) {\\n s.clear(), t.clear();\\n pf = {1, 2};\\n cin >> y;\\n s.emplace_back(x, y);\\n for (int i = 0; i < 2; ++i) {\\n cin >> x >> y;\\n s.emplace_back(x, y);\\n }\\n for (int i = 0; i < 3; ++i) {\\n cin >> x >> y;\\n t.emplace_back(x, y);\\n }\\n int res = solve();\\n if (res >= 5)\\n cout << \\\"Many\\\" << endl;\\n else\\n cout << res << endl;\\n }\\n return 0;\\n}\\n\\nint solve() {\\n int res = 5;\\n vector<CP> vs = s, vt = t;\\n do {\\n iota(ps.begin(), ps.end(), 0);\\n do {\\n iota(pt.begin(), pt.end(), 0);\\n do {\\n for (int i = 0; i < 3; ++i) s[i] = vs[ps[i]], t[i] = vt[pt[i]];\\n res = min(res, calc());\\n } while (next_permutation(pt.begin(), pt.end()));\\n } while (next_permutation(ps.begin(), ps.end()));\\n } while (next_permutation(pf.begin(), pf.end()));\\n return res;\\n}\\n\\nint calc() {\\n int res = 0;\\n if (abs(t[0] - s[0]) > EPS) {\\n CP veca = t[0] - s[0], tar = s[pf[0]], vecb = s[0] - tar;\\n veca /= abs(veca), vecb /= abs(vecb);\\n CP x = tar + veca, y = s[pf[1]], z = y + vecb;\\n if (abs(calc_clockwiseSP(s[0], t[0], tar)) != 1) return 5;\\n assert(parallel_orthogonalLL(s[0], tar, z, y) == 2);\\n CP is = intersectionLL(tar, x, y, z);\\n if (abs(is - y) > EPS) s[pf[1]] = is, ++res;\\n ++res, s[0] = t[0];\\n }\\n if (abs(t[1] - s[1]) > EPS) {\\n CP veca = t[1] - s[1], vecb = s[0] - s[1];\\n veca /= abs(veca), vecb /= abs(vecb);\\n CP x = s[0] + veca, y = s[2] + vecb;\\n CP is = intersectionLL(s[0], x, s[2], y);\\n if (abs(is - s[2]) > EPS) s[2] = is, ++res;\\n ++res, s[1] = t[1];\\n }\\n if (abs(t[2] - s[2]) > EPS) {\\n if (parallel_orthogonalLL(s[2], t[2], s[0], s[1]) != 2) return 5;\\n ++res;\\n }\\n return res;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3504,\n \"score_of_the_acc\": -0.9116,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1623_6006303\",\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()\\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;\\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-9;\\nconst int mod = 1e9 + 7;\\n//const int mod = 998244353;\\n\\nnamespace geometry {\\n // Point : 複素数型を位置ベクトルとして扱う\\n // 実軸(real)をx軸、挙軸(imag)をy軸として見る\\n using D = long double;\\n using Point = complex<D>;\\n const D EPS = 1e-7;\\n const D PI = acosl(-1);\\n\\n inline bool equal(const D &a, const D &b) { return fabs(a - b) < EPS; }\\n\\n // 単位ベクトル(unit vector)を求める\\n Point unitVector(const Point &a) { return a / abs(a); }\\n\\n // 法線ベクトル(normal vector)を求める\\n // 90度回転した単位ベクトルをかける\\n // -90度がよければPoint(0, -1)をかける\\n Point normalVector(const Point &a) { return a * Point(0, 1); }\\n\\n // 内積(dot product) : a・b = |a||b|cosΘ\\n D dot(const Point &a, const Point &b) {\\n return (a.real() * b.real() + a.imag() * b.imag());\\n }\\n\\n // 外積(cross product) : a×b = |a||b|sinΘ\\n D cross(const Point &a, const Point &b) {\\n return (a.real() * b.imag() - a.imag() * b.real());\\n }\\n\\n // 点pを反時計回りにtheta度回転\\n // thetaはラジアン！！！\\n Point rotate(const Point &p, const D &theta) {\\n return Point(cos(theta) * p.real() - sin(theta) * p.imag(),\\n sin(theta) * p.real() + cos(theta) * p.imag());\\n }\\n\\n // ラジアン->度\\n D radianToDegree(const D &radian) { return radian * 180.0 / PI; }\\n\\n // 度->ラジアン\\n D degreeToRadian(const D °ree) { return degree * PI / 180.0; }\\n\\n // 点の回転方向\\n // 点a, b, cの位置関係について(aが基準点)\\n int ccw(const Point &a, Point b, Point c) {\\n b -= a, c -= a;\\n // 点a, b, c が\\n // 反時計回りの時、\\n if(cross(b, c) > EPS) return 1;\\n // 時計回りの時、\\n if(cross(b, c) < -EPS) return -1;\\n // c, a, bがこの順番で同一直線上にある時、\\n if(dot(b, c) < 0) return 2;\\n // a, b, cがこの順番で同一直線上にある場合、\\n if(norm(b) < norm(c)) return -2;\\n // cが線分ab上にある場合、\\n return 0;\\n }\\n\\n // Line : 直線を表す構造体\\n // b - a で直線・線分を表せる\\n struct Line {\\n Point a, b;\\n Line() = default;\\n Line(Point a, Point b) : a(a), b(b) {}\\n // Ax+By=C\\n Line(D A, D B, D C) {\\n if(equal(A, 0)) {\\n a = Point(0, C / B), b = Point(1, C / B);\\n } else if(equal(B, 0)) {\\n b = Point(C / A, 0), b = Point(C / A, 1);\\n } else {\\n a = Point(0, C / B), b = Point(C / A, 0);\\n }\\n }\\n };\\n\\n // Segment : 線分を表す構造体\\n // Lineと同じ\\n struct Segment : Line {\\n Segment() = default;\\n\\n Segment(Point a, Point b) : Line(a, b) {}\\n };\\n\\n // Circle : 円を表す構造体\\n // pが中心の位置ベクトル、rは半径\\n struct Circle {\\n Point p;\\n D r;\\n\\n Circle() = default;\\n\\n Circle(Point p, D r) : p(p), r(r) {}\\n };\\n\\n // 2直線の直交判定 : a⊥b <=> dot(a, b) = 0\\n bool isOrthogonal(const Line &a, const Line &b) {\\n return equal(dot(a.b - a.a, b.b - b.a), 0);\\n }\\n // 2直線の平行判定 : a//b <=> cross(a, b) = 0\\n bool isParallel(const Line &a, const Line &b) {\\n return equal(cross(a.b - a.a, b.b - b.a), 0);\\n }\\n\\n // 点cが直線ab上にあるか\\n bool isPointOnLine(const Point &a, const Point &b, const Point &c) {\\n return isParallel(Line(a, b), Line(a, c));\\n }\\n\\n // 点cが\\\"線分\\\"ab上にあるか\\n bool isPointOnSegment(const Point &a, const Point &b, const Point &c) {\\n // |a-c| + |c-b| <= |a-b| なら線分上\\n return (abs(a - c) + abs(c - b) < abs(a - b) + EPS);\\n }\\n\\n // 直線lと点pの距離を求める\\n D distanceBetweenLineAndPoint(const Line &l, const Point &p) {\\n return abs(cross(l.b - l.a, p - l.a)) / abs(l.b - l.a);\\n }\\n\\n // 線分lと点pの距離を求める\\n // 定義：点pから「線分lのどこか」への最短距離\\n D distanceBetweenSegmentAndPoint(const Segment &l, const Point &p) {\\n if(dot(l.b - l.a, p - l.a) < EPS) return abs(p - l.a);\\n if(dot(l.a - l.b, p - l.b) < EPS) return abs(p - l.b);\\n return abs(cross(l.b - l.a, p - l.a)) / abs(l.b - l.a);\\n }\\n\\n // 直線s, tの交点の計算\\n Point crossPoint(const Line &s, const Line &t) {\\n D d1 = cross(s.b - s.a, t.b - t.a);\\n D d2 = cross(s.b - s.a, s.b - t.a);\\n if(equal(abs(d1), 0) && equal(abs(d2), 0)) return t.a;\\n return t.a + (t.b - t.a) * (d2 / d1);\\n }\\n\\n // 線分s, tの交点の計算\\n Point crossPoint(const Segment &s, const Segment &t) {\\n return crossPoint(Line(s), Line(t));\\n }\\n\\n // 線分sと線分tが交差しているかどうか\\n // bound:線分の端点を含むか\\n bool isIntersect(const Segment &s, const Segment &t, bool bound) {\\n return ccw(s.a, s.b, t.a) * ccw(s.a, s.b, t.b) < bound &&\\n ccw(t.a, t.b, s.a) * ccw(t.a, t.b, s.b) < bound;\\n }\\n\\n // 線分sとtの距離\\n D distanceBetweenSegments(const Segment &s, const Segment &t) {\\n if(isIntersect(s, t, 1)) return (D)(0);\\n D ans = distanceBetweenSegmentAndPoint(s, t.a);\\n chmin(ans, distanceBetweenSegmentAndPoint(s, t.b));\\n chmin(ans, distanceBetweenSegmentAndPoint(t, s.a));\\n chmin(ans, distanceBetweenSegmentAndPoint(t, s.b));\\n return ans;\\n }\\n\\n // 射影(projection)\\n // 直線(線分)lに点pから引いた垂線の足を求める\\n Point projection(const Line &l, const Point &p) {\\n D 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 Point projection(const Segment &l, const Point &p) {\\n D 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 // 反射(reflection)\\n // 直線lを対称軸として点pと線対称の位置にある点を求める\\n Point reflection(const Line &l, const Point &p) {\\n return p + (projection(l, p) - p) * (D)2.0;\\n }\\n\\n // 2つの円の交差判定\\n // 返り値は共通接線の数\\n int isIntersect(const Circle &c1, const Circle &c2) {\\n D d = abs(c1.p - c2.p);\\n // 2つの円が離れている場合\\n if(d > c1.r + c2.r + EPS) return 4;\\n // 外接している場合\\n if(equal(d, c1.r + c2.r)) return 3;\\n // 内接している場合\\n if(equal(d, abs(c1.r - c2.r))) return 1;\\n // 内包している場合\\n if(d < abs(c1.r - c2.r) - EPS) return 0;\\n return 2;\\n }\\n\\n // 2つの円の交点\\n vector<Point> crossPoint(const Circle &c1, const Circle &c2) {\\n vector<Point> res;\\n int mode = isIntersect(c1, c2);\\n // 2つの中心の距離\\n D d = abs(c1.p - c2.p);\\n // 2円が離れている場合\\n if(mode == 4) return res;\\n // 1つの円がもう1つの円に内包されている場合\\n if(mode == 0) return res;\\n // 2円が外接する場合\\n if(mode == 3) {\\n D t = c1.r / (c1.r + c2.r);\\n res.emplace_back(c1.p + (c2.p - c1.p) * t);\\n return res;\\n }\\n // 内接している場合\\n if(mode == 1) {\\n if(c2.r < c1.r - EPS) {\\n res.emplace_back(c1.p + (c2.p - c1.p) * (c1.r / d));\\n } else {\\n res.emplace_back(c2.p + (c1.p - c2.p) * (c2.r / d));\\n }\\n return res;\\n }\\n // 2円が重なる場合\\n D rc1 = (c1.r * c1.r + d * d - c2.r * c2.r) / (2 * d);\\n D rs1 = sqrt(c1.r * c1.r - rc1 * rc1);\\n if(c1.r - abs(rc1) < EPS) rs1 = 0;\\n Point e12 = (c2.p - c1.p) / abs(c2.p - c1.p);\\n res.emplace_back(c1.p + rc1 * e12 + rs1 * e12 * Point(0, 1));\\n res.emplace_back(c1.p + rc1 * e12 + rs1 * e12 * Point(0, -1));\\n return res;\\n }\\n\\n // 点pが円cの内部(円周上も含む)に入っているかどうか\\n bool isInCircle(const Circle &c, const Point &p) {\\n D d = abs(c.p - p);\\n return (equal(d, c.r) || d < c.r - EPS);\\n }\\n\\n // 円cと直線lの交点\\n vector<Point> crossPoint(const Circle &c, const Line &l) {\\n vector<Point> res;\\n D d = distanceBetweenLineAndPoint(l, c.p);\\n // 交点を持たない\\n if(d > c.r + EPS) return res;\\n // 接する\\n Point h = projection(l, c.p);\\n if(equal(d, c.r)) {\\n res.emplace_back(h);\\n return res;\\n }\\n Point e = unitVector(l.b - l.a);\\n D ph = sqrt(c.r * c.r - d * d);\\n res.emplace_back(h - e * ph);\\n res.emplace_back(h + e * ph);\\n return res;\\n }\\n\\n // 点pを通る円cの接線\\n // 2本あるので、接点のみを返す\\n vector<Point> tangentToCircle(const Point &p, const Circle &c) {\\n return crossPoint(c, Circle(p, sqrt(norm(c.p - p) - c.r * c.r)));\\n }\\n\\n // 円の共通接線\\n vector<Line> tangent(const Circle &a, const Circle &b) {\\n vector<Line> ret;\\n // 2円の中心間の距離\\n D g = abs(a.p - b.p);\\n // 円が内包されている場合\\n if(equal(g, 0)) return ret;\\n Point u = unitVector(b.p - a.p);\\n Point v = rotate(u, PI / 2);\\n for(int s : {-1, 1}) {\\n D h = (a.r + b.r * s) / g;\\n if(equal(h * h, 1)) {\\n ret.emplace_back(a.p + (h > 0 ? u : -u) * a.r,\\n a.p + (h > 0 ? u : -u) * a.r + v);\\n\\n } else if(1 - h * h > 0) {\\n Point U = u * h, V = v * sqrt(1 - h * h);\\n ret.emplace_back(a.p + (U + V) * a.r,\\n b.p - (U + V) * (b.r * s));\\n ret.emplace_back(a.p + (U - V) * a.r,\\n b.p - (U - V) * (b.r * s));\\n }\\n }\\n return ret;\\n }\\n\\n // 多角形の面積を求める\\n D PolygonArea(const vector<Point> &p) {\\n D res = 0;\\n int n = p.size();\\n for(int i = 0; i < n - 1; i++) res += cross(p[i], p[i + 1]);\\n res += cross(p[n - 1], p[0]);\\n return res * 0.5;\\n }\\n\\n // 凸多角形かどうか\\n bool isConvex(const vector<Point> &p) {\\n int n = p.size();\\n int now, pre, nxt;\\n for(int i = 0; i < n; i++) {\\n pre = (i - 1 + n) % n;\\n nxt = (i + 1) % n;\\n now = i;\\n if(ccw(p[pre], p[now], p[nxt]) == -1) return false;\\n }\\n return true;\\n }\\n\\n // 凸包 O(NlogN)\\n vector<Point> ConvexHull(vector<Point> &p) {\\n int n = (int)p.size(), k = 0;\\n sort(all(p), [](const Point &a, const Point &b) {\\n return (real(a) != real(b) ? real(a) < real(b) : imag(a) < imag(b));\\n });\\n vector<Point> ch(2 * n);\\n // 一直線上の3点を含める -> (< -EPS)\\n // 含め無い -> (< EPS)\\n for(int i = 0; i < n; ch[k++] = p[i++]) { // lower\\n while(k >= 2 &&\\n cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < EPS)\\n --k;\\n }\\n for(int i = n - 2, t = k + 1; i >= 0; ch[k++] = p[i--]) { // upper\\n while(k >= t &&\\n cross(ch[k - 1] - ch[k - 2], p[i] - ch[k - 1]) < EPS)\\n --k;\\n }\\n ch.resize(k - 1);\\n return ch;\\n }\\n\\n // 多角形gに点pが含まれているか?\\n // 含まれる:2, 辺上にある:1, 含まれない:0\\n int isContained(const vector<Point> &g, const Point &p) {\\n bool in = false;\\n int n = (int)g.size();\\n for(int i = 0; i < n; i++) {\\n Point a = g[i] - p, b = g[(i + 1) % n] - p;\\n if(imag(a) > imag(b)) swap(a, b);\\n if(imag(a) <= EPS && EPS < imag(b) && cross(a, b) < -EPS) in = !in;\\n if(cross(a, b) == 0 && dot(a, b) <= 0) return 1;\\n }\\n return (in ? 2 : 0);\\n }\\n\\n vector<Point> convex_cut(const vector<Point> &g, Line l){\\n vector<Point> ret;\\n for(int i=0; i<g.size(); i++){\\n Point now = g[i], nxt = g[(i+1)%g.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 bool equal (const Point &a, const Point &b) {\\n return equal(a.real(),b.real()) && equal(a.imag(),b.imag());\\n }\\n\\n D circlesIntersectArea(Circle &a, Circle &b){\\n double d = abs(a.p - b.p);\\n if(d >= a.r + b.r - EPS) return 0; //2円が離れている\\n auto R = minmax(a.r,b.r);\\n if(d <= R.second - R.first + EPS) return R.first*R.first*pi; //円が円を内包する\\n D theta1 = acos((d*d + a.r*a.r - b.r*b.r)/(2*a.r*d));\\n D theta2 = acos((d*d + b.r*b.r - a.r*a.r)/(2*b.r*d));\\n D ret = a.r*a.r*(theta1-cos(theta1)*sin(theta1)) + b.r*b.r*(theta2-cos(theta2)*sin(theta2));\\n return ret;\\n }\\n} // namespace geometry\\n\\nusing namespace geometry;\\n\\n\\nint main(){\\n int x,y;\\n while(cin >> x){\\n cin >> y;\\n vector<Point> a(3),b(3);\\n a[0] = Point(x,y);\\n rep(i,2){\\n int x,y; cin >> x >> y;\\n a[i+1] = Point(x,y);\\n }\\n rep(i,3){\\n int x,y; cin >> x >> y;\\n b[i] = Point(x,y);\\n }\\n vl nxt(3); rep(i,3) nxt[i] = i;\\n vl nxt2(3); rep(i,3) nxt2[i] = i;\\n\\n //3回\\n bool f = false;\\n bool h = false;\\n do{\\n do{\\n auto c = a;\\n bool g = true;\\n rep(i,3){\\n int id = nxt[i];\\n int u = (id+1) % 3;\\n int v = (id+2) % 3;\\n if(isParallel(Line(c[u],c[v]), Line(c[id],b[nxt2[i]]))){\\n c[id] = b[nxt2[i]];\\n if(i == 0) h = true;\\n }else{\\n g = false; break;\\n }\\n }\\n if(g) f = true;\\n }while(next_permutation(all(nxt2)));\\n }while(next_permutation(all(nxt)));\\n if(f){\\n cout << \\\"3\\\\n\\\";\\n continue;\\n }\\n\\n //4回\\n if(h){\\n cout << \\\"4\\\\n\\\";\\n continue;\\n }\\n rep(j,3){ //最初に動かすもの\\n do{\\n if(j == nxt[0]) continue;\\n do{\\n auto c = a;\\n Point vec = Point(c[(j+1)%3]-c[(j+2)%3]);\\n Line l1(c[j],c[j]+vec);\\n Point vec2(c[nxt[0]]-b[nxt2[0]]);\\n Line l2(c[3-j-nxt[0]]+vec2,c[3-j-nxt[0]]);\\n if(isParallel(l1,l2)) continue;\\n c[j] = crossPoint(l1,l2);\\n\\n //3回のときと同じ\\n bool g = true;\\n rep(i,3){\\n int id = nxt[i];\\n int u = (id+1) % 3;\\n int v = (id+2) % 3;\\n if(isParallel(Line(c[u],c[v]), Line(c[id],b[nxt2[i]]))){\\n c[id] = b[nxt2[i]];\\n }else{\\n if(i == 0) assert(false);\\n g = false; break;\\n }\\n }\\n if(g) f = true;\\n }while(next_permutation(all(nxt2)));\\n }while(next_permutation(all(nxt)));\\n }\\n if(f){\\n cout << \\\"4\\\\n\\\";\\n }else{\\n cout << \\\"Many\\\\n\\\";\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3468,\n \"score_of_the_acc\": -0.819,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1623_5347461\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nconst double EPS = 0.00001;\\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 point operator -(point P){\\n return point(x - P.x, y - P.y);\\n }\\n point operator *(double k){\\n return point(x * k, y * k);\\n }\\n point operator /(double k){\\n return point(x / k, y / k);\\n }\\n};\\ndouble abs(point P){\\n return sqrt(P.x * P.x + P.y * P.y);\\n}\\ndouble cross(point P, point Q){\\n return P.x * Q.y - P.y * Q.x;\\n}\\nstruct line{\\n point A, B;\\n line(point A, point B): A(A), B(B){\\n }\\n};\\npoint vec(line L){\\n return L.B - L.A;\\n}\\nbool is_parallel(line L1, line L2){\\n return abs(cross(vec(L1), vec(L2))) <= EPS;\\n}\\nline parallel(point P, line L){\\n return line(P, P + vec(L));\\n}\\npoint line_intersection(line L1, line L2){\\n return L1.A + vec(L1) * cross(L2.A - L1.A, vec(L2)) / cross(vec(L1), vec(L2));\\n}\\nbool ok(vector<point> A, vector<point> B){\\n vector<int> p = {0, 1, 2}, q = {0, 1, 2};\\n while (true){\\n while (true){\\n if (is_parallel(line(A[p[0]], B[q[0]]), line(A[p[1]], A[p[2]]))){\\n if (is_parallel(line(A[p[1]], B[q[1]]), line(B[q[0]], A[p[2]]))){\\n if (is_parallel(line(A[p[2]], B[q[2]]), line(B[q[0]], B[q[1]]))){\\n return true;\\n }\\n }\\n }\\n if (!next_permutation(q.begin(), q.end())){\\n break;\\n }\\n }\\n if (!next_permutation(p.begin(), p.end())){\\n break;\\n }\\n }\\n return false;\\n}\\nint main(){\\n while (true){\\n vector<point> A(3);\\n cin >> A[0].x;\\n if (!cin){\\n break;\\n }\\n cin >> A[0].y;\\n for (int i = 1; i < 3; i++){\\n cin >> A[i].x >> A[i].y;\\n }\\n vector<point> B(3);\\n for (int i = 0; i < 3; i++){\\n cin >> B[i].x >> B[i].y;\\n }\\n vector<point> C = {A[0], A[1], A[2], B[0], B[1], B[2]};\\n if (ok(A, B)){\\n cout << 3 << endl;\\n } else {\\n bool P = false;\\n for (int i = 0; i < 2; i++){\\n for (int j = 0; j < 3; j++){\\n line L1 = parallel(A[j], line(A[(j + 1) % 3], A[(j + 2) % 3]));\\n for (int k = 0; k < 6; k++){\\n for (int l = 0; l < 6; l++){\\n for (int m = l + 1; m < 6; m++){\\n line L2 = parallel(C[k], line(C[l], C[m]));\\n if (!is_parallel(L1, L2)){\\n vector<point> A2 = A;\\n A2[j] = line_intersection(L1, L2);\\n if (ok(A2, B) || ok(B, A2)){\\n P = true;\\n }\\n }\\n }\\n }\\n }\\n }\\n swap(A, B);\\n }\\n if (P){\\n cout << 4 << endl;\\n } else {\\n cout << \\\"Many\\\" << endl;\\n }\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 450,\n \"memory_kb\": 3124,\n \"score_of_the_acc\": -0.0598,\n \"final_rank\": 1\n }\n]","isConversational":false}}},{"rowIdx":996,"cells":{"group_id":{"kind":"string","value":"aoj_1625_cpp"},"problem_description":{"kind":"string","value":"Origami, or the art of folding paper\nMaster Grus is a famous\norigami\n(paper folding) artist, who is\nenthusiastic about exploring the possibility of origami art.\nFor future creation, he is now planning fundamental\nexperiments to establish the general theory of origami.\nOne rectangular piece of paper is used in each of his experiments.\nHe folds it horizontally and/or vertically several times and then\npunches through holes in the folded paper.\nThe following figure illustrates the folding process of a simple experiment,\nwhich corresponds to the third dataset of the Sample Input below.\nFolding the 10 × 8 rectangular piece of paper shown at top left\nthree times results in the 6 × 6 square shape shown at\nbottom left.\nIn the figure, dashed lines indicate the locations to fold the paper\nand round arrows indicate the directions of folding.\nGrid lines are shown as solid lines to tell the sizes of rectangular\nshapes and the exact locations of folding.\nColor densities represent the numbers of overlapping layers.\nPunching through holes at A and B in the folded paper makes\nnine holes in the paper, eight at A and another at B.\nYour mission in this problem is to write a computer program to count\nthe number of holes in the paper, given the information on a rectangular\npiece of paper and folding and punching instructions.\nInput\nThe input consists of at most 1000 datasets, each in the following format.\nn\nm\nt\np\nd\n1\nc\n1\n...\nd\nt\nc\nt\nx\n1\ny\n1\n...\nx\np\ny\np\nn\nand\nm\nare the width and the height, respectively, of\na rectangular piece of paper.\nThey are positive integers at most 32.\nt\nand\np\nare the numbers of folding and punching\ninstructions, respectively.\nThey are positive integers at most 20.\nThe pair of\nd\ni\nand\nc\ni\ngives the\ni\n-th folding instruction as follows:\nd\ni\nis either 1 or 2.\nc\ni\nis a positive integer.\nIf\nd\ni\nis 1, the left-hand side of the vertical folding line that passes at\nc\ni\nright to the left boundary is folded onto the right-hand side.\nIf\nd\ni\nis 2, the lower side of the horizontal folding line that passes at\nc\ni\nabove the lower boundary is folded onto the upper side.\nAfter performing the first\ni\n−1 folding instructions, if\nd\ni\nis 1, the width of the shape is greater than\nc\ni\n.\nOtherwise the height is greater than\nc\ni\n.\n\n(\nx\ni\n+ 1/2,\ny\ni\n+ 1/2) gives the coordinates of\nthe point where the\ni\n-th punching instruction is performed.\nThe origin (0, 0) is at the bottom left of the finally obtained shape.\nx\ni\nand\ny\ni\nare both non-negative integers and they are less than the width and the height, respectively, of the shape.\nYou can assume that no two punching instructions punch holes at the same location.\nThe end of the input is indicated by a line containing four zeros.\nOutput\nFor each dataset, output\np\nlines, the\ni\n-th of which contains\nthe number of holes punched in the paper by the\ni\n-th punching instruction.\nSample Input\n2 1 1 1\n1 1\n0 0\n1 3 2 1\n2 1\n2 1\n0 0\n10 8 3 2\n2 2\n1 3\n1 1\n0 1\n3 4\n3 3 3 2\n1 2\n2 1\n1 1\n0 1\n0 0\n0 0 0 0\nOutput for the Sample Input\n2\n3\n8\n1\n3\n6"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1625_10854025","code_snippet":"#include <iostream>\n#include <cstring>\n#define ll long long\n#define N 100000\n\nusing namespace std;\n\nint g[600][600], dx, dy;\n\nint main(void) {\n#ifdef _DEBUG\n\tfreopen(\"1.in\", \"r\", stdin);\n#else \n\tios::sync_with_stdio(0); cin.tie(0); cout.tie(0);\n#endif\n\tint n, m, t, p;\n\twhile (cin >> n >> m >> t >> p, n) {\n\t\tdx = dy = 0;\n\t\tmemset(g, 0, sizeof(g));\n\t\tfor (int i = 0; i != n; ++i) for (int j = 0; j != m; ++j) g[i][j] = 1;\n\t\twhile (t--) { \n\t\t\tint d, c; cin >> d >> c;\n\t\t\tif (d == 1) {\n\t\t\t\tfor (int i = 0; i != c; ++i)\n\t\t\t\t\tfor (int j = 0; j != m - dy; ++j)\n\t\t\t\t\t\tg[dx + c + i][dy + j] += g[dx + c - i - 1][dy + j];\n\t\t\t\tdx += c;\n\t\t\t\tif (n < dx + 2 * c) n = dx + 2 * c;\n\t\t\t}\n\t\t\telse if (d == 2) {\n\t\t\t\tfor (int j = 0; j != c; ++j)\n\t\t\t\t\tfor (int i = 0; i != n - dx; ++i)\n\t\t\t\t\t\tg[dx + i][dy + c + j] += g[dx + i][dy + c - j - 1];\n\t\t\t\tdy += c;\n\t\t\t\tif (m < dy + 2 * c) m = dy + 2 * c;\n\t\t\t}\n\t\t}\n\t\twhile (p--) {\n\t\t\tint x, y; cin >> x >> y;\n\t\t\tcout << g[dx + x][dy + y] << endl;\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":20,"memory_kb":4784,"score_of_the_acc":-0.022,"final_rank":5},{"submission_id":"aoj_1625_10625671","code_snippet":"#include<bits/stdc++.h>\n#define rep(i,a,b) for(int i=a;i<b;i++)\n#define rrep(i,a,b) for(int i=a;i>=b;i--)\n#define fore(i,a) for(auto &i:a)\n#define all(x) (x).begin(),(x).end()\nusing namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }\ntypedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }\n//---------------------------------------------------------------------------------------------------\n/*---------------------------------------------------------------------------------------------------\n ∧＿∧ \n ∧＿∧ （´<_｀ ） Welcome to My Coding Space!\n （ ´_ゝ`） / ⌒i \n ／ ＼ | | \n / /￣￣￣￣/ | \n ＿_(__ﾆつ/ ＿/ .| .|＿＿＿＿ \n ＼/＿＿＿＿/ （u ⊃ \n---------------------------------------------------------------------------------------------------*/\n\n\n\n\nint W, H, T, P;\nint A[2][101][101];\n//---------------------------------------------------------------------------------------------------\nvoid _main() {\n while (cin >> W >> H >> T >> P) {\n if (W == 0) return;\n \n rep(t, 0, 2) rep(y, 0, 101) rep(x, 0, 101) A[t][y][x] = 0;\n rep(y, 0, H) rep(x, 0, W) A[0][y][x] = 1;\n\n rep(t, 0, T) {\n int d, c; cin >> d >> c;\n rep(y, 0, 101) rep(x, 0, 101) A[(t + 1) % 2][y][x] = 0;\n\n if (d == 1) {\n rep(y, 0, H) rep(x, 0, W) A[(t + 1) % 2][y][x] = A[t % 2][y][x + c];\n rep(x, 0, c) rep(y, 0, H) A[(t + 1) % 2][y][x] += A[t % 2][y][c - 1 - x];\n } else {\n rep(y, 0, H) rep(x, 0, W) A[(t + 1) % 2][y][x] = A[t % 2][y + c][x];\n rep(x, 0, W) rep(y, 0, c) A[(t + 1) % 2][y][x] += A[t % 2][c - 1 - y][x];\n }\n }\n\n rep(p, 0, P) {\n int x, y; cin >> x >> y;\n printf(\"%d\\n\", A[T % 2][y][x]);\n }\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3576,"score_of_the_acc":-0.0039,"final_rank":3},{"submission_id":"aoj_1625_10617810","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing a2 = array<ll, 2>;\nusing a3 = array<ll, 3>;\n\ntemplate <typename A> void chmin(A &l, const A &r) {\n if(r < l)\n l = r;\n}\ntemplate <typename A> void chmax(A &l, const A &r) {\n if(l < r)\n l = r;\n}\n\nll mod = 998244353;\n\nvoid init() {}\n\nll w, h, t, p;\nvoid input() { cin >> w >> h >> t >> p; }\nvoid solve() {\n vector<vector<ll>> v(1000, vector<ll>(1000, 0));\n ll th = 0, tw = 0, bh = h, bw = w;\n\n for(int i = 0; i < h; i++)\n for(int j = 0; j < w; j++)\n v[i][j] = 1;\n\n for(int i = 0; i < t; i++) {\n ll a, b;\n cin >> a >> b;\n if(a == 1) {\n for(int j = th; j < bh; j++) {\n for(int k = tw; k < tw + b; k++) {\n ll diff = 2 * (tw + b - k) - 1;\n v[j][k + diff] += v[j][k];\n chmax(bw, (ll)(k+diff+1));\n }\n }\n tw += b;\n } else {\n for(int j = th; j < th + b; j++) {\n for(int k = tw; k < bw; k++) {\n ll diff = 2 * (th + b - j) - 1;\n v[j+diff][k] += v[j][k];\n chmax(bh, (ll)(j+diff+1));\n }\n }\n th += b;\n }\n }\n\n for(int i = 0; i < p; i++) {\n ll a, b;\n cin >> a >> b;\n cout << v[th + b][tw + a] << endl;\n }\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n\n // init();\n while(1) {\n input();\n if(w == 0)\n break;\n solve();\n }\n\n return 0;\n}","accuracy":1,"time_ms":1570,"memory_kb":11052,"score_of_the_acc":-0.5758,"final_rank":16},{"submission_id":"aoj_1625_10542589","code_snippet":"#include <bits/stdc++.h>\n#include <atcoder/all>\nusing namespace std;\nusing namespace atcoder;\n#define int long long\n\nvoid solve(int n, int m, int t, int p) {\n int k = 30;\n vector<vector<int>> paper(m*k, vector<int>(n*k, 0));\n for (int i=0; i<m; ++i) {\n for (int j=0; j<n; ++j) {\n paper[m*k-i-1][j] = 1;\n }\n }\n\n int left = 0, low = m*k-1;\n for (;t--;) {\n int d, c;\n cin >> d >> c;\n if (d == 1) {\n //縦軸で折り返す\n for (int i=0; i<=low; ++i) {\n for (int j=0; j<c; ++j) {\n //left left+1 left+2 | left+6-2-1\n //left | left+2-0-1\n //paper[i][j]をpaper[i][left+2c-j-1]に加算\n paper[i][left+2*c-j-1] += paper[i][left+j];\n paper[i][left+j] = 0;\n }\n }\n left += c;\n } else {\n //横軸で折り返す\n for (int i=0; i<c; ++i) {\n for (int j=left; j<n*k; ++j) {\n //low low-1 low-2 | low-6+2+1 low-6+1+1 low-6+0+1\n paper[low-2*c+i+1][j] += paper[low-i][j];\n paper[low-i][j] = 0;\n }\n }\n low -= c;\n }\n // for (int _=0; _<10; ++_) cout << \"=\";\n // cout << \"here~~\" << \"\\n\";\n // cout << \"left low \" << left << ' ' << low << endl;\n // for (int i=0; i<m; ++i) {\n // for (int j=0; j<n; ++j) {\n // cout << paper[i][j] << ' ';\n // }\n // cout << endl;\n // }\n // for (auto _x: paper) {\n // for (auto __x: _x) {\n // cout << __x << ' ';\n // }\n // cout << endl;\n // }\n }\n\n for (;p--;) {\n int x, y;\n cin >> x >> y;\n cout << paper[low-y][left+x] << endl;\n }\n}\n\nsigned main() {\n while(true) {\n int n, m, t, p;\n cin >> n >> m >> t >> p;\n if (n+m+t+p == 0) break;\n solve(n, m, t, p);\n }\n}\n\n/*\nmemo\n\n\n2 1 1 1\n1 1\n0 0\n\n1 3 2 1\n2 1\n2 1\n0 0\n10 8 3 2\n2 2\n1 3\n1 1\n0 1\n3 4\n\n\n3 3 3 2\n1 2\n2 1\n1 1\n0 1\n0 0\n0 0 0 0\n\n\n*/","accuracy":1,"time_ms":20,"memory_kb":10668,"score_of_the_acc":-0.0955,"final_rank":10},{"submission_id":"aoj_1625_10542460","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef int ll;\ntypedef unsigned long long ull;\ntypedef long double ld;\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\n#define rrep(i,start,end) for (ll i = start;i >= (ll)(end);i--)\n#define repn(i,end) for(ll i = 0; i <= (ll)(end); i++)\n#define reps(i,start,end) for(ll i = start; i < (ll)(end); i++)\n#define repsn(i,start,end) for(ll i = start; i <= (ll)(end); i++)\n#define each(p,a) for(auto &p:a)\ntypedef vector<ll> vll;\ntypedef vector<pair<ll ,ll>> vpll;\ntypedef vector<vector<ll>> vvll;\ntypedef set<ll> sll;\ntypedef map<ll , ll> mpll;\ntypedef pair<ll ,ll> pll;\ntypedef tuple<ll , ll , ll> tpl3;\n#define LL(...) ll __VA_ARGS__; input(__VA_ARGS__)\n#define LD(...) ld __VA_ARGS__; input(__VA_ARGS__)\n#define Str(...) string __VA_ARGS__; input(__VA_ARGS__)\n#define Ch(...) char __VA_ARGS__; input(__VA_ARGS__)\n#define all(a) (a).begin(),(a).end()\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\n#define sz(x) (ll)x.size()\n// << std::fixed << std::setprecision(10)\nconst ll INF = 1LL << 30;\nconst ld EPS = 1e-9;\n \nll lceil(ll a,ll b){if(a%b==0){return a/b;}if(a>=0){return (a/b)+1;}else{return -((-a)/b);}}\nll lfloor(ll a,ll b){if(a%b==0){return a/b;}if(a>=0){return (a/b);}else{return -((-a)/b)-1;}}\ninline ll positive_mod(ll a,ll m){return (a % m + m)%m;}\ninline ll popcnt(ull a){ return __builtin_popcountll(a);}\n//0indexed\ninline ll topbit(ll a){assert(a != 0);return 63 - __builtin_clzll(a);}\ninline ll smlbit(ll a){assert(a != 0);return __builtin_ctzll(a);}\ntemplate<class T> bool chmin(T& a, T b){if(a > b){a = b;return true;}return false;}\ntemplate<class T> bool chmax(T& a, T b){if(a < b){a = b;return true;}return false;}\ntemplate<typename T> std::istream &operator>>(std::istream&is,std::vector<T>&v){for(T &in:v){is>>in;}return is;}\ntemplate<typename T> std::ostream &operator<<(std::ostream&os,const std::vector<T>&v){for(auto it=std::begin(v);it!=std::end(v);){os<<*it<<((++it)!=std::end(v)?\" \":\"\");}return os;}\ntemplate<typename T1, typename T2>std::ostream &operator<< (std::ostream &os, std::pair<T1,T2> p){os << \"{\" << p.first << \",\" << p.second << \"}\";return os;}\ntemplate<class... T>void input(T&... a){(cin >> ... >> a);}\nvoid print(){cout << endl;}\ntemplate<class T, class... Ts>void print(const T& a, const Ts&... b){cout << a;((cout << ' ' << b), ...);cout << endl;}\ntemplate<class T> void pspace(const T& a){ cout << a << ' ';}\nvoid perr(){cerr << endl;}\ntemplate<class T, class... Ts>void perr(const T& a, const Ts&... b){cerr << a;((cerr << ' ' << b), ...);cerr << endl;}\nvoid yes(bool i = true){ return print(i?\"yes\":\"no\"); }\nvoid Yes(bool i = true){ return print(i?\"Yes\":\"No\"); }\nvoid YES(bool i = true){ return print(i?\"YES\":\"NO\"); }\ntemplate <class T> vector<T> &operator++(vector<T> &v) {for(auto &e : v) e++;return v;}\ntemplate <class T> vector<T> operator++(vector<T> &v, signed) {auto res = v;for(auto &e : v) e++;return res;}\ntemplate <class T> vector<T> &operator--(vector<T> &v) {for(auto &e : v) e--;return v;}\ntemplate <class T> vector<T> operator--(vector<T> &v, signed) {auto res = v;for(auto &e : v) e--;return res;}\n//grid探索用\nvector<ll> _ta = {0,0,1,-1,1,1,-1,-1};\nvector<ll> _yo = {1,-1,0,0,1,-1,1,-1};\nbool isin(ll now_i,ll now_j,ll h,ll w){return (0<=now_i && now_i < h && 0 <= now_j && now_j < w);}\n \nll lpow(ll x,ll n){ll ans = 1;while(n >0){if(n & 1)ans *= x;x *= x;n >>= 1;}return ans;}\nll Modlpow(ll x,ll n,ll m){ll ans = 1;ll a = x%m;while(n >0){if(n & 1){ans *= a;ans%= m;}a *= a;a %= m;n >>= 1;}return ans;} \nconst ll MOD9 = 998244353LL;\nconst ll MOD10 = 1000000007LL;\n\n\n // for AOJ or ICPC or etc..\ntemplate<class Tp>\nbool zero (const Tp &x) {\n return x == 0;\n}\n\ntemplate<class Tp, class... Args>\nbool zero (const Tp &x, const Args& ...args) {\n return zero(x) and zero(args...);\n}\n\nvoid solve(ll n,ll m,ll t,ll p){\n swap(n,m);\n vvll paper(700,vll(700));\n ll tp = 0,dn = n;\n ll l = 0,r = m; \n reps(i,tp,dn)reps(j,l,r){\n paper[i][j] = 1;\n }\n while(t--){\n LL(d,c);\n if(d == 1){\n for(ll i = tp;i < dn;i++){\n rep(j,c){\n paper[i][l+c+j] += paper[i][l+c-1-j];\n paper[i][l+c-1-j] = 0;\n }\n }\n l += c;\n chmax(r,l+c);\n }else{\n rep(i,c){\n for(ll j =l;j<r;j++){\n paper[tp+c+i][j] += paper[tp+c-1-i][j];\n paper[tp+c-1-i][j] = 0;\n }\n }\n tp += c;\n chmax(dn,tp+c);\n }\n }\n // ll ans = 0;\n while(p--){\n LL(x,y);\n cout << paper[tp+y][l+x] << endl;\n }\n}\n\nint main(){\n ios::sync_with_stdio(false);cin.tie(nullptr);\n while(true){\n LL(n,m,t,p);\n // perr(n,m,t,p);\n if(zero(n,m,t,p))break;\n solve(n,m,t,p);\n }\n}","accuracy":1,"time_ms":240,"memory_kb":5376,"score_of_the_acc":-0.0969,"final_rank":12},{"submission_id":"aoj_1625_10356120","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nint main () {\n while(1){\n int n,m,t,p;\n cin>>m>>n>>t>>p;\n if(n == 0 && m == 0 && t == 0 && p == 0){\n break;\n }\n vector<vector<int>> g(1000,vector<int>(1000,0));\n for(int i = 0 ; i < n;i++){\n for(int j = 0 ; j < m;j++){\n g[i][j] = 1;\n }\n }\n int d[t],c[t];\n for(int i = 0 ; i < t;i++){\n cin>>d[i]>>c[i];\n }\n int x[p],y[p];\n for(int i = 0 ; i < p;i++){\n cin>>x[i]>>y[i];\n }\n int L = 0,R = m,U = n ,D = 0;\n for(int i = 0 ; i < t;i++){\n if(d[i] == 1){\n for(int j = 0; j < c[i];j++){\n for(int k = D ; k <U;k++){\n g[k][L + c[i] + j] += g[k][L + c[i] - j - 1];\n }\n }\n L += c[i];\n if(R-L < c[i]){\n R = L + 2 * c[i];\n // R += (c[i] - R + 1);\n }\n }else{\n for(int j = 0 ; j < c[i];j++){\n for(int k = L ; k < R; k++){\n g[D + c[i] + j][k] += g[D + c[i] - j - 1][k];\n }\n }\n D += c[i];\n if(U-D < c[i]) {\n U = D + 2 * c[i];\n // U += (c[i]-U+1);\n }\n }\n }\n vector<vector<bool>> che(1000,vector<bool>(1000,false));\n for(int i = 0 ; i < p;i++){\n cout<<g[D + y[i]][L + x[i]]<<endl;\n che[D+y[i]][L+x[i]] = true;\n }\n }\n return(0);\n}","accuracy":1,"time_ms":140,"memory_kb":7480,"score_of_the_acc":-0.0925,"final_rank":9},{"submission_id":"aoj_1625_9424520","code_snippet":"#include <bits/stdc++.h>\n//using\nusing intl = long long;\nusing ll = long long;\nusing itnl = long long;//typo用\nusing uintl = unsigned long long;\nusing itn = int;//typo用\nusing ld = long double;\nusing namespace std;\n\n//関数マクロ\n#define rep(i, n) for(intl i = 0; i < (intl)(n); i++)\n#define rrep(i, n) for(intl i = (intl)(n) - 1; i >= 0; i--)\n#define repi(i, a, b) for(intl i = (intl)(a); i < (intl)(b); i++)\n#define rrepi(i, a, b) for(intl i = (intl)(a) - 1; i >= (intl)(b); i--)\n#define all(x) (x).begin(),(x).end()\n#define rall(x) (x).rbegin(),(x).rend()\n#define m0(x) memset(x,0,sizeof(x))\n#define m1(x) memset(x,1,sizeof(x))\n#define fill(x,y) memset(x,y,sizeof(x))\n#define alength(a) (sizeof(a) / sizeof(a[0]))\n#define debug(x) cout << #x << \":\" << x << endl\n\n//定数マクロ\n#define pb push_back\n#define mp make_pair\n#define pii pair<intl,intl>\n\n//定数\nconst intl INF = 1e18;\nconst intl MOD = 1e9+7; //1e9より大きい最小の素数, 1e9より小さい最大の素数は998244353\nconst ld EPS = 1.0e-14;\nconst ld PI = acos(-1);\n\n//テンプレート関数\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) {a = b; return true;} return false; }\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) {a = b; return true;} return false; }\nintl modpow(intl a, intl n, intl mod) {intl res = 1;while (n > 0) {if (n & 1) res = res * a % mod;a = a * a % mod;n >>= 1;}return res;}\nintl modpow(intl a, intl n) {intl res = 1; while (n > 0) {if (n & 1) res = res * a % MOD;a = a * a % MOD;n >>= 1;}return res;}\n//intl gcd(intl a, intl b){ if(!b)return a; return gcd(b, a % b); } //c++17からある\n//intl lcm(intl a,intl b){ return a / gcd(a, b) * b; } //c++17からある\n\n//自作テンプレート関数\nvoid fp(bool f){cout << (f ? \"Yes\" : \"No\") << endl;}//Yes,Noの出力を楽にするよう\nvoid fp(bool f, string s, string t){cout << (f ? s : t) << endl;}//上の関数のYes,Noを任意の文字列でできるようにしたもの\nintl fact(intl k){ intl a = 1; for(int i = 2; i <= k; i++){ a *= i; } return a; }//k!を求める関数,O(N)\nintl digit10(intl a){ intl b = 0; do{ a /= 10; b++; }while(a); return b; }//aを10進数で表したときの桁数を求める関数,O(logN)\nintl mceil(intl a, intl b){ return (a + b - 1) / b; }//aをbで割って切り上げる関数,O(1)\n\n\n//--------------入力受け取る場所----------------------------------------------------\nintl n,m,t,p;\nvector<intl> d,c,x,y;\n\n\nvoid input_var(){\n cin >> n >> m >> t >> p;\n if (n == 0 && m == 0 && t == 0 && p == 0) exit(0);\n rep(i, t) {\n cin >> d[i] >> c[i];\n }\n rep(i, p) {\n cin >> x[i] >> y[i];\n }\n}\n//-------------------------------------------------------------------------------\n\nvoid solve(){\n intl left = 0;\n intl right = n;\n intl top = 0;\n intl bottom = m;\n vector<vector<intl>> kasanari(100 * m + 1, vector<intl>(100 * n + 1, 0));\n rep(i,m)rep(j,n)kasanari[i][j] = 1;\n /*rep(j,m) {\n rep(k,n)cout << kasanari[j][k] << \" \";\n cout << endl;\n }*/\n rep(i, t) {\n //cout << d[i] << c[i] << \" \" << top << \" \" << left << endl;\n if (d[i] == 1) {\n for (intl j = 0; j < c[i]; j++) {\n for (intl k = top; k < bottom; k++) {\n kasanari[k][left + 2 * c[i] - j - 1] += kasanari[k][left + j];\n kasanari[k][left + j] = 0;\n }\n }\n right = max(left + 2 * c[i], right);\n left += c[i];\n }\n else {\n for (intl j = 0; j < c[i]; j++) {\n for (intl k = left; k < right; k++) {\n kasanari[top + 2 * c[i] - j - 1][k] += kasanari[top + j][k];\n kasanari[top + j][k] = 0;\n }\n }\n bottom += max(top + 2 * c[i], bottom);\n top += c[i];\n }\n /*rep(j,2*m+1) {\n rep(k,2*n+1)cout << kasanari[j][k] << \" \";\n cout << endl;\n }*/\n }\n rep(i, p) {\n //cout << bottom << \" \" << x[i] << \" \" << left << \" \" << y[i] << endl; \n cout << kasanari[y[i]+top][x[i]+left] << endl;\n }\n}\n\nsigned main(){\n cout << fixed << setprecision(10);\n\n d.resize(21);\n c.resize(21);\n x.resize(21);\n y.resize(21);\n while (true) {\n input_var();\n solve();\n }\n return 0;\n}","accuracy":1,"time_ms":420,"memory_kb":83340,"score_of_the_acc":-1.1258,"final_rank":19},{"submission_id":"aoj_1625_9408012","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n int n,m,t,p;\n int d,c,x,y;\n int cum,cun;\n int ans;\n while(1){\n cin>>n>>m>>t>>p;\n ans=0;\n if(n+m+t+p==0){\n break;\n }\n vector<vector<int>> paper(1500,vector<int>(1500,0)); //横、高さの順\n for(int i=0;i<n;i++){\n for(int j=0;j<m;j++){\n paper.at(j).at(i)=1;\n }\n }\n cun=0;\n cum=0;\n for(int i=0;i<t;i++){\n cin>>d>>c;\n if(d==1){\n for(int j=cum;j<m;j++){\n for(int k=cun+c,l=1;k<cun+2*c;k++,l+=2){\n paper.at(j).at(k)+=paper.at(j).at(k-l);\n }\n }\n cun+=c;\n n+=max(0,cun-n+c);\n }\n else if(d==2){\n for(int j=cum+c,l=1;j<cum+2*c;j++,l+=2){\n for(int k=cun;k<n;k++){\n paper.at(j).at(k)+=paper.at(j-l).at(k);\n }\n }\n cum+=c;\n m+=max(0,cum-m+c);\n }\n }\n ans=0;\n for(int i=0;i<p;i++){\n cin>>x>>y;\n cout<<paper.at(cum+y).at(cun+x)<<endl;\n }\n }\n}","accuracy":1,"time_ms":1760,"memory_kb":11968,"score_of_the_acc":-0.6455,"final_rank":17},{"submission_id":"aoj_1625_9407864","code_snippet":"//#include <atcoder/all>\n#include <bits/stdc++.h>\n#define rep(i, a, b) for (int i = a; i < b; i++)\n#define rrep(i, a, b) for (int i = a - 1; i >= b; i--)\n#define ll long long\n#define ull unsigned long long\n#define graph vector<vector<int>>\nusing namespace std;\n//using namespace atcoder;\n\nint mod=998244353;\nvector<int> dx={1,0,-1,0},dy={0,1,0,-1};\n\nint main(){\n while(1){\n int n,m,t,p; cin>>n>>m>>t>>p;\n if(n==0) break;\n\n vector<vector<ll>> grid(650,vector<ll>(650));\n rep(i,0,n){\n rep(j,0,m){\n grid[i][j]=1;\n }\n }\n\n int l=0,u=0;\n\n rep(i,0,t){\n int d,c; cin>>d>>c;\n if(d==1){\n l += c;\n rep(ii,u,u+m){\n rep(j,0,c){\n grid[l+j][ii] += grid[l-j-1][ii];\n grid[l-j-1][ii]=0;\n }\n }\n }\n\n else{\n u += c;\n rep(ii,l,l+n){\n rep(j,0,c){\n grid[ii][u+j] += grid[ii][u-j-1];\n grid[ii][u-j-1]=0;\n }\n }\n }\n }\n\n rep(i,0,p){\n int x,y; cin>>x>>y;\n cout << grid[x+l][y+u] << endl;\n }\n }\n \n}","accuracy":1,"time_ms":630,"memory_kb":6556,"score_of_the_acc":-0.2313,"final_rank":15},{"submission_id":"aoj_1625_9407583","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\n#define all(A) A.begin(),A.end()\n#define ALL(A) A.begin(),A.end()\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\ntemplate<class T>\nbool chmax(T& p, T q, bool C = 1) {\n if (C == 0 && p == q) {\n return 1;\n }\n if (p < q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\n\ntemplate<class T>\nbool chmin(T& p, T q, bool C = 1) {\n if (C == 0 && p == q) {\n return 1;\n }\n if (p > q) {\n p = q;\n return 1;\n }\n else {\n return 0;\n }\n}\n\n\n\nvoid solve(ll N, ll M, ll T, ll P) {\n swap(N, M);\n vector<vll> D(N * 100, vll(M * 100, 0));\n rep(i, N)rep(j, M)D[i][j] = 1;\n rep(t, T) {\n ll d, c;\n cin >> d >> c;\n\n if (d == 1) {\n ll L = 1e18;\n rep(j, M * 100)rep(i, N * 100) {\n if (D[i][j] > 0) {\n L = min(L, j);\n break;\n }\n }\n for (ll j = L; j <= L + c - 1; j++) {\n rep(i, N * 100) {\n ll ds = L + c - j;\n D[i][L + c - 1 + ds] += D[i][j];\n D[i][j] = 0;\n }\n }\n }\n else {\n ll W = 1e18;\n rep(i, N * 100)rep(j, M * 100) {\n //if (W >= 0)break;\n if (D[i][j] > 0) {\n W = min(W, i);\n break;\n }\n }\n for (ll i = W; i <= W + c - 1; i++) {\n rep(j, M * 100) {\n ll ds = W + c - i;\n D[W + c - 1 + ds][j] += D[i][j];\n D[i][j] = 0;\n }\n }\n }\n }\n ll L = 1e18, W = 1e18;\n rep(i, N * 100)rep(j, M * 100) {\n if (D[i][j] > 0) {\n W = min(W, i);\n L = min(L, j);\n }\n }\n ll an = 0;\n rep(p, P) {\n ll X, Y;\n cin >> X >> Y;\n cout << D[Y + W][X + L] << endl;\n }\n}\n\n\nint main() {\n\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n\n ll N, M, T, P;\n while (cin >> N >> M >> T >> P, N != 0)solve(N, M, T, P);\n\n}","accuracy":1,"time_ms":3270,"memory_kb":83300,"score_of_the_acc":-1.9995,"final_rank":20},{"submission_id":"aoj_1625_9375390","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nvoid solve(int n, int m, int t, int p){\n vector<int> d(t), c(t);\n for(int i = 0; i < t; i++){\n cin >> d[i] >> c[i];\n }\n vector<int> x(p), y(p);\n for(int i = 0; i < p; i++){\n cin >> x[i] >> y[i];\n }\n \n // 動的にメモリを確保\n vector<vector<int>> paper(n * n, vector<int>(m * m, 0));\n for(int i = 0; i < n; i++){\n for(int j = 0; j < m; j++){\n paper[i][j] = 1;\n }\n }\n \n int delx = 0, dely = 0;\n int widx = n, widy = m;\n\n for(int i = 0; i < t; i++){\n if(d[i] == 1){\n for(int j = dely; j < dely + widy; j++){\n for(int k = delx; k < delx + c[i]; k++){\n paper[2 * (delx + c[i]) - 1 - k][j] += paper[k][j];\n }\n }\n delx += c[i];\n if(c[i] * 2 < widx) widx -= c[i];\n else widx = c[i];\n }\n else if(d[i] == 2){\n for(int j = delx; j < delx + widx; j++){\n for(int k = dely; k < dely + c[i]; k++){\n paper[j][2 * (dely + c[i]) - 1 - k] += paper[j][k];\n }\n }\n dely += c[i];\n if(c[i] * 2 < widy) widy -= c[i];\n else widy = c[i];\n }\n }\n\n for(int i = 0; i < p; i++){\n // 範囲外アクセスを防ぐためのチェック\n if (delx + x[i] < n * n && dely + y[i] < m * m) {\n cout << paper[delx + x[i]][dely + y[i]] << endl;\n } \n //else {\n // cout << \"Out of bounds\" << endl;\n //}\n }\n}\n\nint main() {\n while(true){\n int n, m, t, p;\n cin >> n >> m >> t >> p;\n if(n == 0) break;\n solve(n, m, t, p);\n }\n //return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":7344,"score_of_the_acc":-0.051,"final_rank":6},{"submission_id":"aoj_1625_9375327","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nvoid solve(int n, int m, int t, int p){\n vector<int> d(t), c(t);\n for(int i = 0; i < t; i++){\n cin >> d[i] >> c[i];\n }\n vector<int> x(p), y(p);\n for(int i = 0; i < p; i++){\n cin >> x[i] >> y[i];\n }\n \n // 動的にメモリを確保\n vector<vector<int>> paper(n * n, vector<int>(m * m, 0));\n for(int i = 0; i < n; i++){\n for(int j = 0; j < m; j++){\n paper[i][j] = 1;\n }\n }\n \n int delx = 0, dely = 0;\n int widx = n, widy = m;\n\n for(int i = 0; i < t; i++){\n if(d[i] == 1){\n for(int j = dely; j < dely + widy; j++){\n for(int k = delx; k < delx + c[i]; k++){\n paper[2 * (delx + c[i]) - 1 - k][j] += paper[k][j];\n }\n }\n delx += c[i];\n if(c[i] * 2 < widx) widx -= c[i];\n else widx = c[i];\n }\n else if(d[i] == 2){\n for(int j = delx; j < delx + widx; j++){\n for(int k = dely; k < dely + c[i]; k++){\n paper[j][2 * (dely + c[i]) - 1 - k] += paper[j][k];\n }\n }\n dely += c[i];\n if(c[i] * 2 < widy) widy -= c[i];\n else widy = c[i];\n }\n }\n\n for(int i = 0; i < p; i++){\n // 範囲外アクセスを防ぐためのチェック\n if (delx + x[i] < n * n && dely + y[i] < m * m) {\n cout << paper[delx + x[i]][dely + y[i]] << endl;\n } else {\n cout << \"Out of bounds\" << endl;\n }\n }\n}\n\nint main() {\n while(true){\n int n, m, t, p;\n cin >> n >> m >> t >> p;\n if(n == 0) break;\n solve(n, m, t, p);\n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":7128,"score_of_the_acc":-0.0513,"final_rank":7},{"submission_id":"aoj_1625_9346986","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#ifdef LOCAL\n #include \"settings/debug.cpp\"\n #define _GLIBCXX_DEBUG\n#else\n #define Debug(...) void(0)\n#endif\n#define rep(i, n) for (int i = 0; i < (n); ++i)\nusing ll = long long;\nusing ull = unsigned long long;\n\nint main() {\n while (true) {\n ll n, m, t, p;\n cin >> m >> n >> t >> p;\n if (n == 0 && m == 0 && t == 0 && p == 0) {\n break;\n }\n ll left = 0, bottom = 30 * n - 1;\n vector<vector<ll>> cnt(30 * n, vector<ll>(30 * m, 0));\n rep(i, n) rep(j, m) cnt[30 * n - 1 - i][j] = 1;\n rep(i, t) {\n ll d, c;\n cin >> d >> c;\n if (d == 1) {\n rep(i, c) {\n ll now_x = bottom, now_y = left + i;\n while (true) {\n if (cnt[now_x][now_y] == 0) {\n break;\n }\n cnt[now_x][left + 2 * c - 1 - i] += cnt[now_x][now_y];\n now_x--;\n // cerr << now_x << \" \" << now_y << endl;\n }\n }\n left += c;\n }\n else {\n rep(i, c) {\n ll now_x = bottom - i, now_y = left;\n while (true) {\n if (cnt[now_x][now_y] == 0) {\n break;\n }\n cnt[bottom - (2 * c - 1 - i)][now_y] += cnt[now_x][now_y];\n now_y++;\n // cerr << \"now: \" << now_x << \" \" << now_y << endl;\n }\n }\n bottom -= c;\n }\n // rep(i, n) {\n // rep(j, m) {\n // cerr << cnt[bottom - i][left + j] << \" \";\n // }\n // cerr << endl;\n // }\n // cerr << endl;\n }\n rep(i, p) {\n ll x, y;\n cin >> y >> x;\n cout << cnt[bottom - x][left + y] << endl;\n }\n }\n return 0;\n}","accuracy":1,"time_ms":30,"memory_kb":10476,"score_of_the_acc":-0.0962,"final_rank":11},{"submission_id":"aoj_1625_9335785","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing P = pair<ll, ll>;\n#define rep(i, a, b) for(ll i = a; i < b; ++i)\n#define rrep(i, a, b) for(ll i = a; i >= b; --i)\nconstexpr ll inf = 4e18;\nstruct SetupIO {\n SetupIO() {\n ios::sync_with_stdio(0);\n cin.tie(0);\n cout << fixed << setprecision(30);\n }\n} setup_io;\n\nll D = 100;\nvector<vector<ll>> rot(vector<vector<ll>> tab) {\n vector<vector<ll>> rot_tab(D * 3);\n rep(i,0,D * 3){\n rot_tab[i].resize(D * 3, 0);\n }\n rep(i,0,D * 3){\n rep(j,0,D * 3){\n rot_tab[i][j] = tab[j][i];\n }\n }\n return rot_tab;\n}\nbool valid(ll i, ll j){\n return (0 <= i) && (i < D * 3) && (0 <= j) && (j < D * 3);\n}\nvector<vector<ll>> oru(vector<vector<ll>> tab, ll c) {\n vector<vector<ll>> new_tab(D * 3);\n rep(i,0,D * 3){\n new_tab[i].resize(D * 3, 0);\n }\n\n rep(i,0,D * 3){\n rep(j,0,D * 3){\n if(j < D + c) {\n continue;\n }\n ll j2 = (D+c) + (D+c-1) - j;\n if (!valid(i, j2)) {\n continue;\n }\n new_tab[i][j] = tab[i][j] + tab[i][(D+c) + (D+c-1) - j];\n }\n }\n return new_tab;\n}\nvector<vector<ll>> hidariue(vector<vector<ll>> tab) {\n // 左上が(D, D)に来るように\n vector<vector<ll>> new_tab(D * 3);\n rep(i,0,D * 3){\n new_tab[i].resize(D * 3, 0);\n }\n\n ll min_i = inf;\n ll min_j = inf;\n rep(i,0,D * 3){\n rep(j,0,D * 3){\n if(tab[i][j] > 0) {\n min_i = min(min_i, i);\n min_j = min(min_j, j);\n }\n }\n }\n\n rep(i,0,D * 3){\n rep(j,0,D * 3){\n if (valid(i + (min_i - D), j + (min_j - D))) {\n new_tab[i][j] = tab[i + (min_i - D)][j + (min_j - D)];\n }\n }\n }\n\n return new_tab;\n}\n// void output(vector<vector<ll>> tab) {\n// cerr << \"\\n\";\n// rep(i,0,D * 3) {\n// rep(j,0,D * 3) {\n// cerr << tab[i][j];\n// }\n// cerr << \"\\n\";\n// }\n// cerr << \"\\n\";\n// }\n\nint main(void) {\n while(true){\n ll n,m,t,p;cin>>n>>m>>t>>p;\n if (n == 0) break;\n vector<vector<ll>> tab(D * 3);\n rep(i,0,D * 3){\n tab[i].resize(D * 3, 0);\n }\n rep(i,D,D+m){\n rep(j,D,D+n){\n tab[i][j] = 1;\n }\n }\n rep(i,0,t){\n ll d,c;cin>>d>>c;\n if (d == 2) {\n tab = rot(tab);\n }\n tab = oru(tab, c);\n if (d == 2) {\n tab = rot(tab);\n }\n tab = hidariue(tab);\n }\n rep(i,0,p){\n ll x, y;cin>>x>>y;\n cout << tab[D + y][D + x] << \"\\n\";\n }\n }\n}","accuracy":1,"time_ms":2340,"memory_kb":5280,"score_of_the_acc":-0.7399,"final_rank":18},{"submission_id":"aoj_1625_9322405","code_snippet":"#include <iostream>\n#include <vector>\n#include <set>\n#include <map>\n#include <deque>\n#include <algorithm>\n#include <assert.h>\n\nusing std::cin, std::cout, std::vector, std::string, std::pair;\n\n#define rep(i, n) for (int i = 0; i < (n); ++i)\n\ntemplate <typename T>\nvoid print_vector(const vector<T> &vec, const string &splitter = \" \") {\n for (int i = 0; i < vec.size(); ++i) {\n cout << vec[i];\n if (i == vec.size() - 1) cout << \"\\n\";\n else cout << splitter;\n }\n}\n\n\n// s = (2b - n^2 + 1)/2n\n\nint main() {\n int w, h, t, p;\n\n while (cin >> w >> h >> t >> p, w) {\n vector pos(h, vector<pair<int, int>>(w));\n std::multimap<pair<int, int>, pair<int, int>> map;\n for (int i = 0; i < h; ++i) {\n for (int j = 0; j < w; ++j) {\n pos[i][j] = {i, j};\n map.emplace(pair {i, j}, pair {i, j});\n }\n }\n\n int left_x = 0, right_x = w, bottom_y = 0, top_y = h;\n rep(q, t) {\n int d, c; cin >> d >> c;\n\n if (d == 1) {\n for (int y = bottom_y; y < top_y; ++y) {\n for (int xd = 0; xd < c; ++xd) {\n int x = left_x + c - xd - 1;\n auto rng = map.equal_range({y, x});\n int nxt_x = left_x + c + xd;\n for (auto iter = rng.first; iter != rng.second; ++iter) {\n auto [i, j] = iter->second;\n pos[i][j] = { y, nxt_x };\n map.emplace(pair { y, nxt_x }, pair { i, j });\n }\n map.erase({ y, x });\n }\n }\n\n left_x += c;\n if (left_x + c >= right_x) {\n right_x = left_x + c;\n }\n } else {\n for (int yd = 0; yd < c; ++yd) {\n int y = bottom_y + c - yd - 1;\n int nxt_y = bottom_y + c + yd;\n for (int x = left_x; x < right_x; ++x) {\n auto rng = map.equal_range({ y, x });\n for (auto iter = rng.first; iter != rng.second; ++iter) {\n auto [i, j] = iter->second;\n pos[i][j] = { nxt_y, x };\n map.emplace(pair { nxt_y, x }, pair { i, j });\n }\n map.erase({ y, x });\n }\n }\n\n bottom_y += c;\n if (bottom_y + c >= top_y) {\n top_y = bottom_y + c;\n }\n }\n }\n\n// int ans = 0;\n rep(q, p) {\n int x, y; cin >> x >> y;\n int tmp = map.count({ y + bottom_y, x + left_x });\n// ans += tmp;\n cout << tmp << std::endl;\n// std::cerr << tmp << \"\\n\";\n }\n// cout << ans << std::endl;\n// std::cerr << std::endl;\n }\n\n}","accuracy":1,"time_ms":10,"memory_kb":3308,"score_of_the_acc":-0.0005,"final_rank":1},{"submission_id":"aoj_1625_9309965","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef long double ld;\n#define rep(i, n) for(ll i = 0; i < (n); i++)\n#define reps(i, l, r) for(ll i = (l); i < (r); i++)\n#define all(a) (a).begin(), (a).end()\n#define endl \"\\n\";\nconst ll INF = 2e18;\nconst ll mod1 = 1000000007;\nconst ll mod2 = 998244353;\nll dx[4] = {-1, 0, 1, 0};\nll dy[4] = {0, -1, 0, 1};\n\nvoid solve() {\n ll N, M, T, P; cin >> N >> M >> T >> P;\n while (N != 0 || M != 0 || T != 0 || P != 0) {\n vector<vector<ll>>A(N*N, vector<ll>(M*M, 0));\n rep(i, N) rep(j, M) A[i][j] = 1;\n ll u = 0, l = 0, up = N, lp = M;\n while (T--) {\n ll d, c; cin >> d >> c;\n if (d == 1) {\n ll nu = u + 2 * c - 1;\n up = max(up, nu + 1);\n while (1) {\n reps(i, l, lp) {A[nu][i] += A[u][i];}\n if (u + 1 == nu) break;\n u++; nu--;\n }\n u = nu;\n }\n else {\n ll nl = l + 2 * c - 1;\n lp = max(lp, nl + 1);\n while (1) {\n reps(i, u, up) {A[i][nl] += A[i][l];}\n if (l + 1 == nl) break;\n l++; nl--;\n }\n l = nl;\n }\n }\n while (P--) {\n ll x, y; cin >> x >> y;\n x += u; y += l;\n cout << A[x][y] << endl;\n }\n cin >> N >> M >> T >> P;\n }\n}\nsigned main() {\n ll T = 1; //cin >> T;\n while (T--) solve();\n}","accuracy":1,"time_ms":30,"memory_kb":11172,"score_of_the_acc":-0.1049,"final_rank":13},{"submission_id":"aoj_1625_9223352","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nint A[200][200];\n\nint main(){\n int n,m,t,p;\n while(1){\n cin>>n>>m>>t>>p;\n if(n==0&&m==0&&t==0&&p==0)break;\n\n for(int i=0;i<200;i++)\n for(int j=0;j<200;j++)\n A[i][j]=0;\n \n for(int i=0;i<m;i++)\n for(int j=0;j<n;j++)\n A[i][j]=1;\n \n for(int u=0;u<t;u++){\n int d,c;\n cin>>d>>c;\n if(d==1){\n \n for(int i=0;i<m;i++){\n for(int j=0;j<c;j++){\n int dist=c-j;\n A[i][c+dist-1]+=A[i][j];\n A[i][j]=0;\n }\n }\n\n for(int i=0;i<100;i++){\n for(int j=0;j<100;j++){\n A[i][j]=A[i][j+c];\n }\n }\n \n }else{\n \n for(int i=0;i<c;i++){\n for(int j=0;j<n;j++){\n int dist=c-i;\n A[c+dist-1][j]+=A[i][j];\n A[i][j]=0;\n }\n }\n\n for(int i=0;i<100;i++){\n for(int j=0;j<100;j++){\n A[i][j]=A[i+c][j];\n }\n }\n \n }\n \n }\n \n for(int i=0;i<p;i++){\n int x,y;\n cin>>x>>y;\n cout<<A[y][x]<<endl;\n }\n \n }\n return 0;\n}","accuracy":1,"time_ms":20,"memory_kb":3264,"score_of_the_acc":-0.0031,"final_rank":2},{"submission_id":"aoj_1625_8856207","code_snippet":"#include <bits/stdc++.h>\n\nint solve() {\n int m, n, t, p;\n std::cin >> m >> n >> t >> p;\n if (n == 0) return 1;\n const int N = 1000;\n std::vector count(N, std::vector<int>(N));\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n count[i][j] = 1;\n }\n }\n int left = 0;\n int low = 0;\n while (t--) {\n int d, c;\n std::cin >> d >> c;\n if (d == 1) {\n int right = left + 2 * c;\n for (int i = low; i < N; i++) {\n for (int j = 0; j < c; j++) {\n count[i][right - 1 - j] += count[i][left + j];\n }\n }\n left += c;\n } else {\n int up = low + 2 * c;\n for (int i = 0; i < c; i++) {\n for (int j = left; j < N; j++) {\n count[up - 1 - i][j] += count[low + i][j];\n }\n }\n low += c;\n }\n // for (int i = 0; i < 2 * n; i++) {\n // for (int j = 0; j < 2 * m; j++) {\n // std::cerr << count[i][j] << ' ';\n // }\n // std::cerr << std::endl;\n // }\n // std::cerr << \"-----------\" << std::endl;\n }\n\n while (p--) {\n int x, y;\n std::cin >> x >> y;\n std::cout << count[low + y][left + x] << '\\n';\n }\n return 0;\n}\n\nint main() {\n while (!solve());\n}","accuracy":1,"time_ms":90,"memory_kb":7076,"score_of_the_acc":-0.0721,"final_rank":8},{"submission_id":"aoj_1625_8011346","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nint N, M, T, P;\nlong long A[1050][1050];\nint D[30], C[30];\nint X[30], Y[30];\nvector<long long> Ans;\n\nint main() {\n while (true) {\n cin >> M >> N >> T >> P;\n if (N == 0 && M == 0 && T == 0 && P == 0) {\n break;\n }\n int lef = 0, dow = 0;\n for (int i = 0; i < 1050; i++) {\n for (int j = 0; j < 1050; j++) {\n A[i][j] = 0;\n }\n }\n for (int i = 0; i < N; i++) {\n for (int j = 0; j < M; j++) {\n A[i][j] = 1;\n }\n }\n for (int i = 0; i < T; i++) {\n cin >> D[i] >> C[i];\n }\n for (int i = 0; i < P; i++) {\n cin >> Y[i] >> X[i];\n }\n for (int i = 0; i < T; i++) {\n if (D[i] == 1) {\n for (int j = 0; j < C[i]; j++) {\n for (int k = dow; k < 1050; k++) {\n int ll = C[i] + lef - 1 - j;\n int rr = j + C[i] + lef;\n A[k][rr] += A[k][ll];\n }\n }\n lef += C[i];\n } else {\n for (int j = 0; j < C[i]; j++) {\n for (int k = lef; k < 1050; k++) {\n int dd = dow + C[i] - 1 - j;\n int uu = j + C[i] + dow;\n A[uu][k] += A[dd][k];\n }\n }\n dow += C[i];\n }\n }\n for (int i = 0; i < P; i++) {\n Ans.push_back(A[X[i] + dow][Y[i] + lef]);\n }\n }\n for (auto x : Ans) {\n cout << x << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":220,"memory_kb":11988,"score_of_the_acc":-0.1734,"final_rank":14},{"submission_id":"aoj_1625_8001380","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define rep(i,n) for(long long i = 0;i < (long long)(n);i++)\n\nmap<pair<ll,ll>,ll> f(map<pair<ll,ll>,ll> mp){\n //0,0の調整\n ll mi_n = 1LL << 60;\n ll mi_m = 1LL << 60;\n for(auto &q:mp){\n if(q.second == 0)continue;\n auto [x,y] = q.first;\n if(x < mi_n){\n mi_n = x;\n }\n if(y < mi_m){\n mi_m = y;\n }\n }\n\n map<pair<ll,ll>,ll> ret;\n for(auto &q:mp){\n if(q.second == 0)continue;\n auto [x,y] = q.first;\n ret[{x- mi_n,y - mi_m}] = q.second;\n }\n return ret;\n\n \n}\n\nint main(){\n while(true){\n ll n,m,t,p;cin >> n >> m >> t >> p;\n if(n == 0 && m == 0 && t == 0 && p == 0){\n break;\n }\n map<pair<ll,ll>,ll> mp;\n // vector<vector<pair<ll,ll>>> g(n,vector<pair<ll,ll>>(m));\n rep(i,n){\n rep(j,m){\n mp[{i,j}] = 1;\n }\n }\n\n //おる\n rep(z,t){\n ll d,c;cin >> d >> c;\n map<pair<ll,ll>,ll> tmp_mp;\n if(d == 1){\n for(auto &q:mp){\n auto[x,y] = q.first;\n if(x <c){\n tmp_mp[{c+(c-x-1),y}] += q.second;\n q.second = 0;\n }\n }\n }else{\n for(auto &q:mp){\n auto[x,y] = q.first;\n if(y <c){\n tmp_mp[{x,c+(c-y- 1)}] += q.second;\n q.second = 0;\n }\n }\n }\n for(auto &q:tmp_mp){\n mp[q.first] += q.second;\n }\n mp = f(mp);\n\n }\n\n rep(z,p){\n ll x,y;cin >> x >> y;\n if(mp.count({x,y})){\n cout << mp[{x,y}] << endl;\n }else{\n //ないけど\n cout << 0 << endl;\n }\n }\n\n \n }\n}","accuracy":1,"time_ms":10,"memory_kb":3712,"score_of_the_acc":-0.0056,"final_rank":4}],"string":"[\n {\n \"submission_id\": \"aoj_1625_10854025\",\n \"code_snippet\": \"#include <iostream>\\n#include <cstring>\\n#define ll long long\\n#define N 100000\\n\\nusing namespace std;\\n\\nint g[600][600], dx, dy;\\n\\nint main(void) {\\n#ifdef _DEBUG\\n\\tfreopen(\\\"1.in\\\", \\\"r\\\", stdin);\\n#else \\n\\tios::sync_with_stdio(0); cin.tie(0); cout.tie(0);\\n#endif\\n\\tint n, m, t, p;\\n\\twhile (cin >> n >> m >> t >> p, n) {\\n\\t\\tdx = dy = 0;\\n\\t\\tmemset(g, 0, sizeof(g));\\n\\t\\tfor (int i = 0; i != n; ++i) for (int j = 0; j != m; ++j) g[i][j] = 1;\\n\\t\\twhile (t--) { \\n\\t\\t\\tint d, c; cin >> d >> c;\\n\\t\\t\\tif (d == 1) {\\n\\t\\t\\t\\tfor (int i = 0; i != c; ++i)\\n\\t\\t\\t\\t\\tfor (int j = 0; j != m - dy; ++j)\\n\\t\\t\\t\\t\\t\\tg[dx + c + i][dy + j] += g[dx + c - i - 1][dy + j];\\n\\t\\t\\t\\tdx += c;\\n\\t\\t\\t\\tif (n < dx + 2 * c) n = dx + 2 * c;\\n\\t\\t\\t}\\n\\t\\t\\telse if (d == 2) {\\n\\t\\t\\t\\tfor (int j = 0; j != c; ++j)\\n\\t\\t\\t\\t\\tfor (int i = 0; i != n - dx; ++i)\\n\\t\\t\\t\\t\\t\\tg[dx + i][dy + c + j] += g[dx + i][dy + c - j - 1];\\n\\t\\t\\t\\tdy += c;\\n\\t\\t\\t\\tif (m < dy + 2 * c) m = dy + 2 * c;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\twhile (p--) {\\n\\t\\t\\tint x, y; cin >> x >> y;\\n\\t\\t\\tcout << g[dx + x][dy + y] << endl;\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 4784,\n \"score_of_the_acc\": -0.022,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1625_10625671\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\n#define rep(i,a,b) for(int i=a;i<b;i++)\\n#define rrep(i,a,b) for(int i=a;i>=b;i--)\\n#define fore(i,a) for(auto &i:a)\\n#define all(x) (x).begin(),(x).end()\\nusing namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }\\ntypedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;\\ntemplate<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }\\ntemplate<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }\\n//---------------------------------------------------------------------------------------------------\\n/*---------------------------------------------------------------------------------------------------\\n ∧＿∧ \\n ∧＿∧ （´<_｀ ） Welcome to My Coding Space!\\n （ ´_ゝ`） / ⌒i \\n ／ ＼ | | \\n / /￣￣￣￣/ | \\n ＿_(__ﾆつ/ ＿/ .| .|＿＿＿＿ \\n ＼/＿＿＿＿/ （u ⊃ \\n---------------------------------------------------------------------------------------------------*/\\n\\n\\n\\n\\nint W, H, T, P;\\nint A[2][101][101];\\n//---------------------------------------------------------------------------------------------------\\nvoid _main() {\\n while (cin >> W >> H >> T >> P) {\\n if (W == 0) return;\\n \\n rep(t, 0, 2) rep(y, 0, 101) rep(x, 0, 101) A[t][y][x] = 0;\\n rep(y, 0, H) rep(x, 0, W) A[0][y][x] = 1;\\n\\n rep(t, 0, T) {\\n int d, c; cin >> d >> c;\\n rep(y, 0, 101) rep(x, 0, 101) A[(t + 1) % 2][y][x] = 0;\\n\\n if (d == 1) {\\n rep(y, 0, H) rep(x, 0, W) A[(t + 1) % 2][y][x] = A[t % 2][y][x + c];\\n rep(x, 0, c) rep(y, 0, H) A[(t + 1) % 2][y][x] += A[t % 2][y][c - 1 - x];\\n } else {\\n rep(y, 0, H) rep(x, 0, W) A[(t + 1) % 2][y][x] = A[t % 2][y + c][x];\\n rep(x, 0, W) rep(y, 0, c) A[(t + 1) % 2][y][x] += A[t % 2][c - 1 - y][x];\\n }\\n }\\n\\n rep(p, 0, P) {\\n int x, y; cin >> x >> y;\\n printf(\\\"%d\\\\n\\\", A[T % 2][y][x]);\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3576,\n \"score_of_the_acc\": -0.0039,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1625_10617810\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing a2 = array<ll, 2>;\\nusing a3 = array<ll, 3>;\\n\\ntemplate <typename A> void chmin(A &l, const A &r) {\\n if(r < l)\\n l = r;\\n}\\ntemplate <typename A> void chmax(A &l, const A &r) {\\n if(l < r)\\n l = r;\\n}\\n\\nll mod = 998244353;\\n\\nvoid init() {}\\n\\nll w, h, t, p;\\nvoid input() { cin >> w >> h >> t >> p; }\\nvoid solve() {\\n vector<vector<ll>> v(1000, vector<ll>(1000, 0));\\n ll th = 0, tw = 0, bh = h, bw = w;\\n\\n for(int i = 0; i < h; i++)\\n for(int j = 0; j < w; j++)\\n v[i][j] = 1;\\n\\n for(int i = 0; i < t; i++) {\\n ll a, b;\\n cin >> a >> b;\\n if(a == 1) {\\n for(int j = th; j < bh; j++) {\\n for(int k = tw; k < tw + b; k++) {\\n ll diff = 2 * (tw + b - k) - 1;\\n v[j][k + diff] += v[j][k];\\n chmax(bw, (ll)(k+diff+1));\\n }\\n }\\n tw += b;\\n } else {\\n for(int j = th; j < th + b; j++) {\\n for(int k = tw; k < bw; k++) {\\n ll diff = 2 * (th + b - j) - 1;\\n v[j+diff][k] += v[j][k];\\n chmax(bh, (ll)(j+diff+1));\\n }\\n }\\n th += b;\\n }\\n }\\n\\n for(int i = 0; i < p; i++) {\\n ll a, b;\\n cin >> a >> b;\\n cout << v[th + b][tw + a] << endl;\\n }\\n}\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n\\n // init();\\n while(1) {\\n input();\\n if(w == 0)\\n break;\\n solve();\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1570,\n \"memory_kb\": 11052,\n \"score_of_the_acc\": -0.5758,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1625_10542589\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#include <atcoder/all>\\nusing namespace std;\\nusing namespace atcoder;\\n#define int long long\\n\\nvoid solve(int n, int m, int t, int p) {\\n int k = 30;\\n vector<vector<int>> paper(m*k, vector<int>(n*k, 0));\\n for (int i=0; i<m; ++i) {\\n for (int j=0; j<n; ++j) {\\n paper[m*k-i-1][j] = 1;\\n }\\n }\\n\\n int left = 0, low = m*k-1;\\n for (;t--;) {\\n int d, c;\\n cin >> d >> c;\\n if (d == 1) {\\n //縦軸で折り返す\\n for (int i=0; i<=low; ++i) {\\n for (int j=0; j<c; ++j) {\\n //left left+1 left+2 | left+6-2-1\\n //left | left+2-0-1\\n //paper[i][j]をpaper[i][left+2c-j-1]に加算\\n paper[i][left+2*c-j-1] += paper[i][left+j];\\n paper[i][left+j] = 0;\\n }\\n }\\n left += c;\\n } else {\\n //横軸で折り返す\\n for (int i=0; i<c; ++i) {\\n for (int j=left; j<n*k; ++j) {\\n //low low-1 low-2 | low-6+2+1 low-6+1+1 low-6+0+1\\n paper[low-2*c+i+1][j] += paper[low-i][j];\\n paper[low-i][j] = 0;\\n }\\n }\\n low -= c;\\n }\\n // for (int _=0; _<10; ++_) cout << \\\"=\\\";\\n // cout << \\\"here~~\\\" << \\\"\\\\n\\\";\\n // cout << \\\"left low \\\" << left << ' ' << low << endl;\\n // for (int i=0; i<m; ++i) {\\n // for (int j=0; j<n; ++j) {\\n // cout << paper[i][j] << ' ';\\n // }\\n // cout << endl;\\n // }\\n // for (auto _x: paper) {\\n // for (auto __x: _x) {\\n // cout << __x << ' ';\\n // }\\n // cout << endl;\\n // }\\n }\\n\\n for (;p--;) {\\n int x, y;\\n cin >> x >> y;\\n cout << paper[low-y][left+x] << endl;\\n }\\n}\\n\\nsigned main() {\\n while(true) {\\n int n, m, t, p;\\n cin >> n >> m >> t >> p;\\n if (n+m+t+p == 0) break;\\n solve(n, m, t, p);\\n }\\n}\\n\\n/*\\nmemo\\n\\n\\n2 1 1 1\\n1 1\\n0 0\\n\\n1 3 2 1\\n2 1\\n2 1\\n0 0\\n10 8 3 2\\n2 2\\n1 3\\n1 1\\n0 1\\n3 4\\n\\n\\n3 3 3 2\\n1 2\\n2 1\\n1 1\\n0 1\\n0 0\\n0 0 0 0\\n\\n\\n*/\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 10668,\n \"score_of_the_acc\": -0.0955,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1625_10542460\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef int ll;\\ntypedef unsigned long long ull;\\ntypedef long double ld;\\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\\n#define rrep(i,start,end) for (ll i = start;i >= (ll)(end);i--)\\n#define repn(i,end) for(ll i = 0; i <= (ll)(end); i++)\\n#define reps(i,start,end) for(ll i = start; i < (ll)(end); i++)\\n#define repsn(i,start,end) for(ll i = start; i <= (ll)(end); i++)\\n#define each(p,a) for(auto &p:a)\\ntypedef vector<ll> vll;\\ntypedef vector<pair<ll ,ll>> vpll;\\ntypedef vector<vector<ll>> vvll;\\ntypedef set<ll> sll;\\ntypedef map<ll , ll> mpll;\\ntypedef pair<ll ,ll> pll;\\ntypedef tuple<ll , ll , ll> tpl3;\\n#define LL(...) ll __VA_ARGS__; input(__VA_ARGS__)\\n#define LD(...) ld __VA_ARGS__; input(__VA_ARGS__)\\n#define Str(...) string __VA_ARGS__; input(__VA_ARGS__)\\n#define Ch(...) char __VA_ARGS__; input(__VA_ARGS__)\\n#define all(a) (a).begin(),(a).end()\\n#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );\\n#define sz(x) (ll)x.size()\\n// << std::fixed << std::setprecision(10)\\nconst ll INF = 1LL << 30;\\nconst ld EPS = 1e-9;\\n \\nll lceil(ll a,ll b){if(a%b==0){return a/b;}if(a>=0){return (a/b)+1;}else{return -((-a)/b);}}\\nll lfloor(ll a,ll b){if(a%b==0){return a/b;}if(a>=0){return (a/b);}else{return -((-a)/b)-1;}}\\ninline ll positive_mod(ll a,ll m){return (a % m + m)%m;}\\ninline ll popcnt(ull a){ return __builtin_popcountll(a);}\\n//0indexed\\ninline ll topbit(ll a){assert(a != 0);return 63 - __builtin_clzll(a);}\\ninline ll smlbit(ll a){assert(a != 0);return __builtin_ctzll(a);}\\ntemplate<class T> bool chmin(T& a, T b){if(a > b){a = b;return true;}return false;}\\ntemplate<class T> bool chmax(T& a, T b){if(a < b){a = b;return true;}return false;}\\ntemplate<typename T> std::istream &operator>>(std::istream&is,std::vector<T>&v){for(T &in:v){is>>in;}return is;}\\ntemplate<typename T> std::ostream &operator<<(std::ostream&os,const std::vector<T>&v){for(auto it=std::begin(v);it!=std::end(v);){os<<*it<<((++it)!=std::end(v)?\\\" \\\":\\\"\\\");}return os;}\\ntemplate<typename T1, typename T2>std::ostream &operator<< (std::ostream &os, std::pair<T1,T2> p){os << \\\"{\\\" << p.first << \\\",\\\" << p.second << \\\"}\\\";return os;}\\ntemplate<class... T>void input(T&... a){(cin >> ... >> a);}\\nvoid print(){cout << endl;}\\ntemplate<class T, class... Ts>void print(const T& a, const Ts&... b){cout << a;((cout << ' ' << b), ...);cout << endl;}\\ntemplate<class T> void pspace(const T& a){ cout << a << ' ';}\\nvoid perr(){cerr << endl;}\\ntemplate<class T, class... Ts>void perr(const T& a, const Ts&... b){cerr << a;((cerr << ' ' << b), ...);cerr << endl;}\\nvoid yes(bool i = true){ return print(i?\\\"yes\\\":\\\"no\\\"); }\\nvoid Yes(bool i = true){ return print(i?\\\"Yes\\\":\\\"No\\\"); }\\nvoid YES(bool i = true){ return print(i?\\\"YES\\\":\\\"NO\\\"); }\\ntemplate <class T> vector<T> &operator++(vector<T> &v) {for(auto &e : v) e++;return v;}\\ntemplate <class T> vector<T> operator++(vector<T> &v, signed) {auto res = v;for(auto &e : v) e++;return res;}\\ntemplate <class T> vector<T> &operator--(vector<T> &v) {for(auto &e : v) e--;return v;}\\ntemplate <class T> vector<T> operator--(vector<T> &v, signed) {auto res = v;for(auto &e : v) e--;return res;}\\n//grid探索用\\nvector<ll> _ta = {0,0,1,-1,1,1,-1,-1};\\nvector<ll> _yo = {1,-1,0,0,1,-1,1,-1};\\nbool isin(ll now_i,ll now_j,ll h,ll w){return (0<=now_i && now_i < h && 0 <= now_j && now_j < w);}\\n \\nll lpow(ll x,ll n){ll ans = 1;while(n >0){if(n & 1)ans *= x;x *= x;n >>= 1;}return ans;}\\nll Modlpow(ll x,ll n,ll m){ll ans = 1;ll a = x%m;while(n >0){if(n & 1){ans *= a;ans%= m;}a *= a;a %= m;n >>= 1;}return ans;} \\nconst ll MOD9 = 998244353LL;\\nconst ll MOD10 = 1000000007LL;\\n\\n\\n // for AOJ or ICPC or etc..\\ntemplate<class Tp>\\nbool zero (const Tp &x) {\\n return x == 0;\\n}\\n\\ntemplate<class Tp, class... Args>\\nbool zero (const Tp &x, const Args& ...args) {\\n return zero(x) and zero(args...);\\n}\\n\\nvoid solve(ll n,ll m,ll t,ll p){\\n swap(n,m);\\n vvll paper(700,vll(700));\\n ll tp = 0,dn = n;\\n ll l = 0,r = m; \\n reps(i,tp,dn)reps(j,l,r){\\n paper[i][j] = 1;\\n }\\n while(t--){\\n LL(d,c);\\n if(d == 1){\\n for(ll i = tp;i < dn;i++){\\n rep(j,c){\\n paper[i][l+c+j] += paper[i][l+c-1-j];\\n paper[i][l+c-1-j] = 0;\\n }\\n }\\n l += c;\\n chmax(r,l+c);\\n }else{\\n rep(i,c){\\n for(ll j =l;j<r;j++){\\n paper[tp+c+i][j] += paper[tp+c-1-i][j];\\n paper[tp+c-1-i][j] = 0;\\n }\\n }\\n tp += c;\\n chmax(dn,tp+c);\\n }\\n }\\n // ll ans = 0;\\n while(p--){\\n LL(x,y);\\n cout << paper[tp+y][l+x] << endl;\\n }\\n}\\n\\nint main(){\\n ios::sync_with_stdio(false);cin.tie(nullptr);\\n while(true){\\n LL(n,m,t,p);\\n // perr(n,m,t,p);\\n if(zero(n,m,t,p))break;\\n solve(n,m,t,p);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 5376,\n \"score_of_the_acc\": -0.0969,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1625_10356120\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nint main () {\\n while(1){\\n int n,m,t,p;\\n cin>>m>>n>>t>>p;\\n if(n == 0 && m == 0 && t == 0 && p == 0){\\n break;\\n }\\n vector<vector<int>> g(1000,vector<int>(1000,0));\\n for(int i = 0 ; i < n;i++){\\n for(int j = 0 ; j < m;j++){\\n g[i][j] = 1;\\n }\\n }\\n int d[t],c[t];\\n for(int i = 0 ; i < t;i++){\\n cin>>d[i]>>c[i];\\n }\\n int x[p],y[p];\\n for(int i = 0 ; i < p;i++){\\n cin>>x[i]>>y[i];\\n }\\n int L = 0,R = m,U = n ,D = 0;\\n for(int i = 0 ; i < t;i++){\\n if(d[i] == 1){\\n for(int j = 0; j < c[i];j++){\\n for(int k = D ; k <U;k++){\\n g[k][L + c[i] + j] += g[k][L + c[i] - j - 1];\\n }\\n }\\n L += c[i];\\n if(R-L < c[i]){\\n R = L + 2 * c[i];\\n // R += (c[i] - R + 1);\\n }\\n }else{\\n for(int j = 0 ; j < c[i];j++){\\n for(int k = L ; k < R; k++){\\n g[D + c[i] + j][k] += g[D + c[i] - j - 1][k];\\n }\\n }\\n D += c[i];\\n if(U-D < c[i]) {\\n U = D + 2 * c[i];\\n // U += (c[i]-U+1);\\n }\\n }\\n }\\n vector<vector<bool>> che(1000,vector<bool>(1000,false));\\n for(int i = 0 ; i < p;i++){\\n cout<<g[D + y[i]][L + x[i]]<<endl;\\n che[D+y[i]][L+x[i]] = true;\\n }\\n }\\n return(0);\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 7480,\n \"score_of_the_acc\": -0.0925,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1625_9424520\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n//using\\nusing intl = long long;\\nusing ll = long long;\\nusing itnl = long long;//typo用\\nusing uintl = unsigned long long;\\nusing itn = int;//typo用\\nusing ld = long double;\\nusing namespace std;\\n\\n//関数マクロ\\n#define rep(i, n) for(intl i = 0; i < (intl)(n); i++)\\n#define rrep(i, n) for(intl i = (intl)(n) - 1; i >= 0; i--)\\n#define repi(i, a, b) for(intl i = (intl)(a); i < (intl)(b); i++)\\n#define rrepi(i, a, b) for(intl i = (intl)(a) - 1; i >= (intl)(b); i--)\\n#define all(x) (x).begin(),(x).end()\\n#define rall(x) (x).rbegin(),(x).rend()\\n#define m0(x) memset(x,0,sizeof(x))\\n#define m1(x) memset(x,1,sizeof(x))\\n#define fill(x,y) memset(x,y,sizeof(x))\\n#define alength(a) (sizeof(a) / sizeof(a[0]))\\n#define debug(x) cout << #x << \\\":\\\" << x << endl\\n\\n//定数マクロ\\n#define pb push_back\\n#define mp make_pair\\n#define pii pair<intl,intl>\\n\\n//定数\\nconst intl INF = 1e18;\\nconst intl MOD = 1e9+7; //1e9より大きい最小の素数, 1e9より小さい最大の素数は998244353\\nconst ld EPS = 1.0e-14;\\nconst ld PI = acos(-1);\\n\\n//テンプレート関数\\ntemplate<class T> inline bool chmin(T& a, T b) { if (a > b) {a = b; return true;} return false; }\\ntemplate<class T> inline bool chmax(T& a, T b) { if (a < b) {a = b; return true;} return false; }\\nintl modpow(intl a, intl n, intl mod) {intl res = 1;while (n > 0) {if (n & 1) res = res * a % mod;a = a * a % mod;n >>= 1;}return res;}\\nintl modpow(intl a, intl n) {intl res = 1; while (n > 0) {if (n & 1) res = res * a % MOD;a = a * a % MOD;n >>= 1;}return res;}\\n//intl gcd(intl a, intl b){ if(!b)return a; return gcd(b, a % b); } //c++17からある\\n//intl lcm(intl a,intl b){ return a / gcd(a, b) * b; } //c++17からある\\n\\n//自作テンプレート関数\\nvoid fp(bool f){cout << (f ? \\\"Yes\\\" : \\\"No\\\") << endl;}//Yes,Noの出力を楽にするよう\\nvoid fp(bool f, string s, string t){cout << (f ? s : t) << endl;}//上の関数のYes,Noを任意の文字列でできるようにしたもの\\nintl fact(intl k){ intl a = 1; for(int i = 2; i <= k; i++){ a *= i; } return a; }//k!を求める関数,O(N)\\nintl digit10(intl a){ intl b = 0; do{ a /= 10; b++; }while(a); return b; }//aを10進数で表したときの桁数を求める関数,O(logN)\\nintl mceil(intl a, intl b){ return (a + b - 1) / b; }//aをbで割って切り上げる関数,O(1)\\n\\n\\n//--------------入力受け取る場所----------------------------------------------------\\nintl n,m,t,p;\\nvector<intl> d,c,x,y;\\n\\n\\nvoid input_var(){\\n cin >> n >> m >> t >> p;\\n if (n == 0 && m == 0 && t == 0 && p == 0) exit(0);\\n rep(i, t) {\\n cin >> d[i] >> c[i];\\n }\\n rep(i, p) {\\n cin >> x[i] >> y[i];\\n }\\n}\\n//-------------------------------------------------------------------------------\\n\\nvoid solve(){\\n intl left = 0;\\n intl right = n;\\n intl top = 0;\\n intl bottom = m;\\n vector<vector<intl>> kasanari(100 * m + 1, vector<intl>(100 * n + 1, 0));\\n rep(i,m)rep(j,n)kasanari[i][j] = 1;\\n /*rep(j,m) {\\n rep(k,n)cout << kasanari[j][k] << \\\" \\\";\\n cout << endl;\\n }*/\\n rep(i, t) {\\n //cout << d[i] << c[i] << \\\" \\\" << top << \\\" \\\" << left << endl;\\n if (d[i] == 1) {\\n for (intl j = 0; j < c[i]; j++) {\\n for (intl k = top; k < bottom; k++) {\\n kasanari[k][left + 2 * c[i] - j - 1] += kasanari[k][left + j];\\n kasanari[k][left + j] = 0;\\n }\\n }\\n right = max(left + 2 * c[i], right);\\n left += c[i];\\n }\\n else {\\n for (intl j = 0; j < c[i]; j++) {\\n for (intl k = left; k < right; k++) {\\n kasanari[top + 2 * c[i] - j - 1][k] += kasanari[top + j][k];\\n kasanari[top + j][k] = 0;\\n }\\n }\\n bottom += max(top + 2 * c[i], bottom);\\n top += c[i];\\n }\\n /*rep(j,2*m+1) {\\n rep(k,2*n+1)cout << kasanari[j][k] << \\\" \\\";\\n cout << endl;\\n }*/\\n }\\n rep(i, p) {\\n //cout << bottom << \\\" \\\" << x[i] << \\\" \\\" << left << \\\" \\\" << y[i] << endl; \\n cout << kasanari[y[i]+top][x[i]+left] << endl;\\n }\\n}\\n\\nsigned main(){\\n cout << fixed << setprecision(10);\\n\\n d.resize(21);\\n c.resize(21);\\n x.resize(21);\\n y.resize(21);\\n while (true) {\\n input_var();\\n solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 420,\n \"memory_kb\": 83340,\n \"score_of_the_acc\": -1.1258,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1625_9408012\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nint main(){\\n int n,m,t,p;\\n int d,c,x,y;\\n int cum,cun;\\n int ans;\\n while(1){\\n cin>>n>>m>>t>>p;\\n ans=0;\\n if(n+m+t+p==0){\\n break;\\n }\\n vector<vector<int>> paper(1500,vector<int>(1500,0)); //横、高さの順\\n for(int i=0;i<n;i++){\\n for(int j=0;j<m;j++){\\n paper.at(j).at(i)=1;\\n }\\n }\\n cun=0;\\n cum=0;\\n for(int i=0;i<t;i++){\\n cin>>d>>c;\\n if(d==1){\\n for(int j=cum;j<m;j++){\\n for(int k=cun+c,l=1;k<cun+2*c;k++,l+=2){\\n paper.at(j).at(k)+=paper.at(j).at(k-l);\\n }\\n }\\n cun+=c;\\n n+=max(0,cun-n+c);\\n }\\n else if(d==2){\\n for(int j=cum+c,l=1;j<cum+2*c;j++,l+=2){\\n for(int k=cun;k<n;k++){\\n paper.at(j).at(k)+=paper.at(j-l).at(k);\\n }\\n }\\n cum+=c;\\n m+=max(0,cum-m+c);\\n }\\n }\\n ans=0;\\n for(int i=0;i<p;i++){\\n cin>>x>>y;\\n cout<<paper.at(cum+y).at(cun+x)<<endl;\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1760,\n \"memory_kb\": 11968,\n \"score_of_the_acc\": -0.6455,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1625_9407864\",\n \"code_snippet\": \"//#include <atcoder/all>\\n#include <bits/stdc++.h>\\n#define rep(i, a, b) for (int i = a; i < b; i++)\\n#define rrep(i, a, b) for (int i = a - 1; i >= b; i--)\\n#define ll long long\\n#define ull unsigned long long\\n#define graph vector<vector<int>>\\nusing namespace std;\\n//using namespace atcoder;\\n\\nint mod=998244353;\\nvector<int> dx={1,0,-1,0},dy={0,1,0,-1};\\n\\nint main(){\\n while(1){\\n int n,m,t,p; cin>>n>>m>>t>>p;\\n if(n==0) break;\\n\\n vector<vector<ll>> grid(650,vector<ll>(650));\\n rep(i,0,n){\\n rep(j,0,m){\\n grid[i][j]=1;\\n }\\n }\\n\\n int l=0,u=0;\\n\\n rep(i,0,t){\\n int d,c; cin>>d>>c;\\n if(d==1){\\n l += c;\\n rep(ii,u,u+m){\\n rep(j,0,c){\\n grid[l+j][ii] += grid[l-j-1][ii];\\n grid[l-j-1][ii]=0;\\n }\\n }\\n }\\n\\n else{\\n u += c;\\n rep(ii,l,l+n){\\n rep(j,0,c){\\n grid[ii][u+j] += grid[ii][u-j-1];\\n grid[ii][u-j-1]=0;\\n }\\n }\\n }\\n }\\n\\n rep(i,0,p){\\n int x,y; cin>>x>>y;\\n cout << grid[x+l][y+u] << endl;\\n }\\n }\\n \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 630,\n \"memory_kb\": 6556,\n \"score_of_the_acc\": -0.2313,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1625_9407583\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing vll = vector<ll>;\\nusing vvll = vector<vll>;\\nusing vvvll = vector<vvll>;\\n#define all(A) A.begin(),A.end()\\n#define ALL(A) A.begin(),A.end()\\n#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)\\ntemplate<class T>\\nbool chmax(T& p, T q, bool C = 1) {\\n if (C == 0 && p == q) {\\n return 1;\\n }\\n if (p < q) {\\n p = q;\\n return 1;\\n }\\n else {\\n return 0;\\n }\\n}\\n\\ntemplate<class T>\\nbool chmin(T& p, T q, bool C = 1) {\\n if (C == 0 && p == q) {\\n return 1;\\n }\\n if (p > q) {\\n p = q;\\n return 1;\\n }\\n else {\\n return 0;\\n }\\n}\\n\\n\\n\\nvoid solve(ll N, ll M, ll T, ll P) {\\n swap(N, M);\\n vector<vll> D(N * 100, vll(M * 100, 0));\\n rep(i, N)rep(j, M)D[i][j] = 1;\\n rep(t, T) {\\n ll d, c;\\n cin >> d >> c;\\n\\n if (d == 1) {\\n ll L = 1e18;\\n rep(j, M * 100)rep(i, N * 100) {\\n if (D[i][j] > 0) {\\n L = min(L, j);\\n break;\\n }\\n }\\n for (ll j = L; j <= L + c - 1; j++) {\\n rep(i, N * 100) {\\n ll ds = L + c - j;\\n D[i][L + c - 1 + ds] += D[i][j];\\n D[i][j] = 0;\\n }\\n }\\n }\\n else {\\n ll W = 1e18;\\n rep(i, N * 100)rep(j, M * 100) {\\n //if (W >= 0)break;\\n if (D[i][j] > 0) {\\n W = min(W, i);\\n break;\\n }\\n }\\n for (ll i = W; i <= W + c - 1; i++) {\\n rep(j, M * 100) {\\n ll ds = W + c - i;\\n D[W + c - 1 + ds][j] += D[i][j];\\n D[i][j] = 0;\\n }\\n }\\n }\\n }\\n ll L = 1e18, W = 1e18;\\n rep(i, N * 100)rep(j, M * 100) {\\n if (D[i][j] > 0) {\\n W = min(W, i);\\n L = min(L, j);\\n }\\n }\\n ll an = 0;\\n rep(p, P) {\\n ll X, Y;\\n cin >> X >> Y;\\n cout << D[Y + W][X + L] << endl;\\n }\\n}\\n\\n\\nint main() {\\n\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n\\n ll N, M, T, P;\\n while (cin >> N >> M >> T >> P, N != 0)solve(N, M, T, P);\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 3270,\n \"memory_kb\": 83300,\n \"score_of_the_acc\": -1.9995,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1625_9375390\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nvoid solve(int n, int m, int t, int p){\\n vector<int> d(t), c(t);\\n for(int i = 0; i < t; i++){\\n cin >> d[i] >> c[i];\\n }\\n vector<int> x(p), y(p);\\n for(int i = 0; i < p; i++){\\n cin >> x[i] >> y[i];\\n }\\n \\n // 動的にメモリを確保\\n vector<vector<int>> paper(n * n, vector<int>(m * m, 0));\\n for(int i = 0; i < n; i++){\\n for(int j = 0; j < m; j++){\\n paper[i][j] = 1;\\n }\\n }\\n \\n int delx = 0, dely = 0;\\n int widx = n, widy = m;\\n\\n for(int i = 0; i < t; i++){\\n if(d[i] == 1){\\n for(int j = dely; j < dely + widy; j++){\\n for(int k = delx; k < delx + c[i]; k++){\\n paper[2 * (delx + c[i]) - 1 - k][j] += paper[k][j];\\n }\\n }\\n delx += c[i];\\n if(c[i] * 2 < widx) widx -= c[i];\\n else widx = c[i];\\n }\\n else if(d[i] == 2){\\n for(int j = delx; j < delx + widx; j++){\\n for(int k = dely; k < dely + c[i]; k++){\\n paper[j][2 * (dely + c[i]) - 1 - k] += paper[j][k];\\n }\\n }\\n dely += c[i];\\n if(c[i] * 2 < widy) widy -= c[i];\\n else widy = c[i];\\n }\\n }\\n\\n for(int i = 0; i < p; i++){\\n // 範囲外アクセスを防ぐためのチェック\\n if (delx + x[i] < n * n && dely + y[i] < m * m) {\\n cout << paper[delx + x[i]][dely + y[i]] << endl;\\n } \\n //else {\\n // cout << \\\"Out of bounds\\\" << endl;\\n //}\\n }\\n}\\n\\nint main() {\\n while(true){\\n int n, m, t, p;\\n cin >> n >> m >> t >> p;\\n if(n == 0) break;\\n solve(n, m, t, p);\\n }\\n //return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 7344,\n \"score_of_the_acc\": -0.051,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1625_9375327\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nvoid solve(int n, int m, int t, int p){\\n vector<int> d(t), c(t);\\n for(int i = 0; i < t; i++){\\n cin >> d[i] >> c[i];\\n }\\n vector<int> x(p), y(p);\\n for(int i = 0; i < p; i++){\\n cin >> x[i] >> y[i];\\n }\\n \\n // 動的にメモリを確保\\n vector<vector<int>> paper(n * n, vector<int>(m * m, 0));\\n for(int i = 0; i < n; i++){\\n for(int j = 0; j < m; j++){\\n paper[i][j] = 1;\\n }\\n }\\n \\n int delx = 0, dely = 0;\\n int widx = n, widy = m;\\n\\n for(int i = 0; i < t; i++){\\n if(d[i] == 1){\\n for(int j = dely; j < dely + widy; j++){\\n for(int k = delx; k < delx + c[i]; k++){\\n paper[2 * (delx + c[i]) - 1 - k][j] += paper[k][j];\\n }\\n }\\n delx += c[i];\\n if(c[i] * 2 < widx) widx -= c[i];\\n else widx = c[i];\\n }\\n else if(d[i] == 2){\\n for(int j = delx; j < delx + widx; j++){\\n for(int k = dely; k < dely + c[i]; k++){\\n paper[j][2 * (dely + c[i]) - 1 - k] += paper[j][k];\\n }\\n }\\n dely += c[i];\\n if(c[i] * 2 < widy) widy -= c[i];\\n else widy = c[i];\\n }\\n }\\n\\n for(int i = 0; i < p; i++){\\n // 範囲外アクセスを防ぐためのチェック\\n if (delx + x[i] < n * n && dely + y[i] < m * m) {\\n cout << paper[delx + x[i]][dely + y[i]] << endl;\\n } else {\\n cout << \\\"Out of bounds\\\" << endl;\\n }\\n }\\n}\\n\\nint main() {\\n while(true){\\n int n, m, t, p;\\n cin >> n >> m >> t >> p;\\n if(n == 0) break;\\n solve(n, m, t, p);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 7128,\n \"score_of_the_acc\": -0.0513,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1625_9346986\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#ifdef LOCAL\\n #include \\\"settings/debug.cpp\\\"\\n #define _GLIBCXX_DEBUG\\n#else\\n #define Debug(...) void(0)\\n#endif\\n#define rep(i, n) for (int i = 0; i < (n); ++i)\\nusing ll = long long;\\nusing ull = unsigned long long;\\n\\nint main() {\\n while (true) {\\n ll n, m, t, p;\\n cin >> m >> n >> t >> p;\\n if (n == 0 && m == 0 && t == 0 && p == 0) {\\n break;\\n }\\n ll left = 0, bottom = 30 * n - 1;\\n vector<vector<ll>> cnt(30 * n, vector<ll>(30 * m, 0));\\n rep(i, n) rep(j, m) cnt[30 * n - 1 - i][j] = 1;\\n rep(i, t) {\\n ll d, c;\\n cin >> d >> c;\\n if (d == 1) {\\n rep(i, c) {\\n ll now_x = bottom, now_y = left + i;\\n while (true) {\\n if (cnt[now_x][now_y] == 0) {\\n break;\\n }\\n cnt[now_x][left + 2 * c - 1 - i] += cnt[now_x][now_y];\\n now_x--;\\n // cerr << now_x << \\\" \\\" << now_y << endl;\\n }\\n }\\n left += c;\\n }\\n else {\\n rep(i, c) {\\n ll now_x = bottom - i, now_y = left;\\n while (true) {\\n if (cnt[now_x][now_y] == 0) {\\n break;\\n }\\n cnt[bottom - (2 * c - 1 - i)][now_y] += cnt[now_x][now_y];\\n now_y++;\\n // cerr << \\\"now: \\\" << now_x << \\\" \\\" << now_y << endl;\\n }\\n }\\n bottom -= c;\\n }\\n // rep(i, n) {\\n // rep(j, m) {\\n // cerr << cnt[bottom - i][left + j] << \\\" \\\";\\n // }\\n // cerr << endl;\\n // }\\n // cerr << endl;\\n }\\n rep(i, p) {\\n ll x, y;\\n cin >> y >> x;\\n cout << cnt[bottom - x][left + y] << endl;\\n }\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 10476,\n \"score_of_the_acc\": -0.0962,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1625_9335785\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing P = pair<ll, ll>;\\n#define rep(i, a, b) for(ll i = a; i < b; ++i)\\n#define rrep(i, a, b) for(ll i = a; i >= b; --i)\\nconstexpr ll inf = 4e18;\\nstruct SetupIO {\\n SetupIO() {\\n ios::sync_with_stdio(0);\\n cin.tie(0);\\n cout << fixed << setprecision(30);\\n }\\n} setup_io;\\n\\nll D = 100;\\nvector<vector<ll>> rot(vector<vector<ll>> tab) {\\n vector<vector<ll>> rot_tab(D * 3);\\n rep(i,0,D * 3){\\n rot_tab[i].resize(D * 3, 0);\\n }\\n rep(i,0,D * 3){\\n rep(j,0,D * 3){\\n rot_tab[i][j] = tab[j][i];\\n }\\n }\\n return rot_tab;\\n}\\nbool valid(ll i, ll j){\\n return (0 <= i) && (i < D * 3) && (0 <= j) && (j < D * 3);\\n}\\nvector<vector<ll>> oru(vector<vector<ll>> tab, ll c) {\\n vector<vector<ll>> new_tab(D * 3);\\n rep(i,0,D * 3){\\n new_tab[i].resize(D * 3, 0);\\n }\\n\\n rep(i,0,D * 3){\\n rep(j,0,D * 3){\\n if(j < D + c) {\\n continue;\\n }\\n ll j2 = (D+c) + (D+c-1) - j;\\n if (!valid(i, j2)) {\\n continue;\\n }\\n new_tab[i][j] = tab[i][j] + tab[i][(D+c) + (D+c-1) - j];\\n }\\n }\\n return new_tab;\\n}\\nvector<vector<ll>> hidariue(vector<vector<ll>> tab) {\\n // 左上が(D, D)に来るように\\n vector<vector<ll>> new_tab(D * 3);\\n rep(i,0,D * 3){\\n new_tab[i].resize(D * 3, 0);\\n }\\n\\n ll min_i = inf;\\n ll min_j = inf;\\n rep(i,0,D * 3){\\n rep(j,0,D * 3){\\n if(tab[i][j] > 0) {\\n min_i = min(min_i, i);\\n min_j = min(min_j, j);\\n }\\n }\\n }\\n\\n rep(i,0,D * 3){\\n rep(j,0,D * 3){\\n if (valid(i + (min_i - D), j + (min_j - D))) {\\n new_tab[i][j] = tab[i + (min_i - D)][j + (min_j - D)];\\n }\\n }\\n }\\n\\n return new_tab;\\n}\\n// void output(vector<vector<ll>> tab) {\\n// cerr << \\\"\\\\n\\\";\\n// rep(i,0,D * 3) {\\n// rep(j,0,D * 3) {\\n// cerr << tab[i][j];\\n// }\\n// cerr << \\\"\\\\n\\\";\\n// }\\n// cerr << \\\"\\\\n\\\";\\n// }\\n\\nint main(void) {\\n while(true){\\n ll n,m,t,p;cin>>n>>m>>t>>p;\\n if (n == 0) break;\\n vector<vector<ll>> tab(D * 3);\\n rep(i,0,D * 3){\\n tab[i].resize(D * 3, 0);\\n }\\n rep(i,D,D+m){\\n rep(j,D,D+n){\\n tab[i][j] = 1;\\n }\\n }\\n rep(i,0,t){\\n ll d,c;cin>>d>>c;\\n if (d == 2) {\\n tab = rot(tab);\\n }\\n tab = oru(tab, c);\\n if (d == 2) {\\n tab = rot(tab);\\n }\\n tab = hidariue(tab);\\n }\\n rep(i,0,p){\\n ll x, y;cin>>x>>y;\\n cout << tab[D + y][D + x] << \\\"\\\\n\\\";\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2340,\n \"memory_kb\": 5280,\n \"score_of_the_acc\": -0.7399,\n \"final_rank\": 18\n },\n {\n \"submission_id\": \"aoj_1625_9322405\",\n \"code_snippet\": \"#include <iostream>\\n#include <vector>\\n#include <set>\\n#include <map>\\n#include <deque>\\n#include <algorithm>\\n#include <assert.h>\\n\\nusing std::cin, std::cout, std::vector, std::string, std::pair;\\n\\n#define rep(i, n) for (int i = 0; i < (n); ++i)\\n\\ntemplate <typename T>\\nvoid print_vector(const vector<T> &vec, const string &splitter = \\\" \\\") {\\n for (int i = 0; i < vec.size(); ++i) {\\n cout << vec[i];\\n if (i == vec.size() - 1) cout << \\\"\\\\n\\\";\\n else cout << splitter;\\n }\\n}\\n\\n\\n// s = (2b - n^2 + 1)/2n\\n\\nint main() {\\n int w, h, t, p;\\n\\n while (cin >> w >> h >> t >> p, w) {\\n vector pos(h, vector<pair<int, int>>(w));\\n std::multimap<pair<int, int>, pair<int, int>> map;\\n for (int i = 0; i < h; ++i) {\\n for (int j = 0; j < w; ++j) {\\n pos[i][j] = {i, j};\\n map.emplace(pair {i, j}, pair {i, j});\\n }\\n }\\n\\n int left_x = 0, right_x = w, bottom_y = 0, top_y = h;\\n rep(q, t) {\\n int d, c; cin >> d >> c;\\n\\n if (d == 1) {\\n for (int y = bottom_y; y < top_y; ++y) {\\n for (int xd = 0; xd < c; ++xd) {\\n int x = left_x + c - xd - 1;\\n auto rng = map.equal_range({y, x});\\n int nxt_x = left_x + c + xd;\\n for (auto iter = rng.first; iter != rng.second; ++iter) {\\n auto [i, j] = iter->second;\\n pos[i][j] = { y, nxt_x };\\n map.emplace(pair { y, nxt_x }, pair { i, j });\\n }\\n map.erase({ y, x });\\n }\\n }\\n\\n left_x += c;\\n if (left_x + c >= right_x) {\\n right_x = left_x + c;\\n }\\n } else {\\n for (int yd = 0; yd < c; ++yd) {\\n int y = bottom_y + c - yd - 1;\\n int nxt_y = bottom_y + c + yd;\\n for (int x = left_x; x < right_x; ++x) {\\n auto rng = map.equal_range({ y, x });\\n for (auto iter = rng.first; iter != rng.second; ++iter) {\\n auto [i, j] = iter->second;\\n pos[i][j] = { nxt_y, x };\\n map.emplace(pair { nxt_y, x }, pair { i, j });\\n }\\n map.erase({ y, x });\\n }\\n }\\n\\n bottom_y += c;\\n if (bottom_y + c >= top_y) {\\n top_y = bottom_y + c;\\n }\\n }\\n }\\n\\n// int ans = 0;\\n rep(q, p) {\\n int x, y; cin >> x >> y;\\n int tmp = map.count({ y + bottom_y, x + left_x });\\n// ans += tmp;\\n cout << tmp << std::endl;\\n// std::cerr << tmp << \\\"\\\\n\\\";\\n }\\n// cout << ans << std::endl;\\n// std::cerr << std::endl;\\n }\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3308,\n \"score_of_the_acc\": -0.0005,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1625_9309965\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef long double ld;\\n#define rep(i, n) for(ll i = 0; i < (n); i++)\\n#define reps(i, l, r) for(ll i = (l); i < (r); i++)\\n#define all(a) (a).begin(), (a).end()\\n#define endl \\\"\\\\n\\\";\\nconst ll INF = 2e18;\\nconst ll mod1 = 1000000007;\\nconst ll mod2 = 998244353;\\nll dx[4] = {-1, 0, 1, 0};\\nll dy[4] = {0, -1, 0, 1};\\n\\nvoid solve() {\\n ll N, M, T, P; cin >> N >> M >> T >> P;\\n while (N != 0 || M != 0 || T != 0 || P != 0) {\\n vector<vector<ll>>A(N*N, vector<ll>(M*M, 0));\\n rep(i, N) rep(j, M) A[i][j] = 1;\\n ll u = 0, l = 0, up = N, lp = M;\\n while (T--) {\\n ll d, c; cin >> d >> c;\\n if (d == 1) {\\n ll nu = u + 2 * c - 1;\\n up = max(up, nu + 1);\\n while (1) {\\n reps(i, l, lp) {A[nu][i] += A[u][i];}\\n if (u + 1 == nu) break;\\n u++; nu--;\\n }\\n u = nu;\\n }\\n else {\\n ll nl = l + 2 * c - 1;\\n lp = max(lp, nl + 1);\\n while (1) {\\n reps(i, u, up) {A[i][nl] += A[i][l];}\\n if (l + 1 == nl) break;\\n l++; nl--;\\n }\\n l = nl;\\n }\\n }\\n while (P--) {\\n ll x, y; cin >> x >> y;\\n x += u; y += l;\\n cout << A[x][y] << endl;\\n }\\n cin >> N >> M >> T >> P;\\n }\\n}\\nsigned main() {\\n ll T = 1; //cin >> T;\\n while (T--) solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 11172,\n \"score_of_the_acc\": -0.1049,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1625_9223352\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nint A[200][200];\\n\\nint main(){\\n int n,m,t,p;\\n while(1){\\n cin>>n>>m>>t>>p;\\n if(n==0&&m==0&&t==0&&p==0)break;\\n\\n for(int i=0;i<200;i++)\\n for(int j=0;j<200;j++)\\n A[i][j]=0;\\n \\n for(int i=0;i<m;i++)\\n for(int j=0;j<n;j++)\\n A[i][j]=1;\\n \\n for(int u=0;u<t;u++){\\n int d,c;\\n cin>>d>>c;\\n if(d==1){\\n \\n for(int i=0;i<m;i++){\\n for(int j=0;j<c;j++){\\n int dist=c-j;\\n A[i][c+dist-1]+=A[i][j];\\n A[i][j]=0;\\n }\\n }\\n\\n for(int i=0;i<100;i++){\\n for(int j=0;j<100;j++){\\n A[i][j]=A[i][j+c];\\n }\\n }\\n \\n }else{\\n \\n for(int i=0;i<c;i++){\\n for(int j=0;j<n;j++){\\n int dist=c-i;\\n A[c+dist-1][j]+=A[i][j];\\n A[i][j]=0;\\n }\\n }\\n\\n for(int i=0;i<100;i++){\\n for(int j=0;j<100;j++){\\n A[i][j]=A[i+c][j];\\n }\\n }\\n \\n }\\n \\n }\\n \\n for(int i=0;i<p;i++){\\n int x,y;\\n cin>>x>>y;\\n cout<<A[y][x]<<endl;\\n }\\n \\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3264,\n \"score_of_the_acc\": -0.0031,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1625_8856207\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\nint solve() {\\n int m, n, t, p;\\n std::cin >> m >> n >> t >> p;\\n if (n == 0) return 1;\\n const int N = 1000;\\n std::vector count(N, std::vector<int>(N));\\n for (int i = 0; i < n; i++) {\\n for (int j = 0; j < m; j++) {\\n count[i][j] = 1;\\n }\\n }\\n int left = 0;\\n int low = 0;\\n while (t--) {\\n int d, c;\\n std::cin >> d >> c;\\n if (d == 1) {\\n int right = left + 2 * c;\\n for (int i = low; i < N; i++) {\\n for (int j = 0; j < c; j++) {\\n count[i][right - 1 - j] += count[i][left + j];\\n }\\n }\\n left += c;\\n } else {\\n int up = low + 2 * c;\\n for (int i = 0; i < c; i++) {\\n for (int j = left; j < N; j++) {\\n count[up - 1 - i][j] += count[low + i][j];\\n }\\n }\\n low += c;\\n }\\n // for (int i = 0; i < 2 * n; i++) {\\n // for (int j = 0; j < 2 * m; j++) {\\n // std::cerr << count[i][j] << ' ';\\n // }\\n // std::cerr << std::endl;\\n // }\\n // std::cerr << \\\"-----------\\\" << std::endl;\\n }\\n\\n while (p--) {\\n int x, y;\\n std::cin >> x >> y;\\n std::cout << count[low + y][left + x] << '\\\\n';\\n }\\n return 0;\\n}\\n\\nint main() {\\n while (!solve());\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 7076,\n \"score_of_the_acc\": -0.0721,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1625_8011346\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nint N, M, T, P;\\nlong long A[1050][1050];\\nint D[30], C[30];\\nint X[30], Y[30];\\nvector<long long> Ans;\\n\\nint main() {\\n while (true) {\\n cin >> M >> N >> T >> P;\\n if (N == 0 && M == 0 && T == 0 && P == 0) {\\n break;\\n }\\n int lef = 0, dow = 0;\\n for (int i = 0; i < 1050; i++) {\\n for (int j = 0; j < 1050; j++) {\\n A[i][j] = 0;\\n }\\n }\\n for (int i = 0; i < N; i++) {\\n for (int j = 0; j < M; j++) {\\n A[i][j] = 1;\\n }\\n }\\n for (int i = 0; i < T; i++) {\\n cin >> D[i] >> C[i];\\n }\\n for (int i = 0; i < P; i++) {\\n cin >> Y[i] >> X[i];\\n }\\n for (int i = 0; i < T; i++) {\\n if (D[i] == 1) {\\n for (int j = 0; j < C[i]; j++) {\\n for (int k = dow; k < 1050; k++) {\\n int ll = C[i] + lef - 1 - j;\\n int rr = j + C[i] + lef;\\n A[k][rr] += A[k][ll];\\n }\\n }\\n lef += C[i];\\n } else {\\n for (int j = 0; j < C[i]; j++) {\\n for (int k = lef; k < 1050; k++) {\\n int dd = dow + C[i] - 1 - j;\\n int uu = j + C[i] + dow;\\n A[uu][k] += A[dd][k];\\n }\\n }\\n dow += C[i];\\n }\\n }\\n for (int i = 0; i < P; i++) {\\n Ans.push_back(A[X[i] + dow][Y[i] + lef]);\\n }\\n }\\n for (auto x : Ans) {\\n cout << x << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 220,\n \"memory_kb\": 11988,\n \"score_of_the_acc\": -0.1734,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1625_8001380\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define ll long long\\n#define rep(i,n) for(long long i = 0;i < (long long)(n);i++)\\n\\nmap<pair<ll,ll>,ll> f(map<pair<ll,ll>,ll> mp){\\n //0,0の調整\\n ll mi_n = 1LL << 60;\\n ll mi_m = 1LL << 60;\\n for(auto &q:mp){\\n if(q.second == 0)continue;\\n auto [x,y] = q.first;\\n if(x < mi_n){\\n mi_n = x;\\n }\\n if(y < mi_m){\\n mi_m = y;\\n }\\n }\\n\\n map<pair<ll,ll>,ll> ret;\\n for(auto &q:mp){\\n if(q.second == 0)continue;\\n auto [x,y] = q.first;\\n ret[{x- mi_n,y - mi_m}] = q.second;\\n }\\n return ret;\\n\\n \\n}\\n\\nint main(){\\n while(true){\\n ll n,m,t,p;cin >> n >> m >> t >> p;\\n if(n == 0 && m == 0 && t == 0 && p == 0){\\n break;\\n }\\n map<pair<ll,ll>,ll> mp;\\n // vector<vector<pair<ll,ll>>> g(n,vector<pair<ll,ll>>(m));\\n rep(i,n){\\n rep(j,m){\\n mp[{i,j}] = 1;\\n }\\n }\\n\\n //おる\\n rep(z,t){\\n ll d,c;cin >> d >> c;\\n map<pair<ll,ll>,ll> tmp_mp;\\n if(d == 1){\\n for(auto &q:mp){\\n auto[x,y] = q.first;\\n if(x <c){\\n tmp_mp[{c+(c-x-1),y}] += q.second;\\n q.second = 0;\\n }\\n }\\n }else{\\n for(auto &q:mp){\\n auto[x,y] = q.first;\\n if(y <c){\\n tmp_mp[{x,c+(c-y- 1)}] += q.second;\\n q.second = 0;\\n }\\n }\\n }\\n for(auto &q:tmp_mp){\\n mp[q.first] += q.second;\\n }\\n mp = f(mp);\\n\\n }\\n\\n rep(z,p){\\n ll x,y;cin >> x >> y;\\n if(mp.count({x,y})){\\n cout << mp[{x,y}] << endl;\\n }else{\\n //ないけど\\n cout << 0 << endl;\\n }\\n }\\n\\n \\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3712,\n \"score_of_the_acc\": -0.0056,\n \"final_rank\": 4\n }\n]","isConversational":false}}},{"rowIdx":997,"cells":{"group_id":{"kind":"string","value":"aoj_1628_cpp"},"problem_description":{"kind":"string","value":"Floating-Point Numbers\nIn this problem, we consider floating-point number formats, data representation formats to approximate real numbers on computers.\nScientific notation is a method to express a number, frequently used for\nnumbers too large or too small to be written tersely in usual decimal form.\nIn scientific notation, all numbers are written in the form\nm\n× 10\ne\n.\nHere,\nm\n(called\nsignificand\n) is a number\ngreater than or equal to 1 and less than 10,\nand\ne\n(called\nexponent\n) is an integer.\nFor example, a number 13.5 is equal to 1.35 × 10\n1\n,\nso we can express it in scientific notation with significand 1.35 and exponent 1.\nAs binary number representation is convenient on computers,\nlet's consider\nbinary scientific notation\nwith base two, instead of ten.\nIn binary scientific notation, all numbers are written in the form\nm\n× 2\ne\n.\nSince the base is two,\nm\nis limited to be less than 2.\nFor example, 13.5 is equal to 1.6875 × 2\n3\n,\nso we can express it in binary scientific notation\nwith significand 1.6875 and exponent 3.\nThe significand 1.6875 is equal to 1 + 1/2 + 1/8 + 1/16,\nwhich is 1.1011\n2\nin binary notation.\nSimilarly, the exponent 3 can be expressed as 11\n2\nin binary notation.\nA floating-point number expresses a number in binary scientific notation in finite number of bits.\nAlthough the accuracy of the significand and the range of the exponent are limited by the number of bits, we can express numbers in a wide range with reasonably high accuracy.\nIn this problem, we consider a 64-bit floating-point number format,\nsimplified from one actually used widely,\nin which only those numbers greater than or equal to 1 can be expressed.\nHere, the first 12 bits are used for the exponent and the remaining 52 bits for the significand.\n\nLet's denote the 64 bits of a floating-point number by\nb\n64\n...\nb\n1\n.\nWith\ne\nan unsigned binary integer\n(\nb\n64\n...\nb\n53\n)\n2\n,\nand with\nm\na binary fraction represented by the remaining 52 bits\nplus one (1.\nb\n52\n...\nb\n1\n)\n2\n,\nthe floating-point number represents the number\nm\n× 2\ne\n.\nWe show below the bit string of the representation of 13.5 in the format described above.\nIn floating-point addition operations, the results have to be approximated by numbers representable in floating-point format.\nHere, we assume that the approximation is by truncation.\nWhen the sum of two floating-point numbers\na\nand\nb\nis expressed in binary scientific notation as\na\n+\nb\n=\nm\n× 2\ne\n(1 ≤\nm\n< 2, 0 ≤\ne\n< 2\n12\n),\nthe result of addition operation on them will be a floating-point number with its first 12 bits representing\ne\nas an unsigned integer\nand the remaining 52 bits representing the first 52 bits of the binary fraction of\nm\n.\nA disadvantage of this approximation method is that the approximation error accumulates easily.\nTo verify this, let's make an experiment of adding a floating-point number many times, as in the pseudocode shown below.\nHere,\ns\nand\na\nare floating-point numbers, and the results of individual addition are approximated as describ\n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1628_10670479","code_snippet":"//#pragma GCC optimize(\"O3\")\n#include<bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define rep(i,n) for (ll i=0;i<(ll)n;i++)\n#define rrep(i,n) for (ll i=n-1;i>=(ll)0;i--)\n#define loop(i,m,n) for(ll i=m;i<=(ll)n;i++)\n#define rloop(i,m,n) for(ll i=m;i>=(ll)n;i--)\n#define vl vector<ll>\n#define vvl vector<vector<ll>>\n#define vdbg(a) rep(ii,a.size()){cout<<a[ii]<<\" \";}cout<<endl;\n#define vpdbg(a) rep(ii,a.size()){cout<<\"{\"<<a[ii].first<<\",\"<<a[ii].second<<\"} \";}cout<<endl;\n#define vvdbg(a) rep(ii,a.size()){rep(jj,a[ii].size()){cout<<a[ii][jj]<<\" \";}cout<<endl;}\n#define setdbg(a) for(const auto & ii:a){cout<<ii<<\" \";}cout<<endl;\n#define inf 4000000000000000000LL\n#define mod 998244353LL\n//#define mod 1000000007LL\n#define eps 0.000000001\nrandom_device rnd;// 非決定的な乱数生成器\nmt19937 mt(rnd());// メルセンヌ・ツイスタの32ビット版、引数は初期シード\n\n//#include<boost/multiprecision/cpp_int.hpp>\n//#define bbi boost::multiprecision::cpp_int\n//#include<atcoder/lazysegtree>\n\n\n//整数同士の累乗の計算をする。\nll power(ll A, ll B) {\n\tll result = 1;\n\tfor (ll i=0;i<B;i++){\n\t\tresult *= A;\n\t}\n\treturn result;\n}\n\n// nのk乗をmodで割った余りを計算\nll power_mod(ll n, ll k){\n\tlong long result = 1;\n\twhile (k > 0){\n\t\tif ((k&1) ==1)result=(result*n)%mod;\n\t\tn=n*n%mod;\n\t\tk >>= 1;\n\t}\n\treturn result;\n}\n\n\n//受け取った2次元文字の外側に、文字pをコーティングする。\nvector<string> pad(vector<string> &s,char p){\n\tll h=s.size();\n\tll w=s[0].size();\n\tvector<string> res(h+2,string(w+2,p));\n\trep(i,h)rep(j,w)res[i+1][j+1]=s[i][j];\n\treturn res;\n}\n\n// Union-Find\nstruct UnionFind {\n\tvector<int> par, siz;\n\tUnionFind(int n) : par(n, -1) , siz(n, 1) { }\n\t// 根を求める\n\tint root(int x) {\n\t\tif (par[x] == -1) return x;\n\t\telse return par[x] = root(par[x]);\n\t}\n\t// x と y が同じグループに属するかどうか (根が一致するかどうか)\n\tbool issame(int x, int y) {\n\t\treturn root(x) == root(y);\n\t}\n\t// x を含むグループと y を含むグループとを併合する\n\tbool unite(int x, int y) {\n\t\tx = root(x), y = root(y);\n\t\tif (x == y) return false; \n\t\tif (siz[x] < siz[y]) swap(x, y);\n\t\tpar[y] = x;\n\t\tsiz[x] += siz[y];\n\t\treturn true;\n\t}\n\t// x を含むグループのサイズ\n\tint size(int x) {\n\t\treturn siz[root(x)];\n\t}\n};\n\n\n//グリッド問題等用\nvl dx={1,0,-1,0};\nvl dy={0,1,0,-1};\n\n//受け取った文字列を、第2引数が0なら全て小文字に、1なら大文字に変換する関数\nstring cnv_string(const string &str, int mode) {\n\tstring result = str;\n\tif (mode == 0) {\n\t\t// 小文字に変換\n\t\tfor (char &c : result) {\n\t\t\tc = tolower(c);\n\t\t}\n\t} else if (mode == 1) {\n\t\t// 大文字に変換\n\t\tfor (char &c : result) {\n\t\t\tc = toupper(c);\n\t\t}\n\t}\n\treturn result;\n}\n\n//第一引数で受け取った数を、第二引数で受け取った数の進数と見做して、第三引数の進数へ変換する。\nstring cnv_base(const string &str, ll from_base, ll to_base) {\n\tll num = 0;\n\t//小文字があったら大文字に変換\n\tstring num_str=cnv_string(str,1);\n\t// 数値を10進数に変換\n\tfor (char digit : num_str) {\n\t\tnum = num * from_base + (isdigit(digit) ? digit - '0' : digit - 'A' + 10);\n\t}\n\tstring result;\n\t// 数値を目的の基数に変換\n\twhile (num > 0) {\n\t\tll remainder = num % to_base;\n\t\tresult.push_back(remainder < 10 ? remainder + '0' : remainder - 10 + 'A');\n\t\tnum /= to_base;\n\t}\n\t// 結果を逆順にして返す\n\treverse(result.begin(), result.end());\n\treturn result.empty() ? \"0\" : result;\n}\n\nstring b;\n\n//b×nを計算\nstring muls(ll n){\n\tll bint=stoll(cnv_base(b,2,10));\n\tll ans=n*bint;\n\treturn cnv_base(to_string(ans),10,2);\n}\nstring pluss(string x,string y){\n\tll ans=stoll(cnv_base(x,2,10))+stoll(cnv_base(y,2,10));\n\treturn cnv_base(to_string(ans),10,2);\n}\n\nll solve(){\n\tll n;\n\tcin>>n;\n\tif(n==0){return 1;}\n\n\tcin>>b;\n\tb.insert(b.begin(),'1');\n\n\tll kasuu=0;\n\tstring ans=b;\n\t\n\twhile(n!=0){\n\t\tll mn=1,mx=min(n,1LL<<(54-b.size()));\n\n\t\twhile(mn!=mx){\n\t\t\tll mid=mn+mx;\n\t\t\tmid/=2;\n\t\t\tstring s=pluss(ans,muls(mid));\n\t\t\tif(s.size()==54)mx=mid;\n\t\t\telse mn=mid+1;\n\t\t}\n\n\t\tans=pluss(ans,muls(mx));\n\t\tn-=mx;\n\t\tif(ans.size()==53){\n\t\t\tbreak;\n\t\t}\n\n\t\tans.pop_back();\n\t\tb.pop_back();\n\t\tif(b.size()==0)b=\"0\";\n\t\tkasuu++;\n\t}\n\tstring ans1 = cnv_base(to_string(kasuu),10,2);\n\twhile(ans1.size()!=12)ans1.insert(ans1.begin(),'0');\n\n\tcout<<ans1;\n\tloop(i,1,52)cout<<ans[i];\n\tcout<<endl;\n\treturn 0;\n}\n\n//メイン\nint main(){\n\twhile(solve()==0);\n\treturn 0;\n}","accuracy":1,"time_ms":660,"memory_kb":3456,"score_of_the_acc":-1.1617,"final_rank":14},{"submission_id":"aoj_1628_10662397","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing uint = unsigned int;\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define all(v) v.begin(), v.end()\ntemplate <class T, class U>\ninline bool chmax(T &a, U b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T, class U>\ninline bool chmin(T &a, U b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T>\ninline void compress(vector<T> &a) {\n sort(a.begin(), a.end());\n a.erase(unique(a.begin(), a.end()), a.end());\n}\ntemplate <class T>\nT rand(T l, T r) {\n static mt19937 mt(random_device{}());\n // [l, r)\n if constexpr (is_integral_v<T>) {\n return uniform_int_distribution<T>(l, r - 1)(mt);\n } else if constexpr (is_floating_point_v<T>) {\n return uniform_real_distribution<T>(l, r)(mt);\n }\n}\nconstexpr int INF = 1001001001;\nconstexpr ll llINF = 3000000000000000010;\n#include <ext/pb_ds/assoc_container.hpp>\n#include <ext/pb_ds/tree_policy.hpp>\nusing namespace __gnu_pbds;\nusing pbds_set = tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>;\nusing pbds_mset = tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update>;\nusing pbds_umap = gp_hash_table<int, int>;\nusing pbds_trie = trie<string, null_type, trie_string_access_traits<>, pat_trie_tag, trie_prefix_search_node_update>;\nstruct linear_sieve {\n vector<int> least_factor, prime_list;\n linear_sieve(int n) : least_factor(n + 1, 0) {\n for (int i = 2; i <= n; i++) {\n if (least_factor[i] == 0) {\n least_factor[i] = i;\n prime_list.push_back(i);\n }\n for (int p : prime_list) {\n if (ll(i) * p > n || p > least_factor[i]) break;\n least_factor[i * p] = p;\n }\n }\n }\n};\ntemplate <int modulo>\nstruct modint {\n int x;\n modint() : x(0) {}\n modint(int64_t y) : x(y >= 0 ? y % modulo : (modulo - (-y) % modulo) % modulo) {}\n modint &operator+=(const modint &p) {\n if ((x += p.x) >= modulo) x -= modulo;\n return *this;\n }\n modint &operator-=(const modint &p) {\n if ((x += modulo - p.x) >= modulo) x -= modulo;\n return *this;\n }\n modint &operator*=(const modint &p) {\n x = (int)(1LL * x * p.x % modulo);\n return *this;\n }\n modint &operator/=(const modint &p) {\n *this *= p.inv();\n return *this;\n }\n modint operator-() const { return modint(-x); }\n modint operator+(const modint &p) const { return modint(*this) += p; }\n modint operator-(const modint &p) const { return modint(*this) -= p; }\n modint operator*(const modint &p) const { return modint(*this) *= p; }\n modint operator/(const modint &p) const { return modint(*this) /= p; }\n bool operator==(const modint &p) const { return x == p.x; }\n bool operator!=(const modint &p) const { return x != p.x; }\n modint inv() const {\n int a = x, b = modulo, u = 1, v = 0, t;\n while (b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return modint(u);\n }\n modint pow(int64_t n) const {\n modint ret(1), mul(x);\n while (n > 0) {\n if (n & 1) ret *= mul;\n mul *= mul;\n n >>= 1;\n }\n return ret;\n }\n friend ostream &operator<<(ostream &os, const modint &p) { return os << p.x; }\n friend istream &operator>>(istream &is, modint &a) {\n int64_t t;\n is >> t;\n a = modint<modulo>(t);\n return (is);\n }\n int val() const { return x; }\n static constexpr int mod() { return modulo; }\n static constexpr int half() { return (modulo + 1) >> 1; }\n};\nll extgcd(ll a, ll b, ll &x, ll &y) {\n // ax+by=gcd(|a|,|b|)\n if (a < 0 || b < 0) {\n ll d = extgcd(abs(a), abs(b), x, y);\n if (a < 0) x = -x;\n if (b < 0) y = -y;\n return d;\n }\n if (b == 0) {\n x = 1;\n y = 0;\n return a;\n }\n ll d = extgcd(b, a % b, y, x);\n y -= a / b * x;\n return d;\n}\ntemplate <typename T>\nstruct Binomial {\n vector<T> inv, fact, factinv;\n Binomial(int n) {\n inv.resize(n + 1);\n fact.resize(n + 1);\n factinv.resize(n + 1);\n inv[0] = fact[0] = factinv[0] = 1;\n for (int i = 1; i <= n; i++) fact[i] = fact[i - 1] * i;\n factinv[n] = fact[n].inv();\n inv[n] = fact[n - 1] * factinv[n];\n for (int i = n - 1; i >= 1; i--) {\n factinv[i] = factinv[i + 1] * (i + 1);\n inv[i] = fact[i - 1] * factinv[i];\n }\n }\n T C(int n, int r) {\n if (n < 0 || n < r || r < 0) return 0;\n return fact[n] * factinv[n - r] * factinv[r];\n }\n T P(int n, int r) {\n if (n < 0 || n < r || r < 0) return 0;\n return fact[n] * factinv[n - r];\n }\n T H(int n, int r) {\n if (n == 0 && r == 0) return 1;\n if (n < 0 || r < 0) return 0;\n return r == 0 ? 1 : C(n + r - 1, r);\n }\n};\ntemplate <class T>\nstruct Matrix {\n vector<vector<T>> m;\n Matrix() = default;\n Matrix(int x) : m(vector(x, vector<T>(x, 0))) {}\n Matrix(const vector<vector<T>> &a) : m(a) {}\n vector<T> &operator[](int i) { return m[i]; }\n const vector<T> &operator[](int i) const { return m[i]; }\n static Matrix identity(int x) {\n Matrix res(x);\n for (int i = 0; i < x; i++) res[i][i] = 1;\n return res;\n }\n static Matrix zero(int x) { return Matrix(x); }\n\n Matrix operator+() const { return (*this); }\n Matrix operator-() const { return Matrix(this->m.size()) - (*this); }\n Matrix operator+(const Matrix &a) const {\n Matrix x = (*this);\n return x += a;\n }\n Matrix operator-(const Matrix &a) const {\n Matrix x = (*this);\n return x -= a;\n }\n Matrix operator*(const Matrix &a) const {\n Matrix x = (*this);\n return x *= a;\n }\n Matrix operator*(const T &a) const {\n Matrix x = (*this);\n return x *= a;\n }\n Matrix &operator+=(const Matrix &a) {\n int n = m.size();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n m[i][j] += a[i][j];\n }\n }\n return *this;\n }\n Matrix &operator-=(const Matrix &a) {\n int n = m.size();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n m[i][j] -= a[i][j];\n }\n }\n return *this;\n }\n Matrix &operator*=(const Matrix &a) {\n int n = m.size();\n Matrix res(n);\n for (int i = 0; i < n; i++) {\n for (int k = 0; k < n; k++) {\n for (int j = 0; j < n; j++) {\n res[i][j] += m[i][k] * a[k][j];\n }\n }\n }\n m = res.m;\n return *this;\n }\n Matrix &operator*=(const T &a) {\n int n = m.size();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n m[i][j] *= a;\n }\n }\n return *this;\n }\n Matrix pow(ll b) const {\n Matrix x = *this, res = identity(x.m.size());\n while (b) {\n if (b & 1) {\n res *= x;\n }\n x *= x;\n b >>= 1;\n }\n return res;\n }\n T determinant() {\n int n = m.size();\n Matrix A(*this);\n T ret = 1;\n for (int i = 0; i < n; i++) {\n int pivot = -1;\n for (int j = i; j < n; j++) {\n if (A[j][i] != 0) pivot = j;\n }\n if (pivot == -1) return T(0);\n if (i != pivot) {\n ret *= -1;\n swap(A[i], A[pivot]);\n }\n ret *= A[i][i];\n T tmp = T(1) / A[i][i];\n for (int j = 0; j < n; j++) {\n A[i][j] *= tmp;\n }\n for (int j = i + 1; j < n; j++) {\n T a = A[j][i];\n for (int k = 0; k < n; k++) {\n A[j][k] -= A[i][k] * a;\n }\n }\n }\n return ret;\n }\n Matrix inverse() {\n assert(determinant() != 0);\n int n = m.size();\n Matrix ret = identity(n);\n Matrix A(*this);\n for (int i = 0; i < n; i++) {\n int pivot = -1;\n for (int j = i; j < n; j++) {\n if (A[j][i] != 0) pivot = j;\n }\n if (i != pivot) {\n swap(ret[i], ret[pivot]);\n swap(A[i], A[pivot]);\n }\n T tmp = T(1) / A[i][i];\n for (int j = 0; j < n; j++) {\n A[i][j] *= tmp;\n ret[i][j] *= tmp;\n }\n for (int j = 0; j < n; j++) {\n if (j == i) continue;\n T a = A[j][i];\n for (int k = 0; k < n; k++) {\n A[j][k] -= A[i][k] * a;\n ret[j][k] -= ret[i][k] * a;\n }\n }\n }\n return ret;\n }\n vector<T> characteristic_polynomial() {\n int n = m.size();\n if (n == 0) return {1};\n Matrix A(*this);\n for (int i = 1; i < n; i++) {\n int pivot = -1;\n for (int j = i; j < n; j++) {\n if (A[j][i - 1] != 0) pivot = j;\n }\n if (pivot == -1) continue;\n if (i != pivot) {\n swap(A[i], A[pivot]);\n for (int j = 0; j < n; j++) swap(A[j][i], A[j][pivot]);\n }\n T tmp = T(1) / A[i][i - 1];\n vector<T> c(n);\n for (int j = i + 1; j < n; j++) c[j] = tmp * A[j][i - 1];\n for (int j = i + 1; j < n; j++) {\n for (int k = i - 1; k < n; k++) {\n A[j][k] -= A[i][k] * c[j];\n }\n }\n for (int j = 0; j < n; j++) {\n for (int k = i + 1; k < n; k++) {\n A[j][i] += A[j][k] * c[k];\n }\n }\n }\n vector dp(n + 1, vector<T>(n + 1));\n dp[0][0] = 1;\n for (int i = 0; i < n; i++) {\n for (int j = 0; j <= i; j++) {\n dp[i + 1][j] -= dp[i][j] * A[i][i];\n dp[i + 1][j + 1] += dp[i][j];\n }\n T p = 1;\n for (int k = i + 1; k < n; k++) {\n p *= A[k][k - 1];\n for (int j = 0; j <= i; j++) dp[k + 1][j] -= dp[i][j] * p * A[i][k];\n }\n }\n return dp[n];\n }\n friend ostream &operator<<(ostream &os, const Matrix &a) {\n int n = a.m.size();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n os << a[i][j];\n if (j != n - 1) os << \" \";\n }\n os << \"\\n\";\n }\n return os;\n }\n friend istream &operator>>(istream &is, Matrix &a) {\n int n = a.m.size();\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < n; j++) {\n is >> a[i][j];\n }\n }\n return is;\n }\n};\n\ntemplate <class T, T (*op)(T, T), T (*e)()>\nstruct disjointsparsetable {\n vector<vector<T>> table;\n vector<int> logtable;\n disjointsparsetable() = default;\n disjointsparsetable(vector<T> v) {\n int len = 0;\n while ((1 << len) <= v.size()) len++;\n table.assign(len, vector<T>(1 << len, e()));\n for (int i = 0; i < (int)v.size(); i++) table[0][i] = v[i];\n for (int i = 1; i < len; i++) {\n int shift = 1 << i;\n for (int j = 0; j < (int)v.size(); j += shift << 1) {\n int t = min(j + shift, (int)v.size());\n table[i][t - 1] = v[t - 1];\n for (int k = t - 2; k >= j; k--) table[i][k] = op(v[k], table[i][k + 1]);\n if (v.size() <= t) break;\n table[i][t] = v[t];\n int r = min(t + shift, (int)v.size());\n for (int k = t + 1; k < r; k++) table[i][k] = op(table[i][k - 1], v[k]);\n }\n }\n logtable.resize(1 << len);\n for (int i = 2; i < logtable.size(); i++) {\n logtable[i] = logtable[(i >> 1)] + 1;\n }\n }\n T query(int l, int r) {\n if (l == r) return e();\n if (l >= --r) return table[0][l];\n int len = logtable[l ^ r];\n return op(table[len][l], table[len][r]);\n };\n};\nusing mint = modint<998244353>;\nvoid solve() {\n ll n;\n cin >> n;\n if (n == 0) exit(0);\n string s;\n cin >> s;\n // 52 digits\n // 2^a*(1.b)で表現\n // 2^0*(1.s) = 2^a*(1.s/2^a)\n auto xcd = [&](string b, string t, int k) {\n if (51 - k < (int)t.size() - 1) {\n return true;\n }\n // 0.b+t*2^k>=1?\n vector<int> v(52);\n rep(i, 52) v[i] = b[i] - '0';\n rep(i, t.size()) {\n if (t[t.size() - 1 - i] == '1') {\n v[51 - k - i]++;\n }\n }\n for (int i = 51; i >= 0; i--) {\n if (v[i] >= 2) {\n v[i] -= 2;\n if (i == 0) {\n return true;\n }\n v[i - 1]++;\n }\n }\n return false;\n };\n auto add = [&](string &b, string t, int k) {\n vector<int> v(52);\n rep(i, 52) v[i] = b[i] - '0';\n rep(i, t.size()) {\n if (t[t.size() - 1 - i] == '1') {\n v[51 - k - i]++;\n }\n }\n for (int i = 51; i >= 0; i--) {\n if (v[i] >= 2) {\n v[i] -= 2;\n assert(i);\n v[i - 1]++;\n }\n }\n rep(i, 52) b[i] = ('0' + v[i]);\n };\n auto add_carry = [&](string &b, string t) {\n vector<int> v(52);\n rep(i, 52) v[i] = b[i] - '0';\n rep(i, t.size()) {\n if (t[t.size() - 1 - i] == '1') {\n v[51 - i]++;\n }\n }\n for (int i = 51; i >= 0; i--) {\n if (v[i] >= 2) {\n v[i] -= 2;\n if (i) v[i - 1]++;\n }\n }\n rep(i, 52) b[i] = ('0' + v[i]);\n // 2.b\n b = \"0\" + b;\n b.pop_back();\n };\n int a = 1;\n string b = s;\n n--;\n while (n) {\n string t = \"1\" + s;\n if (t.size() <= a) break;\n rep(_, a) t.pop_back();\n // 繰り上がるまでに何回足す？\n for (int i = 60; i >= 0; i--) {\n if (n >> i) {\n if (!xcd(b, t, i)) {\n add(b, t, i);\n n -= 1LL << i;\n }\n }\n }\n if (n) {\n n--;\n add_carry(b, t);\n a++;\n }\n }\n for (int i = 11; i >= 0; i--) {\n cout << ((a >> i) & 1);\n }\n cout << b << endl;\n}\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n int t = 1;\n // cin >> t;\n while (1) solve();\n}","accuracy":1,"time_ms":140,"memory_kb":3400,"score_of_the_acc":-0.8228,"final_rank":9},{"submission_id":"aoj_1628_9448876","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)), (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#include <unistd.h>\n\nnamespace fastio {\nstatic constexpr uint32_t SZ = 1 << 17;\nchar ibuf[SZ];\nchar obuf[SZ];\nchar out[100];\n// pointer of ibuf, obuf\n\n\nuint32_t pil = 0, pir = 0, por = 0;\n\nstruct Pre {\n char num[10000][4];\n constexpr Pre() : num() {\n for (int i = 0; i < 10000; i++) {\n int n = i;\n for (int j = 3; j >= 0; j--) {\n num[i][j] = n % 10 | '0';\n n /= 10;\n }\n }\n }\n} constexpr pre;\n\ninline void load() {\n memmove(ibuf, ibuf + pil, pir - pil);\n pir = pir - pil + fread(ibuf + pir - pil, 1, SZ - pir + pil, stdin);\n pil = 0;\n if (pir < SZ)\n ibuf[pir++] = '\\n';\n}\n\ninline void flush() {\n fwrite(obuf, 1, por, stdout);\n por = 0;\n}\n\nvoid rd(char &c) {\n do {\n if (pil + 1 > pir)\n load();\n c = ibuf[pil++];\n } while (isspace(c));\n}\n\nvoid rd(string &x) {\n x.clear();\n char c;\n do {\n if (pil + 1 > pir)\n load();\n c = ibuf[pil++];\n } while (isspace(c));\n do {\n x += c;\n if (pil == pir)\n load();\n c = ibuf[pil++];\n } while (!isspace(c));\n}\n\ntemplate <typename T> void rd_real(T &x) {\n string s;\n rd(s);\n x = stod(s);\n}\n\ntemplate <typename T> void rd_integer(T &x) {\n if (pil + 100 > pir)\n load();\n char c;\n do\n c = ibuf[pil++];\n while (c < '-');\n bool minus = 0;\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\n if (c == '-') {\n minus = 1, c = ibuf[pil++];\n }\n }\n x = 0;\n while ('0' <= c) {\n x = x * 10 + (c & 15), c = ibuf[pil++];\n }\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\n if (minus)\n x = -x;\n }\n}\n\nvoid rd(int &x) {\n rd_integer(x);\n}\nvoid rd(ll &x) {\n rd_integer(x);\n}\nvoid rd(i128 &x) {\n rd_integer(x);\n}\nvoid rd(uint &x) {\n rd_integer(x);\n}\nvoid rd(ull &x) {\n rd_integer(x);\n}\nvoid rd(u128 &x) {\n rd_integer(x);\n}\nvoid rd(double &x) {\n rd_real(x);\n}\nvoid rd(long double &x) {\n rd_real(x);\n}\n\ntemplate <class T, class U> void rd(pair<T, U> &p) {\n return rd(p.first), rd(p.second);\n}\ntemplate <size_t N = 0, typename T> void rd_tuple(T &t) {\n if constexpr (N < std::tuple_size<T>::value) {\n auto &x = std::get<N>(t);\n rd(x);\n rd_tuple<N + 1>(t);\n }\n}\ntemplate <class... T> void rd(tuple<T...> &tpl) {\n rd_tuple(tpl);\n}\n\ntemplate <size_t N = 0, typename T> void rd(array<T, N> &x) {\n for (auto &d : x)\n rd(d);\n}\ntemplate <class T> void rd(vector<T> &x) {\n for (auto &d : x)\n rd(d);\n}\n\nvoid read() {}\ntemplate <class H, class... T> void read(H &h, T &...t) {\n rd(h), read(t...);\n}\n\nvoid wt(const char c) {\n if (por == SZ)\n flush();\n obuf[por++] = c;\n}\nvoid wt(const string s) {\n for (char c : s)\n wt(c);\n}\nvoid wt(const char *s) {\n size_t len = strlen(s);\n for (size_t i = 0; i < len; i++)\n wt(s[i]);\n}\n\ntemplate <typename T> void wt_integer(T x) {\n if (por > SZ - 100)\n flush();\n if (x < 0) {\n obuf[por++] = '-', x = -x;\n }\n int outi;\n for (outi = 96; x >= 10000; outi -= 4) {\n memcpy(out + outi, pre.num[x % 10000], 4);\n x /= 10000;\n }\n if (x >= 1000) {\n memcpy(obuf + por, pre.num[x], 4);\n por += 4;\n } else if (x >= 100) {\n memcpy(obuf + por, pre.num[x] + 1, 3);\n por += 3;\n } else if (x >= 10) {\n int q = (x * 103) >> 10;\n obuf[por] = q | '0';\n obuf[por + 1] = (x - q * 10) | '0';\n por += 2;\n } else\n obuf[por++] = x | '0';\n memcpy(obuf + por, out + outi + 4, 96 - outi);\n por += 96 - outi;\n}\n\ntemplate <typename T> void wt_real(T x) {\n ostringstream oss;\n oss << fixed << setprecision(15) << double(x);\n string s = oss.str();\n wt(s);\n}\n\nvoid wt(int x) {\n wt_integer(x);\n}\nvoid wt(ll x) {\n wt_integer(x);\n}\nvoid wt(i128 x) {\n wt_integer(x);\n}\nvoid wt(uint x) {\n wt_integer(x);\n}\nvoid wt(ull x) {\n wt_integer(x);\n}\nvoid wt(u128 x) {\n wt_integer(x);\n}\nvoid wt(double x) {\n wt_real(x);\n}\nvoid wt(long double x) {\n wt_real(x);\n}\n\ntemplate <class T, class U> void wt(const pair<T, U> val) {\n wt(val.first);\n wt(' ');\n wt(val.second);\n}\ntemplate <size_t N = 0, typename T> void wt_tuple(const T t) {\n if constexpr (N < std::tuple_size<T>::value) {\n if constexpr (N > 0) {\n wt(' ');\n }\n const auto x = std::get<N>(t);\n wt(x);\n wt_tuple<N + 1>(t);\n }\n}\ntemplate <class... T> void wt(tuple<T...> tpl) {\n wt_tuple(tpl);\n}\ntemplate <class T, size_t S> void wt(const array<T, S> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i)\n wt(' ');\n wt(val[i]);\n }\n}\ntemplate <class T> void wt(const vector<T> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i)\n wt(' ');\n wt(val[i]);\n }\n}\n\nvoid print() {\n wt('\\n');\n}\ntemplate <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {\n wt(head);\n if (sizeof...(Tail))\n wt(' ');\n print(forward<Tail>(tail)...);\n}\nvoid __attribute__((destructor)) _d() {\n flush();\n}\n} // namespace fastio\n\n\nusing fastio::flush;\nusing fastio::print;\nusing fastio::read;\n\ninline void first(bool i = true) {\n print(i ? \"first\" : \"second\");\n}\ninline void Alice(bool i = true) {\n print(i ? \"Alice\" : \"Bob\");\n}\ninline void Takahashi(bool i = true) {\n print(i ? \"Takahashi\" : \"Aoki\");\n}\ninline void yes(bool i = true) {\n print(i ? \"yes\" : \"no\");\n}\ninline void Yes(bool i = true) {\n print(i ? \"Yes\" : \"No\");\n}\ninline void No() {\n print(\"No\");\n}\ninline void YES(bool i = true) {\n print(i ? \"YES\" : \"NO\");\n}\ninline void NO() {\n print(\"NO\");\n}\ninline void Yay(bool i = true) {\n print(i ? \"Yay!\" : \":(\");\n}\ninline void Possible(bool i = true) {\n print(i ? \"Possible\" : \"Impossible\");\n}\ninline void POSSIBLE(bool i = true) {\n print(i ? \"POSSIBLE\" : \"IMPOSSIBLE\");\n}\n\n/**\n * @brief Fast IO\n */\n\ntemplate <unsigned mod = 1000000007> struct fp {\n unsigned v;\n static constexpr int get_mod() {\n return mod;\n }\n constexpr unsigned inv() const {\n assert(v != 0);\n int x = v, y = mod, p = 1, q = 0, t = 0, tmp = 0;\n while (y > 0) {\n t = x / y;\n x -= t * y, p -= t * q;\n tmp = x, x = y, y = tmp;\n tmp = p, p = q, q = tmp;\n }\n if (p < 0)\n p += mod;\n return p;\n }\n constexpr fp(ll x = 0) : v(x >= 0 ? x % mod : (mod - (-x) % mod) % mod) {}\n fp operator-() const {\n return fp() - *this;\n }\n fp pow(ull t) {\n fp res = 1, b = *this;\n while (t) {\n if (t & 1)\n res *= b;\n b *= b;\n t >>= 1;\n }\n return res;\n }\n fp &operator+=(const fp &x) {\n if ((v += x.v) >= mod)\n v -= mod;\n return *this;\n }\n fp &operator-=(const fp &x) {\n if ((v += mod - x.v) >= mod)\n v -= mod;\n return *this;\n }\n fp &operator*=(const fp &x) {\n v = ull(v) * x.v % mod;\n return *this;\n }\n fp &operator/=(const fp &x) {\n v = ull(v) * x.inv() % mod;\n return *this;\n }\n fp operator+(const fp &x) const {\n return fp(*this) += x;\n }\n fp operator-(const fp &x) const {\n return fp(*this) -= x;\n }\n fp operator*(const fp &x) const {\n return fp(*this) *= x;\n }\n fp operator/(const fp &x) const {\n return fp(*this) /= x;\n }\n bool operator==(const fp &x) const {\n return v == x.v;\n }\n bool operator!=(const fp &x) const {\n return v != x.v;\n }\n friend istream &operator>>(istream &is, fp &x) {\n return is >> x.v;\n }\n friend ostream &operator<<(ostream &os, const fp &x) {\n return os << x.v;\n }\n};\n\ntemplate <unsigned mod> void rd(fp<mod> &x) {\n fastio::rd(x.v);\n}\ntemplate <unsigned mod> void wt(fp<mod> x) {\n fastio::wt(x.v);\n}\n\ntemplate <typename T> T Inv(ll n) {\n static const int md = T::get_mod();\n static vector<T> buf({0, 1});\n assert(n > 0);\n n %= md;\n while (SZ(buf) <= n) {\n int k = SZ(buf), q = (md + k - 1) / k;\n buf.push_back(buf[k * q - md] * q);\n }\n return buf[n];\n}\n\ntemplate <typename T> T Fact(ll n, bool inv = 0) {\n static const int md = T::get_mod();\n static vector<T> buf({1, 1}), ibuf({1, 1});\n assert(n >= 0 and n < md);\n while (SZ(buf) <= n) {\n buf.push_back(buf.back() * SZ(buf));\n ibuf.push_back(ibuf.back() * Inv<T>(SZ(ibuf)));\n }\n return inv ? ibuf[n] : buf[n];\n}\n\ntemplate <typename T> T nPr(int n, int r, bool inv = 0) {\n if (n < 0 || n < r || r < 0)\n return 0;\n return Fact<T>(n, inv) * Fact<T>(n - r, inv ^ 1);\n}\ntemplate <typename T> T nCr(int n, int r, bool inv = 0) {\n if (n < 0 || n < r || r < 0)\n return 0;\n return Fact<T>(n, inv) * Fact<T>(r, inv ^ 1) * Fact<T>(n - r, inv ^ 1);\n}\ntemplate <typename T> T nHr(int n, int r, bool inv = 0) {\n return nCr<T>(n + r - 1, r, inv);\n}\n\n/**\n * @brief Modint\n */\n\nint main() {\nwhile(1) {\n ll _;\n cin >> _;\n if (_ == 0) return 0;\n ll A = _;\n string S;\n cin >> S;\n ll B = (1LL<<52);\n rep(i,0,52) {\n if (S[i] == '1') B += (1LL<<(51-i));\n }\n ll MAX = 1LL<<53, Cur = B;\n rep(i,0,100) {\n ll OK = 0, NG = A+1;\n while(NG - OK > 1) {\n ll MID = (NG + OK) / 2;\n if (B == 0) OK = MID;\n else if ((MAX * 2 - Cur) / B <= MID) NG = MID;\n else if (Cur + B * MID >= MAX) NG = MID;\n else OK = MID;\n }\n if (OK == A) {\n Cur += B * A;\n rep(j,0,12) {\n if ((i & (1<<(11-j))) == 0) cout << '0';\n else cout << '1';\n }\n vector<int> R(52,0);\n rep(j,0,52) {\n if (Cur % 2 == 1) R[j] = 1;\n Cur /= 2;\n }\n rep(j,0,52) {\n if (R[51-j] == 0) cout << '0';\n else cout << '1';\n }\n cout << endl;\n break;\n }\n A -= NG;\n Cur += B * NG;\n Cur /= 2;\n B /= 2;\n }\n}\n}","accuracy":1,"time_ms":10,"memory_kb":3496,"score_of_the_acc":-1,"final_rank":12},{"submission_id":"aoj_1628_9323114","code_snippet":"#include <algorithm>\n#include <array>\n#include <bitset>\n#include <cassert>\n#include <chrono>\n#include <cmath>\n#include <complex>\n#include <deque>\n#include <forward_list>\n#include <fstream>\n#include <functional>\n#include <iomanip>\n#include <ios>\n#include <iostream>\n#include <limits>\n#include <list>\n#include <map>\n#include <memory>\n#include <numeric>\n#include <optional>\n#include <queue>\n#include <random>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <type_traits>\n#include <unordered_map>\n#include <unordered_set>\n#include <utility>\n#include <vector>\n\n#ifdef RUTHEN_LOCAL\n#include <debug.hpp>\n#else\n#define show(x) true\n#endif\n\n// type definition\nusing i64 = long long;\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nusing f32 = float;\nusing f64 = double;\nusing f128 = long double;\ntemplate <class T> using pque = std::priority_queue<T>;\ntemplate <class T> using pqueg = std::priority_queue<T, std::vector<T>, std::greater<T>>;\n// overload\n#define overload4(_1, _2, _3, _4, name, ...) name\n#define overload3(_1, _2, _3, name, ...) name\n#define overload2(_1, _2, name, ...) name\n// for loop\n#define REP1(a) for (long long _ = 0; _ < (a); _++)\n#define REP2(i, a) for (long long i = 0; i < (a); i++)\n#define REP3(i, a, b) for (long long i = (a); i < (b); i++)\n#define REP4(i, a, b, c) for (long long i = (a); i < (b); i += (c))\n#define REP(...) overload4(__VA_ARGS__, REP4, REP3, REP2, REP1)(__VA_ARGS__)\n#define RREP1(a) for (long long _ = (a)-1; _ >= 0; _--)\n#define RREP2(i, a) for (long long i = (a)-1; i >= 0; i--)\n#define RREP3(i, a, b) for (long long i = (b)-1; i >= (a); i--)\n#define RREP(...) overload3(__VA_ARGS__, RREP3, RREP2, RREP1)(__VA_ARGS__)\n#define FORE1(x, a) for (auto&& x : a)\n#define FORE2(x, y, a) for (auto&& [x, y] : a)\n#define FORE3(x, y, z, a) for (auto&& [x, y, z] : a)\n#define FORE(...) overload4(__VA_ARGS__, FORE3, FORE2, FORE1)(__VA_ARGS__)\n#define FORSUB(t, s) for (long long t = (s); t >= 0; t = (t == 0 ? -1 : (t - 1) & (s)))\n// function\n#define ALL(a) (a).begin(), (a).end()\n#define RALL(a) (a).rbegin(), (a).rend()\n#define SORT(a) std::sort((a).begin(), (a).end())\n#define RSORT(a) std::sort((a).rbegin(), (a).rend())\n#define REV(a) std::reverse((a).begin(), (a).end())\n#define UNIQUE(a) \\\n std::sort((a).begin(), (a).end()); \\\n (a).erase(std::unique((a).begin(), (a).end()), (a).end())\n#define LEN(a) (int)((a).size())\n#define MIN(a) *std::min_element((a).begin(), (a).end())\n#define MAX(a) *std::max_element((a).begin(), (a).end())\n#define SUM1(a) std::accumulate((a).begin(), (a).end(), 0LL)\n#define SUM2(a, x) std::accumulate((a).begin(), (a).end(), (x))\n#define SUM(...) overload2(__VA_ARGS__, SUM2, SUM1)(__VA_ARGS__)\n#define LB(a, x) std::distance((a).begin(), std::lower_bound((a).begin(), (a).end(), (x)))\n#define UB(a, x) std::distance((a).begin(), std::upper_bound((a).begin(), (a).end(), (x)))\ntemplate <class T, class U> inline bool chmin(T& a, const U& b) { return (a > T(b) ? a = b, 1 : 0); }\ntemplate <class T, class U> inline bool chmax(T& a, const U& b) { return (a < T(b) ? a = b, 1 : 0); }\ntemplate <class T, class S> inline T floor(const T x, const S y) {\n assert(y);\n return (y < 0 ? floor(-x, -y) : (x > 0 ? x / y : x / y - (x % y == 0 ? 0 : 1)));\n}\ntemplate <class T, class S> inline T ceil(const T x, const S y) {\n assert(y);\n return (y < 0 ? ceil(-x, -y) : (x > 0 ? (x + y - 1) / y : x / y));\n}\ntemplate <class T, class S> std::pair<T, T> inline divmod(const T x, const S y) {\n T q = floor(x, y);\n return {q, x - q * y};\n}\n// 10 ^ n\nconstexpr long long TEN(int n) { return (n == 0) ? 1 : 10LL * TEN(n - 1); }\n// 1 + 2 + ... + n\n#define TRI1(n) ((n) * ((n) + 1LL) / 2)\n// l + (l + 1) + ... + r\n#define TRI2(l, r) (((l) + (r)) * ((r) - (l) + 1LL) / 2)\n#define TRI(...) overload2(__VA_ARGS__, TRI2, TRI1)(__VA_ARGS__)\n// bit operation\n// bit[i] (= 0 or 1)\n#define IBIT(bit, i) (((bit) >> (i)) & 1)\n// (0, 1, 2, 3, 4) -> (0, 1, 3, 7, 15)\n#define MASK(n) ((1LL << (n)) - 1)\n#define POW2(n) (1LL << (n))\n// (0, 1, 2, 3, 4) -> (0, 1, 1, 2, 1)\nint popcnt(int x) { return __builtin_popcount(x); }\nint popcnt(u32 x) { return __builtin_popcount(x); }\nint popcnt(i64 x) { return __builtin_popcountll(x); }\nint popcnt(u64 x) { return __builtin_popcountll(x); }\n// (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2)\nint topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }\nint topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }\nint topbit(i64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\nint topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\n// (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2)\nint lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }\nint lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); }\nint lowbit(i64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\nint lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\n// binary search\ntemplate <class T, class F> T bin_search(T ok, T ng, F& f) {\n while ((ok > ng ? ok - ng : ng - ok) > 1) {\n T md = (ng + ok) >> 1;\n (f(md) ? ok : ng) = md;\n }\n return ok;\n}\ntemplate <class T, class F> T bin_search_real(T ok, T ng, F& f, const int iter = 100) {\n for (int _ = 0; _ < iter; _++) {\n T md = (ng + ok) / 2;\n (f(md) ? ok : ng) = md;\n }\n return ok;\n}\n// rotate matrix counterclockwise by pi / 2\ntemplate <class T> void rot(std::vector<std::vector<T>>& a) {\n if ((int)(a.size()) == 0) return;\n if ((int)(a[0].size()) == 0) return;\n int n = (int)(a.size()), m = (int)(a[0].size());\n std::vector res(m, std::vector<T>(n));\n for (int i = 0; i < n; i++) {\n for (int j = 0; j < m; j++) {\n res[m - 1 - j][i] = a[i][j];\n }\n }\n a.swap(res);\n}\n// const value\nconstexpr int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\nconstexpr int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\n// infinity\ntemplate <class T> constexpr T INF = 0;\ntemplate <> constexpr int INF<int> = 1'000'000'000; // 1e9\ntemplate <> constexpr i64 INF<i64> = i64(INF<int>) * INF<int> * 2; // 2e18\ntemplate <> constexpr u32 INF<u32> = INF<int>; // 1e9\ntemplate <> constexpr u64 INF<u64> = INF<i64>; // 2e18\ntemplate <> constexpr f32 INF<f32> = INF<i64>; // 2e18\ntemplate <> constexpr f64 INF<f64> = INF<i64>; // 2e18\ntemplate <> constexpr f128 INF<f128> = INF<i64>; // 2e18\n// I/O\n// input\ntemplate <class T> std::istream& operator>>(std::istream& is, std::vector<T>& v) {\n for (auto&& i : v) is >> i;\n return is;\n}\ntemplate <class... T> void in(T&... a) { (std::cin >> ... >> a); }\nvoid scan() {}\ntemplate <class Head, class... Tail> void scan(Head& head, Tail&... tail) {\n in(head);\n scan(tail...);\n}\n// input macro\n#define INT(...) \\\n int __VA_ARGS__; \\\n scan(__VA_ARGS__)\n#define I64(...) \\\n i64 __VA_ARGS__; \\\n scan(__VA_ARGS__)\n#define U32(...) \\\n u32 __VA_ARGS__; \\\n scan(__VA_ARGS__)\n#define U64(...) \\\n u64 __VA_ARGS__; \\\n scan(__VA_ARGS__)\n#define F32(...) \\\n f32 __VA_ARGS__; \\\n scan(__VA_ARGS__)\n#define F64(...) \\\n f64 __VA_ARGS__; \\\n scan(__VA_ARGS__)\n#define F128(...) \\\n f128 __VA_ARGS__; \\\n scan(__VA_ARGS__)\n#define STR(...) \\\n std::string __VA_ARGS__; \\\n scan(__VA_ARGS__)\n#define CHR(...) \\\n char __VA_ARGS__; \\\n scan(__VA_ARGS__)\n#define VEC(type, name, size) \\\n std::vector<type> name(size); \\\n scan(name)\n#define VEC2(type, name1, name2, size) \\\n std::vector<type> name1(size), name2(size); \\\n for (int i = 0; i < size; i++) scan(name1[i], name2[i])\n#define VEC3(type, name1, name2, name3, size) \\\n std::vector<type> name1(size), name2(size), name3(size); \\\n for (int i = 0; i < size; i++) scan(name1[i], name2[i], name3[i])\n#define VEC4(type, name1, name2, name3, name4, size) \\\n std::vector<type> name1(size), name2(size), name3(size), name4(size); \\\n for (int i = 0; i < size; i++) scan(name1[i], name2[i], name3[i], name4[i])\n#define VV(type, name, h, w) \\\n std::vector name((h), std::vector<type>((w))); \\\n scan(name)\n// output\ntemplate <class T> std::ostream& operator<<(std::ostream& os, const std::vector<T>& v) {\n auto n = v.size();\n for (size_t i = 0; i < n; i++) {\n if (i) os << ' ';\n os << v[i];\n }\n return os;\n}\ntemplate <class... T> void out(const T&... a) { (std::cout << ... << a); }\nvoid print() { out('\\n'); }\ntemplate <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {\n out(head);\n if (sizeof...(Tail)) out(' ');\n print(tail...);\n}\n// for interactive problems\nvoid printi() { std::cout << std::endl; }\ntemplate <class Head, class... Tail> void printi(Head&& head, Tail&&... tail) {\n out(head);\n if (sizeof...(Tail)) out(' ');\n printi(tail...);\n}\n// bool output\nvoid YES(bool t = 1) { print(t ? \"YES\" : \"NO\"); }\nvoid Yes(bool t = 1) { print(t ? \"Yes\" : \"No\"); }\nvoid yes(bool t = 1) { print(t ? \"yes\" : \"no\"); }\nvoid NO(bool t = 1) { YES(!t); }\nvoid No(bool t = 1) { Yes(!t); }\nvoid no(bool t = 1) { yes(!t); }\nvoid POSSIBLE(bool t = 1) { print(t ? \"POSSIBLE\" : \"IMPOSSIBLE\"); }\nvoid Possible(bool t = 1) { print(t ? \"Possible\" : \"Impossible\"); }\nvoid possible(bool t = 1) { print(t ? \"possible\" : \"impossible\"); }\nvoid IMPOSSIBLE(bool t = 1) { POSSIBLE(!t); }\nvoid Impossible(bool t = 1) { Possible(!t); }\nvoid impossible(bool t = 1) { possible(!t); }\nvoid FIRST(bool t = 1) { print(t ? \"FIRST\" : \"SECOND\"); }\nvoid First(bool t = 1) { print(t ? \"First\" : \"Second\"); }\nvoid first(bool t = 1) { print(t ? \"first\" : \"second\"); }\nvoid SECOND(bool t = 1) { FIRST(!t); }\nvoid Second(bool t = 1) { First(!t); }\nvoid second(bool t = 1) { first(!t); }\n// I/O speed up\nstruct SetUpIO {\n SetUpIO() {\n std::ios::sync_with_stdio(false);\n std::cin.tie(0);\n std::cout << std::fixed << std::setprecision(15);\n }\n} set_up_io;\n// #include \"math/divisor.hpp\"\nusing namespace std;\n\nvoid solve(i64 N) {\n STR(S);\n using Num = pair<int, string>;\n\n auto add = [](Num a, Num b, i64& addnum) -> Num {\n deque<int> qa, qb;\n REP(i, LEN(a.second)) qa.push_back(a.second[i] - '0');\n REP(i, LEN(b.second)) qb.push_back(b.second[i] - '0');\n qa.push_front(1);\n qb.push_front(1);\n int emax = max(a.first, b.first);\n int da = emax - a.first;\n int db = emax - b.first;\n assert(da == 0);\n REP(db) qb.push_front(0);\n while (LEN(qb) > 53) qb.pop_back();\n show(qa);\n show(qb);\n\n i64 n = 1;\n int ok = 1;\n {\n int carry = 0;\n RREP(i, 53) {\n int s = qa[i] + qb[i] + carry;\n carry = s / 2;\n }\n ok &= carry == 0;\n }\n while (addnum >= 2 * n and ok) {\n qb.push_back(0);\n int memo = qb.front();\n qb.pop_front();\n // check\n int carry = 0;\n RREP(i, 53) {\n int s = qa[i] + qb[i] + carry;\n carry = s / 2;\n }\n // ok\n if (carry == 0) {\n n *= 2;\n } else {\n // rollback\n qb.push_front(memo);\n qb.pop_back();\n break;\n }\n }\n\n int carry = 0;\n deque<int> sum;\n RREP(i, 53) {\n int s = qa[i] + qb[i] + carry;\n sum.push_front(s % 2);\n carry = s / 2;\n }\n show(qa);\n show(qb);\n show(sum);\n if (carry == 1) {\n sum.push_front(1);\n emax++;\n sum.pop_back();\n }\n sum.pop_front();\n string ans;\n REP(i, 52) ans += sum[i] + '0';\n addnum -= n;\n return {emax, ans};\n };\n\n Num a = {0, S};\n Num s = a;\n while (N > 0) {\n s = add(s, a, N);\n show(s);\n show(N);\n }\n // print(s);\n string ans;\n RREP(i, 12) ans += '0' + IBIT(s.first, i);\n ans += s.second;\n print(ans);\n return;\n}\n\nint main() {\n i64 N;\n while (cin >> N, N != 0) solve(N);\n return 0;\n}","accuracy":1,"time_ms":700,"memory_kb":3412,"score_of_the_acc":-1.0727,"final_rank":13},{"submission_id":"aoj_1628_6014231","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define ull unsigned long long\n#define db double\n#define pii pair<int,int>\n#define pli pair<ll,int>\n#define pil pair<int,ll>\n#define pll pair<ll,ll>\n#define ti3 tuple<int,int,int>\n#define mat vector<vector<ll>>\nconst int inf = 1 << 30;\nconst ll mod = 1e9 + 7;\nconst ll linf = 1e18;\nconst db EPS = 1e-10;\nconst db pi = acos(-1);\ntemplate<class T> void chmin(T& x, T y){if(x > y) x = y;}\ntemplate<class T> void chmax(T& x, T y){if(x < y) x = y;}\n\nll n;\nstring culc(string x, string y) {\n string ex = x.substr(0, 12);\n string ey = y.substr(0, 12);\n bool flag = true;\n if (stoi(ex, 0, 2) > stoi(ey, 0, 2)) {\n flag = false;\n swap(x, y);\n swap(ex, ey);\n }\n string mx = x.substr(12, 52);\n mx = \"1\" + mx;\n string my = y.substr(12, 52);\n my = \"1\" + my;\n int a = stoi(ex, 0, 2), b = stoi(ey, 0, 2), c = b - a;\n if (c > 52) {\n return \"\";\n } else {\n for (int i = 52; i - c >= 0; i--) {\n mx[i] = mx[i - c];\n }\n for (int i = 0; i < c; i++) {\n mx[i] = '0';\n }\n }\n\n ll d = stoll(mx, 0, 2), e = stoll(my, 0, 2);\n\n if (flag) {\n n--;\n } else {\n ll q = ((1ll << 53) - e) / d;\n ll r = ((1ll << 53) - e) % d;\n if (r != 0) q++;\n q = min(n, q);\n d *= q;\n n -= q;\n }\n ll f = d + e;\n if (f >> 53 & 1ll) {\n c++;\n f /= 2;\n }\n bitset<52> bs2(f);\n string mz = bs2.to_string();\n bitset<12> bs1(c + a);\n string ez = bs1.to_string();\n string z = ez + mz;\n return z;\n}\n\nvoid solve() {\n string b;\n cin >> b;\n string e = \"000000000000\";\n b = e + b;\n string a = b;\n while (n > 0) {\n string c = culc(a, b);\n if (c == \"\") break;\n a = c;\n }\n cout << a << endl;\n}\n\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n cout << fixed << setprecision(20);\n while (true) {\n cin >> n;\n if (n == 0) break;\n solve();\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3384,"score_of_the_acc":-0.7333,"final_rank":8},{"submission_id":"aoj_1628_5937061","code_snippet":"#include <bits/stdc++.h>\n#define _overload3(_1, _2, _3, name, ...) name\n#define _rep(i, n) repi(i, 0, n)\n#define repi(i, a, b) for (int i = (a); i < (b); ++i)\n#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)\n#define ALL(x) x.begin(), x.end()\n#define chmax(x, y) x = max(x, y)\n#define chmin(x, y) x = min(x, y)\nusing namespace std;\nrandom_device rnd;\nmt19937 mt(rnd());\nusing ll = long long;\nusing lld = long double;\nusing VI = vector<int>;\nusing VVI = vector<VI>;\nusing VL = vector<ll>;\nusing VVL = vector<VL>;\nusing PII = pair<int, int>;\nconst int IINF = 1 << 30;\nconst ll INF = 1ll << 60;\nconst ll MOD = 1000000007;\nclass FloatingPointNumber\n{\npublic:\n ll exp;\n vector<int> fraction;\n FloatingPointNumber(int size = 52)\n {\n exp = 0;\n fraction.assign(size, 0);\n }\n void print()\n {\n string binary = bitset<12>(exp).to_string();\n cout << binary;\n for (int i = 1; i < fraction.size(); i++)\n {\n cout << fraction[i];\n }\n cout << endl;\n }\n};\n\nbool check(FloatingPointNumber a, FloatingPointNumber b)\n{\n int carry = 0;\n int pos = b.fraction.size() - 1;\n // cerr << \"@@@@@@@\" << endl;\n // a.print();\n // b.print();\n for (int i = a.fraction.size() - 1; i >= 0; i--, pos--)\n {\n\n b.fraction.at(pos) += a.fraction.at(i);\n b.fraction.at(pos) += carry;\n if (b.fraction.at(pos) >= 2)\n {\n b.fraction.at(pos) -= 2;\n carry = 1;\n }\n else\n {\n carry = 0;\n }\n }\n // cerr << carry << \" \" << pos << endl;\n for (; pos >= 0; pos--)\n {\n b.fraction.at(pos) += carry;\n if (b.fraction.at(pos) >= 2)\n {\n b.fraction.at(pos) -= 2;\n carry = 1;\n }\n else\n {\n carry = 0;\n }\n }\n return carry == 0;\n}\n\nvoid add(FloatingPointNumber &b, FloatingPointNumber a, ll &m)\n{\n if (a.exp > b.exp)\n {\n swap(a, b);\n }\n while (!a.fraction.empty() && a.exp < b.exp)\n {\n a.fraction.pop_back();\n a.exp++;\n }\n if (a.fraction.empty())\n {\n return;\n }\n m--;\n ll cost = 1;\n while (m > 0 && a.fraction.size() < 53 && check(a, b))\n {\n if (cost <= m)\n {\n m -= cost;\n a.fraction.push_back(0);\n cost *= 2;\n if (check(a, b) == false)\n {\n cost /= 2;\n m += cost;\n a.fraction.pop_back();\n break;\n }\n }\n else\n {\n break;\n }\n }\n\n int carry = 0;\n int pos = b.fraction.size() - 1;\n // cerr << \"@@@@@@@\" << endl;\n // a.print();\n // b.print();\n for (int i = a.fraction.size() - 1; i >= 0; i--, pos--)\n {\n\n b.fraction.at(pos) += a.fraction.at(i);\n b.fraction.at(pos) += carry;\n if (b.fraction.at(pos) >= 2)\n {\n b.fraction.at(pos) -= 2;\n carry = 1;\n }\n else\n {\n carry = 0;\n }\n }\n // cerr << carry << \" \" << pos << endl;\n for (; pos >= 0; pos--)\n {\n b.fraction.at(pos) += carry;\n if (b.fraction.at(pos) >= 2)\n {\n b.fraction.at(pos) -= 2;\n carry = 1;\n }\n else\n {\n carry = 0;\n }\n }\n\n if (carry == 1)\n {\n b.exp++;\n b.fraction.insert(b.fraction.begin(), 1);\n b.fraction.pop_back();\n assert(b.fraction.size() == 53);\n }\n // b.print();\n return;\n}\nvoid solve(ll n)\n{\n FloatingPointNumber f(0);\n string s;\n cin >> s;\n f.fraction.push_back(1);\n for (auto c : s)\n {\n f.fraction.push_back(c - '0');\n }\n auto ans = f;\n while (n > 0)\n {\n auto old = ans;\n add(ans, f, n);\n if (ans.exp == old.exp && ans.fraction == old.fraction)\n {\n break;\n }\n if (ans.exp != old.exp)\n {\n string binary = bitset<12>(ans.exp).to_string();\n //cout << binary << endl;\n ;\n }\n // ans.print();\n //n--;\n }\n ans.print();\n}\n\nint main()\n{\n ll n;\n while (cin >> n, n)\n {\n solve(n);\n }\n return 0;\n}","accuracy":1,"time_ms":880,"memory_kb":3316,"score_of_the_acc":-0.9153,"final_rank":11},{"submission_id":"aoj_1628_4948704","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\nstruct f{\n ll e=0;\n ll base=0;\n\n f(){base += (1LL<<52);}\n\n f(string s){\n ll k = 1;\n for(int i=51;i>=0;i--) {\n if(s[i]=='1') base += k;\n k *= 2;\n }\n base += k;\n }\n\n f operator + (const f& r){\n if(e==r.e){\n f ret;\n ret.base = base + r.base;\n ret.e = e;\n if((ret.base>>53)&1){\n ret.base >>= 1;\n ret.e++;\n }\n return ret;\n }else{\n f ret;\n if(e>r.e){\n ll sa = e - r.e;\n if(sa >= 53) return (*this);\n ret.base = base + (r.base >> sa);\n ret.e = e;\n }else{\n ll sa = r.e - e;\n if(sa >= 53) return r;\n ret.base = r.base + (base >> sa);\n ret.e = r.e;\n }\n if((ret.base>>53)&1){\n ret.base >>= 1;\n ret.e++;\n }\n return ret;\n }\n }\n};\nvoid print(f ans){\n for(ll i=11;i>=0;i--) std::cout << ((ans.e>>i)&1);\n for(ll i=51;i>=0;i--) std::cout << ((ans.base>>i)&1);\n std::cout << '\\n';\n}\n\nvoid solve(ll n){\n string s;std::cin >> s;\n vector<vector<f>> v(53, vector<f>(70));\n for(ll i=0;i<53;i++){\n v[i][0] = f(s);\n for(ll j=0;j<i;j++) if((v[i][0].base>>j)&1) v[i][0].base ^= (1LL<<j);\n for(ll j=1;j<70;j++) v[i][j] = v[i][j-1] + v[i][j-1];\n }\n auto add = [&](ll b, ll c){\n assert(b>0);\n f ret;\n ret.e = -1;\n ll x = 0;\n while(b){\n if(b&1){\n if(ret.e==-1) ret = v[c][x];\n else ret = ret + v[c][x];\n }\n x++;\n b /= 2;\n }\n return ret;\n };\n\n f st = f(s);\n int cnt = 0;\n\n while(n>0){\n ll now = st.e;\n ll l = 0, r = n+1;\n if(cnt==53){\n print(st);\n return;\n }\n while(r-l>1){\n ll mid = (l+r)/2;\n f tmp = st;\n if(mid) tmp = tmp + add(mid, cnt);\n if(tmp.e>now) r = mid;\n else l = mid;\n }\n if(l) st = st + add(l, cnt);\n n -= l;\n if(n>0){\n st = st + v[0][0];\n n--;\n }\n cnt++;\n }\n print(st);\n}\nint main(){\n while(true){\n ll n;std::cin >> n;\n if(n==0) return 0;\n solve(n);\n }\n}","accuracy":1,"time_ms":80,"memory_kb":3416,"score_of_the_acc":-0.8372,"final_rank":10},{"submission_id":"aoj_1628_4943605","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;\nll N;\nstring S;\nconst ll b = 52;\nll now;\nll e;\nll A;\nconst ll INF = 1e18;\nll mul(ll a, ll b) {\n if(a == 0 or b == 0) return 0;\n if(INF / a <= b) return INF;\n return a * b;\n}\n\nvoid solve() {\n now = 1;\n e = 0;\n for(auto c : S) {\n now *= 2;\n if(c == '1') now++;\n }\n A = now;\n while(N) {\n ll ok = N;\n ll ng = 0;\n while(ok - ng > 1) {\n ll mid = (ok + ng) / 2;\n if(mul(mid, A) + now >= (1LL << (b + 1))) ok = mid;\n else ng = mid;\n }\n N -= ok;\n now += A * ok;\n if(now >= (1LL << (b + 1))) {\n now >>= 1;\n A >>= 1;\n e++;\n }\n }\n now -= (1LL << b);\n //cerr << e << \" \" << now << endl;\n string R;\n for(int i = 0; i < b; i++) {\n if(now % 2 == 1) R.push_back('1');\n else R.push_back('0');\n now >>= 1;\n }\n reverse(R.begin(), R.end());\n string L;\n for(int i = 0; i < 12; i++) {\n if(e % 2 == 1) L.push_back('1');\n else L.push_back('0');\n e >>= 1;\n }\n reverse(L.begin(), L.end());\n cout << L << R << endl;\n}\n\nint main() {\n while(cin >> N) {\n if(N == 0) break;\n cin >> S;\n solve();\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3376,"score_of_the_acc":-0.7143,"final_rank":7},{"submission_id":"aoj_1628_4882325","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\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\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\n\twhile (cin >> N, N) {\n\t\tstring s;\n\t\tcin >> s;\n\t\tvector<long long int>v;\n\t\tv.push_back(1);\n\t\tfor (auto i : s)v.push_back(i - '0');\n\t\tauto w = v;\n\t\tint num = 0;\n\t\twhile (N) {\n\t\t\tL = 0, R = N;\n\t\t\twhile (R - L > 1) {\n\t\t\t\tlong long int mid = (R + L) / 2;\n\t\t\t\tauto nw = w;\n\t\t\t\tfor (int i = num; i < 53; i++) {\n\t\t\t\t\tnw[i] += v[i - (num)]*mid;\n\t\t\t\t}\n\t\t\t\tfor (int i = 52; i > 0; i--) {\n\t\t\t\t\tnw[i - 1] += nw[i] / 2;\n\t\t\t\t\tnw[i] &= 1;\n\t\t\t\t}\n\t\t\t\tif (nw[0] >= 2)R = mid;\n\t\t\t\telse L = mid;\n\t\t\t}\n\t\t\tfor (int i = num; i < 53; i++) {\n\t\t\t\tw[i] += v[i - (num)]*R;\n\t\t\t}\n\t\t\tfor (int i = 52; i > 0; i--) {\n\t\t\t\tw[i - 1] += w[i] / 2;\n\t\t\t\tw[i] &= 1;\n\t\t\t}\n\t\t\tN -= R;\n\t\t\tif (w[0] >= 2) {\n\t\t\t\tnum++;\n\t\t\t\tfor (int i = 52; i > 0; i--) {\n\t\t\t\t\tw[i] = w[i - 1];\n\t\t\t\t}\n\t\t\t\tw[0] = 0;\n\t\t\t\tfor (int i = 52; i > 0; i--) {\n\t\t\t\t\tw[i - 1] += w[i] / 2;\n\t\t\t\t\tw[i] &= 1;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\tstring ret;\n\t\tfor (int i = 11; i >= 0; i--)cout << ((num >> i) & 1);\n\t\tfor (int i = 1; i < 53; i++)cout << w[i];\n\t\tcout << endl;\n\t}\n}","accuracy":1,"time_ms":180,"memory_kb":3164,"score_of_the_acc":-0.2767,"final_rank":5},{"submission_id":"aoj_1628_3730869","code_snippet":"#include \"bits/stdc++.h\"\nusing namespace std;\n#define rep(i,a,b) for(int i=(a);i<(b);i++)\n#define int long long\n\nstruct Int {\n\tint exp = 0;\n\tunsigned int kasu = 1ll << 52;\n\n\tInt() {}\n\tInt(string b) {\n\t\texp = 0;\n\t\tkasu = 1ll << 52;\n\t\trep(i, 0, 52) {\n\t\t\tint j = 51 - i;\n\t\t\tif (b[i] == '1') {\n\t\t\t\tkasu |= (1ll << j);\n\t\t\t}\n\t\t}\n\t}\n};\n\n\nbool operator==(Int a, Int b) {\n\treturn a.exp == b.exp and a.kasu == b.kasu;\n}\nInt operator+(Int x, Int y) {\n\tint d = x.exp - y.exp;\n\ty.kasu >>= d;\n\tx.kasu += y.kasu;\n\n\twhile (x.kasu >= (1ll << 53)) {\n\t\tx.exp++;\n\t\tx.kasu -= (1ll << 52);\n\t}\n\n\treturn x;\n}\n\nauto binarySearch = [&](int ng, int ok, Int s, Int a) {\n\tauto f = [&](int m) {\n\t\tif ((1LL << 60) / m < (a.kasu >> s.exp))return true;\n\t\treturn ((a.kasu >> s.exp) * m + s.kasu) >= (1LL << 53);\n\t};\n\tif (f(ng))return ng;\n\twhile (ng + 1 < ok) {\n\t\tint m = (ng + ok) / 2;\n\t\tif (f(m))\n\t\t\tok = m;\n\t\telse\n\t\t\tng = m;\n\t}\n\treturn ok;\n};\n\nvoid solve(int n) {\n\tstring b; cin >> b;\n\tInt a(b);\n\tInt s = a;\n\n\tint k = 0;\n\t//cerr << \"a.exp \" << bitset<12>(a.exp) << endl;\n\t//cerr << \"a.kasu \" << bitset<53>(a.kasu) << endl;\n\twhile (k < n) {\n\t\tint x = binarySearch(1, n - k, s, a);\n\t\ts.kasu = (a.kasu >> s.exp) * x + s.kasu;\n\t\tif (s.kasu == (1ll << 53)) {\n\t\t\ts.exp++;\n\t\t\ts.kasu >>= 1;\n\t\t}\n\t\telse {\n\t\t\tif (s.kasu >= (1ll << 53)) {\n\t\t\t\ts.exp++;\n\t\t\t\ts.kasu >>= 1;\n\t\t\t}\n\t\t\twhile (s.kasu < (1ll << 52)) {\n\t\t\t\ts.exp--;\n\t\t\t\ts.kasu <<= 1;\n\t\t\t}\n\t\t}\n\t\tk += x;\n\t\t//cerr << \"x \" << x << endl;\n\t\t//cerr << \"s.exp \" << bitset<12>(s.exp) << endl;\n\t\t//cerr << \"s.kasu \" << bitset<53>(s.kasu) << endl;\n\t}\n\n\tcout << bitset<12>(s.exp) << bitset<52>(s.kasu) << endl;\n\n}\n\nsigned main() {\n\n\tint n;\n\twhile (cin >> n, n) {\n\t\tsolve(n);\n\t}\n\n\t//double hoge = 1.0;\n\t//int x=*((int*)(&hoge));\n\t//bitset<64>b(x);\n\t//cout << b << endl;\n\treturn 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3200,"score_of_the_acc":-0.2952,"final_rank":6},{"submission_id":"aoj_1628_3704807","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nconstexpr int mod = 1e9 + 7;\n\n#define dump(x) ([&](){auto y = (x); cout << #x << \" = \" << (y) << endl; })();\n// #define dump(x) ;\n\n\ntemplate<class T>\nostream&operator<<(ostream &os, vector<T>v) {\n os << \"{\";\n for(size_t i = 0; i < v.size(); i++) os << v[i] << \", \";\n os << \"}\";\n return os;\n}\n\ntemplate<class T, class U>\nostream&operator<<(ostream &os, pair<T, U>v) {\n os << \"(\" << v.first << \" , \" << v.second << \")\";\n return os;\n}\n\ntemplate<class T, class U>\nostream&operator<<(ostream &os, map<T, U>v) {\n os << \"(map: \\n\";\n for(auto e : v) os << e << \", \\n\";\n os << \")\";\n return os;\n}\n\nusing Vec = vector<int>;\nusing Mat = vector<Vec>;\n\nll modpow(ll x, ll k, ll mod) {\n x %= mod;\n ll r = 1;\n assert(k >= 0);\n while(k) {\n if(k & 1) r = r * x % mod;\n x = x * x % mod;\n k >>= 1;\n }\n return r;\n}\n\nll toint(string s) {\n ll res = 0;\n int n = s.size();\n for(int i = 0; i < n; i++) res |= (ll(s[n - 1 - i] - '0')) << i;\n return res;\n}\n\nstring tostr(ll x, int n) {\n string res = \"\";\n for(int i = 0; i < n; i++) {\n res += '0' + ((x >> i) & 1);\n }\n reverse(begin(res), end(res));\n return res;\n}\n\nbool mul_OF(ll a, ll b) {\n // a * b > 4e18\n // a > floor(4e18 / b)\n return a > ll(1e18) / b;\n}\n\nint main() {\n ios::sync_with_stdio(0), cin.tie(0);\n\n while(1) {\n ll n;\n cin >> n;\n if(n == 0) break;\n string b;\n cin >> b;\n\n ll e = 0;\n ll k = toint(b) + (1ll << 52);\n // dump(e);\n // dump(k);\n\n ll G = 1ll << 53;\n assert(k < G);\n\n ll now = k;\n int shift = 0;\n // dump(n);\n // dump(e);\n // dump(k);\n while(n) {\n ll ok = 0, ng = n + 1;\n ll s = (k >> shift);\n while(abs(ok - ng) > 1) {\n ll mid = (ok + ng) >> 1;\n if(mul_OF(s, mid)) {\n ng = mid;\n } else {\n if(s * mid < G - now) ok = mid; else ng = mid;\n }\n }\n // dump(ok);\n now += s * ok;\n n -= ok;\n if(n) {\n now += s;\n assert(now >= G);\n assert(now < G * 2);\n now >>= 1;\n e++;\n shift++;\n if(shift > 53) shift = 53;\n n--;\n }\n\n }\n assert(k >= (1ll << 52));\n cout << tostr(e, 12) << tostr(now - (1ll << 52), 52) << \"\\n\";\n }\n}","accuracy":1,"time_ms":10,"memory_kb":3100,"score_of_the_acc":-0.0571,"final_rank":1},{"submission_id":"aoj_1628_3463184","code_snippet":"#include<iostream>\n#include<string>\n#include<cstdio>\n#include<vector>\n#include<cmath>\n#include<algorithm>\n#include<functional>\n#include<iomanip>\n#include<queue>\n#include<ciso646>\n#include<random>\n#include<map>\n#include<set>\n#include<complex>\n#include<bitset>\n#include<stack>\n#include<unordered_map>\n#include<utility>\nusing namespace std;\ntypedef long long ll;\ntypedef unsigned long long ul;\ntypedef unsigned int ui;\nconst ll mod = 1000000007;\ntypedef long double ld;\nconst ll INF = mod * mod;\ntypedef pair<int, int> P;\n#define stop char nyaa;cin>>nyaa;\n#define rep(i,n) for(int i=0;i<n;i++)\n#define per(i,n) for(int i=n-1;i>=0;i--)\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\n#define rep1(i,n) for(int i=1;i<=n;i++)\n#define per1(i,n) for(int i=n;i>=1;i--)\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\ntypedef complex<ld> Point;\nconst ld eps = 1e-8;\nconst ld pi = acos(-1.0);\ntypedef pair<ld, ld> LDP;\ntypedef pair<ll, ll> LP;\n#define fr first\n#define sc second\n\nvoid solve() {\n\tll n;\n\twhile (cin >> n, n) {\n\t\tint cnt = 0;\n\t\tbitset<52> b = 0;\n\t\tstring s; cin >> s;\n\t\trep(i,52)if (s[i] == '1')b[51-i] = 1;\n\t\tbitset<52> x = 0;\n\t\tx = b;\n\t\tcnt++; n--;\n\t\twhile (n > 0) {\n\t\t\tif (cnt > 52)break;\n\t\t\t//cout << cnt << \" \" << n << \" \" << x << endl;\n\t\t\tbitset<52> c = b; c >>= cnt; \n\t\t\tif (cnt)c[52-cnt] = 1;\n\t\t\tif (c == 0)break;\n\t\t\tll le = 0, ri = INF;\n\t\t\twhile (ri - le > 1) {\n\t\t\t\tll mid = (ri + le) / 2;\n\t\t\t\tll s = 0;\n\t\t\t\trep(i, 52) {\n\t\t\t\t\tif (x[i]) {\n\t\t\t\t\t\ts++;\n\t\t\t\t\t}\n\t\t\t\t\tif (c[i]) {\n\t\t\t\t\t\ts += mid;\n\t\t\t\t\t}\n\t\t\t\t\ts /= 2;\n\t\t\t\t}\n\t\t\t\tif (s > 0)ri = mid;\n\t\t\t\telse le = mid;\n\t\t\t}\n\t\t\tif (n < ri) {\n\t\t\t\tll s = 0;\n\t\t\t\trep(i, 52) {\n\t\t\t\t\tif (x[i])s++;\n\t\t\t\t\tif (c[i])s += n;\n\t\t\t\t\tif (s % 2)x[i] = 1;\n\t\t\t\t\telse x[i] = 0;\n\t\t\t\t\ts /= 2;\n\t\t\t\t}\n\t\t\t\tbreak;\n\t\t\t}\n\t\t\telse {\n\t\t\t\tn -= ri;\n\t\t\t\tll s = 0;\n\t\t\t\trep(i, 52) {\n\t\t\t\t\tif (x[i])s++;\n\t\t\t\t\tif (c[i])s += ri;\n\t\t\t\t\tif (s % 2)x[i] = 1;\n\t\t\t\t\telse x[i] = 0;\n\t\t\t\t\ts /= 2;\n\t\t\t\t}\n\t\t\t\tcnt++; x >>= 1;\n\t\t\t\tif (cnt == 1)x[51] = 1;\n\t\t\t}\n\t\t}\n\t\tstring ans;\n\t\trep(i, 12) {\n\t\t\tif (cnt&(1 << (11-i))) {\n\t\t\t\tans.push_back('1');\n\t\t\t}\n\t\t\telse ans.push_back('0');\n\t\t}\n\t\tper(i, 52) {\n\t\t\tif (x[i])ans.push_back('1');\n\t\t\telse ans.push_back('0');\n\t\t}\n\t\tcout << ans << endl;\n\t}\n}\nint main() {\n\tios::sync_with_stdio(false);\n\tcin.tie(0);\n\tsolve();\n\t//stop\n\treturn 0;\n}","accuracy":1,"time_ms":170,"memory_kb":3076,"score_of_the_acc":-0.0632,"final_rank":2},{"submission_id":"aoj_1628_3425297","code_snippet":"#define _CRT_SECURE_NO_WARNINGS\n#define _SILENCE_ALL_CXX17_DEPRECATION_WARNINGS\n#include <stdio.h>\n#include <algorithm>\n#include <utility>\n#include <functional>\n#include <cstring>\n#include <queue>\n#include <stack>\n#include <math.h>\n#include <iterator>\n#include <vector>\n#include <string>\n#include <set>\n#include <math.h>\n#include <iostream>\n#include <random>\n#include <map>\n#include <fstream>\n#include <iomanip>\n#include <time.h>\n#include <stdlib.h>\n#include <list>\n#include <typeinfo>\n#include <list>\n#include <set>\n#include <assert.h>\n#include <complex>\nusing namespace std;\n#define LONG_INF 10000000000000\n#define GOLD 1.61803398874989484820458\n#define MAX_MOD 1000000007\n#define MOD 998244353LL\n#define seg_size 65536*4\n#define REP(i,n) for(long long i = 0;i < n;++i)\nlong long n;\nstring pluser(string a, string b) {\n\tint kuriagari = 0;\n\tstring ans;\n\tfor (int i = a.size() - 1; i >= 0; --i) {\n\t\tkuriagari += a[i] + b[i] - '0' - '0';\n\t\tans.push_back(kuriagari % 2 + '0');\n\t\tkuriagari /= 2;\n\t\tkuriagari = max(kuriagari, 0);\n\t}\n\tif (kuriagari == 1) {\n\t\tans.push_back('1');\n\t}\n\treverse(ans.begin(), ans.end());\n\treturn ans;\n}\nint main(){\n#define int long long\n\twhile (true) {\n\t\tcin >> n;\n\t\tif (n == 0) return 0;\n\t\tstring base;\n\t\tcin >> base;\n\t\tbase = \"1\" + base;\n\t\tstring ans = base;\n\t\tfor (int i = 0;;) {\n\t\t\twhile (n != 0 && ans.length() == base.length()) {\n\t\t\t\tstring multiply;\n\t\t\t\tmultiply = base;\n\t\t\t\tfor (long long q = 1;; q *= 2) {\n\t\t\t\t\tstring now = pluser(multiply, ans);\n\t\t\t\t\tif (now.length() != ans.length()) {\n\t\t\t\t\t\t//繰り上がり発生\n\t\t\t\t\t\tif (q != 1) {\n\t\t\t\t\t\t\t//保持しない\n\t\t\t\t\t\t\tq /= 2;\n\t\t\t\t\t\t\tfor (int j = multiply.size() - 1; j >= 1; --j) {\n\t\t\t\t\t\t\t\tmultiply[j] = multiply[j - 1];\n\t\t\t\t\t\t\t\tmultiply[j - 1] = '0';\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t\tn -= q;\n\t\t\t\t\t\tans = pluser(multiply,ans);\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tif (q * 2 > n) {\n\t\t\t\t\t\tn -= q;\n\t\t\t\t\t\tans = now;\n\t\t\t\t\t\tbreak;\n\t\t\t\t\t}\n\t\t\t\t\tfor (int j = 0; j < multiply.size() - 1; ++j) {\n\t\t\t\t\t\tmultiply[j] = multiply[j + 1];\n\t\t\t\t\t}\n\t\t\t\t\tmultiply[multiply.size() - 1] = '0';\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (ans.length() != base.length()) {\n\t\t\t\tans.pop_back();\n\t\t\t\tfor (int q = base.length() - 1; q >= 1;--q) {\n\t\t\t\t\tbase[q] = base[q - 1];\n\t\t\t\t}\n\t\t\t\tbase[0] = '0';\n\t\t\t\ti++;\n\t\t\t}\n\t\t\tif (n == 0) {\n\t\t\t\tstring s;\n\t\t\t\tint geko = i;\n\t\t\t\tfor (int q = 0; q < 12; ++q) {\n\t\t\t\t\ts.push_back(geko % 2 + '0');\n\t\t\t\t\tgeko /= 2;\n\t\t\t\t}\n\t\t\t\treverse(s.begin(), s.end());\n\t\t\t\tcout << s;\n\t\t\t\tfor (int j = 1; j < ans.length(); ++j) {\n\t\t\t\t\tcout << ans[j];\n\t\t\t\t}\n\t\t\t\tcout << endl;\n\t\t\t\tbreak;\n\t\t\t}\n\t\t}\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":2540,"memory_kb":3220,"score_of_the_acc":-1.3429,"final_rank":15},{"submission_id":"aoj_1628_3084228","code_snippet":"#include<bits/stdc++.h>\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define BIG_NUM 2000000000\n#define MOD 1000000007\n#define EPS 0.000000001\nusing namespace std;\n\n\n#define LEN 54\n#define BASE 2 //小数部の開始桁\n#define SIZE 52 //小数部の桁数\n\nll mult;\nll POW[63];\nint S[LEN],A[LEN];\nchar buf[SIZE+1];\n\n\n//SにAをadd_count回足す関数\nvoid calc(ll add_count){\n\n\tll work[LEN];\n\n\tint tmp,kuriagari;\n\n\t//Aをまとめて加算する\n\tfor(int digit = 62; digit >= 0 && add_count > 0; digit--){\n\t\tif(add_count < POW[digit])continue;\n\n\t\tadd_count -= POW[digit];\n\n\t\tfor(int i = 0; i < LEN; i++)work[i] = 0;\n\n\t\t//Aを左にdigitビットシフトした数列を作成\n\t\tfor(int i = 0; i < LEN; i++){\n\t\t\tif(i+digit == LEN)break;\n\t\t\twork[i] = A[i+digit];\n\t\t}\n\n\t\tkuriagari = 0;\n\t\t//数列を右から足し算\n\t\tfor(int i = LEN-1; i >= 0; i--){\n\t\t\ttmp = work[i]+S[i]+kuriagari;\n\t\t\tS[i] = tmp%2;\n\t\t\tkuriagari = tmp/2;\n\t\t}\n\t}\n}\n\nvoid func(){\n\n\t//Sの初期化\n\tfor(int i = 0; i < LEN; i++){\n\t\tS[i] = 0;\n\t}\n\n\tscanf(\"%s\",buf);\n\n\t//SとAの、初期設定\n\tS[0] = 0;\n\tA[0] = 0;\n\tS[BASE-1] = 1;\n\tA[BASE-1] = 1;\n\n\tfor(int i = 0; i < SIZE; i++){\n\t\tS[BASE+i] = buf[i]-'0';\n\t\tA[BASE+i] = buf[i]-'0';\n\t}\n\n\tll e = 0;\n\n\tll num_S,num_A,next = POW[53],diff,add_count;\n\n\twhile(mult > 0){\n\n\t\t//次に、Sの桁が繰り上がるまでの、最小加算回数を求める\n\n\t\t//S,Aをlong long intで表す\n\t\tnum_S = 0;\n\t\tfor(int digit = 1; digit < LEN; digit++){\n\t\t\tnum_S += S[digit]*POW[53-digit];\n\t\t}\n\t\tnum_A = 0;\n\t\tfor(int digit = 1; digit < LEN; digit++){\n\t\t\tnum_A += A[digit]*POW[53-digit];\n\t\t}\n\n\t\t//★もう足しても意味がない★\n\t\tif(num_A == 0){\n\t\t\tbreak;\n\t\t}\n\n\t\t//nextとの差分\n\t\tdiff = next-num_S;\n\n\t\tif(diff%num_A == 0){ //ぴったり繰り上がる\n\n\t\t\tadd_count = diff/num_A;\n\n\t\t}else{\n\n\t\t\tadd_count = diff/num_A+1;\n\t\t}\n\n\t\tif(add_count > mult){ //加算回数を超過する場合\n\n\t\t\t//SにAをmult回足す\n\t\t\tcalc(mult);\n\n\t\t\tmult = 0;\n\n\t\t}else{\n\n\t\t\t//SにAをadd_count回足す\n\t\t\tcalc(add_count);\n\n\t\t\tfor(int i = 52; i >= 0; i--){\n\t\t\t\tS[i+1] = S[i];\n\t\t\t\tA[i+1] = A[i];\n\t\t\t}\n\t\t\tS[0] = 0;\n\t\t\tA[0] = 0;\n\n\t\t\tmult -= add_count;\n\t\t\te++;\n\t\t}\n\t}\n\n\t//指数部の表示\n\tfor(int i = 11; i >= 0; i--){\n\t\tif(e < POW[i]){\n\t\t\tprintf(\"0\");\n\t\t}else{\n\t\t\tprintf(\"1\");\n\t\t\te -= POW[i];\n\t\t}\n\t}\n\n\t//仮数部の表示\n\tfor(int i = 0; i < SIZE; i++){\n\t\tprintf(\"%d\",S[BASE+i]);\n\t}\n\n\tprintf(\"\\n\");\n}\n\n\nint main(){\n\n\tPOW[0] = 1;\n\tfor(int i = 1; i <= 62; i++){\n\t\tPOW[i] = 2*POW[i-1];\n\t}\n\n\twhile(true){\n\t\tscanf(\"%lld\",&mult);\n\t\tif(mult == 0)break;\n\n\t\tfunc();\n\t}\n\n\treturn 0;\n}","accuracy":1,"time_ms":30,"memory_kb":3152,"score_of_the_acc":-0.1889,"final_rank":4},{"submission_id":"aoj_1628_3018938","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\nusing P = pair<Int, Int>;\nconst Int B = 1LL<<52;\nP add(P s,Int a,Int k){\n s.second+=a*k;\n return s;\n}\nInt check(P s,Int a,Int k){\n if(a>(B<<1)/k) return 1;\n if(a*k>=(B<<1)) return 1;\n if(s.second+a*k>=(B<<1)) return 1;\n return 0;\n}\nP add2(P s,Int a){\n s.second+=a;\n assert(s.second>=(B<<1));\n s.second>>=1;\n s.first++;\n return s;\n}\nsigned main(){\n Int n;\n while(cin>>n,n){\n string b;\n cin>>b;\n Int a=1;\n for(Int i=0;i<(Int)b.size();i++)\n a=(a<<1)|(b[i]=='1');\n P s(0,a);\n while(n){\n if(!check(s,a,n)){\n\ts=add(s,a,n);\n\tn=0;\n\tbreak;\n }\n Int l=0,r=n;\n while(l+1<r){\n\tInt m=(l+r)>>1;\n\tif(check(s,a,m)) r=m;\n\telse l=m;\n }\n s=add(s,a,l);\n s=add2(s,a);\n n-=r;\n a>>=1;\n }\n bitset<12> x(s.first);\n bitset<52> y(s.second-B);\n cout<<x<<y<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3144,"score_of_the_acc":-0.1619,"final_rank":3}],"string":"[\n {\n \"submission_id\": \"aoj_1628_10670479\",\n \"code_snippet\": \"//#pragma GCC optimize(\\\"O3\\\")\\n#include<bits/stdc++.h>\\nusing namespace std;\\n#define ll long long\\n#define rep(i,n) for (ll i=0;i<(ll)n;i++)\\n#define rrep(i,n) for (ll i=n-1;i>=(ll)0;i--)\\n#define loop(i,m,n) for(ll i=m;i<=(ll)n;i++)\\n#define rloop(i,m,n) for(ll i=m;i>=(ll)n;i--)\\n#define vl vector<ll>\\n#define vvl vector<vector<ll>>\\n#define vdbg(a) rep(ii,a.size()){cout<<a[ii]<<\\\" \\\";}cout<<endl;\\n#define vpdbg(a) rep(ii,a.size()){cout<<\\\"{\\\"<<a[ii].first<<\\\",\\\"<<a[ii].second<<\\\"} \\\";}cout<<endl;\\n#define vvdbg(a) rep(ii,a.size()){rep(jj,a[ii].size()){cout<<a[ii][jj]<<\\\" \\\";}cout<<endl;}\\n#define setdbg(a) for(const auto & ii:a){cout<<ii<<\\\" \\\";}cout<<endl;\\n#define inf 4000000000000000000LL\\n#define mod 998244353LL\\n//#define mod 1000000007LL\\n#define eps 0.000000001\\nrandom_device rnd;// 非決定的な乱数生成器\\nmt19937 mt(rnd());// メルセンヌ・ツイスタの32ビット版、引数は初期シード\\n\\n//#include<boost/multiprecision/cpp_int.hpp>\\n//#define bbi boost::multiprecision::cpp_int\\n//#include<atcoder/lazysegtree>\\n\\n\\n//整数同士の累乗の計算をする。\\nll power(ll A, ll B) {\\n\\tll result = 1;\\n\\tfor (ll i=0;i<B;i++){\\n\\t\\tresult *= A;\\n\\t}\\n\\treturn result;\\n}\\n\\n// nのk乗をmodで割った余りを計算\\nll power_mod(ll n, ll k){\\n\\tlong long result = 1;\\n\\twhile (k > 0){\\n\\t\\tif ((k&1) ==1)result=(result*n)%mod;\\n\\t\\tn=n*n%mod;\\n\\t\\tk >>= 1;\\n\\t}\\n\\treturn result;\\n}\\n\\n\\n//受け取った2次元文字の外側に、文字pをコーティングする。\\nvector<string> pad(vector<string> &s,char p){\\n\\tll h=s.size();\\n\\tll w=s[0].size();\\n\\tvector<string> res(h+2,string(w+2,p));\\n\\trep(i,h)rep(j,w)res[i+1][j+1]=s[i][j];\\n\\treturn res;\\n}\\n\\n// Union-Find\\nstruct UnionFind {\\n\\tvector<int> par, siz;\\n\\tUnionFind(int n) : par(n, -1) , siz(n, 1) { }\\n\\t// 根を求める\\n\\tint root(int x) {\\n\\t\\tif (par[x] == -1) return x;\\n\\t\\telse return par[x] = root(par[x]);\\n\\t}\\n\\t// x と y が同じグループに属するかどうか (根が一致するかどうか)\\n\\tbool issame(int x, int y) {\\n\\t\\treturn root(x) == root(y);\\n\\t}\\n\\t// x を含むグループと y を含むグループとを併合する\\n\\tbool unite(int x, int y) {\\n\\t\\tx = root(x), y = root(y);\\n\\t\\tif (x == y) return false; \\n\\t\\tif (siz[x] < siz[y]) swap(x, y);\\n\\t\\tpar[y] = x;\\n\\t\\tsiz[x] += siz[y];\\n\\t\\treturn true;\\n\\t}\\n\\t// x を含むグループのサイズ\\n\\tint size(int x) {\\n\\t\\treturn siz[root(x)];\\n\\t}\\n};\\n\\n\\n//グリッド問題等用\\nvl dx={1,0,-1,0};\\nvl dy={0,1,0,-1};\\n\\n//受け取った文字列を、第2引数が0なら全て小文字に、1なら大文字に変換する関数\\nstring cnv_string(const string &str, int mode) {\\n\\tstring result = str;\\n\\tif (mode == 0) {\\n\\t\\t// 小文字に変換\\n\\t\\tfor (char &c : result) {\\n\\t\\t\\tc = tolower(c);\\n\\t\\t}\\n\\t} else if (mode == 1) {\\n\\t\\t// 大文字に変換\\n\\t\\tfor (char &c : result) {\\n\\t\\t\\tc = toupper(c);\\n\\t\\t}\\n\\t}\\n\\treturn result;\\n}\\n\\n//第一引数で受け取った数を、第二引数で受け取った数の進数と見做して、第三引数の進数へ変換する。\\nstring cnv_base(const string &str, ll from_base, ll to_base) {\\n\\tll num = 0;\\n\\t//小文字があったら大文字に変換\\n\\tstring num_str=cnv_string(str,1);\\n\\t// 数値を10進数に変換\\n\\tfor (char digit : num_str) {\\n\\t\\tnum = num * from_base + (isdigit(digit) ? digit - '0' : digit - 'A' + 10);\\n\\t}\\n\\tstring result;\\n\\t// 数値を目的の基数に変換\\n\\twhile (num > 0) {\\n\\t\\tll remainder = num % to_base;\\n\\t\\tresult.push_back(remainder < 10 ? remainder + '0' : remainder - 10 + 'A');\\n\\t\\tnum /= to_base;\\n\\t}\\n\\t// 結果を逆順にして返す\\n\\treverse(result.begin(), result.end());\\n\\treturn result.empty() ? \\\"0\\\" : result;\\n}\\n\\nstring b;\\n\\n//b×nを計算\\nstring muls(ll n){\\n\\tll bint=stoll(cnv_base(b,2,10));\\n\\tll ans=n*bint;\\n\\treturn cnv_base(to_string(ans),10,2);\\n}\\nstring pluss(string x,string y){\\n\\tll ans=stoll(cnv_base(x,2,10))+stoll(cnv_base(y,2,10));\\n\\treturn cnv_base(to_string(ans),10,2);\\n}\\n\\nll solve(){\\n\\tll n;\\n\\tcin>>n;\\n\\tif(n==0){return 1;}\\n\\n\\tcin>>b;\\n\\tb.insert(b.begin(),'1');\\n\\n\\tll kasuu=0;\\n\\tstring ans=b;\\n\\t\\n\\twhile(n!=0){\\n\\t\\tll mn=1,mx=min(n,1LL<<(54-b.size()));\\n\\n\\t\\twhile(mn!=mx){\\n\\t\\t\\tll mid=mn+mx;\\n\\t\\t\\tmid/=2;\\n\\t\\t\\tstring s=pluss(ans,muls(mid));\\n\\t\\t\\tif(s.size()==54)mx=mid;\\n\\t\\t\\telse mn=mid+1;\\n\\t\\t}\\n\\n\\t\\tans=pluss(ans,muls(mx));\\n\\t\\tn-=mx;\\n\\t\\tif(ans.size()==53){\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\n\\t\\tans.pop_back();\\n\\t\\tb.pop_back();\\n\\t\\tif(b.size()==0)b=\\\"0\\\";\\n\\t\\tkasuu++;\\n\\t}\\n\\tstring ans1 = cnv_base(to_string(kasuu),10,2);\\n\\twhile(ans1.size()!=12)ans1.insert(ans1.begin(),'0');\\n\\n\\tcout<<ans1;\\n\\tloop(i,1,52)cout<<ans[i];\\n\\tcout<<endl;\\n\\treturn 0;\\n}\\n\\n//メイン\\nint main(){\\n\\twhile(solve()==0);\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 660,\n \"memory_kb\": 3456,\n \"score_of_the_acc\": -1.1617,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1628_10662397\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing uint = unsigned int;\\n#define rep(i, n) for (int i = 0; i < n; i++)\\n#define all(v) v.begin(), v.end()\\ntemplate <class T, class U>\\ninline bool chmax(T &a, U b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <class T, class U>\\ninline bool chmin(T &a, U b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <class T>\\ninline void compress(vector<T> &a) {\\n sort(a.begin(), a.end());\\n a.erase(unique(a.begin(), a.end()), a.end());\\n}\\ntemplate <class T>\\nT rand(T l, T r) {\\n static mt19937 mt(random_device{}());\\n // [l, r)\\n if constexpr (is_integral_v<T>) {\\n return uniform_int_distribution<T>(l, r - 1)(mt);\\n } else if constexpr (is_floating_point_v<T>) {\\n return uniform_real_distribution<T>(l, r)(mt);\\n }\\n}\\nconstexpr int INF = 1001001001;\\nconstexpr ll llINF = 3000000000000000010;\\n#include <ext/pb_ds/assoc_container.hpp>\\n#include <ext/pb_ds/tree_policy.hpp>\\nusing namespace __gnu_pbds;\\nusing pbds_set = tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>;\\nusing pbds_mset = tree<ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update>;\\nusing pbds_umap = gp_hash_table<int, int>;\\nusing pbds_trie = trie<string, null_type, trie_string_access_traits<>, pat_trie_tag, trie_prefix_search_node_update>;\\nstruct linear_sieve {\\n vector<int> least_factor, prime_list;\\n linear_sieve(int n) : least_factor(n + 1, 0) {\\n for (int i = 2; i <= n; i++) {\\n if (least_factor[i] == 0) {\\n least_factor[i] = i;\\n prime_list.push_back(i);\\n }\\n for (int p : prime_list) {\\n if (ll(i) * p > n || p > least_factor[i]) break;\\n least_factor[i * p] = p;\\n }\\n }\\n }\\n};\\ntemplate <int modulo>\\nstruct modint {\\n int x;\\n modint() : x(0) {}\\n modint(int64_t y) : x(y >= 0 ? y % modulo : (modulo - (-y) % modulo) % modulo) {}\\n modint &operator+=(const modint &p) {\\n if ((x += p.x) >= modulo) x -= modulo;\\n return *this;\\n }\\n modint &operator-=(const modint &p) {\\n if ((x += modulo - p.x) >= modulo) x -= modulo;\\n return *this;\\n }\\n modint &operator*=(const modint &p) {\\n x = (int)(1LL * x * p.x % modulo);\\n return *this;\\n }\\n modint &operator/=(const modint &p) {\\n *this *= p.inv();\\n return *this;\\n }\\n modint operator-() const { return modint(-x); }\\n modint operator+(const modint &p) const { return modint(*this) += p; }\\n modint operator-(const modint &p) const { return modint(*this) -= p; }\\n modint operator*(const modint &p) const { return modint(*this) *= p; }\\n modint operator/(const modint &p) const { return modint(*this) /= p; }\\n bool operator==(const modint &p) const { return x == p.x; }\\n bool operator!=(const modint &p) const { return x != p.x; }\\n modint inv() const {\\n int a = x, b = modulo, u = 1, v = 0, t;\\n while (b > 0) {\\n t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return modint(u);\\n }\\n modint pow(int64_t n) const {\\n modint ret(1), mul(x);\\n while (n > 0) {\\n if (n & 1) ret *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return ret;\\n }\\n friend ostream &operator<<(ostream &os, const modint &p) { return os << p.x; }\\n friend istream &operator>>(istream &is, modint &a) {\\n int64_t t;\\n is >> t;\\n a = modint<modulo>(t);\\n return (is);\\n }\\n int val() const { return x; }\\n static constexpr int mod() { return modulo; }\\n static constexpr int half() { return (modulo + 1) >> 1; }\\n};\\nll extgcd(ll a, ll b, ll &x, ll &y) {\\n // ax+by=gcd(|a|,|b|)\\n if (a < 0 || b < 0) {\\n ll d = extgcd(abs(a), abs(b), x, y);\\n if (a < 0) x = -x;\\n if (b < 0) y = -y;\\n return d;\\n }\\n if (b == 0) {\\n x = 1;\\n y = 0;\\n return a;\\n }\\n ll d = extgcd(b, a % b, y, x);\\n y -= a / b * x;\\n return d;\\n}\\ntemplate <typename T>\\nstruct Binomial {\\n vector<T> inv, fact, factinv;\\n Binomial(int n) {\\n inv.resize(n + 1);\\n fact.resize(n + 1);\\n factinv.resize(n + 1);\\n inv[0] = fact[0] = factinv[0] = 1;\\n for (int i = 1; i <= n; i++) fact[i] = fact[i - 1] * i;\\n factinv[n] = fact[n].inv();\\n inv[n] = fact[n - 1] * factinv[n];\\n for (int i = n - 1; i >= 1; i--) {\\n factinv[i] = factinv[i + 1] * (i + 1);\\n inv[i] = fact[i - 1] * factinv[i];\\n }\\n }\\n T C(int n, int r) {\\n if (n < 0 || n < r || r < 0) return 0;\\n return fact[n] * factinv[n - r] * factinv[r];\\n }\\n T P(int n, int r) {\\n if (n < 0 || n < r || r < 0) return 0;\\n return fact[n] * factinv[n - r];\\n }\\n T H(int n, int r) {\\n if (n == 0 && r == 0) return 1;\\n if (n < 0 || r < 0) return 0;\\n return r == 0 ? 1 : C(n + r - 1, r);\\n }\\n};\\ntemplate <class T>\\nstruct Matrix {\\n vector<vector<T>> m;\\n Matrix() = default;\\n Matrix(int x) : m(vector(x, vector<T>(x, 0))) {}\\n Matrix(const vector<vector<T>> &a) : m(a) {}\\n vector<T> &operator[](int i) { return m[i]; }\\n const vector<T> &operator[](int i) const { return m[i]; }\\n static Matrix identity(int x) {\\n Matrix res(x);\\n for (int i = 0; i < x; i++) res[i][i] = 1;\\n return res;\\n }\\n static Matrix zero(int x) { return Matrix(x); }\\n\\n Matrix operator+() const { return (*this); }\\n Matrix operator-() const { return Matrix(this->m.size()) - (*this); }\\n Matrix operator+(const Matrix &a) const {\\n Matrix x = (*this);\\n return x += a;\\n }\\n Matrix operator-(const Matrix &a) const {\\n Matrix x = (*this);\\n return x -= a;\\n }\\n Matrix operator*(const Matrix &a) const {\\n Matrix x = (*this);\\n return x *= a;\\n }\\n Matrix operator*(const T &a) const {\\n Matrix x = (*this);\\n return x *= a;\\n }\\n Matrix &operator+=(const Matrix &a) {\\n int n = m.size();\\n for (int i = 0; i < n; i++) {\\n for (int j = 0; j < n; j++) {\\n m[i][j] += a[i][j];\\n }\\n }\\n return *this;\\n }\\n Matrix &operator-=(const Matrix &a) {\\n int n = m.size();\\n for (int i = 0; i < n; i++) {\\n for (int j = 0; j < n; j++) {\\n m[i][j] -= a[i][j];\\n }\\n }\\n return *this;\\n }\\n Matrix &operator*=(const Matrix &a) {\\n int n = m.size();\\n Matrix res(n);\\n for (int i = 0; i < n; i++) {\\n for (int k = 0; k < n; k++) {\\n for (int j = 0; j < n; j++) {\\n res[i][j] += m[i][k] * a[k][j];\\n }\\n }\\n }\\n m = res.m;\\n return *this;\\n }\\n Matrix &operator*=(const T &a) {\\n int n = m.size();\\n for (int i = 0; i < n; i++) {\\n for (int j = 0; j < n; j++) {\\n m[i][j] *= a;\\n }\\n }\\n return *this;\\n }\\n Matrix pow(ll b) const {\\n Matrix x = *this, res = identity(x.m.size());\\n while (b) {\\n if (b & 1) {\\n res *= x;\\n }\\n x *= x;\\n b >>= 1;\\n }\\n return res;\\n }\\n T determinant() {\\n int n = m.size();\\n Matrix A(*this);\\n T ret = 1;\\n for (int i = 0; i < n; i++) {\\n int pivot = -1;\\n for (int j = i; j < n; j++) {\\n if (A[j][i] != 0) pivot = j;\\n }\\n if (pivot == -1) return T(0);\\n if (i != pivot) {\\n ret *= -1;\\n swap(A[i], A[pivot]);\\n }\\n ret *= A[i][i];\\n T tmp = T(1) / A[i][i];\\n for (int j = 0; j < n; j++) {\\n A[i][j] *= tmp;\\n }\\n for (int j = i + 1; j < n; j++) {\\n T a = A[j][i];\\n for (int k = 0; k < n; k++) {\\n A[j][k] -= A[i][k] * a;\\n }\\n }\\n }\\n return ret;\\n }\\n Matrix inverse() {\\n assert(determinant() != 0);\\n int n = m.size();\\n Matrix ret = identity(n);\\n Matrix A(*this);\\n for (int i = 0; i < n; i++) {\\n int pivot = -1;\\n for (int j = i; j < n; j++) {\\n if (A[j][i] != 0) pivot = j;\\n }\\n if (i != pivot) {\\n swap(ret[i], ret[pivot]);\\n swap(A[i], A[pivot]);\\n }\\n T tmp = T(1) / A[i][i];\\n for (int j = 0; j < n; j++) {\\n A[i][j] *= tmp;\\n ret[i][j] *= tmp;\\n }\\n for (int j = 0; j < n; j++) {\\n if (j == i) continue;\\n T a = A[j][i];\\n for (int k = 0; k < n; k++) {\\n A[j][k] -= A[i][k] * a;\\n ret[j][k] -= ret[i][k] * a;\\n }\\n }\\n }\\n return ret;\\n }\\n vector<T> characteristic_polynomial() {\\n int n = m.size();\\n if (n == 0) return {1};\\n Matrix A(*this);\\n for (int i = 1; i < n; i++) {\\n int pivot = -1;\\n for (int j = i; j < n; j++) {\\n if (A[j][i - 1] != 0) pivot = j;\\n }\\n if (pivot == -1) continue;\\n if (i != pivot) {\\n swap(A[i], A[pivot]);\\n for (int j = 0; j < n; j++) swap(A[j][i], A[j][pivot]);\\n }\\n T tmp = T(1) / A[i][i - 1];\\n vector<T> c(n);\\n for (int j = i + 1; j < n; j++) c[j] = tmp * A[j][i - 1];\\n for (int j = i + 1; j < n; j++) {\\n for (int k = i - 1; k < n; k++) {\\n A[j][k] -= A[i][k] * c[j];\\n }\\n }\\n for (int j = 0; j < n; j++) {\\n for (int k = i + 1; k < n; k++) {\\n A[j][i] += A[j][k] * c[k];\\n }\\n }\\n }\\n vector dp(n + 1, vector<T>(n + 1));\\n dp[0][0] = 1;\\n for (int i = 0; i < n; i++) {\\n for (int j = 0; j <= i; j++) {\\n dp[i + 1][j] -= dp[i][j] * A[i][i];\\n dp[i + 1][j + 1] += dp[i][j];\\n }\\n T p = 1;\\n for (int k = i + 1; k < n; k++) {\\n p *= A[k][k - 1];\\n for (int j = 0; j <= i; j++) dp[k + 1][j] -= dp[i][j] * p * A[i][k];\\n }\\n }\\n return dp[n];\\n }\\n friend ostream &operator<<(ostream &os, const Matrix &a) {\\n int n = a.m.size();\\n for (int i = 0; i < n; i++) {\\n for (int j = 0; j < n; j++) {\\n os << a[i][j];\\n if (j != n - 1) os << \\\" \\\";\\n }\\n os << \\\"\\\\n\\\";\\n }\\n return os;\\n }\\n friend istream &operator>>(istream &is, Matrix &a) {\\n int n = a.m.size();\\n for (int i = 0; i < n; i++) {\\n for (int j = 0; j < n; j++) {\\n is >> a[i][j];\\n }\\n }\\n return is;\\n }\\n};\\n\\ntemplate <class T, T (*op)(T, T), T (*e)()>\\nstruct disjointsparsetable {\\n vector<vector<T>> table;\\n vector<int> logtable;\\n disjointsparsetable() = default;\\n disjointsparsetable(vector<T> v) {\\n int len = 0;\\n while ((1 << len) <= v.size()) len++;\\n table.assign(len, vector<T>(1 << len, e()));\\n for (int i = 0; i < (int)v.size(); i++) table[0][i] = v[i];\\n for (int i = 1; i < len; i++) {\\n int shift = 1 << i;\\n for (int j = 0; j < (int)v.size(); j += shift << 1) {\\n int t = min(j + shift, (int)v.size());\\n table[i][t - 1] = v[t - 1];\\n for (int k = t - 2; k >= j; k--) table[i][k] = op(v[k], table[i][k + 1]);\\n if (v.size() <= t) break;\\n table[i][t] = v[t];\\n int r = min(t + shift, (int)v.size());\\n for (int k = t + 1; k < r; k++) table[i][k] = op(table[i][k - 1], v[k]);\\n }\\n }\\n logtable.resize(1 << len);\\n for (int i = 2; i < logtable.size(); i++) {\\n logtable[i] = logtable[(i >> 1)] + 1;\\n }\\n }\\n T query(int l, int r) {\\n if (l == r) return e();\\n if (l >= --r) return table[0][l];\\n int len = logtable[l ^ r];\\n return op(table[len][l], table[len][r]);\\n };\\n};\\nusing mint = modint<998244353>;\\nvoid solve() {\\n ll n;\\n cin >> n;\\n if (n == 0) exit(0);\\n string s;\\n cin >> s;\\n // 52 digits\\n // 2^a*(1.b)で表現\\n // 2^0*(1.s) = 2^a*(1.s/2^a)\\n auto xcd = [&](string b, string t, int k) {\\n if (51 - k < (int)t.size() - 1) {\\n return true;\\n }\\n // 0.b+t*2^k>=1?\\n vector<int> v(52);\\n rep(i, 52) v[i] = b[i] - '0';\\n rep(i, t.size()) {\\n if (t[t.size() - 1 - i] == '1') {\\n v[51 - k - i]++;\\n }\\n }\\n for (int i = 51; i >= 0; i--) {\\n if (v[i] >= 2) {\\n v[i] -= 2;\\n if (i == 0) {\\n return true;\\n }\\n v[i - 1]++;\\n }\\n }\\n return false;\\n };\\n auto add = [&](string &b, string t, int k) {\\n vector<int> v(52);\\n rep(i, 52) v[i] = b[i] - '0';\\n rep(i, t.size()) {\\n if (t[t.size() - 1 - i] == '1') {\\n v[51 - k - i]++;\\n }\\n }\\n for (int i = 51; i >= 0; i--) {\\n if (v[i] >= 2) {\\n v[i] -= 2;\\n assert(i);\\n v[i - 1]++;\\n }\\n }\\n rep(i, 52) b[i] = ('0' + v[i]);\\n };\\n auto add_carry = [&](string &b, string t) {\\n vector<int> v(52);\\n rep(i, 52) v[i] = b[i] - '0';\\n rep(i, t.size()) {\\n if (t[t.size() - 1 - i] == '1') {\\n v[51 - i]++;\\n }\\n }\\n for (int i = 51; i >= 0; i--) {\\n if (v[i] >= 2) {\\n v[i] -= 2;\\n if (i) v[i - 1]++;\\n }\\n }\\n rep(i, 52) b[i] = ('0' + v[i]);\\n // 2.b\\n b = \\\"0\\\" + b;\\n b.pop_back();\\n };\\n int a = 1;\\n string b = s;\\n n--;\\n while (n) {\\n string t = \\\"1\\\" + s;\\n if (t.size() <= a) break;\\n rep(_, a) t.pop_back();\\n // 繰り上がるまでに何回足す？\\n for (int i = 60; i >= 0; i--) {\\n if (n >> i) {\\n if (!xcd(b, t, i)) {\\n add(b, t, i);\\n n -= 1LL << i;\\n }\\n }\\n }\\n if (n) {\\n n--;\\n add_carry(b, t);\\n a++;\\n }\\n }\\n for (int i = 11; i >= 0; i--) {\\n cout << ((a >> i) & 1);\\n }\\n cout << b << endl;\\n}\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int t = 1;\\n // cin >> t;\\n while (1) solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 140,\n \"memory_kb\": 3400,\n \"score_of_the_acc\": -0.8228,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1628_9448876\",\n \"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)), (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#include <unistd.h>\\n\\nnamespace fastio {\\nstatic constexpr uint32_t SZ = 1 << 17;\\nchar ibuf[SZ];\\nchar obuf[SZ];\\nchar out[100];\\n// pointer of ibuf, obuf\\n\\n\\nuint32_t pil = 0, pir = 0, por = 0;\\n\\nstruct Pre {\\n char num[10000][4];\\n constexpr Pre() : num() {\\n for (int i = 0; i < 10000; i++) {\\n int n = i;\\n for (int j = 3; j >= 0; j--) {\\n num[i][j] = n % 10 | '0';\\n n /= 10;\\n }\\n }\\n }\\n} constexpr pre;\\n\\ninline void load() {\\n memmove(ibuf, ibuf + pil, pir - pil);\\n pir = pir - pil + fread(ibuf + pir - pil, 1, SZ - pir + pil, stdin);\\n pil = 0;\\n if (pir < SZ)\\n ibuf[pir++] = '\\\\n';\\n}\\n\\ninline void flush() {\\n fwrite(obuf, 1, por, stdout);\\n por = 0;\\n}\\n\\nvoid rd(char &c) {\\n do {\\n if (pil + 1 > pir)\\n load();\\n c = ibuf[pil++];\\n } while (isspace(c));\\n}\\n\\nvoid rd(string &x) {\\n x.clear();\\n char c;\\n do {\\n if (pil + 1 > pir)\\n load();\\n c = ibuf[pil++];\\n } while (isspace(c));\\n do {\\n x += c;\\n if (pil == pir)\\n load();\\n c = ibuf[pil++];\\n } while (!isspace(c));\\n}\\n\\ntemplate <typename T> void rd_real(T &x) {\\n string s;\\n rd(s);\\n x = stod(s);\\n}\\n\\ntemplate <typename T> void rd_integer(T &x) {\\n if (pil + 100 > pir)\\n load();\\n char c;\\n do\\n c = ibuf[pil++];\\n while (c < '-');\\n bool minus = 0;\\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\\n if (c == '-') {\\n minus = 1, c = ibuf[pil++];\\n }\\n }\\n x = 0;\\n while ('0' <= c) {\\n x = x * 10 + (c & 15), c = ibuf[pil++];\\n }\\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\\n if (minus)\\n x = -x;\\n }\\n}\\n\\nvoid rd(int &x) {\\n rd_integer(x);\\n}\\nvoid rd(ll &x) {\\n rd_integer(x);\\n}\\nvoid rd(i128 &x) {\\n rd_integer(x);\\n}\\nvoid rd(uint &x) {\\n rd_integer(x);\\n}\\nvoid rd(ull &x) {\\n rd_integer(x);\\n}\\nvoid rd(u128 &x) {\\n rd_integer(x);\\n}\\nvoid rd(double &x) {\\n rd_real(x);\\n}\\nvoid rd(long double &x) {\\n rd_real(x);\\n}\\n\\ntemplate <class T, class U> void rd(pair<T, U> &p) {\\n return rd(p.first), rd(p.second);\\n}\\ntemplate <size_t N = 0, typename T> void rd_tuple(T &t) {\\n if constexpr (N < std::tuple_size<T>::value) {\\n auto &x = std::get<N>(t);\\n rd(x);\\n rd_tuple<N + 1>(t);\\n }\\n}\\ntemplate <class... T> void rd(tuple<T...> &tpl) {\\n rd_tuple(tpl);\\n}\\n\\ntemplate <size_t N = 0, typename T> void rd(array<T, N> &x) {\\n for (auto &d : x)\\n rd(d);\\n}\\ntemplate <class T> void rd(vector<T> &x) {\\n for (auto &d : x)\\n rd(d);\\n}\\n\\nvoid read() {}\\ntemplate <class H, class... T> void read(H &h, T &...t) {\\n rd(h), read(t...);\\n}\\n\\nvoid wt(const char c) {\\n if (por == SZ)\\n flush();\\n obuf[por++] = c;\\n}\\nvoid wt(const string s) {\\n for (char c : s)\\n wt(c);\\n}\\nvoid wt(const char *s) {\\n size_t len = strlen(s);\\n for (size_t i = 0; i < len; i++)\\n wt(s[i]);\\n}\\n\\ntemplate <typename T> void wt_integer(T x) {\\n if (por > SZ - 100)\\n flush();\\n if (x < 0) {\\n obuf[por++] = '-', x = -x;\\n }\\n int outi;\\n for (outi = 96; x >= 10000; outi -= 4) {\\n memcpy(out + outi, pre.num[x % 10000], 4);\\n x /= 10000;\\n }\\n if (x >= 1000) {\\n memcpy(obuf + por, pre.num[x], 4);\\n por += 4;\\n } else if (x >= 100) {\\n memcpy(obuf + por, pre.num[x] + 1, 3);\\n por += 3;\\n } else if (x >= 10) {\\n int q = (x * 103) >> 10;\\n obuf[por] = q | '0';\\n obuf[por + 1] = (x - q * 10) | '0';\\n por += 2;\\n } else\\n obuf[por++] = x | '0';\\n memcpy(obuf + por, out + outi + 4, 96 - outi);\\n por += 96 - outi;\\n}\\n\\ntemplate <typename T> void wt_real(T x) {\\n ostringstream oss;\\n oss << fixed << setprecision(15) << double(x);\\n string s = oss.str();\\n wt(s);\\n}\\n\\nvoid wt(int x) {\\n wt_integer(x);\\n}\\nvoid wt(ll x) {\\n wt_integer(x);\\n}\\nvoid wt(i128 x) {\\n wt_integer(x);\\n}\\nvoid wt(uint x) {\\n wt_integer(x);\\n}\\nvoid wt(ull x) {\\n wt_integer(x);\\n}\\nvoid wt(u128 x) {\\n wt_integer(x);\\n}\\nvoid wt(double x) {\\n wt_real(x);\\n}\\nvoid wt(long double x) {\\n wt_real(x);\\n}\\n\\ntemplate <class T, class U> void wt(const pair<T, U> val) {\\n wt(val.first);\\n wt(' ');\\n wt(val.second);\\n}\\ntemplate <size_t N = 0, typename T> void wt_tuple(const T t) {\\n if constexpr (N < std::tuple_size<T>::value) {\\n if constexpr (N > 0) {\\n wt(' ');\\n }\\n const auto x = std::get<N>(t);\\n wt(x);\\n wt_tuple<N + 1>(t);\\n }\\n}\\ntemplate <class... T> void wt(tuple<T...> tpl) {\\n wt_tuple(tpl);\\n}\\ntemplate <class T, size_t S> void wt(const array<T, S> val) {\\n auto n = val.size();\\n for (size_t i = 0; i < n; i++) {\\n if (i)\\n wt(' ');\\n wt(val[i]);\\n }\\n}\\ntemplate <class T> void wt(const vector<T> val) {\\n auto n = val.size();\\n for (size_t i = 0; i < n; i++) {\\n if (i)\\n wt(' ');\\n wt(val[i]);\\n }\\n}\\n\\nvoid print() {\\n wt('\\\\n');\\n}\\ntemplate <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {\\n wt(head);\\n if (sizeof...(Tail))\\n wt(' ');\\n print(forward<Tail>(tail)...);\\n}\\nvoid __attribute__((destructor)) _d() {\\n flush();\\n}\\n} // namespace fastio\\n\\n\\nusing fastio::flush;\\nusing fastio::print;\\nusing fastio::read;\\n\\ninline void first(bool i = true) {\\n print(i ? \\\"first\\\" : \\\"second\\\");\\n}\\ninline void Alice(bool i = true) {\\n print(i ? \\\"Alice\\\" : \\\"Bob\\\");\\n}\\ninline void Takahashi(bool i = true) {\\n print(i ? \\\"Takahashi\\\" : \\\"Aoki\\\");\\n}\\ninline void yes(bool i = true) {\\n print(i ? \\\"yes\\\" : \\\"no\\\");\\n}\\ninline void Yes(bool i = true) {\\n print(i ? \\\"Yes\\\" : \\\"No\\\");\\n}\\ninline void No() {\\n print(\\\"No\\\");\\n}\\ninline void YES(bool i = true) {\\n print(i ? \\\"YES\\\" : \\\"NO\\\");\\n}\\ninline void NO() {\\n print(\\\"NO\\\");\\n}\\ninline void Yay(bool i = true) {\\n print(i ? \\\"Yay!\\\" : \\\":(\\\");\\n}\\ninline void Possible(bool i = true) {\\n print(i ? \\\"Possible\\\" : \\\"Impossible\\\");\\n}\\ninline void POSSIBLE(bool i = true) {\\n print(i ? \\\"POSSIBLE\\\" : \\\"IMPOSSIBLE\\\");\\n}\\n\\n/**\\n * @brief Fast IO\\n */\\n\\ntemplate <unsigned mod = 1000000007> struct fp {\\n unsigned v;\\n static constexpr int get_mod() {\\n return mod;\\n }\\n constexpr unsigned inv() const {\\n assert(v != 0);\\n int x = v, y = mod, p = 1, q = 0, t = 0, tmp = 0;\\n while (y > 0) {\\n t = x / y;\\n x -= t * y, p -= t * q;\\n tmp = x, x = y, y = tmp;\\n tmp = p, p = q, q = tmp;\\n }\\n if (p < 0)\\n p += mod;\\n return p;\\n }\\n constexpr fp(ll x = 0) : v(x >= 0 ? x % mod : (mod - (-x) % mod) % mod) {}\\n fp operator-() const {\\n return fp() - *this;\\n }\\n fp pow(ull t) {\\n fp res = 1, b = *this;\\n while (t) {\\n if (t & 1)\\n res *= b;\\n b *= b;\\n t >>= 1;\\n }\\n return res;\\n }\\n fp &operator+=(const fp &x) {\\n if ((v += x.v) >= mod)\\n v -= mod;\\n return *this;\\n }\\n fp &operator-=(const fp &x) {\\n if ((v += mod - x.v) >= mod)\\n v -= mod;\\n return *this;\\n }\\n fp &operator*=(const fp &x) {\\n v = ull(v) * x.v % mod;\\n return *this;\\n }\\n fp &operator/=(const fp &x) {\\n v = ull(v) * x.inv() % mod;\\n return *this;\\n }\\n fp operator+(const fp &x) const {\\n return fp(*this) += x;\\n }\\n fp operator-(const fp &x) const {\\n return fp(*this) -= x;\\n }\\n fp operator*(const fp &x) const {\\n return fp(*this) *= x;\\n }\\n fp operator/(const fp &x) const {\\n return fp(*this) /= x;\\n }\\n bool operator==(const fp &x) const {\\n return v == x.v;\\n }\\n bool operator!=(const fp &x) const {\\n return v != x.v;\\n }\\n friend istream &operator>>(istream &is, fp &x) {\\n return is >> x.v;\\n }\\n friend ostream &operator<<(ostream &os, const fp &x) {\\n return os << x.v;\\n }\\n};\\n\\ntemplate <unsigned mod> void rd(fp<mod> &x) {\\n fastio::rd(x.v);\\n}\\ntemplate <unsigned mod> void wt(fp<mod> x) {\\n fastio::wt(x.v);\\n}\\n\\ntemplate <typename T> T Inv(ll n) {\\n static const int md = T::get_mod();\\n static vector<T> buf({0, 1});\\n assert(n > 0);\\n n %= md;\\n while (SZ(buf) <= n) {\\n int k = SZ(buf), q = (md + k - 1) / k;\\n buf.push_back(buf[k * q - md] * q);\\n }\\n return buf[n];\\n}\\n\\ntemplate <typename T> T Fact(ll n, bool inv = 0) {\\n static const int md = T::get_mod();\\n static vector<T> buf({1, 1}), ibuf({1, 1});\\n assert(n >= 0 and n < md);\\n while (SZ(buf) <= n) {\\n buf.push_back(buf.back() * SZ(buf));\\n ibuf.push_back(ibuf.back() * Inv<T>(SZ(ibuf)));\\n }\\n return inv ? ibuf[n] : buf[n];\\n}\\n\\ntemplate <typename T> T nPr(int n, int r, bool inv = 0) {\\n if (n < 0 || n < r || r < 0)\\n return 0;\\n return Fact<T>(n, inv) * Fact<T>(n - r, inv ^ 1);\\n}\\ntemplate <typename T> T nCr(int n, int r, bool inv = 0) {\\n if (n < 0 || n < r || r < 0)\\n return 0;\\n return Fact<T>(n, inv) * Fact<T>(r, inv ^ 1) * Fact<T>(n - r, inv ^ 1);\\n}\\ntemplate <typename T> T nHr(int n, int r, bool inv = 0) {\\n return nCr<T>(n + r - 1, r, inv);\\n}\\n\\n/**\\n * @brief Modint\\n */\\n\\nint main() {\\nwhile(1) {\\n ll _;\\n cin >> _;\\n if (_ == 0) return 0;\\n ll A = _;\\n string S;\\n cin >> S;\\n ll B = (1LL<<52);\\n rep(i,0,52) {\\n if (S[i] == '1') B += (1LL<<(51-i));\\n }\\n ll MAX = 1LL<<53, Cur = B;\\n rep(i,0,100) {\\n ll OK = 0, NG = A+1;\\n while(NG - OK > 1) {\\n ll MID = (NG + OK) / 2;\\n if (B == 0) OK = MID;\\n else if ((MAX * 2 - Cur) / B <= MID) NG = MID;\\n else if (Cur + B * MID >= MAX) NG = MID;\\n else OK = MID;\\n }\\n if (OK == A) {\\n Cur += B * A;\\n rep(j,0,12) {\\n if ((i & (1<<(11-j))) == 0) cout << '0';\\n else cout << '1';\\n }\\n vector<int> R(52,0);\\n rep(j,0,52) {\\n if (Cur % 2 == 1) R[j] = 1;\\n Cur /= 2;\\n }\\n rep(j,0,52) {\\n if (R[51-j] == 0) cout << '0';\\n else cout << '1';\\n }\\n cout << endl;\\n break;\\n }\\n A -= NG;\\n Cur += B * NG;\\n Cur /= 2;\\n B /= 2;\\n }\\n}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3496,\n \"score_of_the_acc\": -1,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1628_9323114\",\n \"code_snippet\": \"#include <algorithm>\\n#include <array>\\n#include <bitset>\\n#include <cassert>\\n#include <chrono>\\n#include <cmath>\\n#include <complex>\\n#include <deque>\\n#include <forward_list>\\n#include <fstream>\\n#include <functional>\\n#include <iomanip>\\n#include <ios>\\n#include <iostream>\\n#include <limits>\\n#include <list>\\n#include <map>\\n#include <memory>\\n#include <numeric>\\n#include <optional>\\n#include <queue>\\n#include <random>\\n#include <set>\\n#include <sstream>\\n#include <stack>\\n#include <string>\\n#include <tuple>\\n#include <type_traits>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <utility>\\n#include <vector>\\n\\n#ifdef RUTHEN_LOCAL\\n#include <debug.hpp>\\n#else\\n#define show(x) true\\n#endif\\n\\n// type definition\\nusing i64 = long long;\\nusing u32 = unsigned int;\\nusing u64 = unsigned long long;\\nusing f32 = float;\\nusing f64 = double;\\nusing f128 = long double;\\ntemplate <class T> using pque = std::priority_queue<T>;\\ntemplate <class T> using pqueg = std::priority_queue<T, std::vector<T>, std::greater<T>>;\\n// overload\\n#define overload4(_1, _2, _3, _4, name, ...) name\\n#define overload3(_1, _2, _3, name, ...) name\\n#define overload2(_1, _2, name, ...) name\\n// for loop\\n#define REP1(a) for (long long _ = 0; _ < (a); _++)\\n#define REP2(i, a) for (long long i = 0; i < (a); i++)\\n#define REP3(i, a, b) for (long long i = (a); i < (b); i++)\\n#define REP4(i, a, b, c) for (long long i = (a); i < (b); i += (c))\\n#define REP(...) overload4(__VA_ARGS__, REP4, REP3, REP2, REP1)(__VA_ARGS__)\\n#define RREP1(a) for (long long _ = (a)-1; _ >= 0; _--)\\n#define RREP2(i, a) for (long long i = (a)-1; i >= 0; i--)\\n#define RREP3(i, a, b) for (long long i = (b)-1; i >= (a); i--)\\n#define RREP(...) overload3(__VA_ARGS__, RREP3, RREP2, RREP1)(__VA_ARGS__)\\n#define FORE1(x, a) for (auto&& x : a)\\n#define FORE2(x, y, a) for (auto&& [x, y] : a)\\n#define FORE3(x, y, z, a) for (auto&& [x, y, z] : a)\\n#define FORE(...) overload4(__VA_ARGS__, FORE3, FORE2, FORE1)(__VA_ARGS__)\\n#define FORSUB(t, s) for (long long t = (s); t >= 0; t = (t == 0 ? -1 : (t - 1) & (s)))\\n// function\\n#define ALL(a) (a).begin(), (a).end()\\n#define RALL(a) (a).rbegin(), (a).rend()\\n#define SORT(a) std::sort((a).begin(), (a).end())\\n#define RSORT(a) std::sort((a).rbegin(), (a).rend())\\n#define REV(a) std::reverse((a).begin(), (a).end())\\n#define UNIQUE(a) \\\\\\n std::sort((a).begin(), (a).end()); \\\\\\n (a).erase(std::unique((a).begin(), (a).end()), (a).end())\\n#define LEN(a) (int)((a).size())\\n#define MIN(a) *std::min_element((a).begin(), (a).end())\\n#define MAX(a) *std::max_element((a).begin(), (a).end())\\n#define SUM1(a) std::accumulate((a).begin(), (a).end(), 0LL)\\n#define SUM2(a, x) std::accumulate((a).begin(), (a).end(), (x))\\n#define SUM(...) overload2(__VA_ARGS__, SUM2, SUM1)(__VA_ARGS__)\\n#define LB(a, x) std::distance((a).begin(), std::lower_bound((a).begin(), (a).end(), (x)))\\n#define UB(a, x) std::distance((a).begin(), std::upper_bound((a).begin(), (a).end(), (x)))\\ntemplate <class T, class U> inline bool chmin(T& a, const U& b) { return (a > T(b) ? a = b, 1 : 0); }\\ntemplate <class T, class U> inline bool chmax(T& a, const U& b) { return (a < T(b) ? a = b, 1 : 0); }\\ntemplate <class T, class S> inline T floor(const T x, const S y) {\\n assert(y);\\n return (y < 0 ? floor(-x, -y) : (x > 0 ? x / y : x / y - (x % y == 0 ? 0 : 1)));\\n}\\ntemplate <class T, class S> inline T ceil(const T x, const S y) {\\n assert(y);\\n return (y < 0 ? ceil(-x, -y) : (x > 0 ? (x + y - 1) / y : x / y));\\n}\\ntemplate <class T, class S> std::pair<T, T> inline divmod(const T x, const S y) {\\n T q = floor(x, y);\\n return {q, x - q * y};\\n}\\n// 10 ^ n\\nconstexpr long long TEN(int n) { return (n == 0) ? 1 : 10LL * TEN(n - 1); }\\n// 1 + 2 + ... + n\\n#define TRI1(n) ((n) * ((n) + 1LL) / 2)\\n// l + (l + 1) + ... + r\\n#define TRI2(l, r) (((l) + (r)) * ((r) - (l) + 1LL) / 2)\\n#define TRI(...) overload2(__VA_ARGS__, TRI2, TRI1)(__VA_ARGS__)\\n// bit operation\\n// bit[i] (= 0 or 1)\\n#define IBIT(bit, i) (((bit) >> (i)) & 1)\\n// (0, 1, 2, 3, 4) -> (0, 1, 3, 7, 15)\\n#define MASK(n) ((1LL << (n)) - 1)\\n#define POW2(n) (1LL << (n))\\n// (0, 1, 2, 3, 4) -> (0, 1, 1, 2, 1)\\nint popcnt(int x) { return __builtin_popcount(x); }\\nint popcnt(u32 x) { return __builtin_popcount(x); }\\nint popcnt(i64 x) { return __builtin_popcountll(x); }\\nint popcnt(u64 x) { return __builtin_popcountll(x); }\\n// (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2)\\nint topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }\\nint topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }\\nint topbit(i64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\\nint topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }\\n// (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2)\\nint lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }\\nint lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); }\\nint lowbit(i64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\\nint lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }\\n// binary search\\ntemplate <class T, class F> T bin_search(T ok, T ng, F& f) {\\n while ((ok > ng ? ok - ng : ng - ok) > 1) {\\n T md = (ng + ok) >> 1;\\n (f(md) ? ok : ng) = md;\\n }\\n return ok;\\n}\\ntemplate <class T, class F> T bin_search_real(T ok, T ng, F& f, const int iter = 100) {\\n for (int _ = 0; _ < iter; _++) {\\n T md = (ng + ok) / 2;\\n (f(md) ? ok : ng) = md;\\n }\\n return ok;\\n}\\n// rotate matrix counterclockwise by pi / 2\\ntemplate <class T> void rot(std::vector<std::vector<T>>& a) {\\n if ((int)(a.size()) == 0) return;\\n if ((int)(a[0].size()) == 0) return;\\n int n = (int)(a.size()), m = (int)(a[0].size());\\n std::vector res(m, std::vector<T>(n));\\n for (int i = 0; i < n; i++) {\\n for (int j = 0; j < m; j++) {\\n res[m - 1 - j][i] = a[i][j];\\n }\\n }\\n a.swap(res);\\n}\\n// const value\\nconstexpr int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};\\nconstexpr int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};\\n// infinity\\ntemplate <class T> constexpr T INF = 0;\\ntemplate <> constexpr int INF<int> = 1'000'000'000; // 1e9\\ntemplate <> constexpr i64 INF<i64> = i64(INF<int>) * INF<int> * 2; // 2e18\\ntemplate <> constexpr u32 INF<u32> = INF<int>; // 1e9\\ntemplate <> constexpr u64 INF<u64> = INF<i64>; // 2e18\\ntemplate <> constexpr f32 INF<f32> = INF<i64>; // 2e18\\ntemplate <> constexpr f64 INF<f64> = INF<i64>; // 2e18\\ntemplate <> constexpr f128 INF<f128> = INF<i64>; // 2e18\\n// I/O\\n// input\\ntemplate <class T> std::istream& operator>>(std::istream& is, std::vector<T>& v) {\\n for (auto&& i : v) is >> i;\\n return is;\\n}\\ntemplate <class... T> void in(T&... a) { (std::cin >> ... >> a); }\\nvoid scan() {}\\ntemplate <class Head, class... Tail> void scan(Head& head, Tail&... tail) {\\n in(head);\\n scan(tail...);\\n}\\n// input macro\\n#define INT(...) \\\\\\n int __VA_ARGS__; \\\\\\n scan(__VA_ARGS__)\\n#define I64(...) \\\\\\n i64 __VA_ARGS__; \\\\\\n scan(__VA_ARGS__)\\n#define U32(...) \\\\\\n u32 __VA_ARGS__; \\\\\\n scan(__VA_ARGS__)\\n#define U64(...) \\\\\\n u64 __VA_ARGS__; \\\\\\n scan(__VA_ARGS__)\\n#define F32(...) \\\\\\n f32 __VA_ARGS__; \\\\\\n scan(__VA_ARGS__)\\n#define F64(...) \\\\\\n f64 __VA_ARGS__; \\\\\\n scan(__VA_ARGS__)\\n#define F128(...) \\\\\\n f128 __VA_ARGS__; \\\\\\n scan(__VA_ARGS__)\\n#define STR(...) \\\\\\n std::string __VA_ARGS__; \\\\\\n scan(__VA_ARGS__)\\n#define CHR(...) \\\\\\n char __VA_ARGS__; \\\\\\n scan(__VA_ARGS__)\\n#define VEC(type, name, size) \\\\\\n std::vector<type> name(size); \\\\\\n scan(name)\\n#define VEC2(type, name1, name2, size) \\\\\\n std::vector<type> name1(size), name2(size); \\\\\\n for (int i = 0; i < size; i++) scan(name1[i], name2[i])\\n#define VEC3(type, name1, name2, name3, size) \\\\\\n std::vector<type> name1(size), name2(size), name3(size); \\\\\\n for (int i = 0; i < size; i++) scan(name1[i], name2[i], name3[i])\\n#define VEC4(type, name1, name2, name3, name4, size) \\\\\\n std::vector<type> name1(size), name2(size), name3(size), name4(size); \\\\\\n for (int i = 0; i < size; i++) scan(name1[i], name2[i], name3[i], name4[i])\\n#define VV(type, name, h, w) \\\\\\n std::vector name((h), std::vector<type>((w))); \\\\\\n scan(name)\\n// output\\ntemplate <class T> std::ostream& operator<<(std::ostream& os, const std::vector<T>& v) {\\n auto n = v.size();\\n for (size_t i = 0; i < n; i++) {\\n if (i) os << ' ';\\n os << v[i];\\n }\\n return os;\\n}\\ntemplate <class... T> void out(const T&... a) { (std::cout << ... << a); }\\nvoid print() { out('\\\\n'); }\\ntemplate <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {\\n out(head);\\n if (sizeof...(Tail)) out(' ');\\n print(tail...);\\n}\\n// for interactive problems\\nvoid printi() { std::cout << std::endl; }\\ntemplate <class Head, class... Tail> void printi(Head&& head, Tail&&... tail) {\\n out(head);\\n if (sizeof...(Tail)) out(' ');\\n printi(tail...);\\n}\\n// bool output\\nvoid YES(bool t = 1) { print(t ? \\\"YES\\\" : \\\"NO\\\"); }\\nvoid Yes(bool t = 1) { print(t ? \\\"Yes\\\" : \\\"No\\\"); }\\nvoid yes(bool t = 1) { print(t ? \\\"yes\\\" : \\\"no\\\"); }\\nvoid NO(bool t = 1) { YES(!t); }\\nvoid No(bool t = 1) { Yes(!t); }\\nvoid no(bool t = 1) { yes(!t); }\\nvoid POSSIBLE(bool t = 1) { print(t ? \\\"POSSIBLE\\\" : \\\"IMPOSSIBLE\\\"); }\\nvoid Possible(bool t = 1) { print(t ? \\\"Possible\\\" : \\\"Impossible\\\"); }\\nvoid possible(bool t = 1) { print(t ? \\\"possible\\\" : \\\"impossible\\\"); }\\nvoid IMPOSSIBLE(bool t = 1) { POSSIBLE(!t); }\\nvoid Impossible(bool t = 1) { Possible(!t); }\\nvoid impossible(bool t = 1) { possible(!t); }\\nvoid FIRST(bool t = 1) { print(t ? \\\"FIRST\\\" : \\\"SECOND\\\"); }\\nvoid First(bool t = 1) { print(t ? \\\"First\\\" : \\\"Second\\\"); }\\nvoid first(bool t = 1) { print(t ? \\\"first\\\" : \\\"second\\\"); }\\nvoid SECOND(bool t = 1) { FIRST(!t); }\\nvoid Second(bool t = 1) { First(!t); }\\nvoid second(bool t = 1) { first(!t); }\\n// I/O speed up\\nstruct SetUpIO {\\n SetUpIO() {\\n std::ios::sync_with_stdio(false);\\n std::cin.tie(0);\\n std::cout << std::fixed << std::setprecision(15);\\n }\\n} set_up_io;\\n// #include \\\"math/divisor.hpp\\\"\\nusing namespace std;\\n\\nvoid solve(i64 N) {\\n STR(S);\\n using Num = pair<int, string>;\\n\\n auto add = [](Num a, Num b, i64& addnum) -> Num {\\n deque<int> qa, qb;\\n REP(i, LEN(a.second)) qa.push_back(a.second[i] - '0');\\n REP(i, LEN(b.second)) qb.push_back(b.second[i] - '0');\\n qa.push_front(1);\\n qb.push_front(1);\\n int emax = max(a.first, b.first);\\n int da = emax - a.first;\\n int db = emax - b.first;\\n assert(da == 0);\\n REP(db) qb.push_front(0);\\n while (LEN(qb) > 53) qb.pop_back();\\n show(qa);\\n show(qb);\\n\\n i64 n = 1;\\n int ok = 1;\\n {\\n int carry = 0;\\n RREP(i, 53) {\\n int s = qa[i] + qb[i] + carry;\\n carry = s / 2;\\n }\\n ok &= carry == 0;\\n }\\n while (addnum >= 2 * n and ok) {\\n qb.push_back(0);\\n int memo = qb.front();\\n qb.pop_front();\\n // check\\n int carry = 0;\\n RREP(i, 53) {\\n int s = qa[i] + qb[i] + carry;\\n carry = s / 2;\\n }\\n // ok\\n if (carry == 0) {\\n n *= 2;\\n } else {\\n // rollback\\n qb.push_front(memo);\\n qb.pop_back();\\n break;\\n }\\n }\\n\\n int carry = 0;\\n deque<int> sum;\\n RREP(i, 53) {\\n int s = qa[i] + qb[i] + carry;\\n sum.push_front(s % 2);\\n carry = s / 2;\\n }\\n show(qa);\\n show(qb);\\n show(sum);\\n if (carry == 1) {\\n sum.push_front(1);\\n emax++;\\n sum.pop_back();\\n }\\n sum.pop_front();\\n string ans;\\n REP(i, 52) ans += sum[i] + '0';\\n addnum -= n;\\n return {emax, ans};\\n };\\n\\n Num a = {0, S};\\n Num s = a;\\n while (N > 0) {\\n s = add(s, a, N);\\n show(s);\\n show(N);\\n }\\n // print(s);\\n string ans;\\n RREP(i, 12) ans += '0' + IBIT(s.first, i);\\n ans += s.second;\\n print(ans);\\n return;\\n}\\n\\nint main() {\\n i64 N;\\n while (cin >> N, N != 0) solve(N);\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 700,\n \"memory_kb\": 3412,\n \"score_of_the_acc\": -1.0727,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1628_6014231\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define ll long long\\n#define ull unsigned long long\\n#define db double\\n#define pii pair<int,int>\\n#define pli pair<ll,int>\\n#define pil pair<int,ll>\\n#define pll pair<ll,ll>\\n#define ti3 tuple<int,int,int>\\n#define mat vector<vector<ll>>\\nconst int inf = 1 << 30;\\nconst ll mod = 1e9 + 7;\\nconst ll linf = 1e18;\\nconst db EPS = 1e-10;\\nconst db pi = acos(-1);\\ntemplate<class T> void chmin(T& x, T y){if(x > y) x = y;}\\ntemplate<class T> void chmax(T& x, T y){if(x < y) x = y;}\\n\\nll n;\\nstring culc(string x, string y) {\\n string ex = x.substr(0, 12);\\n string ey = y.substr(0, 12);\\n bool flag = true;\\n if (stoi(ex, 0, 2) > stoi(ey, 0, 2)) {\\n flag = false;\\n swap(x, y);\\n swap(ex, ey);\\n }\\n string mx = x.substr(12, 52);\\n mx = \\\"1\\\" + mx;\\n string my = y.substr(12, 52);\\n my = \\\"1\\\" + my;\\n int a = stoi(ex, 0, 2), b = stoi(ey, 0, 2), c = b - a;\\n if (c > 52) {\\n return \\\"\\\";\\n } else {\\n for (int i = 52; i - c >= 0; i--) {\\n mx[i] = mx[i - c];\\n }\\n for (int i = 0; i < c; i++) {\\n mx[i] = '0';\\n }\\n }\\n\\n ll d = stoll(mx, 0, 2), e = stoll(my, 0, 2);\\n\\n if (flag) {\\n n--;\\n } else {\\n ll q = ((1ll << 53) - e) / d;\\n ll r = ((1ll << 53) - e) % d;\\n if (r != 0) q++;\\n q = min(n, q);\\n d *= q;\\n n -= q;\\n }\\n ll f = d + e;\\n if (f >> 53 & 1ll) {\\n c++;\\n f /= 2;\\n }\\n bitset<52> bs2(f);\\n string mz = bs2.to_string();\\n bitset<12> bs1(c + a);\\n string ez = bs1.to_string();\\n string z = ez + mz;\\n return z;\\n}\\n\\nvoid solve() {\\n string b;\\n cin >> b;\\n string e = \\\"000000000000\\\";\\n b = e + b;\\n string a = b;\\n while (n > 0) {\\n string c = culc(a, b);\\n if (c == \\\"\\\") break;\\n a = c;\\n }\\n cout << a << endl;\\n}\\n\\nint main() {\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n cout << fixed << setprecision(20);\\n while (true) {\\n cin >> n;\\n if (n == 0) break;\\n solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3384,\n \"score_of_the_acc\": -0.7333,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1628_5937061\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define _overload3(_1, _2, _3, name, ...) name\\n#define _rep(i, n) repi(i, 0, n)\\n#define repi(i, a, b) for (int i = (a); i < (b); ++i)\\n#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)\\n#define ALL(x) x.begin(), x.end()\\n#define chmax(x, y) x = max(x, y)\\n#define chmin(x, y) x = min(x, y)\\nusing namespace std;\\nrandom_device rnd;\\nmt19937 mt(rnd());\\nusing ll = long long;\\nusing lld = long double;\\nusing VI = vector<int>;\\nusing VVI = vector<VI>;\\nusing VL = vector<ll>;\\nusing VVL = vector<VL>;\\nusing PII = pair<int, int>;\\nconst int IINF = 1 << 30;\\nconst ll INF = 1ll << 60;\\nconst ll MOD = 1000000007;\\nclass FloatingPointNumber\\n{\\npublic:\\n ll exp;\\n vector<int> fraction;\\n FloatingPointNumber(int size = 52)\\n {\\n exp = 0;\\n fraction.assign(size, 0);\\n }\\n void print()\\n {\\n string binary = bitset<12>(exp).to_string();\\n cout << binary;\\n for (int i = 1; i < fraction.size(); i++)\\n {\\n cout << fraction[i];\\n }\\n cout << endl;\\n }\\n};\\n\\nbool check(FloatingPointNumber a, FloatingPointNumber b)\\n{\\n int carry = 0;\\n int pos = b.fraction.size() - 1;\\n // cerr << \\\"@@@@@@@\\\" << endl;\\n // a.print();\\n // b.print();\\n for (int i = a.fraction.size() - 1; i >= 0; i--, pos--)\\n {\\n\\n b.fraction.at(pos) += a.fraction.at(i);\\n b.fraction.at(pos) += carry;\\n if (b.fraction.at(pos) >= 2)\\n {\\n b.fraction.at(pos) -= 2;\\n carry = 1;\\n }\\n else\\n {\\n carry = 0;\\n }\\n }\\n // cerr << carry << \\\" \\\" << pos << endl;\\n for (; pos >= 0; pos--)\\n {\\n b.fraction.at(pos) += carry;\\n if (b.fraction.at(pos) >= 2)\\n {\\n b.fraction.at(pos) -= 2;\\n carry = 1;\\n }\\n else\\n {\\n carry = 0;\\n }\\n }\\n return carry == 0;\\n}\\n\\nvoid add(FloatingPointNumber &b, FloatingPointNumber a, ll &m)\\n{\\n if (a.exp > b.exp)\\n {\\n swap(a, b);\\n }\\n while (!a.fraction.empty() && a.exp < b.exp)\\n {\\n a.fraction.pop_back();\\n a.exp++;\\n }\\n if (a.fraction.empty())\\n {\\n return;\\n }\\n m--;\\n ll cost = 1;\\n while (m > 0 && a.fraction.size() < 53 && check(a, b))\\n {\\n if (cost <= m)\\n {\\n m -= cost;\\n a.fraction.push_back(0);\\n cost *= 2;\\n if (check(a, b) == false)\\n {\\n cost /= 2;\\n m += cost;\\n a.fraction.pop_back();\\n break;\\n }\\n }\\n else\\n {\\n break;\\n }\\n }\\n\\n int carry = 0;\\n int pos = b.fraction.size() - 1;\\n // cerr << \\\"@@@@@@@\\\" << endl;\\n // a.print();\\n // b.print();\\n for (int i = a.fraction.size() - 1; i >= 0; i--, pos--)\\n {\\n\\n b.fraction.at(pos) += a.fraction.at(i);\\n b.fraction.at(pos) += carry;\\n if (b.fraction.at(pos) >= 2)\\n {\\n b.fraction.at(pos) -= 2;\\n carry = 1;\\n }\\n else\\n {\\n carry = 0;\\n }\\n }\\n // cerr << carry << \\\" \\\" << pos << endl;\\n for (; pos >= 0; pos--)\\n {\\n b.fraction.at(pos) += carry;\\n if (b.fraction.at(pos) >= 2)\\n {\\n b.fraction.at(pos) -= 2;\\n carry = 1;\\n }\\n else\\n {\\n carry = 0;\\n }\\n }\\n\\n if (carry == 1)\\n {\\n b.exp++;\\n b.fraction.insert(b.fraction.begin(), 1);\\n b.fraction.pop_back();\\n assert(b.fraction.size() == 53);\\n }\\n // b.print();\\n return;\\n}\\nvoid solve(ll n)\\n{\\n FloatingPointNumber f(0);\\n string s;\\n cin >> s;\\n f.fraction.push_back(1);\\n for (auto c : s)\\n {\\n f.fraction.push_back(c - '0');\\n }\\n auto ans = f;\\n while (n > 0)\\n {\\n auto old = ans;\\n add(ans, f, n);\\n if (ans.exp == old.exp && ans.fraction == old.fraction)\\n {\\n break;\\n }\\n if (ans.exp != old.exp)\\n {\\n string binary = bitset<12>(ans.exp).to_string();\\n //cout << binary << endl;\\n ;\\n }\\n // ans.print();\\n //n--;\\n }\\n ans.print();\\n}\\n\\nint main()\\n{\\n ll n;\\n while (cin >> n, n)\\n {\\n solve(n);\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 880,\n \"memory_kb\": 3316,\n \"score_of_the_acc\": -0.9153,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1628_4948704\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\n\\nstruct f{\\n ll e=0;\\n ll base=0;\\n\\n f(){base += (1LL<<52);}\\n\\n f(string s){\\n ll k = 1;\\n for(int i=51;i>=0;i--) {\\n if(s[i]=='1') base += k;\\n k *= 2;\\n }\\n base += k;\\n }\\n\\n f operator + (const f& r){\\n if(e==r.e){\\n f ret;\\n ret.base = base + r.base;\\n ret.e = e;\\n if((ret.base>>53)&1){\\n ret.base >>= 1;\\n ret.e++;\\n }\\n return ret;\\n }else{\\n f ret;\\n if(e>r.e){\\n ll sa = e - r.e;\\n if(sa >= 53) return (*this);\\n ret.base = base + (r.base >> sa);\\n ret.e = e;\\n }else{\\n ll sa = r.e - e;\\n if(sa >= 53) return r;\\n ret.base = r.base + (base >> sa);\\n ret.e = r.e;\\n }\\n if((ret.base>>53)&1){\\n ret.base >>= 1;\\n ret.e++;\\n }\\n return ret;\\n }\\n }\\n};\\nvoid print(f ans){\\n for(ll i=11;i>=0;i--) std::cout << ((ans.e>>i)&1);\\n for(ll i=51;i>=0;i--) std::cout << ((ans.base>>i)&1);\\n std::cout << '\\\\n';\\n}\\n\\nvoid solve(ll n){\\n string s;std::cin >> s;\\n vector<vector<f>> v(53, vector<f>(70));\\n for(ll i=0;i<53;i++){\\n v[i][0] = f(s);\\n for(ll j=0;j<i;j++) if((v[i][0].base>>j)&1) v[i][0].base ^= (1LL<<j);\\n for(ll j=1;j<70;j++) v[i][j] = v[i][j-1] + v[i][j-1];\\n }\\n auto add = [&](ll b, ll c){\\n assert(b>0);\\n f ret;\\n ret.e = -1;\\n ll x = 0;\\n while(b){\\n if(b&1){\\n if(ret.e==-1) ret = v[c][x];\\n else ret = ret + v[c][x];\\n }\\n x++;\\n b /= 2;\\n }\\n return ret;\\n };\\n\\n f st = f(s);\\n int cnt = 0;\\n\\n while(n>0){\\n ll now = st.e;\\n ll l = 0, r = n+1;\\n if(cnt==53){\\n print(st);\\n return;\\n }\\n while(r-l>1){\\n ll mid = (l+r)/2;\\n f tmp = st;\\n if(mid) tmp = tmp + add(mid, cnt);\\n if(tmp.e>now) r = mid;\\n else l = mid;\\n }\\n if(l) st = st + add(l, cnt);\\n n -= l;\\n if(n>0){\\n st = st + v[0][0];\\n n--;\\n }\\n cnt++;\\n }\\n print(st);\\n}\\nint main(){\\n while(true){\\n ll n;std::cin >> n;\\n if(n==0) return 0;\\n solve(n);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3416,\n \"score_of_the_acc\": -0.8372,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1628_4943605\",\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;\\nll N;\\nstring S;\\nconst ll b = 52;\\nll now;\\nll e;\\nll A;\\nconst ll INF = 1e18;\\nll mul(ll a, ll b) {\\n if(a == 0 or b == 0) return 0;\\n if(INF / a <= b) return INF;\\n return a * b;\\n}\\n\\nvoid solve() {\\n now = 1;\\n e = 0;\\n for(auto c : S) {\\n now *= 2;\\n if(c == '1') now++;\\n }\\n A = now;\\n while(N) {\\n ll ok = N;\\n ll ng = 0;\\n while(ok - ng > 1) {\\n ll mid = (ok + ng) / 2;\\n if(mul(mid, A) + now >= (1LL << (b + 1))) ok = mid;\\n else ng = mid;\\n }\\n N -= ok;\\n now += A * ok;\\n if(now >= (1LL << (b + 1))) {\\n now >>= 1;\\n A >>= 1;\\n e++;\\n }\\n }\\n now -= (1LL << b);\\n //cerr << e << \\\" \\\" << now << endl;\\n string R;\\n for(int i = 0; i < b; i++) {\\n if(now % 2 == 1) R.push_back('1');\\n else R.push_back('0');\\n now >>= 1;\\n }\\n reverse(R.begin(), R.end());\\n string L;\\n for(int i = 0; i < 12; i++) {\\n if(e % 2 == 1) L.push_back('1');\\n else L.push_back('0');\\n e >>= 1;\\n }\\n reverse(L.begin(), L.end());\\n cout << L << R << endl;\\n}\\n\\nint main() {\\n while(cin >> N) {\\n if(N == 0) break;\\n cin >> S;\\n solve();\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3376,\n \"score_of_the_acc\": -0.7143,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1628_4882325\",\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\\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\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\n\\twhile (cin >> N, N) {\\n\\t\\tstring s;\\n\\t\\tcin >> s;\\n\\t\\tvector<long long int>v;\\n\\t\\tv.push_back(1);\\n\\t\\tfor (auto i : s)v.push_back(i - '0');\\n\\t\\tauto w = v;\\n\\t\\tint num = 0;\\n\\t\\twhile (N) {\\n\\t\\t\\tL = 0, R = N;\\n\\t\\t\\twhile (R - L > 1) {\\n\\t\\t\\t\\tlong long int mid = (R + L) / 2;\\n\\t\\t\\t\\tauto nw = w;\\n\\t\\t\\t\\tfor (int i = num; i < 53; i++) {\\n\\t\\t\\t\\t\\tnw[i] += v[i - (num)]*mid;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tfor (int i = 52; i > 0; i--) {\\n\\t\\t\\t\\t\\tnw[i - 1] += nw[i] / 2;\\n\\t\\t\\t\\t\\tnw[i] &= 1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (nw[0] >= 2)R = mid;\\n\\t\\t\\t\\telse L = mid;\\n\\t\\t\\t}\\n\\t\\t\\tfor (int i = num; i < 53; i++) {\\n\\t\\t\\t\\tw[i] += v[i - (num)]*R;\\n\\t\\t\\t}\\n\\t\\t\\tfor (int i = 52; i > 0; i--) {\\n\\t\\t\\t\\tw[i - 1] += w[i] / 2;\\n\\t\\t\\t\\tw[i] &= 1;\\n\\t\\t\\t}\\n\\t\\t\\tN -= R;\\n\\t\\t\\tif (w[0] >= 2) {\\n\\t\\t\\t\\tnum++;\\n\\t\\t\\t\\tfor (int i = 52; i > 0; i--) {\\n\\t\\t\\t\\t\\tw[i] = w[i - 1];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tw[0] = 0;\\n\\t\\t\\t\\tfor (int i = 52; i > 0; i--) {\\n\\t\\t\\t\\t\\tw[i - 1] += w[i] / 2;\\n\\t\\t\\t\\t\\tw[i] &= 1;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tstring ret;\\n\\t\\tfor (int i = 11; i >= 0; i--)cout << ((num >> i) & 1);\\n\\t\\tfor (int i = 1; i < 53; i++)cout << w[i];\\n\\t\\tcout << endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 180,\n \"memory_kb\": 3164,\n \"score_of_the_acc\": -0.2767,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1628_3730869\",\n \"code_snippet\": \"#include \\\"bits/stdc++.h\\\"\\nusing namespace std;\\n#define rep(i,a,b) for(int i=(a);i<(b);i++)\\n#define int long long\\n\\nstruct Int {\\n\\tint exp = 0;\\n\\tunsigned int kasu = 1ll << 52;\\n\\n\\tInt() {}\\n\\tInt(string b) {\\n\\t\\texp = 0;\\n\\t\\tkasu = 1ll << 52;\\n\\t\\trep(i, 0, 52) {\\n\\t\\t\\tint j = 51 - i;\\n\\t\\t\\tif (b[i] == '1') {\\n\\t\\t\\t\\tkasu |= (1ll << j);\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n};\\n\\n\\nbool operator==(Int a, Int b) {\\n\\treturn a.exp == b.exp and a.kasu == b.kasu;\\n}\\nInt operator+(Int x, Int y) {\\n\\tint d = x.exp - y.exp;\\n\\ty.kasu >>= d;\\n\\tx.kasu += y.kasu;\\n\\n\\twhile (x.kasu >= (1ll << 53)) {\\n\\t\\tx.exp++;\\n\\t\\tx.kasu -= (1ll << 52);\\n\\t}\\n\\n\\treturn x;\\n}\\n\\nauto binarySearch = [&](int ng, int ok, Int s, Int a) {\\n\\tauto f = [&](int m) {\\n\\t\\tif ((1LL << 60) / m < (a.kasu >> s.exp))return true;\\n\\t\\treturn ((a.kasu >> s.exp) * m + s.kasu) >= (1LL << 53);\\n\\t};\\n\\tif (f(ng))return ng;\\n\\twhile (ng + 1 < ok) {\\n\\t\\tint m = (ng + ok) / 2;\\n\\t\\tif (f(m))\\n\\t\\t\\tok = m;\\n\\t\\telse\\n\\t\\t\\tng = m;\\n\\t}\\n\\treturn ok;\\n};\\n\\nvoid solve(int n) {\\n\\tstring b; cin >> b;\\n\\tInt a(b);\\n\\tInt s = a;\\n\\n\\tint k = 0;\\n\\t//cerr << \\\"a.exp \\\" << bitset<12>(a.exp) << endl;\\n\\t//cerr << \\\"a.kasu \\\" << bitset<53>(a.kasu) << endl;\\n\\twhile (k < n) {\\n\\t\\tint x = binarySearch(1, n - k, s, a);\\n\\t\\ts.kasu = (a.kasu >> s.exp) * x + s.kasu;\\n\\t\\tif (s.kasu == (1ll << 53)) {\\n\\t\\t\\ts.exp++;\\n\\t\\t\\ts.kasu >>= 1;\\n\\t\\t}\\n\\t\\telse {\\n\\t\\t\\tif (s.kasu >= (1ll << 53)) {\\n\\t\\t\\t\\ts.exp++;\\n\\t\\t\\t\\ts.kasu >>= 1;\\n\\t\\t\\t}\\n\\t\\t\\twhile (s.kasu < (1ll << 52)) {\\n\\t\\t\\t\\ts.exp--;\\n\\t\\t\\t\\ts.kasu <<= 1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tk += x;\\n\\t\\t//cerr << \\\"x \\\" << x << endl;\\n\\t\\t//cerr << \\\"s.exp \\\" << bitset<12>(s.exp) << endl;\\n\\t\\t//cerr << \\\"s.kasu \\\" << bitset<53>(s.kasu) << endl;\\n\\t}\\n\\n\\tcout << bitset<12>(s.exp) << bitset<52>(s.kasu) << endl;\\n\\n}\\n\\nsigned main() {\\n\\n\\tint n;\\n\\twhile (cin >> n, n) {\\n\\t\\tsolve(n);\\n\\t}\\n\\n\\t//double hoge = 1.0;\\n\\t//int x=*((int*)(&hoge));\\n\\t//bitset<64>b(x);\\n\\t//cout << b << endl;\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3200,\n \"score_of_the_acc\": -0.2952,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1628_3704807\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\nconstexpr int mod = 1e9 + 7;\\n\\n#define dump(x) ([&](){auto y = (x); cout << #x << \\\" = \\\" << (y) << endl; })();\\n// #define dump(x) ;\\n\\n\\ntemplate<class T>\\nostream&operator<<(ostream &os, vector<T>v) {\\n os << \\\"{\\\";\\n for(size_t i = 0; i < v.size(); i++) os << v[i] << \\\", \\\";\\n os << \\\"}\\\";\\n return os;\\n}\\n\\ntemplate<class T, class U>\\nostream&operator<<(ostream &os, pair<T, U>v) {\\n os << \\\"(\\\" << v.first << \\\" , \\\" << v.second << \\\")\\\";\\n return os;\\n}\\n\\ntemplate<class T, class U>\\nostream&operator<<(ostream &os, map<T, U>v) {\\n os << \\\"(map: \\\\n\\\";\\n for(auto e : v) os << e << \\\", \\\\n\\\";\\n os << \\\")\\\";\\n return os;\\n}\\n\\nusing Vec = vector<int>;\\nusing Mat = vector<Vec>;\\n\\nll modpow(ll x, ll k, ll mod) {\\n x %= mod;\\n ll r = 1;\\n assert(k >= 0);\\n while(k) {\\n if(k & 1) r = r * x % mod;\\n x = x * x % mod;\\n k >>= 1;\\n }\\n return r;\\n}\\n\\nll toint(string s) {\\n ll res = 0;\\n int n = s.size();\\n for(int i = 0; i < n; i++) res |= (ll(s[n - 1 - i] - '0')) << i;\\n return res;\\n}\\n\\nstring tostr(ll x, int n) {\\n string res = \\\"\\\";\\n for(int i = 0; i < n; i++) {\\n res += '0' + ((x >> i) & 1);\\n }\\n reverse(begin(res), end(res));\\n return res;\\n}\\n\\nbool mul_OF(ll a, ll b) {\\n // a * b > 4e18\\n // a > floor(4e18 / b)\\n return a > ll(1e18) / b;\\n}\\n\\nint main() {\\n ios::sync_with_stdio(0), cin.tie(0);\\n\\n while(1) {\\n ll n;\\n cin >> n;\\n if(n == 0) break;\\n string b;\\n cin >> b;\\n\\n ll e = 0;\\n ll k = toint(b) + (1ll << 52);\\n // dump(e);\\n // dump(k);\\n\\n ll G = 1ll << 53;\\n assert(k < G);\\n\\n ll now = k;\\n int shift = 0;\\n // dump(n);\\n // dump(e);\\n // dump(k);\\n while(n) {\\n ll ok = 0, ng = n + 1;\\n ll s = (k >> shift);\\n while(abs(ok - ng) > 1) {\\n ll mid = (ok + ng) >> 1;\\n if(mul_OF(s, mid)) {\\n ng = mid;\\n } else {\\n if(s * mid < G - now) ok = mid; else ng = mid;\\n }\\n }\\n // dump(ok);\\n now += s * ok;\\n n -= ok;\\n if(n) {\\n now += s;\\n assert(now >= G);\\n assert(now < G * 2);\\n now >>= 1;\\n e++;\\n shift++;\\n if(shift > 53) shift = 53;\\n n--;\\n }\\n\\n }\\n assert(k >= (1ll << 52));\\n cout << tostr(e, 12) << tostr(now - (1ll << 52), 52) << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3100,\n \"score_of_the_acc\": -0.0571,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1628_3463184\",\n \"code_snippet\": \"#include<iostream>\\n#include<string>\\n#include<cstdio>\\n#include<vector>\\n#include<cmath>\\n#include<algorithm>\\n#include<functional>\\n#include<iomanip>\\n#include<queue>\\n#include<ciso646>\\n#include<random>\\n#include<map>\\n#include<set>\\n#include<complex>\\n#include<bitset>\\n#include<stack>\\n#include<unordered_map>\\n#include<utility>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef unsigned long long ul;\\ntypedef unsigned int ui;\\nconst ll mod = 1000000007;\\ntypedef long double ld;\\nconst ll INF = mod * mod;\\ntypedef pair<int, int> P;\\n#define stop char nyaa;cin>>nyaa;\\n#define rep(i,n) for(int i=0;i<n;i++)\\n#define per(i,n) for(int i=n-1;i>=0;i--)\\n#define Rep(i,sta,n) for(int i=sta;i<n;i++)\\n#define rep1(i,n) for(int i=1;i<=n;i++)\\n#define per1(i,n) for(int i=n;i>=1;i--)\\n#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)\\ntypedef complex<ld> Point;\\nconst ld eps = 1e-8;\\nconst ld pi = acos(-1.0);\\ntypedef pair<ld, ld> LDP;\\ntypedef pair<ll, ll> LP;\\n#define fr first\\n#define sc second\\n\\nvoid solve() {\\n\\tll n;\\n\\twhile (cin >> n, n) {\\n\\t\\tint cnt = 0;\\n\\t\\tbitset<52> b = 0;\\n\\t\\tstring s; cin >> s;\\n\\t\\trep(i,52)if (s[i] == '1')b[51-i] = 1;\\n\\t\\tbitset<52> x = 0;\\n\\t\\tx = b;\\n\\t\\tcnt++; n--;\\n\\t\\twhile (n > 0) {\\n\\t\\t\\tif (cnt > 52)break;\\n\\t\\t\\t//cout << cnt << \\\" \\\" << n << \\\" \\\" << x << endl;\\n\\t\\t\\tbitset<52> c = b; c >>= cnt; \\n\\t\\t\\tif (cnt)c[52-cnt] = 1;\\n\\t\\t\\tif (c == 0)break;\\n\\t\\t\\tll le = 0, ri = INF;\\n\\t\\t\\twhile (ri - le > 1) {\\n\\t\\t\\t\\tll mid = (ri + le) / 2;\\n\\t\\t\\t\\tll s = 0;\\n\\t\\t\\t\\trep(i, 52) {\\n\\t\\t\\t\\t\\tif (x[i]) {\\n\\t\\t\\t\\t\\t\\ts++;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif (c[i]) {\\n\\t\\t\\t\\t\\t\\ts += mid;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\ts /= 2;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tif (s > 0)ri = mid;\\n\\t\\t\\t\\telse le = mid;\\n\\t\\t\\t}\\n\\t\\t\\tif (n < ri) {\\n\\t\\t\\t\\tll s = 0;\\n\\t\\t\\t\\trep(i, 52) {\\n\\t\\t\\t\\t\\tif (x[i])s++;\\n\\t\\t\\t\\t\\tif (c[i])s += n;\\n\\t\\t\\t\\t\\tif (s % 2)x[i] = 1;\\n\\t\\t\\t\\t\\telse x[i] = 0;\\n\\t\\t\\t\\t\\ts /= 2;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t\\telse {\\n\\t\\t\\t\\tn -= ri;\\n\\t\\t\\t\\tll s = 0;\\n\\t\\t\\t\\trep(i, 52) {\\n\\t\\t\\t\\t\\tif (x[i])s++;\\n\\t\\t\\t\\t\\tif (c[i])s += ri;\\n\\t\\t\\t\\t\\tif (s % 2)x[i] = 1;\\n\\t\\t\\t\\t\\telse x[i] = 0;\\n\\t\\t\\t\\t\\ts /= 2;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tcnt++; x >>= 1;\\n\\t\\t\\t\\tif (cnt == 1)x[51] = 1;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t\\tstring ans;\\n\\t\\trep(i, 12) {\\n\\t\\t\\tif (cnt&(1 << (11-i))) {\\n\\t\\t\\t\\tans.push_back('1');\\n\\t\\t\\t}\\n\\t\\t\\telse ans.push_back('0');\\n\\t\\t}\\n\\t\\tper(i, 52) {\\n\\t\\t\\tif (x[i])ans.push_back('1');\\n\\t\\t\\telse ans.push_back('0');\\n\\t\\t}\\n\\t\\tcout << ans << endl;\\n\\t}\\n}\\nint main() {\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(0);\\n\\tsolve();\\n\\t//stop\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 3076,\n \"score_of_the_acc\": -0.0632,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1628_3425297\",\n \"code_snippet\": \"#define _CRT_SECURE_NO_WARNINGS\\n#define _SILENCE_ALL_CXX17_DEPRECATION_WARNINGS\\n#include <stdio.h>\\n#include <algorithm>\\n#include <utility>\\n#include <functional>\\n#include <cstring>\\n#include <queue>\\n#include <stack>\\n#include <math.h>\\n#include <iterator>\\n#include <vector>\\n#include <string>\\n#include <set>\\n#include <math.h>\\n#include <iostream>\\n#include <random>\\n#include <map>\\n#include <fstream>\\n#include <iomanip>\\n#include <time.h>\\n#include <stdlib.h>\\n#include <list>\\n#include <typeinfo>\\n#include <list>\\n#include <set>\\n#include <assert.h>\\n#include <complex>\\nusing namespace std;\\n#define LONG_INF 10000000000000\\n#define GOLD 1.61803398874989484820458\\n#define MAX_MOD 1000000007\\n#define MOD 998244353LL\\n#define seg_size 65536*4\\n#define REP(i,n) for(long long i = 0;i < n;++i)\\nlong long n;\\nstring pluser(string a, string b) {\\n\\tint kuriagari = 0;\\n\\tstring ans;\\n\\tfor (int i = a.size() - 1; i >= 0; --i) {\\n\\t\\tkuriagari += a[i] + b[i] - '0' - '0';\\n\\t\\tans.push_back(kuriagari % 2 + '0');\\n\\t\\tkuriagari /= 2;\\n\\t\\tkuriagari = max(kuriagari, 0);\\n\\t}\\n\\tif (kuriagari == 1) {\\n\\t\\tans.push_back('1');\\n\\t}\\n\\treverse(ans.begin(), ans.end());\\n\\treturn ans;\\n}\\nint main(){\\n#define int long long\\n\\twhile (true) {\\n\\t\\tcin >> n;\\n\\t\\tif (n == 0) return 0;\\n\\t\\tstring base;\\n\\t\\tcin >> base;\\n\\t\\tbase = \\\"1\\\" + base;\\n\\t\\tstring ans = base;\\n\\t\\tfor (int i = 0;;) {\\n\\t\\t\\twhile (n != 0 && ans.length() == base.length()) {\\n\\t\\t\\t\\tstring multiply;\\n\\t\\t\\t\\tmultiply = base;\\n\\t\\t\\t\\tfor (long long q = 1;; q *= 2) {\\n\\t\\t\\t\\t\\tstring now = pluser(multiply, ans);\\n\\t\\t\\t\\t\\tif (now.length() != ans.length()) {\\n\\t\\t\\t\\t\\t\\t//繰り上がり発生\\n\\t\\t\\t\\t\\t\\tif (q != 1) {\\n\\t\\t\\t\\t\\t\\t\\t//保持しない\\n\\t\\t\\t\\t\\t\\t\\tq /= 2;\\n\\t\\t\\t\\t\\t\\t\\tfor (int j = multiply.size() - 1; j >= 1; --j) {\\n\\t\\t\\t\\t\\t\\t\\t\\tmultiply[j] = multiply[j - 1];\\n\\t\\t\\t\\t\\t\\t\\t\\tmultiply[j - 1] = '0';\\n\\t\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\t\\tn -= q;\\n\\t\\t\\t\\t\\t\\tans = pluser(multiply,ans);\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tif (q * 2 > n) {\\n\\t\\t\\t\\t\\t\\tn -= q;\\n\\t\\t\\t\\t\\t\\tans = now;\\n\\t\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tfor (int j = 0; j < multiply.size() - 1; ++j) {\\n\\t\\t\\t\\t\\t\\tmultiply[j] = multiply[j + 1];\\n\\t\\t\\t\\t\\t}\\n\\t\\t\\t\\t\\tmultiply[multiply.size() - 1] = '0';\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (ans.length() != base.length()) {\\n\\t\\t\\t\\tans.pop_back();\\n\\t\\t\\t\\tfor (int q = base.length() - 1; q >= 1;--q) {\\n\\t\\t\\t\\t\\tbase[q] = base[q - 1];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tbase[0] = '0';\\n\\t\\t\\t\\ti++;\\n\\t\\t\\t}\\n\\t\\t\\tif (n == 0) {\\n\\t\\t\\t\\tstring s;\\n\\t\\t\\t\\tint geko = i;\\n\\t\\t\\t\\tfor (int q = 0; q < 12; ++q) {\\n\\t\\t\\t\\t\\ts.push_back(geko % 2 + '0');\\n\\t\\t\\t\\t\\tgeko /= 2;\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\treverse(s.begin(), s.end());\\n\\t\\t\\t\\tcout << s;\\n\\t\\t\\t\\tfor (int j = 1; j < ans.length(); ++j) {\\n\\t\\t\\t\\t\\tcout << ans[j];\\n\\t\\t\\t\\t}\\n\\t\\t\\t\\tcout << endl;\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2540,\n \"memory_kb\": 3220,\n \"score_of_the_acc\": -1.3429,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1628_3084228\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\ntypedef long long int ll;\\ntypedef unsigned long long int ull;\\n#define BIG_NUM 2000000000\\n#define MOD 1000000007\\n#define EPS 0.000000001\\nusing namespace std;\\n\\n\\n#define LEN 54\\n#define BASE 2 //小数部の開始桁\\n#define SIZE 52 //小数部の桁数\\n\\nll mult;\\nll POW[63];\\nint S[LEN],A[LEN];\\nchar buf[SIZE+1];\\n\\n\\n//SにAをadd_count回足す関数\\nvoid calc(ll add_count){\\n\\n\\tll work[LEN];\\n\\n\\tint tmp,kuriagari;\\n\\n\\t//Aをまとめて加算する\\n\\tfor(int digit = 62; digit >= 0 && add_count > 0; digit--){\\n\\t\\tif(add_count < POW[digit])continue;\\n\\n\\t\\tadd_count -= POW[digit];\\n\\n\\t\\tfor(int i = 0; i < LEN; i++)work[i] = 0;\\n\\n\\t\\t//Aを左にdigitビットシフトした数列を作成\\n\\t\\tfor(int i = 0; i < LEN; i++){\\n\\t\\t\\tif(i+digit == LEN)break;\\n\\t\\t\\twork[i] = A[i+digit];\\n\\t\\t}\\n\\n\\t\\tkuriagari = 0;\\n\\t\\t//数列を右から足し算\\n\\t\\tfor(int i = LEN-1; i >= 0; i--){\\n\\t\\t\\ttmp = work[i]+S[i]+kuriagari;\\n\\t\\t\\tS[i] = tmp%2;\\n\\t\\t\\tkuriagari = tmp/2;\\n\\t\\t}\\n\\t}\\n}\\n\\nvoid func(){\\n\\n\\t//Sの初期化\\n\\tfor(int i = 0; i < LEN; i++){\\n\\t\\tS[i] = 0;\\n\\t}\\n\\n\\tscanf(\\\"%s\\\",buf);\\n\\n\\t//SとAの、初期設定\\n\\tS[0] = 0;\\n\\tA[0] = 0;\\n\\tS[BASE-1] = 1;\\n\\tA[BASE-1] = 1;\\n\\n\\tfor(int i = 0; i < SIZE; i++){\\n\\t\\tS[BASE+i] = buf[i]-'0';\\n\\t\\tA[BASE+i] = buf[i]-'0';\\n\\t}\\n\\n\\tll e = 0;\\n\\n\\tll num_S,num_A,next = POW[53],diff,add_count;\\n\\n\\twhile(mult > 0){\\n\\n\\t\\t//次に、Sの桁が繰り上がるまでの、最小加算回数を求める\\n\\n\\t\\t//S,Aをlong long intで表す\\n\\t\\tnum_S = 0;\\n\\t\\tfor(int digit = 1; digit < LEN; digit++){\\n\\t\\t\\tnum_S += S[digit]*POW[53-digit];\\n\\t\\t}\\n\\t\\tnum_A = 0;\\n\\t\\tfor(int digit = 1; digit < LEN; digit++){\\n\\t\\t\\tnum_A += A[digit]*POW[53-digit];\\n\\t\\t}\\n\\n\\t\\t//★もう足しても意味がない★\\n\\t\\tif(num_A == 0){\\n\\t\\t\\tbreak;\\n\\t\\t}\\n\\n\\t\\t//nextとの差分\\n\\t\\tdiff = next-num_S;\\n\\n\\t\\tif(diff%num_A == 0){ //ぴったり繰り上がる\\n\\n\\t\\t\\tadd_count = diff/num_A;\\n\\n\\t\\t}else{\\n\\n\\t\\t\\tadd_count = diff/num_A+1;\\n\\t\\t}\\n\\n\\t\\tif(add_count > mult){ //加算回数を超過する場合\\n\\n\\t\\t\\t//SにAをmult回足す\\n\\t\\t\\tcalc(mult);\\n\\n\\t\\t\\tmult = 0;\\n\\n\\t\\t}else{\\n\\n\\t\\t\\t//SにAをadd_count回足す\\n\\t\\t\\tcalc(add_count);\\n\\n\\t\\t\\tfor(int i = 52; i >= 0; i--){\\n\\t\\t\\t\\tS[i+1] = S[i];\\n\\t\\t\\t\\tA[i+1] = A[i];\\n\\t\\t\\t}\\n\\t\\t\\tS[0] = 0;\\n\\t\\t\\tA[0] = 0;\\n\\n\\t\\t\\tmult -= add_count;\\n\\t\\t\\te++;\\n\\t\\t}\\n\\t}\\n\\n\\t//指数部の表示\\n\\tfor(int i = 11; i >= 0; i--){\\n\\t\\tif(e < POW[i]){\\n\\t\\t\\tprintf(\\\"0\\\");\\n\\t\\t}else{\\n\\t\\t\\tprintf(\\\"1\\\");\\n\\t\\t\\te -= POW[i];\\n\\t\\t}\\n\\t}\\n\\n\\t//仮数部の表示\\n\\tfor(int i = 0; i < SIZE; i++){\\n\\t\\tprintf(\\\"%d\\\",S[BASE+i]);\\n\\t}\\n\\n\\tprintf(\\\"\\\\n\\\");\\n}\\n\\n\\nint main(){\\n\\n\\tPOW[0] = 1;\\n\\tfor(int i = 1; i <= 62; i++){\\n\\t\\tPOW[i] = 2*POW[i-1];\\n\\t}\\n\\n\\twhile(true){\\n\\t\\tscanf(\\\"%lld\\\",&mult);\\n\\t\\tif(mult == 0)break;\\n\\n\\t\\tfunc();\\n\\t}\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3152,\n \"score_of_the_acc\": -0.1889,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1628_3018938\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing Int = long long;\\nusing P = pair<Int, Int>;\\nconst Int B = 1LL<<52;\\nP add(P s,Int a,Int k){\\n s.second+=a*k;\\n return s;\\n}\\nInt check(P s,Int a,Int k){\\n if(a>(B<<1)/k) return 1;\\n if(a*k>=(B<<1)) return 1;\\n if(s.second+a*k>=(B<<1)) return 1;\\n return 0;\\n}\\nP add2(P s,Int a){\\n s.second+=a;\\n assert(s.second>=(B<<1));\\n s.second>>=1;\\n s.first++;\\n return s;\\n}\\nsigned main(){\\n Int n;\\n while(cin>>n,n){\\n string b;\\n cin>>b;\\n Int a=1;\\n for(Int i=0;i<(Int)b.size();i++)\\n a=(a<<1)|(b[i]=='1');\\n P s(0,a);\\n while(n){\\n if(!check(s,a,n)){\\n\\ts=add(s,a,n);\\n\\tn=0;\\n\\tbreak;\\n }\\n Int l=0,r=n;\\n while(l+1<r){\\n\\tInt m=(l+r)>>1;\\n\\tif(check(s,a,m)) r=m;\\n\\telse l=m;\\n }\\n s=add(s,a,l);\\n s=add2(s,a);\\n n-=r;\\n a>>=1;\\n }\\n bitset<12> x(s.first);\\n bitset<52> y(s.second-B);\\n cout<<x<<y<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3144,\n \"score_of_the_acc\": -0.1619,\n \"final_rank\": 3\n }\n]","isConversational":false}}},{"rowIdx":998,"cells":{"group_id":{"kind":"string","value":"aoj_1627_cpp"},"problem_description":{"kind":"string","value":"Playoff by all the teams\nThe Minato Mirai Football Association hosts its annual championship\nas a single round-robin tournament,\nin which each team plays a single match against all the others.\n\n\nUnlike many other round-robin tournaments of football,\nmatches never result in a draw in this tournament.\nWhen the regular time match is a tie,\novertime is played, and, when it is a tie again,\na penalty shootout is played to decide the winner.\nIf two or more teams won the most number of matches in the round-robin,\na playoff is conducted among them to decide the champion.\n\n\nHowever, if the number of teams is an odd number,\nit is possible that all the teams may have\nthe same number of wins and losses,\nin which case all the teams participate in the playoff,\ncalled a \"full playoff\" here.\nNow, some of the tournament matches have already been played and we know\ntheir results.\nWhether or not a full playoff will be required may\ndepend on the results of the remaining matches.\n\n\n\nWrite a program that computes the number of win/loss combination patterns\nof the remaining matches that lead to a full playoff.\nThe first datatset of the Sample Input represents the results of the\nfirst three matches in a round-robin tournament of five teams, shown\nin the following table.\n\n\nIn the table, gray cells indicate the matches not played yet.\nTeam\n1\nTeam\n2\nTeam\n3\nTeam\n4\nTeam\n5\nTeam\n1\nlost\nlost\nTeam\n2\nlost\nTeam\n3\nwon\nTeam\n4\nwon\nTeam\n5\nwon\nIn this case,\nall the teams win the same number of matches\nwith only two win/loss combination patterns\nof the remaining matches,\nwhich lead to a full playoff,\nas shown below.\n\nIn the two tables, the differences are indicated in light yellow.\nTeam\n1\nTeam\n2\nTeam\n3\nTeam\n4\nTeam\n5\nTeam\n1\nwon\nwon\nlost\nlost\nTeam\n2\nlost\nlost\nwon\nwon\nTeam\n3\nlost\nwon\nwon\nlost\nTeam\n4\nwon\nlost\nlost\nwon\nTeam\n5\nwon\nlost\nwon\nlost\nTeam\n1\nTeam\n2\nTeam\n3\nTeam\n4\nTeam\n5\nTeam\n1\nwon\nwon\nlost\nlost\nTeam\n2\nlost\nlost\nwon\nwon\nTeam\n3\nlost\nwon\nlost\nwon\nTeam\n4\nwon\nlost\nwon\nlost\nTeam\n5\nwon\nlost\nlost\nwon\nInput\nThe input consists of multiple datasets, each in the following format.\nn\nm\nx\n1\ny\n1\n...\nx\nm\ny\nm\nn\nis an odd integer, 3, 5, 7, or 9,\nindicating the number of teams participating in the tournament.\nm\nis a positive integer less than\nn\n(\nn\n−1)/2,\nwhich is the number of matches already finished.\nx\ni\nand\ny\ni\ngive\nthe result of the\ni\n-th match that has already taken place,\nindicating that team\nx\ni\ndefeated team\ny\ni\n.\nEach of\nx\ni\nand\ny\ni\nis an integer 1 through\nn\nwhich indicates the team number. \nNo team plays against itself, that is, for any\ni\n,\nx\ni\n≠\ny\ni\n.\nThe match result of the same team pair appears at most once.\nThat is, if\ni\n≠\nj\n,\nthen\n(\nx\ni\n,\ny\ni\n) ≠\n(\nx\nj\n,\ny\nj\n) and\n(\nx\ni\n,\ny\ni\n) ≠\n(\ny\nj\n,\nx\nj\n) hold.\nThe end of the input is indicated by a line containing a zero.\nThe number of datasets does not exceed 100.\nOutput\nFor each dataset, output a single line containing one integer\nwhich indicates the number of possible future win/loss patterns\nthat a full playoff will be required.\nSample Input\n5\n\n...(truncated)"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1627_10848400","code_snippet":"#include<iostream>\n#include<cstring>\n#include<cstdio>\nusing namespace std;\nint n,m;\nint sum;\nint x,y;\nint a[100][100];\nint cnt[100];\nvoid show()\n{\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tfor(int j=1;j<=n;j++)\n\t\tif(a[i][j]==-1) cout<<\"* \";else \n\t\tcout<<a[i][j]<<\" \";cout<<endl;\n\t}\n}\nvoid dfs(int x,int next)\n{\n\t//show();\n\t//system(\"pause\");\n\tif(x==n+1) sum++;\n\telse\n\t{\n\t\tif(cnt[x]==n/2) dfs(x+1,1);\n\t\telse for(int i=next;i<=n;i++)\n\t\t{\n\t\t\tif(a[x][i]==0&&x!=i)\n\t\t\t{\n\t\t\t\ta[x][i]=1;\n\t\t\t\ta[i][x]=-1;\n\t\t\t\tcnt[x]++;\n\t\t\t\tif(cnt[x]==n/2)\n\t\t\t\tdfs(x+1,1);\n\t\t\t\telse dfs(x,i+1);\n\t\t\t\ta[x][i]=0;\n\t\t\t\ta[i][x]=0;\n\t\t\t\tcnt[x]--;\n\t\t\t}\n\t\t}\n\t}\n}\nint main()\n{\n\twhile(true)\n\t{\n\t\tmemset(cnt,0,sizeof(cnt));\n\t\tmemset(a,0,sizeof(a));\n\t\tsum=0;\n\t\tcin>>n;\n\t\tif(n==0) return 0;\n\t\tcin>>m;\n\t\tif(n==9&&m==1)\n\t\t{\n\t\t\tcin>>x>>y;\n\t\t\tcout<<\"1615040\"<<endl;\n\t\t\tcontinue;\n\t\t}\n\t\tfor(int i=1;i<=m;i++)\n\t\t{\n\t\t\tcin>>x>>y;\n\t\t\ta[x][y]=1;\n\t\t\ta[y][x]=-1;\n\t\t\tcnt[x]++;\n\t\t}\n\t\tdfs(1,1);\n\t\tprintf(\"%d\\n\",sum);\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":1960,"memory_kb":3612,"score_of_the_acc":-0.4442,"final_rank":17},{"submission_id":"aoj_1627_10707340","code_snippet":"//QWsin\n#include<cstdio>\n#include<cstring>\n#include<iostream>\n#include<algorithm>\n#define rep(i,x,y) for(int i=x;i<=y;++i)\nusing namespace std;\n\nconst int maxn=20;\n\nint c[maxn],win[maxn],dft[maxn],ned[maxn],ans=0,g[maxn][maxn];\n\nint n,m,case_;\nvoid dfs(int cur,int ct,int pre)\n{\n\tif(ct == ned[cur]+1)\n\t{\n\t\tif(cur==n) ++ans;\n\t\telse dfs(cur+1,1,0);\n\t\treturn ;\n\t}\t\n\tfor(int i=pre+1;ned[cur]-ct<=n-i;++i) if(i!=cur && c[i] && g[cur][i]!=case_){\n\t\t--c[i];g[cur][i]=g[i][cur]=case_;\n\t\tdfs(cur,ct+1,i);\n\t\t++c[i];g[cur][i]=g[i][cur]=case_-1;\n\t}\n}\n\nint main()\n{\n\twhile(1)\n\t{\n\t\t++case_;\n\t\tcin>>n;\n\t\tif(!n) break;\n\t\tcin>>m;\n\t\t\n\t\trep(i,1,n) win[i]=dft[i]=0;\n\t\tint u,v;\n\t\trep(i,1,m)\n\t\t{\n\t\t\tcin>>u>>v;\n\t\t\t++win[u];++dft[v];g[u][v]=g[v][u]=case_;\n\t\t}\n\t\t\n\t\tint k=(n-1)/2,ok=1;\n\t\trep(i,1,n) {\t\n\t\t\tc[i]=k-dft[i];\n\t\t\tned[i]=k-win[i];\n\t\t\tif(c[i] < 0 || ned[i]<0) {ok=0;break;}\n\t\t}\n\t\tif(!ok) {puts(\"0\");continue;}\n\t\t\n\t\tans=0;\n\t\tdfs(1,1,0);\n\t\t\n\t\tcout<<ans<<endl;\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":4630,"memory_kb":3360,"score_of_the_acc":-1.004,"final_rank":19},{"submission_id":"aoj_1627_10707339","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define INF 0x3f\n#define eps 1e-6\n#define PI acos(-1.0)\nconst int MAXN = 10010;\n\nint n,m;\nint f[10][10];\nint win[10],los[10];\nint ans;\n\nvector<pair<int,int>>p;\n\nvoid dfs(int ptr,int flag)\n{\n if(ptr==p.size())\n {\n int ok=1;\n for(int i=1;i<=n;i++)\n if(win[i]!=n/2||los[i]!=n/2)ok=0;\n if(ok)ans++;\n return;\n }\n int i=p[ptr].first,j=p[ptr].second;\n if(win[i]>n/2||los[i]>n/2||win[j]>n/2||los[j]>n/2)\n return;\n if(flag){\n if(win[i]==n/2||los[j]==n/2)return;\n win[i]++;\n los[j]++;\n }\n else{\n if(win[j]==n/2||los[i]==n/2)return;\n win[j]++;\n los[i]++;\n }\n dfs(ptr+1,0);\n dfs(ptr+1,1);\n if(flag){\n win[i]--;\n los[j]--;\n }\n else{\n win[j]--;\n los[i]--;\n }\n}\n\nint main() {\n while(1){\n memset(f,0,sizeof(f));\n memset(win,0,sizeof(win));\n memset(los,0,sizeof(los));\n scanf(\"%d\",&n);\n if(n==0)break;\n scanf(\"%d\",&m);\n for(int i=0;i<m;i++){\n int x,y;\n scanf(\"%d%d\",&x,&y);\n f[x][y]=1;\n f[y][x]=-1;\n win[x]++;\n los[y]++;\n }\n p.clear();\n for(int i=1;i<=n;i++)\n for(int j=i+1;j<=n;j++)\n if(!f[i][j])p.push_back(make_pair(i,j));\n ans=0;\n dfs(0,0);\n dfs(0,1);\n printf(\"%d\\n\",ans/2);\n }\n}","accuracy":1,"time_ms":110,"memory_kb":3452,"score_of_the_acc":-0.0256,"final_rank":6},{"submission_id":"aoj_1627_10681517","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\n\nvoid solve(int n){\n int m;cin >> m;\n vector<int> win(n,0),los(n,(1<<n)-1);\n for (int i = 0; i < m; i++){\n int a,b;cin >> a >> b;\n a--;b--;\n win[a] |= (1<<b);\n los[b] -= (1<<a);\n }\n\n vector<int> v(n,0);\n\n int ans = 0;\n auto f = [&](auto &f, int lv)->void{\n if (lv == 0){\n ans++;\n // (int i = 0; i < n; i++)cout << v[i] << endl;\n return;\n }\n\n int pre = v[lv];\n for (int i = 0; i < (1<<lv); i++){\n int bit = pre|i;\n\n if ((bit|win[lv]) != bit)continue;\n if ((bit|los[lv]) != los[lv])continue;\n\n int cnt = 0;\n for (int j = 0; j < n; j++){\n if ((bit>>j)&1)cnt++;\n }\n\n if (cnt != (n-1)/2)continue;\n\n for (int j = 0; j < lv; j++){\n if ((i>>j)&1)v[j] = v[j]&(~(1<<lv));\n else v[j] |= (1<<lv);\n }\n\n f(f,lv-1);\n }\n };\n f(f,n-1);\n cout << ans << endl;\n}\n\nint main(){\n int n;cin >> n;\n while(n){\n solve(n);\n cin >> n;\n }\n}","accuracy":1,"time_ms":420,"memory_kb":3324,"score_of_the_acc":-0.0815,"final_rank":13},{"submission_id":"aoj_1627_10670447","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing P = pair<int, int>;\nusing PP = pair<int, P>;\nusing PLL = pair<ll, ll>;\nusing PPLL = pair<ll, PLL>;\n#define rep(i, n) for(ll i = 0; i < (ll)n; ++i)\n#define rrep(i, n) for(ll i = n - 1; i >= 0; --i)\n#define loop(i, a, b) for(ll i = a; i <= b; ++i)\n#define all(v) v.begin(), v.end()\n#define nC2(n) n * (n - 1) / 2\nconstexpr ll INF = 9009009009009009009LL;\nconstexpr int INF32 = 2002002002;\nconstexpr ll MOD = 998244353;\nconstexpr ll MOD107 = 1000000007;\n\nint dx[8] = {0, 1, 0, -1, 1, 1, -1, -1};\nint dy[8] = {1, 0, -1, 0, 1, -1, 1, -1};\n\ntemplate <class T>\ninline 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>\ninline 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}\n\ntemplate <typename Container,\n typename = std::enable_if_t<\n !std::is_same_v<Container, std::string> &&\n std::is_convertible_v<decltype(std::declval<Container>().begin()),\n typename Container::iterator>>>\nostream &operator<<(ostream &os, const Container &container) {\n auto it = container.begin();\n auto end = container.end();\n\n if (it != end) {\n os << *it;\n ++it;\n }\n\tfor (; it != end; ++it) {\n\t\tos << \" \" << *it;\n\t}\n return os;\n}\ntemplate <typename T>\nostream& operator<<(ostream& os, const vector<T>& v) {\n for (size_t i = 0; i < v.size(); ++i) {\n os << v[i];\n if (i != v.size() - 1) os << \" \";\n }\n return os;\n}\ntemplate <typename T>\nostream& operator<<(ostream& os, const vector<vector<T>>& vv) {\n\tfor (size_t i = 0; i < vv.size(); ++i) {\n\t\tos << vv[i];\n\t\tif (i != vv.size() - 1) os << \"\\n\";\n }\n return os;\n}\ntemplate <typename T>\nistream& operator>>(istream& is, vector<T>& v) {\n\tassert(v.size() > 0);\n\tfor (size_t i = 0; i < v.size(); ++i) is >> v[i];\n\treturn is;\n}\ntemplate <typename T>\nistream& operator>>(istream& is, vector<vector<T>>& vv) {\n\tassert(vv.size() > 0);\n\tfor (size_t i = 0; i < vv.size(); ++i) is >> vv[i];\n\treturn is;\n}\n\nstruct phash {\n\ttemplate<class T1, class T2>\n inline size_t operator()(const pair<T1, T2> & p) const {\n auto h1 = hash<T1>()(p.first);\n auto h2 = hash<T2>()(p.second);\n\n\t\tsize_t seed = h1 + h2; \n\t\th1 = ((h1 >> 16) ^ h1) * 0x45d9f3b;\n h1 = ((h1 >> 16) ^ h1) * 0x45d9f3b;\n h1 = (h1 >> 16) ^ h1;\n seed ^= h1 + 0x9e3779b9 + (seed << 6) + (seed >> 2);\n\t\th2 = ((h2 >> 16) ^ h2) * 0x45d9f3b;\n h2 = ((h2 >> 16) ^ h2) * 0x45d9f3b;\n h2 = (h2 >> 16) ^ h2;\n seed ^= h2 + 0x9e3779b9 + (seed << 6) + (seed >> 2);\n return seed;\n }\n};\n\n\n\n\n\nint solve() {\n\tll n; cin >> n;\n\tif (n == 0) return 1;\n\tll m; cin >> m;\n\tvvll g(n, vll(n, -1));\n\trep(i, m) {\n\t\tll x, y; cin >> x >> y;\n\t\tx--, y--;\n\t\tg[x][y] = 1;\n\t\tg[y][x] = 0;\n\t}\n\t\n\tauto dfs = [&](auto dfs, vll& st) -> ll {\n\t\tif (st.size() == n) return 1;\n\n\t\tll res = 0;\n\t\trep(rbit, 1LL << (n - 1 - st.size())) {\n\t\t\tull bit = 0;\n\t\t\trep(i, st.size()) {\n\t\t\t\tbit |= (((st[i] >> st.size()) & 1) ^ 1) << i;\n\t\t\t}\n\t\t\tbit |= rbit << (st.size() + 1);\n\n\t\t\tif (popcount(bit) != (n - 1) / 2) continue;\n\n\t\t\tbool ok = true;\n\t\t\trep(i, n) {\n\t\t\t\tif (g[st.size()][i] == -1) continue;\n\t\t\t\tif (((bit >> i) & 1) != g[st.size()][i]) {\n\t\t\t\t\tok = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!ok) continue;\n\n\t\t\tll sum = 0;\n\t\t\trep(i, n) {\n\t\t\t\tif (st.size() == i) continue;\n\t\t\t\tsum += ((bit >> i) & 1) ? 1 : -1;\n\t\t\t}\n\t\t\tif (sum != 0) continue;\n\n\t\t\tst.push_back(bit);\n\t\t\tres += dfs(dfs, st);\n\t\t\tst.pop_back();\n\t\t}\n\n\t\treturn res;\n\t};\n\tvll st;\n\tll ans = dfs(dfs, st);\n\n\tcout << ans << \"\\n\";\n\n\treturn 0;\n}\n\nint main() {\n\tcin.tie(nullptr);\n\tios::sync_with_stdio(false);\n\n\twhile (!solve()) { }\n\n\treturn 0;\n}","accuracy":1,"time_ms":260,"memory_kb":3456,"score_of_the_acc":-0.0587,"final_rank":10},{"submission_id":"aoj_1627_10668868","code_snippet":"#line 1 \"2018D.cpp\"\n#include <bits/stdc++.h>\n#line 1 \"/home/ardririy/repos/cp-libs/libraries-cpp/input.hpp\"\n\n\n#line 6 \"/home/ardririy/repos/cp-libs/libraries-cpp/input.hpp\"\nusing namespace std;\nvector<long long> i64_vec_IN(int n) {vector<long long> res(n); for(int i=0; i<n; i++) { cin >> res[i]; } return res; }\nvector<string> str_vec_IN(int n) { vector<string> res(n); for(int i=0; i<n; i++) { cin >> res[i]; } return res; }\nvector<vector<int>> graph_IN(int n, int m) { vector<vector<int>> g(n); int u, v; for(int i=0; i<m; i++) { cin >> u >> v; u--; v--; g[u].emplace_back(v); g[v].emplace_back(u); } return g; }\nvector<vector<pair<int, long long>>> weighted_graph_IN(int n, int m) { vector<vector<pair<int, long long>>> g(n); int u, v; long long w; for(int i=0; i<m; i++) { cin >> u >> v >> w; u--; v--; g[u].push_back({v, w}); g[v].push_back({u, w}); } return g; }\n\n\n#line 3 \"2018D.cpp\"\n\nusing namespace std;\n\n// using namespace atcoder;\n\n#ifdef ADRY\n#include <dbg.h>\n#else\n// DO NOTHING\n#define dbg(...)\n#endif\n\n\n#define all(v) v.begin(),v.end()\n#define resort(v) sort(v.rbegin(),v.rend())\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>>;\nusing djks=priority_queue<P, vp, greater<P>>;\n\nconst int inf=1ll<<30;\n#define mod10 (ll)1e9+7\n#define mod99 (ll)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=(n)-1;i>=(a);--i)\n\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\nll dx[] = {1, 0, -1, 0, -1, 1, -1, 1};\nll dy[] = {0, 1, 0, -1, -1, 1, 1, -1};\n\nmap<vector<int>, ll> memo;\nll dfs(const int n, int i, vector<vector<int>>& state, vector<int>& win_counts) {\n if(memo.find(win_counts) != memo.end()) return memo[win_counts];\n if(n==i) return 1;\n\n vector<int> idxs;\n int left = 0;\n rep(j,n) {\n if(state[i][j] == 0) idxs.emplace_back(j), left++;\n }\n\n int x = n/2;\n if(x < win_counts[i] || x > win_counts[i] + left) {\n return 0;\n }\n\n vector<int> part(left,2);\n \n\n rep(j,x-win_counts[i]) {\n part[j] = 1;\n }\n ll res = 0;\n do {\n rep(j,left) {\n state[i][idxs[j]] = part[j];\n state[idxs[j]][i] = (part[j]==1)?2:1;\n if(part[j]==1) {\n win_counts[i]++;\n } else {\n win_counts[idxs[j]]++;\n }\n\n \n }\n res += dfs(n,i+1,state,win_counts);\n rep(j,left) {\n if(part[j]==1) {\n win_counts[i]--;\n } else {\n win_counts[idxs[j]]--;\n }\n state[i][idxs[j]] = 0;\n state[idxs[j]][i] = 0;\n }\n \n } while(next_permutation(all(part)));\n \n return memo[win_counts] = res;\n}\n\nint solve(){\n int n, m;cin>> n;\n if(n==0) return 1;\n cin >> m;\n memo.clear();\n // 0: 未定\n // 1: 勝利\n // 2: 敗北\n vector<vector<int>> state(n,vector<int>(n,0));\n vector<int> lefts(n,0);\n int w,l;\n rep(_,m) {\n cin >> w >> l;\n w--;\n l--;\n state[w][l] = 1;\n state[l][w] = 2;\n lefts[w]++;\n }\n\n ll ans = dfs(n,0,state,lefts);\n cout << ans << '\\n';\n return 0;\n}\n\nint main() {\n #ifdef ADRY\n #else\n cin.tie(0);\n ios::sync_with_stdio(false);\n #endif\n while(!solve());\n}","accuracy":1,"time_ms":80,"memory_kb":5168,"score_of_the_acc":-0.1766,"final_rank":16},{"submission_id":"aoj_1627_10667795","code_snippet":"//#pragma GCC optimize(\"O3\")\n#include<bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define rep(i,n) for (ll i=0;i<(ll)n;i++)\n#define rrep(i,n) for (ll i=n-1;i>=(ll)0;i--)\n#define loop(i,m,n) for(ll i=m;i<=(ll)n;i++)\n#define rloop(i,m,n) for(ll i=m;i>=(ll)n;i--)\n#define vl vector<ll>\n#define vvl vector<vector<ll>>\n#define vdbg(a) rep(ii,a.size()){cout<<a[ii]<<\" \";}cout<<endl;\n#define vpdbg(a) rep(ii,a.size()){cout<<\"{\"<<a[ii].first<<\",\"<<a[ii].second<<\"} \";}cout<<endl;\n#define vvdbg(a) rep(ii,a.size()){rep(jj,a[ii].size()){cout<<a[ii][jj]<<\" \";}cout<<endl;}\n#define setdbg(a) for(const auto & ii:a){cout<<ii<<\" \";}cout<<endl;\n#define inf 4000000000000000000LL\n#define mod 998244353LL\n//#define mod 1000000007LL\n#define eps 0.000000001\nrandom_device rnd;// 非決定的な乱数生成器\nmt19937 mt(rnd());// メルセンヌ・ツイスタの32ビット版、引数は初期シード\n\n//#include<boost/multiprecision/cpp_int.hpp>\n//#define bbi boost::multiprecision::cpp_int\n//#include<atcoder/lazysegtree>\n\n\n//整数同士の累乗の計算をする。\nll power(ll A, ll B) {\n\tll result = 1;\n\tfor (ll i=0;i<B;i++){\n\t\tresult *= A;\n\t}\n\treturn result;\n}\n\n// nのk乗をmodで割った余りを計算\nll power_mod(ll n, ll k){\n\tlong long result = 1;\n\twhile (k > 0){\n\t\tif ((k&1) ==1)result=(result*n)%mod;\n\t\tn=n*n%mod;\n\t\tk >>= 1;\n\t}\n\treturn result;\n}\n\n\n//受け取った2次元文字の外側に、文字pをコーティングする。\nvector<string> pad(vector<string> &s,char p){\n\tll h=s.size();\n\tll w=s[0].size();\n\tvector<string> res(h+2,string(w+2,p));\n\trep(i,h)rep(j,w)res[i+1][j+1]=s[i][j];\n\treturn res;\n}\n\n// Union-Find\nstruct UnionFind {\n\tvector<int> par, siz;\n\tUnionFind(int n) : par(n, -1) , siz(n, 1) { }\n\t// 根を求める\n\tint root(int x) {\n\t\tif (par[x] == -1) return x;\n\t\telse return par[x] = root(par[x]);\n\t}\n\t// x と y が同じグループに属するかどうか (根が一致するかどうか)\n\tbool issame(int x, int y) {\n\t\treturn root(x) == root(y);\n\t}\n\t// x を含むグループと y を含むグループとを併合する\n\tbool unite(int x, int y) {\n\t\tx = root(x), y = root(y);\n\t\tif (x == y) return false; \n\t\tif (siz[x] < siz[y]) swap(x, y);\n\t\tpar[y] = x;\n\t\tsiz[x] += siz[y];\n\t\treturn true;\n\t}\n\t// x を含むグループのサイズ\n\tint size(int x) {\n\t\treturn siz[root(x)];\n\t}\n};\n\n\n//グリッド問題等用\nvl dx={1,0,-1,0};\nvl dy={0,1,0,-1};\n\nll n;\nvl wcnt,lcnt;\nvvl wl;\nll ans;\n\nvoid dfs(ll i,ll j){\n\tif(i==n){\n\t\tans++;\n\t\treturn;\n\t}\n\tif(j==n){\n\t\tdfs(i+1,0);\n\t\treturn;\n\t}\n\tif(i==j||wl[i][j]!=0){\n\t\tdfs(i,j+1);\n\t\treturn;\n\t}\n\n\t// iが勝つ場合\n\twcnt[i]++;\n\tlcnt[j]++;\n\twl[i][j]=1;\n\twl[j][i]=-1;\n\tif(wcnt[i]<=n/2&&lcnt[j]<=n/2){\n\t\tdfs(i,j+1);\n\t}\n\twcnt[i]--;\n\tlcnt[j]--;\n\twl[i][j]=0;\n\twl[j][i]=0;\n\n\t// jが勝つ場合\n\twcnt[j]++;\n\tlcnt[i]++;\n\twl[j][i]=1;\n\twl[i][j]=-1;\n\tif(wcnt[j]<=n/2&&lcnt[i]<=n/2){\n\t\tdfs(i,j+1);\n\t}\n\twcnt[j]--;\n\tlcnt[i]--;\n\twl[j][i]=0;\n\twl[i][j]=0;\n\treturn;\n}\n\nll solve(){\n\t\n\tcin>>n;\n\tif(n==0){return 1;}\n\t\n\twcnt=vl(n,0);\n\tlcnt=vl(n,0);\n\twl=vvl(n,vl(n,0));\n\tans=0;\n\t\n\tll m;\n\tcin>>m;\n\tbool f=true;\n\trep(i,m){\n\t\tll a,b;\n\t\tcin>>a>>b;\n\t\ta--,b--;\n\t\twl[a][b]=1;\n\t\twl[b][a]=-1;\n\t\twcnt[a]++;\n\t\tlcnt[b]++;\n\t\tif(wcnt[a]>n/2)f=false;\n\t\tif(lcnt[b]>n/2)f=false;\n\t}\n\n\tif(!f){\n\t\tcout<<0<<endl;\n\t\treturn 0;\n\t}\n\n\tdfs(0,0);\n\tcout<<ans<<endl;\n\treturn 0;\n}\n\n//メイン\nint main(){\n\twhile(solve()==0);\n\treturn 0;\n}","accuracy":1,"time_ms":120,"memory_kb":3388,"score_of_the_acc":-0.0219,"final_rank":5},{"submission_id":"aoj_1627_10640270","code_snippet":"#include <bits/stdc++.h>\n#include <numeric>\n#define FAST_IO\n#define OVERRIDE(a, b, c, d, ...) d\n#define REP2(i, n) for (i32 i = 0; i < (i32)(n); ++i)\n#define REP3(i, m, n) for (i32 i = (i32)(m); i < (i32)(n); ++i)\n#define REP(...) OVERRIDE(__VA_ARGS__, REP3, REP2)(__VA_ARGS__)\n#define PER2(i, n) for (i32 i = (i32)(n)-1; i >= 0; --i)\n#define PER3(i, m, n) for (i32 i = (i32)(n)-1; i >= (i32)(m); --i)\n#define PER(...) OVERRIDE(__VA_ARGS__, PER3, PER2)(__VA_ARGS__)\n#define ALL(x) begin(x), end(x)\n#define LEN(x) (i32)(x.size())\nusing namespace std;\nusing u32 = unsigned int;\nusing u64 = unsigned long long;\nusing i32 = signed int;\nusing i64 = signed long long;\nusing f64 = double;\nusing f80 = long double;\nusing pi = pair<i32, i32>;\nusing pl = pair<i64, i64>;\ntemplate <typename T>\nusing V = vector<T>;\ntemplate <typename T>\nusing VV = V<V<T>>;\ntemplate <typename T>\nusing VVV = V<V<V<T>>>;\ntemplate <typename T>\nusing VVVV = V<V<V<V<T>>>>;\ntemplate <typename T>\nusing PQR = priority_queue<T, V<T>, greater<T>>;\ntemplate <typename T>\nbool chmin(T &x, const T &y) {\n if (x > y) {\n x = y;\n return true;\n }\n return false;\n}\ntemplate <typename T>\nbool chmax(T &x, const T &y) {\n if (x < y) {\n x = y;\n return true;\n }\n return false;\n}\ntemplate <typename T>\ni32 lob(const V<T> &arr, const T &v) {\n return (i32)(lower_bound(ALL(arr), v) - arr.begin());\n}\ntemplate <typename T>\ni32 upb(const V<T> &arr, const T &v) {\n return (i32)(upper_bound(ALL(arr), v) - arr.begin());\n}\ntemplate <typename T>\nV<i32> argsort(const V<T> &arr) {\n V<i32> ret(arr.size());\n iota(ALL(ret), 0);\n sort(ALL(ret), [&](i32 i, i32 j) -> bool {\n if (arr[i] == arr[j]) {\n return i < j;\n } else {\n return arr[i] < arr[j];\n }\n });\n return ret;\n}\n#ifdef INT128\nusing u128 = __uint128_t;\nusing i128 = __int128_t;\n#endif\n[[maybe_unused]] constexpr i32 INF = 1000000100;\n[[maybe_unused]] constexpr i64 INF64 = 3000000000000000100;\nstruct SetUpIO {\n SetUpIO() {\n#ifdef FAST_IO\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n#endif\n cout << fixed << setprecision(15);\n }\n} set_up_io;\nvoid scan(char &x) { cin >> x; }\nvoid scan(u32 &x) { cin >> x; }\nvoid scan(u64 &x) { cin >> x; }\nvoid scan(i32 &x) { cin >> x; }\nvoid scan(i64 &x) { cin >> x; }\nvoid scan(string &x) { cin >> x; }\ntemplate <typename T>\nvoid scan(V<T> &x) {\n for (T &ele : x) {\n scan(ele);\n }\n}\nvoid read() {}\ntemplate <typename Head, typename... Tail>\nvoid read(Head &head, Tail &...tail) {\n scan(head);\n read(tail...);\n}\n#define CHAR(...) \\\n char __VA_ARGS__; \\\n read(__VA_ARGS__);\n#define U32(...) \\\n u32 __VA_ARGS__; \\\n read(__VA_ARGS__);\n#define U64(...) \\\n u64 __VA_ARGS__; \\\n read(__VA_ARGS__);\n#define I32(...) \\\n i32 __VA_ARGS__; \\\n read(__VA_ARGS__);\n#define I64(...) \\\n i64 __VA_ARGS__; \\\n read(__VA_ARGS__);\n#define STR(...) \\\n string __VA_ARGS__; \\\n read(__VA_ARGS__);\n#define VEC(type, name, size) \\\n V<type> name(size); \\\n read(name);\n#define VVEC(type, name, size1, size2) \\\n VV<type> name(size1, V<type>(size2)); \\\n read(name);\n\n#ifdef DEBUGF\n#include \"spl/template/debug.hpp\"\n#else\n#define DBG(...) (void)0\n#endif\n\nvoid solve(i32 n) {\n I32(m);\n VV<i32> res(n, V<i32>(n, 0));\n REP(i, m) {\n I32(x, y);\n --x;\n --y;\n res[x][y] = 1;\n res[y][x] = -1;\n }\n V<i32> pcnt(n, 0), mcnt(n, 0);\n REP(i, n) REP(j, n) {\n if (res[i][j] == 1) {\n ++pcnt[i];\n }\n if (res[i][j] == -1) {\n ++mcnt[i];\n }\n }\n i32 ans = 0;\n auto dfs = [&](auto dfs, i32 r, i32 c) -> void {\n DBG(r, c, res);\n if (r == n) {\n ++ans;\n return;\n }\n if (c == n) {\n i32 sum = accumulate(ALL(res[r]), 0);\n if (sum != 0) {\n return;\n }\n dfs(dfs, r + 1, r + 2);\n return;\n }\n if (res[r][c] == 0) {\n if (pcnt[r] < n / 2) {\n res[r][c] = 1;\n res[c][r] = -1;\n ++pcnt[r];\n dfs(dfs, r, c + 1);\n res[r][c] = 0;\n res[c][r] = 0;\n --pcnt[r];\n }\n if (mcnt[r] < n / 2) {\n res[r][c] = -1;\n res[c][r] = 1;\n ++mcnt[r];\n dfs(dfs, r, c + 1);\n res[r][c] = 0;\n res[c][r] = 0;\n --mcnt[r];\n }\n } else {\n dfs(dfs, r, c + 1);\n }\n };\n dfs(dfs, 0, 1);\n cout << ans << endl;\n}\n\nint main() {\n while (true) {\n I32(n);\n if (n == 0) {\n break;\n }\n solve(n);\n }\n}","accuracy":1,"time_ms":240,"memory_kb":3584,"score_of_the_acc":-0.0661,"final_rank":11},{"submission_id":"aoj_1627_10625207","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n// dp[i][vec]: 0..i 番での試合について、勝ち数ベクトルが vec であるような組合せの数\n\n\nll solve(int N) {\n int M;\n cin >> M;\n // A[x][y] == 1 -> x wins to y\n vector<vector<int>> A(N, vector<int>(N));\n for (int i = 0; i < M; i++) {\n int x, y;\n cin >> x >> y;\n x--;\n y--;\n A[x][y] = 1;\n }\n\n // for (int x = 0; x < N; x++) {\n // for (int y = 0; y < N; y++) {\n // cerr << A[x][y] << (y < N - 1 ? \" \": \"\\n\");\n // }\n // }\n\n unordered_map<string, ll> dp;\n dp[string(N - 1, 0)] = 1LL;\n for (int x = 1; x < N; x++) {\n // fix x\n // cerr << \"x = \" << x << endl;\n unordered_map<string, ll> ndp;\n for (auto [vec, cnt]: dp) {\n // cerr << \"vec = [\";\n // for (auto v: vec) cerr << int(v) << \", \";\n // cerr << \"]\" << endl;\n for (int bi = 0; bi < (1 << x); bi++) {\n auto nvec = vec;\n bool flag = true;\n for (int y = 0; y < x; y++) {\n if (bi >> y & 1) { // x wins to y\n if (A[y][x] == 1) flag = false;\n if (x < N - 1) nvec[x]++;\n } else {\n if (A[x][y] == 1) flag = false;\n nvec[y]++;\n }\n }\n\n if (!flag) {\n // cerr << \"CANNOT trans\" << endl;\n continue;\n }\n\n // vec[*] <= (N - 1) / 2 ?\n for (int i = 0; i < N; i++) {\n if (nvec[i] > (N - 1) / 2) flag = false;\n }\n if (!flag) continue;\n\n ndp[nvec] += cnt;\n }\n }\n swap(dp, ndp);\n }\n string ans_vec(N - 1, (N - 1) / 2);\n // ans_vec[N - 1] = 0;\n // for (auto [vec, cnt]: dp) {\n // cerr << \"vec = [\";\n // for (auto v: vec) cerr << int(v) << \", \";\n // cerr << \"] -> cnt = \" << cnt << endl;\n\n // }\n return dp[ans_vec];\n}\n\nint main() {\n while (1) {\n int N;\n cin >> N;\n if (N == 0) break;\n ll ans = solve(N);\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":50,"memory_kb":3548,"score_of_the_acc":-0.0213,"final_rank":4},{"submission_id":"aoj_1627_10625087","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define ALL(v) (v).begin(), (v).end()\nusing ll = long long;\n#define rep(i,n) for(int i =0;i<(int)(n);i++)\n\nvoid print(vector<int> a){\n rep(i,a.size()){\n //cout<<a[i] << \" \";\n }\n //cout<<endl;\n}\nvoid print_pair(vector<pair<int,int>> a){\n for(auto [x,y]:a){\n //cout<<x <<\" \"<< y<<endl;\n }\n}\nint toSeisuu(vector<int> a){\n int k=1;\n int res =0;\n rep(i,a.size()){\n res+=a[i]*k;\n k*=10;\n if(a[i]<0){\n print(a);\n return -1;\n }\n }\n return res;\n}\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n int c =0;\n while (true) {\n //cout<<\"c+\"<<c<<endl;\n c++;\n \n int n,m;\n cin>>n;\n if(n==0)break;\n cin>>m;\n vector<int> x(n,0);\n set<pair<int,int>> playedGame;\n rep(i,m){\n int a,b;\n cin>>a>>b;\n a--;b--;\n //win a\n x[a]++;\n playedGame.insert({min(a,b),max(a,b)});\n }\n // if(c>1)continue;\n // cout<<\"a\"<<endl;\n vector<pair<int,int>> unplayedGame;\n rep(i,n){\n rep(j,n){\n if(i>=j)continue;\n if(playedGame.count({i,j})!=0)continue;\n unplayedGame.push_back({i,j});\n }\n }\n // cout<<\"b2\"<<endl;\n vector<pair<int,int>> mae,ushiro;\n\n int st = unplayedGame.size();\n rep(i,st){\n if(i<(int)(unplayedGame.size())/2){\n mae.push_back(unplayedGame[i]);\n }else{\n ushiro.push_back(unplayedGame[i]);\n }\n }\n // // //cout<<\"mae:\"<<endl;\n // // print_pair(mae);\n // //cout<<\"==\"<<endl;\n // print_pair(ushiro);\n // //cout<<\"==\"<<endl;\n // //cout<<\"b\"<<endl;\n int ms=mae.size(),us=ushiro.size();\n map<int,int> mp;\n //全列挙\n for(int i =0; i < (1<<ms);i++){\n vector<int> a(n,0);\n\n rep(k,ms){\n auto [s,t] = mae[k];\n // s wins t\n if(((i>>k)&1)==0){\n a[s]++;\n }else{\n a[t]++;\n }\n }\n //整数に変換site mapNIHOZON\n mp[toSeisuu(a)]++;\n //cout<<\"==\"<<toSeisuu(a)<<endl;\n }\n int ans=0;\n //break\n // //cout<<\"x\"<<endl;\n for(int i =0; i < (1<<us);i++){\n vector<int> a(n,0);\n\n \n rep(k,us){\n auto [s,t] = ushiro[k];\n // s wins t\n //cout<<s<<\" \"<<t<<endl;\n if(((i>>k)&1)==0){\n a[s]++;\n }else{\n a[t]++;\n }\n }\n //cout<<\"!<==\"<<toSeisuu(a)<<endl;\n rep(k,n){\n int p=(n-1)/2;\n int xx=x[k];\n a[k]=p-xx-a[k];\n }\n //整数に変換site mapNIHOZON\n ans+=mp[toSeisuu(a)];\n //cout<<\"!==\"<<toSeisuu(a)<<endl;\n }\n cout<<ans<<endl;\n }\n\n}","accuracy":1,"time_ms":70,"memory_kb":4992,"score_of_the_acc":-0.1582,"final_rank":15},{"submission_id":"aoj_1627_10621189","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)\n#define rrep(i, s, t) for(ll i = (ll)(t) - 1; i >= (ll)(s); i--)\n#define all(x) begin(x), end(x)\n#define rall(x) rbegin(x), rend(x)\n\n#define TT template<typename T>\nTT using vec = vector<T>;\ntemplate<class T1, class T2> bool chmin(T1 &x, T2 y) { return x > y ? (x = y, true) : false; }\ntemplate<class T1, class T2> bool chmax(T1 &x, T2 y) { return x < y ? (x = y, true) : false; }\n\nstruct io_setup {\n io_setup() {\n ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n cout << fixed << setprecision(15);\n }\n} io_setup;\n\nint main(){\n while(1){\n int N;\n cin>>N;\n if(N==0)return 0;\n int M;\n cin>>M;\n vector win(N,vector<int>(N,-1));\n rep(i,0,M){\n int x,y;\n cin>>x>>y;\n x--;\n y--;\n win[x][y]=1;\n win[y][x]=0;\n }\n vector<int>C(N);\n int ans=0;\n auto dfs=[&](auto dfs,int x,int y)-> void {\n if(x==N-1){\n ans++;\n return;\n }\n if(win[x][y]!=0&&C[x]+1<=N/2){\n C[x]++;\n if(y+1==N&&C[x]==N/2)dfs(dfs,x+1,x+2);\n else dfs(dfs,x,y+1);\n C[x]--;\n }\n if(win[x][y]!=1&&C[x]+(N-1-y)>=N/2){\n C[y]++;\n if(y+1==N&&C[x]==N/2)dfs(dfs,x+1,x+2);\n else dfs(dfs,x,y+1);\n C[y]--;\n }\n };\n dfs(dfs,0,1);\n cout<<ans<<endl;\n }\n}","accuracy":1,"time_ms":80,"memory_kb":3584,"score_of_the_acc":-0.0312,"final_rank":7},{"submission_id":"aoj_1627_10611581","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n// using mint = modint998244353;\n// using mint = modint1000000007;\nusing ll = long long;\nusing ull = unsigned long long;\n#define rep(i, n) for(ll i = 0; i < n; i++)\nconstexpr ll INF = ((1LL << 61) + (1LL << 30) - 1);\n\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n\n while(true) {\n ll n;\n cin >> n;\n if(n == 0) break;\n ll m;\n cin >> m;\n vector<vector<ll>> flag(n, vector<ll>(n, 0));\n // flag[i][j] : i が j に勝利したら 1, 逆なら 2, まだなら 0\n rep(i, m) {\n ll x, y;\n cin >> x >> y;\n x--, y--;\n flag[x][y] = 1;\n flag[y][x] = 2;\n }\n\n ll tn = n;\n ll threshold = 7;\n n = min(n, threshold);\n\n ll rest_match = 0;\n rep(i, n) for(ll j = i + 1; j < n; j++) rest_match += (flag[i][j] == 0);\n\n ll ans = 0;\n map<vector<ll>, ll> cnt;\n rep(bit, (1LL << rest_match)) {\n vector<ll> win(tn, 0);\n ll idx = 0;\n bool pruning = false;\n rep(i, n) {\n for(ll j = i + 1; j < n; j++) {\n if(flag[i][j] == 1) win[i]++;\n else if(flag[i][j] == 2) win[j]++;\n else {\n if((bit >> idx) & 1) win[i]++;\n else win[j]++;\n idx++;\n }\n if(win[i] > tn * (tn - 1) / 2 / tn || win[j] > tn * (tn - 1) / 2 / tn) {\n pruning = true;\n break;\n }\n }\n if(pruning) break;\n }\n if(pruning) continue;\n\n bool ok = true;\n rep(i, n) ok &= (win[i] == n * (n - 1) / 2 / n);\n if(ok) ans++;\n if(n != tn) cnt[win]++;\n }\n if(tn <= threshold) {\n cout << ans << endl;\n continue;\n }\n // for(auto [vec, c]: cnt) {\n // rep(i, vec.size()) cerr << vec[i] << \" \";\n // cerr << \" : \" << c << endl;\n // }\n\n // n = 9 の時は半分全列挙風に？\n ans = 0;\n rest_match = 0;\n for(ll i = threshold; i < tn; i++) {\n for(ll j = 0; j < i; j++) {\n rest_match += (flag[i][j] == 0);\n }\n }\n // cerr << \"rest_match: \" << rest_match << endl;\n rep(bit, (1LL << rest_match)) {\n vector<ll> win(tn, tn * (tn - 1) / 2 / tn);\n ll idx = 0;\n bool pruning = false;\n for(ll i = threshold; i < tn; i++) {\n for(ll j = 0; j < i; j++) {\n if(flag[i][j] == 1) win[i]--;\n else if(flag[i][j] == 2) win[j]--;\n else {\n if((bit >> idx) & 1) win[i]--;\n else win[j]--;\n idx++;\n }\n if(win[i] < 0 || win[j] < 0) {\n pruning = true;\n break;\n }\n }\n if(pruning) break;\n }\n // if(win[7] == 0 && win[8] == 0) {\n // rep(i, tn) {\n // cerr << win[i] << \" \";\n // }\n // cerr << endl;\n // }\n if(cnt.find(win) != cnt.end()) ans += cnt[win];\n }\n cout << ans << endl;\n }\n\n return 0;\n}","accuracy":1,"time_ms":270,"memory_kb":3624,"score_of_the_acc":-0.0763,"final_rank":12},{"submission_id":"aoj_1627_10607452","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n\nconst long long MOD1 = 1000000007;\nconst long long MOD2 = 998244353;\n#define all(v) v.begin(), v.end()\n#define rall(a) a.rbegin(), a.rend()\n#define fi first\n#define se second\n#define endl \"\\n\"\n\n#define chmax(x, y) x = max(x, y)\n#define chmin(x, y) x = min(x, y)\n\ntemplate <typename T>\nusing vc = vector<T>; // prioriy_queueに必要なのでここにこれ書いてます\ntemplate <typename T>\nusing vv = vc<vc<T>>;\n#define int long long\nusing ll = long long;\nll INF = 2e18;\n\n#ifdef ONLINE_JUDGE\n// ジャッジ環境ではデバッグマクロを無効化\n#define debug_x(x) \\\n do \\\n { \\\n } while (0)\n#define debug_vc(v) \\\n do \\\n { \\\n } while (0)\n#define debug_vv(v) \\\n do \\\n { \\\n } while (0)\n#else\n// ローカルではデバッグ出力\n#define debug_x(x) cout << #x << \" = \" << (x) << endl\n#define debug_vc(v) \\\n { \\\n cout << #v << endl; \\\n ll n = size(v); \\\n rep(i, n) cout << v[i] << ' '; \\\n cout << endl; \\\n } // 一次元配列を出力する\n#define debug_vv(v) \\\n { \\\n cout << #v << endl; \\\n ll n = size(v); \\\n rep(i, n) \\\n { \\\n rep(j, size(v[i])) { cout << v[i][j] << ' '; } \\\n cout << endl; \\\n } \\\n } // 二次元配列を出力する\n#endif\n\n#define rep(i, n) for (ll i = 0; i < (n); ++i)\n#define rrep(i, n) for (ll i = 1; i <= (n); ++i)\n#define drep(i, n) for (ll i = (n) - 1; i >= 0; --i)\n#define nfor(i, s, n) for (ll i = s; i < n; i++) // i=s,s+1...n-1 ノーマルfor\n#define dfor(i, s, n) for (ll i = (s) - 1; i >= n; i--) // s-1スタートでnまで落ちる\n\nusing ld = long double;\nusing bl = bool;\n\ntemplate <class T>\nusing pq = priority_queue<T, vc<T>>; // 大きい順\ntemplate <class T>\nusing pq_g = priority_queue<T, vc<T>, greater<T>>; // 小さい順\n\nusing vl = vc<ll>;\nusing vvl = vv<ll>;\nusing vvvl = vv<vl>;\nusing vvvvl = vv<vvl>;\nusing vs = vc<string>;\nusing vvs = vv<string>;\nusing vb = vc<bl>;\nusing vvb = vv<bl>;\nusing vvvb = vv<vb>;\nusing vld = vc<ld>;\nusing vvld = vv<ld>;\nusing vvvld = vv<vld>;\nusing P = pair<ll, ll>;\nusing vP = vc<P>;\nusing vvP = vc<vP>;\nusing vvvP = vv<vP>;\n\n#define pb push_back\n\n#define YES cout << \"Yes\" << endl\n#define NO cout << \"No\" << endl\n#define YN \\\n { \\\n cout << \"Yes\" << endl; \\\n } \\\n else \\\n { \\\n cout << \"No\" << endl; \\\n } // if(a==b)YN;\n#define dame cout << -1 << endl\n\nstring dir = \"DRUL\"; // 第4象限の場合\nvl di = {1, 0, -1, 0}; // vl di={1,1,0,-1,-1,-1,0,1};\nvl dj = {0, 1, 0, -1}; // vl dj={0,1,1,1,0,-1,-1,-1};\n\nbool out_grid(ll i, ll j, ll h, ll w)\n{ // trueならcontinue\n return (!(0 <= i && i < h && 0 <= j && j < w));\n}\n\nll dfs(vl &battleTimes, ll n, vl &win, vP &amariBattle, ll idx, ll amari)\n{\n ll winCnt = (n - 1) / 2;\n vl at(n);\n rep(i, n)\n {\n at[i] = winCnt - win[i];\n if (at[i] < 0 || at[i] > n - 1 - battleTimes[i])\n {\n return 0;\n }\n }\n if (amari == 0)\n return 1;\n ll sum = 0;\n auto [i, j] = amariBattle[idx];\n battleTimes[i]++;\n battleTimes[j]++;\n win[j]++;\n sum += dfs(battleTimes, n, win, amariBattle, idx + 1, amari - 1);\n win[j]--;\n win[i]++;\n sum += dfs(battleTimes, n, win, amariBattle, idx + 1, amari - 1);\n win[i]--;\n battleTimes[i]--;\n battleTimes[j]--;\n return sum;\n}\n\nbl solve()\n{\n ll n;\n cin >> n;\n if (n == 0)\n {\n return 0;\n }\n ll m;\n cin >> m;\n vl win(n);\n vl x(m), y(m);\n // res[i][j] = iがjに勝ったか?(不明なら-1)\n vvl res(n, vl(n, -1));\n vl battleTimes(n);\n rep(i, m)\n {\n cin >> x[i] >> y[i];\n x[i]--;\n y[i]--;\n res[x[i]][y[i]] = 1;\n res[y[i]][x[i]] = 0;\n win[x[i]]++;\n battleTimes[x[i]]++;\n battleTimes[y[i]]++;\n }\n\n ll amari = n * (n - 1) / 2 - m;\n vP amariBattle;\n rep(i, n)\n {\n rep(j, n)\n {\n if (i >= j)\n continue;\n if (res[i][j] == -1)\n {\n amariBattle.pb({i, j});\n }\n }\n }\n ll winCnt = (n - 1) / 2;\n vl at(n);\n rep(i, n)\n {\n at[i] = winCnt - win[i];\n if (at[i] < 0 || at[i] > n - 1 - battleTimes[i])\n {\n cout << 0 << endl;\n return 1;\n }\n }\n\n // バックトラック法でやる\n cout << dfs(battleTimes, n, win, amariBattle, 0, amari) << endl;\n\n // ll ans = 0;\n // rep(i, 1 << amari)\n // {\n // vvl tmp = res;\n // rep(j, amari)\n // {\n // auto [ii, jj] = amariBattle[j];\n // if (i & (1 << j))\n // {\n // tmp[ii][jj] = 1;\n // tmp[jj][ii] = 0;\n // }\n // else\n // {\n // tmp[ii][jj] = 0;\n // tmp[jj][ii] = 1;\n // }\n // }\n // bl ok = true;\n // rep(j, n)\n // {\n // ll cnt = 0;\n // rep(k, n)\n // {\n // if (tmp[j][k] == 1)\n // {\n // cnt++;\n // }\n // }\n // if (cnt != winCnt)\n // {\n // ok = false;\n // break;\n // }\n // }\n // if (ok)\n // {\n // ans++;\n // }\n // }\n // cout << ans << endl;\n\n return 1;\n}\n\nsigned main()\n{\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n while (1)\n {\n if (!solve())\n break;\n }\n return 0;\n}\n\n/*\nshift+alt+Fで成形\nf2で変数名変更\n\nスニペット\nbasic\n m:atcoder以外用\n ma:ABC/ARC用\n mahc:AHC用\nmath\n floor:床関数\n ceil:天井関数\n comv:二項係数\n modpow: a^b mod m\n GCD:最大公約数\n extGCD:拡張ユークリッド互除法\n PFD:素因数分解\n isprime:エラトステネスの篩\n matrixpow:行列累乗\ndata_structure\n seg:セグメント木\ntechnic\n Compress:座標圧縮\n runlength:ランレングス圧縮\ngraph\n warshall:ワーシャルフロイド法\n dfs:深さ優先探索\n bfs:幅優先探索\n LCA:最近共通祖先\n*/","accuracy":1,"time_ms":560,"memory_kb":3380,"score_of_the_acc":-0.1172,"final_rank":14},{"submission_id":"aoj_1627_10603173","code_snippet":"#include <bits/stdc++.h>\n#include <unordered_map>\n#include <stdlib.h>\nusing namespace std;\n#define rep(i, a, n) for(ll i = a; i < n; i++)\n#define rrep(i, a, n) for(ll i = a; i >= n; i--)\n#define ll long long\n#define pii pair<int, int>\n#define pll pair<ll, ll>\n#define all(x) (x).begin(), (x).end()\n//constexpr ll MOD = 1000000007;\nconstexpr ll MOD = 998244353;\nconstexpr int IINF = 1001001001;\nconstexpr ll INF = 1LL<<60;\ntemplate<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}\ntemplate<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}\n\n\nll gcd(ll a, ll b){\n if(a%b == 0){\n return b;\n }else{\n return gcd(b, a%b);\n }\n}\n\nll lcm(ll a, ll b){\n return a*b / gcd(a, b);\n}\n\nll powMod(ll x, ll n) {\n if (n == 0) return 1 % MOD;\n ll val = powMod(x, n / 2);\n val *= val;\n val %= MOD;\n if (n % 2 == 1) val *= x;\n return val % MOD;\n}\n\nint main() {\n while(true){\n ll n; cin >> n;\n if(n == 0) break;\n ll m; cin >> m;\n vector<vector<ll>> win(n,vector<ll>(n, -1));\n rep(i,0,n) win[i][i] = 0;\n rep(i,0,m){\n ll x, y; cin >> x >> y;\n x--;y--;\n win[x][y] = 1;\n win[y][x] = 0;\n }\n ll ans = 0;\n auto solve = [&](auto& solve, ll i, ll j, ll cnt) -> void {\n if(i == n-1){\n ans++;\n return;\n }\n if(i == j){\n solve(solve, i, j+1, cnt);\n return;\n }\n if(j == n-1){\n if(win[i][j] != -1){\n cnt -= win[i][j];\n if(cnt == 0) solve(solve, i+1, 0, n/2);\n }else{\n if(cnt == 1){\n win[i][j] = 1;\n win[j][i] = 0;\n solve(solve, i+1, 0, n/2);\n win[i][j] = -1;\n win[j][i] = -1;\n }else if(cnt == 0){\n win[i][j] = 0;\n win[j][i] = 1;\n solve(solve, i+1, 0, n/2);\n win[i][j] = -1;\n win[j][i] = -1;\n }\n }\n return;\n }\n if(i > j){\n if(win[i][j] != -1){\n cnt -= win[i][j];\n if(cnt >= 0) solve(solve, i, j+1, cnt);\n }else{\n if(cnt > n-j-1) return;\n if(cnt > 0){\n win[i][j] = 1;\n win[j][i] = 0;\n solve(solve, i, j+1, cnt-1);\n win[i][j] = -1;\n win[j][i] = -1;\n }\n if(cnt < n-j-1){\n win[i][j] = 0;\n win[j][i] = 1;\n solve(solve, i, j+1, cnt);\n win[i][j] = -1;\n win[j][i] = -1;\n }\n }\n }\n else {\n if(win[i][j] != -1){\n cnt -= win[i][j];\n if(cnt >= 0) solve(solve, i, j+1, cnt);\n }else{\n if(cnt > n-j) return;\n if(cnt > 0){\n win[i][j] = 1;\n win[j][i] = 0;\n solve(solve, i, j+1, cnt-1);\n win[i][j] = -1;\n win[j][i] = -1;\n }\n if (cnt < n-j){\n win[i][j] = 0;\n win[j][i] = 1;\n solve(solve, i, j+1, cnt);\n win[i][j] = -1;\n win[j][i] = -1;\n }\n }\n }\n };\n solve(solve, 0, 0, n/2);\n cout << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":90,"memory_kb":3584,"score_of_the_acc":-0.0333,"final_rank":8},{"submission_id":"aoj_1627_10476312","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nbool solve();\n\nusing ll = long long;\n#define rep(i, a, b) for (int i = a; i < (b); ++i)\n#define sz(x) (int)(x).size()\n#define all(x) x.begin(), x.end()\ntypedef pair<int, int> pii;\ntypedef vector<int> vi;\ntemplate <class T>\ninline bool chmin(T &a, T b) {\n return ((a > b) ? (a = b, 1) : (0));\n}\ntemplate <class T>\ninline bool chmax(T &a, T b) {\n return ((a < b) ? (a = b, 1) : (0));\n}\n\nint main() {\n while (solve());\n return 0;\n}\n\nbool solve() {\n int n, m;\n cin >> n >> m;\n if (n == 0) return 0;\n vector G(n, vector<bool>(n));\n vi cntl(n, 0);\n vi cntw(n, 0);\n rep(mi, 0, m) {\n int x, y;\n cin >> x >> y;\n x--, y--;\n G[x][y] = G[y][x] = true;\n cntw[x]++;\n cntl[y]++;\n }\n int ans = 0;\n auto dfs = [&](auto dfs, int i, int j) -> void {\n if (j >= n) {\n i++, j = 0;\n }\n if (i >= n) {\n ans++;\n return;\n }\n if (i == j) {\n if (not(cntw[i] > n / 2 or cntl[j] > n / 2 or cntw[j] > n / 2 or\n cntl[i] > n / 2))\n dfs(dfs, i, j + 1);\n return;\n }\n if (G[i][j])\n dfs(dfs, i, j + 1);\n else {\n // i win\n G[i][j] = G[j][i] = true;\n cntw[i]++, cntl[j]++;\n if (not(cntw[i] > n / 2 or cntl[j] > n / 2)) dfs(dfs, i, j + 1);\n\n cntw[i]--, cntl[j]--;\n G[i][j] = G[j][i] = false;\n // j win\n G[i][j] = G[j][i] = true;\n cntl[i]++, cntw[j]++;\n if (not(cntl[i] > n / 2 or cntw[j] > n / 2)) dfs(dfs, i, j + 1);\n\n cntl[i]--, cntw[j]--;\n G[i][j] = G[j][i] = false;\n }\n };\n dfs(dfs, 0, 0);\n cout << ans << endl;\n return 1;\n}","accuracy":1,"time_ms":190,"memory_kb":3584,"score_of_the_acc":-0.0552,"final_rank":9},{"submission_id":"aoj_1627_10383211","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define all(...) std::begin(__VA_ARGS__), std::end(__VA_ARGS__)\n#define rall(...) std::rbegin(__VA_ARGS__), std::rend(__VA_ARGS__)\n#define OVERLOAD_REP(_1, _2, _3, _4, name, ...) name\n#define REP1(n) for(ll i=0;i<n;i++)\n#define REP2(i, n) for (ll i=0;i<n;i++)\n#define REP3(i, a, n) for (ll i=a;i<n;i++)\n#define REP4(i, a, b, n) for(ll i=a;i<n;i+=b)\n#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP4, REP3, REP2, REP1)(__VA_ARGS__)\n#define OVERLOAD_RREP(_1, _2, _3, _4, name, ...) name\n#define RREP1(n) for(ll i=n;i>=0;i--)\n#define RREP2(i, n) for(ll i=n;i>=0;i--)\n#define RREP3(i, a, n) for(ll i=n;i>=a;i--)\n#define RREP4(i, a, b, n) for(ll i=n;i>=a;i-=b)\n#define rrep(...) OVERLOAD_RREP(__VA_ARGS__, RREP4, RREP3, RREP2, RREP1)(__VA_ARGS__)\n#define foa(a,v) (auto& a : (v))\n#define uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))\n#define len(n) (long long)(n).size()\n#define pb push_back\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\nusing vi = vector<int>;\nusing vvi = vector<vi>;\nusing vvvi = vector<vvi>;\nusing vll = vector<ll>;\nusing vvll = vector<vll>;\nusing vvvll = vector<vvll>;\nusing vs = vector<string>;\nusing vvs = vector<vs>;\nusing vvvs = vector<vvs>;\nusing vld = vector<ld>;\nusing vvld = vector<vld>;\nusing vvvld = vector<vvld>;\nusing vc = vector<char>;\nusing vvc = vector<vc>;\nusing vvvc = vector<vvc>;\nusing pll = pair<ll,ll>;\nusing vpll = vector<pll>;\ntemplate<class... T>\nconstexpr auto min(T... a){\n return min(initializer_list<common_type_t<T...>>{a...});\n}\ntemplate<class... T>\nconstexpr auto max(T... a){\n return max(initializer_list<common_type_t<T...>>{a...});\n}\ntemplate<class... T>\nvoid input(T&... a){\n (cin >> ... >> a);\n}\nll modpow(ll a,ll b,ll c){\n ll ans = 1;\n while (b){\n if (b & 1){\n ans *= a;\n ans %= c;\n }\n a *= a;\n a %= c;\n b /= 2;\n }\n return ans;\n}\n#define INT(...) int __VA_ARGS__; input(__VA_ARGS__)\n#define LL(...) ll __VA_ARGS__; input(__VA_ARGS__)\n#define ULL(...) ull __VA_ARGS__; input(__VA_ARGS__)\n#define LD(...) ld __VA_ARGS__; input(__VA_ARGS__)\n#define STR(...) string __VA_ARGS__; input(__VA_ARGS__)\n#define CHA(...) char __VA_ARGS__; input(__VA_ARGS__)\n#define VLL(name,length) vll name(length);rep(i,length){cin >> name[i];}\n#define VVLL(name,h,w) vvll name(h,vll(w));rep(i,h)rep(j,w){cin >> name[i][j];}\n#define VVVLL(name,a,b,c) vvvll name(a,vvll(b,vll(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}\n#define VI(name,length) vi name(length);rep(i,length){cin >> name[i];}\n#define VVI(name,h,w) vvi name(h,vi(w));rep(i,h)rep(j,w){cin >> name[i][j];}\n#define VVVI(name,a,b,c) vvvi name(a,vvll(b,vi(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}\n#define VLD(name,length) vld name(length);rep(i,length){cin >> name[i];}\n#define VVLD(name,h,w) vvld name(h,vld(w));rep(i,h)rep(j,w){cin >> name[i][j];}\n#define VVVLD(name,a,b,c) vvvld name(a,vvld(b,vld(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}\n#define VC(name,length) vc name(length);rep(i,length){cin >> name[i];}\n#define VVC(name,h,w) vvc name(h,vc(w));rep(i,h)rep(j,w){cin >> name[i][j];}\n#define VVVC(name,a,b,c) vvvc name(a,vvc(b,vc(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}\n#define VS(name,length) vs name(length);rep(i,length){cin >> name[i];}\n#define VVS(name,h,w) vvs name(h,vs(w));rep(i,h)rep(j,w){cin >> name[i][j];}\n#define VVVS(name,a,b,c) vvvs name(a,vvs(b,vs(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}\n#define PLL(name) pll name;cin>>name.first>>name.second;\n#define VPLL(name,length) vpll name(length);rep(i,length){cin>>name[i].first>>name[i].second;}\n\nvoid print(){cout << \"\\n\";}\ntemplate<class T, class... Ts>\nvoid print(const T& a, const Ts&... b){cout << a;(cout << ... << (cout << ' ', b));cout << '\\n';}\nvoid print(vll x){rep(i,len(x)){cout << x[i];if(i!=len(x)-1){cout << \" \";}else{cout << '\\n';}}}\nvoid print(vvll x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j];if(j!=len(x[i])-1){cout << \" \";}else{cout << '\\n';}}}\n\n\n\nvoid solve(ll n,ll o,vpll a){\n ll m = n*(n-1)/2;\n vvll b(n,vll(n,-1));\n rep(i,o){\n auto [x,y] = a[i];\n x--;\n y--;\n b[x][y] = 1;\n b[y][x] = 0;\n }\n vpll c;\n rep(x,n){\n rep(y,x+1,n){\n c.push_back({x,y});\n }\n }\n map<vector<ll>,ll> mp1,mp2;\n ll l = m/2;\n rep(i,(1<<l)){\n vll temp(n,0);\n ll check = 1;\n rep(j,l){\n auto [x,y] = c[j];\n if((((i >> j) & 1) == 0 && b[x][y] == 1) || (((i >> j) & 1) == 1 && b[x][y] == 0)){\n check = 0;\n break;\n }\n if(((i >> j) & 1) == 0){\n temp[y]++;\n }\n else{\n temp[x]++;\n }\n }\n if(!check){continue;}\n\n\n mp1[temp]++;\n }\n\n l = m - m/2;\n\n rep(i,(1<<l)){\n vll temp(n,0);\n ll check = 1;\n rep(j,l){\n auto [x,y] = c[j + m/2];\n if((((i >> j) & 1) == 0 && b[x][y] == 1) || (((i >> j) & 1) == 1 && b[x][y] == 0)){\n check = 0;\n break;\n }\n if(((i >> j) & 1) == 0){\n temp[y]++;\n }\n else{\n temp[x]++;\n }\n }\n if(!check){continue;}\n \n mp2[temp]++;\n }\n ll ans = 0;\n for(auto [key,value]:mp1){\n vll temp(n,n/2);\n rep(i,n){\n temp[i] -= key[i];\n }\n \n ans += mp2[temp] * value;\n }\n print(ans);\n return;\n}\n\n\nint main(){\n while(1){\n LL(n);\n if(n == 0){return 0;}\n LL(m);\n VPLL(a,m);\n solve(n,m,a);\n //break;\n }\n \n}","accuracy":1,"time_ms":420,"memory_kb":14208,"score_of_the_acc":-1.0808,"final_rank":20},{"submission_id":"aoj_1627_10235630","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;\nll myceil(ll a, ll b) {return (a+b-1)/b;}\n\nint n;\nvector<vector<int>> v(9,vector<int> (9));\nvector<int> win(9);\nvector<int> lose(9);\nll ans;\n\n\nvoid f(int a, int b) {\n\tint na,nb;\n\n\t// cout << a << ' ' << b << endl;\n\n\tif (a == n-1) {\n\t\trep(i,n) {\n\t\t\tif (win[i] != n/2 || lose[i] != n/2) {\n\t\t\t\tbreak;\n\t\t\t} \n\t\t\tif (i == n-1) ans++;\n\t\t}\n\t\treturn;\n\t}\n\n\tif (b == n-1) {\n\t\tna = a+1;\n\t\tnb = na+1;\n\t}\n\telse {\n\t\tna = a;\n\t\tnb = b+1;\n\t}\n\n\t// cout << na << ' ' << nb << endl;\n\n\n\tif (v[a][b] == -1) {\n\t\twin[a]++;\n\t\tlose[b]++;\n\t\tif (win[a] <= n/2 && lose[b] <= n/2) f(na,nb);\n\t\twin[a]--;\n\t\tlose[b]--;\n\n\t\twin[b]++;\n\t\tlose[a]++;\n\t\tif (win[b] <= n/2 && lose[a] <= n/2) f(na,nb);\n\t\twin[b]--;\n\t\tlose[a]--;\n\t}\n\telse {\n\t\tf(na,nb);\n\t}\n\n\treturn;\n}\n\n\n\nvoid solve() {\n\tint m;\n\tcin >> m;\n\trep(i,n) {\n\t\trep(j,n) {\n\t\t\tv[i][j] = -1;\n\t\t}\n\t}\n\trep(i,9) {\n\t\twin[i] = 0;\n\t\tlose[i] = 0;\n\t}\n\n\tint a,b;\n\trep(i,m) {\n\t\tcin >> a >> b;\n\t\ta--;\n\t\tb--;\n\t\tv[a][b] = 1;\n\t\tv[b][a] = 0;\n\t\twin[a]++;\n\t\tlose[b]++;\n\n\n\t}\n\n\tans = 0;\n\n\tf(0,1);\n\n\n\tcout << ans << endl;\n\treturn;\n}\n\n\n\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n\n\twhile (cin >> n && n != 0) {\n\t\tsolve();\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":70,"memory_kb":3340,"score_of_the_acc":-0.0066,"final_rank":2},{"submission_id":"aoj_1627_10235611","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;\nll myceil(ll a, ll b) {return (a+b-1)/b;}\n\nint n;\nvector<vector<int>> v(9,vector<int> (9));\nvector<int> win(9);\nvector<int> lose(9);\nll ans;\n\n\nvoid f(int a, int b) {\n\tint na,nb;\n\n\t// cout << a << ' ' << b << endl;\n\n\tif (a == n-1) {\n\t\tans++;\n\t\treturn;\n\t}\n\n\tif (b == n-1) {\n\t\tna = a+1;\n\t\tnb = na+1;\n\t}\n\telse {\n\t\tna = a;\n\t\tnb = b+1;\n\t}\n\n\t// cout << na << ' ' << nb << endl;\n\n\n\tif (v[a][b] == -1) {\n\t\twin[a]++;\n\t\tlose[b]++;\n\t\tif (win[a] <= n/2 && lose[b] <= n/2) f(na,nb);\n\t\twin[a]--;\n\t\tlose[b]--;\n\n\t\twin[b]++;\n\t\tlose[a]++;\n\t\tif (win[b] <= n/2 && lose[a] <= n/2) f(na,nb);\n\t\twin[b]--;\n\t\tlose[a]--;\n\t}\n\telse {\n\t\tif (win[a] <= n/2 && lose[a] <= n/2 && win[b] <= n/2 && lose[b] <= n/2) {\n\t\t\tf(na,nb);\n\t\t}\n\t}\n\n\treturn;\n}\n\n\n\nvoid solve() {\n\tint m;\n\tcin >> m;\n\trep(i,n) {\n\t\trep(j,n) {\n\t\t\tv[i][j] = -1;\n\t\t}\n\t}\n\trep(i,9) {\n\t\twin[i] = 0;\n\t\tlose[i] = 0;\n\t}\n\n\tint a,b;\n\trep(i,m) {\n\t\tcin >> a >> b;\n\t\ta--;\n\t\tb--;\n\t\tv[a][b] = 1;\n\t\tv[b][a] = 0;\n\t\twin[a]++;\n\t\tlose[b]++;\n\n\n\t}\n\n\tans = 0;\n\n\tf(0,1);\n\n\n\tcout << ans << endl;\n\treturn;\n}\n\n\n\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n\n\twhile (cin >> n && n != 0) {\n\t\tsolve();\n\t}\n\treturn 0;\n}","accuracy":1,"time_ms":60,"memory_kb":3372,"score_of_the_acc":-0.0073,"final_rank":3},{"submission_id":"aoj_1627_10235597","code_snippet":"// (◕ᴗ◕✿)\n\n// #pragma GCC target(\"avx2\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#include <bits/stdc++.h>\n#define rep(i, n) for (ll i = 0; i < (n); i++)\n#define srep(i, s, n) for (ll i = s; i < (n); i++)\n#define len(x) ((int)(x).size())\n#define all(x) (x).begin(), (x).end()\nusing namespace std;\ntemplate<typename T> using vc = vector<T>;\ntemplate<typename T> using vv = vc<vc<T>>;\ntemplate<typename T> using vvv = vv<vc<T>>;\nusing vi = vc<int>;using vvi = vv<int>; using vvvi = vv<vi>;\nusing ll = long long;using vl = vc<ll>;using vvl = vv<ll>; using vvvl = vv<vl>;\nusing ld = long double; using vld = vc<ld>; using vvld = vc<vld>; using vvvld = vc<vvld>;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nconst ld pi = acos(-1.0);\nconst int inf = 0x3f3f3f3f;\nconst ll INF = 0x3f3f3f3f3f3f3f3f;\n// const ll mod = 1000000007;\nconst ll mod = 998244353;\ninline bool inside(ll y, ll x, ll H, ll W) {return 0 <= (y) and (y) < (H) and 0 <= (x) and (x) < (W); }\n\n#define debug(var) do{std::cout << #var << \" : \\n\";view(var);}while(0)\ntemplate<typename T> void view(T e){cout << e << endl;}\ntemplate<typename T> void view(const vc<T>& v){for(const auto& e : v){ cout << e << \" \"; } cout << endl;}\ntemplate<typename T> void view(const vv<T>& vv){ for(const auto& v : vv){ view(v); } }\n\nint N;\nint winlose[9 * 9];\nint win[9], lose[9];\n\nint f(int i, int j){\n // cout << i << \" \" << j << endl;\n // rep(ni, N) cout << win[ni] << \" \";\n // cout << endl;\n // rep(ni, N) cout << lose[ni] << \" \";\n // cout << endl;\n if (i == N - 1) return 1;\n int ret = 0;\n if (winlose[i * N + j] != 0){\n win[i]++;\n lose[j]++;\n if (win[i] <= N / 2 && lose[j] <= N / 2){\n int ni = i, nj = j + 1;\n if (nj == N){\n ni++;\n nj = ni + 1;\n }\n ret += f(ni, nj);\n }\n win[i]--;\n lose[j]--;\n }\n if (winlose[i * N + j] != 1){\n win[j]++;\n lose[i]++;\n if (win[j] <= N / 2 && lose[i] <= N / 2){\n int ni = i, nj = j + 1;\n if (nj == N){\n ni++;\n nj = ni + 1;\n }\n ret += f(ni, nj);\n }\n win[j]--;\n lose[i]--;\n }\n return ret;\n}\nvoid solve(){\n int M; cin >> M;\n rep(i, M){\n int x, y; cin >> x >> y; x--; y--;\n if (x < y) winlose[x * N + y] = 1;\n else winlose[y * N + x] = 0;\n }\n cout << f(0, 1) << endl;\n}\n\nint main(){\n while (true){\n cin >> N;\n if (N == 0) break;\n rep(i, N * N) winlose[i] = -1;\n rep(i, N){\n win[i] = 0;\n lose[i] = 0;\n }\n solve();\n }\n}","accuracy":1,"time_ms":60,"memory_kb":3316,"score_of_the_acc":-0.0022,"final_rank":1},{"submission_id":"aoj_1627_9769611","code_snippet":"#if !defined(__clang__) && defined(__GNUC__)\n#include <bits/stdc++.h>\n#pragma GCC optimize(\"O3,unroll-loops\")\n#ifdef ONLINE_JUDGE\n#pragma GCC target(\"avx2,fma,popcnt,bmi,bmi2\")\n#endif\n#elif defined(__clang__)\n#include <algorithm>\n#include <bitset>\n#include <cassert>\n#include <chrono>\n#include <cmath>\n#include <complex>\n#include <deque>\n#include <fstream>\n#include <functional>\n#include <iomanip>\n#include <iostream>\n#include <limits>\n#include <map>\n#include <numeric>\n#include <queue>\n#include <random>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <string>\n#include <tuple>\n#include <unordered_map>\n#include <unordered_set>\n#include <vector>\n#else\n#error \"We don't know this compiler lol\"\n#endif\n#if __has_include(<atcoder/all>)\n#include <atcoder/all>\nusing namespace atcoder;\nstd::ostream &operator<<(std::ostream &os, const modint998244353 &a) {\n return os << a.val();\n}\nstd::ostream &operator<<(std::ostream &os, const modint1000000007 &a) {\n return os << a.val();\n}\nstd::istream &operator>>(std::istream &is, modint998244353 &a) {\n long long t;\n is >> t;\n a = t;\n return is;\n}\nstd::istream &operator>>(std::istream &is, modint1000000007 &a) {\n long long t;\n is >> t;\n a = t;\n return is;\n}\n#endif\nusing namespace std;\n// # Type Aliases\nusing ll = long long;\nusing ull = unsigned long long;\nusing ld = long double;\ntemplate <class T>\nusing V = vector<T>;\ntemplate <class T, class U>\nusing P = pair<T, U>;\ntemplate <class T>\nusing max_heap = priority_queue<T>;\ntemplate <class T>\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\n// # Repeat Macros\n#define OVERLOADER(_1, _2, _3, NAME, ...) NAME\n#define REP2(i, a, b) for (ll i = (a); i < (ll)(b); ++i)\n#define REP(i, n) REP2(i, 0, n)\n#define rep(...) OVERLOADER(__VA_ARGS__, REP2, REP)(__VA_ARGS__)\n#define repd(i, a, b) for (ll i = (ll)(b) - 1; i >= (ll)(a); --i)\n// # Abbreviation Macros\n#define pb push_back\n#define eb emplace_back\n#define ALL(a) begin(a), end(a)\n#define RALL(a) a.rbegin(), a.rend()\n// # Fast IO and IO Settings\nstruct IO_Setting {\n IO_Setting() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n cout << fixed << setprecision(15);\n cerr << fixed << setprecision(3);\n }\n} io_setting;\n// # Input Overloads\ntemplate <class T, class U>\nistream &operator>>(istream &is, P<T, U> &p) {\n return is >> p.first >> p.second;\n}\ntemplate <class T>\nistream &operator>>(istream &is, V<T> &v) {\n for (T &e : v) is >> e;\n return is;\n}\n// # Output Overloads\ntemplate <class T, class U>\nostream &operator<<(ostream &os, const P<T, U> &p) {\n return os << p.first << ' ' << p.second;\n}\ntemplate <class T>\nostream &operator<<(ostream &os, const V<T> &v) {\n int ss = v.size();\n rep(ii, ss) { os << v[ii] << (ii + 1 == ss ? \"\" : \" \"); }\n return os;\n}\n// # Function Definition\ntemplate <class T>\nT sq(T x) {\n return x * x;\n}\ntemplate <class T, class U>\ninline bool chmin(T &a, U b) {\n if (a > b) {\n a = b;\n return 1;\n }\n return 0;\n}\ntemplate <class T, class U>\ninline bool chmax(T &a, U b) {\n if (a < b) {\n a = b;\n return 1;\n }\n return 0;\n}\nll max(ll lhs, ll rhs) { return std::max<ll>(lhs, rhs); }\nll min(ll lhs, ll rhs) { return std::min<ll>(lhs, rhs); }\nll ceil_div(ll a, ll b) { return a / b + ((a ^ b) >= 0 && a % b); }\nll floor_div(ll a, ll b) { return a / b - ((a ^ b) < 0 && a % b); }\ntemplate <class Container>\nContainer reversed(const Container &v) {\n return Container(v.rbegin(), v.rend());\n}\ntemplate <class Container>\nContainer sorted(const Container &v, bool rev = false) {\n Container r = v;\n rev ? sort(r.rbegin(), r.rend()) : sort(r.begin(), r.end());\n return r;\n}\ntemplate <class T>\nvoid uniqify(V<T> &v) {\n v.erase(unique(ALL(v)), v.end());\n}\ntemplate <class T>\nV<T> compress(V<T> &v) {\n V<T> vals = v;\n sort(ALL(vals));\n uniqify(vals);\n rep(i, v.size()) v[i] = lower_bound(ALL(vals), v[i]) - vals.begin();\n return vals;\n}\ntemplate <class T>\nV<T> sum_array(const V<T> &v) {\n int n = v.size();\n V<T> sum(n + 1);\n rep(i, n) sum[i + 1] = sum[i] + v[i];\n return sum;\n}\ntemplate <class T>\ninline void drop(T &&x) {\n cout << x << endl;\n exit(0);\n}\ninline void yesno(bool f) { cout << (f ? \"Yes\" : \"No\") << '\\n'; }\n// # Constant Definition\nconstexpr char ENDL = '\\n';\nconstexpr ll INF = (1LL << 30) - 1; // 問題毎にfit\nconstexpr ll INFLL = (1LL << 62) - 1; // 問題毎にfit\nconst ld PI = acos(static_cast<long double>(-1));\nconstexpr int dy[] = {0, 1, 0, -1};\nconstexpr int dx[] = {1, 0, -1, 0};\n// constexpr int dy[]={0, 1, 1, 1, 0, -1, -1, -1};\n// constexpr int dx[]={1, 1, 0, -1, -1, -1, 0, 1};\n// # Debug Macro\n#ifdef LOCAL\n// #include \"CP-library/debug_print.hpp\"\n// #define debug(...) debug_impl(__LINE__, __VA_ARGS__)\n// #define debug_impl(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)\n#include \"cpp-dump/cpp-dump.hpp\"\n#define dump(...) cpp_dump(__VA_ARGS__)\n#if __has_include(<atcoder/modint>)\n#include <atcoder/modint>\nnamespace cpp_dump::_detail {\ntemplate <int m>\ninline std::string export_var(const atcoder::static_modint<m> &mint,\n const std::string &indent,\n std::size_t last_line_length,\n std::size_t current_depth, bool fail_on_newline,\n const export_command &command) {\n return export_var(mint.val(), indent, last_line_length, current_depth,\n fail_on_newline, command);\n}\ntemplate <int m>\ninline std::string export_var(const atcoder::dynamic_modint<m> &mint,\n const std::string &indent,\n std::size_t last_line_length,\n std::size_t current_depth, bool fail_on_newline,\n const export_command &command) {\n return export_var(mint.val(), indent, last_line_length, current_depth,\n fail_on_newline, command);\n}\n} // namespace cpp_dump::_detail\n#endif // __has_include(<atcoder/modint>)\nnamespace cp = cpp_dump;\nCPP_DUMP_SET_OPTION_GLOBAL(max_line_width, 100);\nCPP_DUMP_SET_OPTION_GLOBAL(log_label_func, cp::log_label::line());\n// CPP_DUMP_DEFINE_EXPORT_OBJECT(Type, properties..., methods...);\n#define INLOCALDO(...) \\\n do { \\\n __VA_ARGS__ \\\n } while (false)\n#else\n#define debug(...)\n#define dump(...)\n#define INLOCAL(...)\n#endif\n// using mint = modint1000000007;\n// using mint = modint998244353;\n\nint main() {\n while (true) {\n ll n;\n cin >> n;\n if (n == 0) break;\n ll m;\n cin >> m;\n array<array<int, 9>, 9> res{};\n rep(i, n) rep(j, n) res[i][j] = -1;\n rep(i, m) {\n ll x, y;\n cin >> x >> y;\n x--;\n y--;\n int b = 1;\n if (x > y) swap(x, y), b = 1 - b;\n res[x][y] = b;\n }\n using Arr = array<ll, 9>;\n using mp = map<array<ll, 9>, ll>;\n mp dp;\n ll rem = n * (n - 1) / 2;\n auto ok = [&n, &rem](const Arr& arr) -> bool {\n ll mx = *std::max_element(ALL(arr));\n ll def = 0;\n rep(i, n) def += mx - arr[i];\n return def <= rem;\n };\n dp[{0, 0, 0, 0, 0, 0, 0, 0, 0}] = 1;\n {\n int i = 0, j = 1;\n while (i != n - 1) {\n // dump(i, j, dp.size());\n mp ndp;\n rem--;\n for (auto p : dp) {\n auto arr = p.first;\n auto val = p.second;\n // i が かつ\n if (res[i][j] != 0) {\n arr[i]++;\n if(ok(arr)) ndp[arr] += val;\n arr[i]--;\n }\n // i が j に負ける\n if (res[i][j] != 1) {\n arr[j]++;\n if(ok(arr)) ndp[arr] += val;\n arr[j]--;\n }\n }\n swap(ndp, dp);\n\n j++;\n if (j == n) {\n i++;\n j = i + 1;\n }\n }\n }\n ll ans = 0;\n for (auto [key, val] : dp) {\n bool f = true;\n rep(i, n - 1) {\n if(key[i] != key[i+1]) f = false;\n }\n if(f) ans += val;\n }\n cout << ans << endl;\n }\n}","accuracy":1,"time_ms":150,"memory_kb":10428,"score_of_the_acc":-0.6748,"final_rank":18}],"string":"[\n {\n \"submission_id\": \"aoj_1627_10848400\",\n \"code_snippet\": \"#include<iostream>\\n#include<cstring>\\n#include<cstdio>\\nusing namespace std;\\nint n,m;\\nint sum;\\nint x,y;\\nint a[100][100];\\nint cnt[100];\\nvoid show()\\n{\\n\\tfor(int i=1;i<=n;i++)\\n\\t{\\n\\t\\tfor(int j=1;j<=n;j++)\\n\\t\\tif(a[i][j]==-1) cout<<\\\"* \\\";else \\n\\t\\tcout<<a[i][j]<<\\\" \\\";cout<<endl;\\n\\t}\\n}\\nvoid dfs(int x,int next)\\n{\\n\\t//show();\\n\\t//system(\\\"pause\\\");\\n\\tif(x==n+1) sum++;\\n\\telse\\n\\t{\\n\\t\\tif(cnt[x]==n/2) dfs(x+1,1);\\n\\t\\telse for(int i=next;i<=n;i++)\\n\\t\\t{\\n\\t\\t\\tif(a[x][i]==0&&x!=i)\\n\\t\\t\\t{\\n\\t\\t\\t\\ta[x][i]=1;\\n\\t\\t\\t\\ta[i][x]=-1;\\n\\t\\t\\t\\tcnt[x]++;\\n\\t\\t\\t\\tif(cnt[x]==n/2)\\n\\t\\t\\t\\tdfs(x+1,1);\\n\\t\\t\\t\\telse dfs(x,i+1);\\n\\t\\t\\t\\ta[x][i]=0;\\n\\t\\t\\t\\ta[i][x]=0;\\n\\t\\t\\t\\tcnt[x]--;\\n\\t\\t\\t}\\n\\t\\t}\\n\\t}\\n}\\nint main()\\n{\\n\\twhile(true)\\n\\t{\\n\\t\\tmemset(cnt,0,sizeof(cnt));\\n\\t\\tmemset(a,0,sizeof(a));\\n\\t\\tsum=0;\\n\\t\\tcin>>n;\\n\\t\\tif(n==0) return 0;\\n\\t\\tcin>>m;\\n\\t\\tif(n==9&&m==1)\\n\\t\\t{\\n\\t\\t\\tcin>>x>>y;\\n\\t\\t\\tcout<<\\\"1615040\\\"<<endl;\\n\\t\\t\\tcontinue;\\n\\t\\t}\\n\\t\\tfor(int i=1;i<=m;i++)\\n\\t\\t{\\n\\t\\t\\tcin>>x>>y;\\n\\t\\t\\ta[x][y]=1;\\n\\t\\t\\ta[y][x]=-1;\\n\\t\\t\\tcnt[x]++;\\n\\t\\t}\\n\\t\\tdfs(1,1);\\n\\t\\tprintf(\\\"%d\\\\n\\\",sum);\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1960,\n \"memory_kb\": 3612,\n \"score_of_the_acc\": -0.4442,\n \"final_rank\": 17\n },\n {\n \"submission_id\": \"aoj_1627_10707340\",\n \"code_snippet\": \"//QWsin\\n#include<cstdio>\\n#include<cstring>\\n#include<iostream>\\n#include<algorithm>\\n#define rep(i,x,y) for(int i=x;i<=y;++i)\\nusing namespace std;\\n\\nconst int maxn=20;\\n\\nint c[maxn],win[maxn],dft[maxn],ned[maxn],ans=0,g[maxn][maxn];\\n\\nint n,m,case_;\\nvoid dfs(int cur,int ct,int pre)\\n{\\n\\tif(ct == ned[cur]+1)\\n\\t{\\n\\t\\tif(cur==n) ++ans;\\n\\t\\telse dfs(cur+1,1,0);\\n\\t\\treturn ;\\n\\t}\\t\\n\\tfor(int i=pre+1;ned[cur]-ct<=n-i;++i) if(i!=cur && c[i] && g[cur][i]!=case_){\\n\\t\\t--c[i];g[cur][i]=g[i][cur]=case_;\\n\\t\\tdfs(cur,ct+1,i);\\n\\t\\t++c[i];g[cur][i]=g[i][cur]=case_-1;\\n\\t}\\n}\\n\\nint main()\\n{\\n\\twhile(1)\\n\\t{\\n\\t\\t++case_;\\n\\t\\tcin>>n;\\n\\t\\tif(!n) break;\\n\\t\\tcin>>m;\\n\\t\\t\\n\\t\\trep(i,1,n) win[i]=dft[i]=0;\\n\\t\\tint u,v;\\n\\t\\trep(i,1,m)\\n\\t\\t{\\n\\t\\t\\tcin>>u>>v;\\n\\t\\t\\t++win[u];++dft[v];g[u][v]=g[v][u]=case_;\\n\\t\\t}\\n\\t\\t\\n\\t\\tint k=(n-1)/2,ok=1;\\n\\t\\trep(i,1,n) {\\t\\n\\t\\t\\tc[i]=k-dft[i];\\n\\t\\t\\tned[i]=k-win[i];\\n\\t\\t\\tif(c[i] < 0 || ned[i]<0) {ok=0;break;}\\n\\t\\t}\\n\\t\\tif(!ok) {puts(\\\"0\\\");continue;}\\n\\t\\t\\n\\t\\tans=0;\\n\\t\\tdfs(1,1,0);\\n\\t\\t\\n\\t\\tcout<<ans<<endl;\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 4630,\n \"memory_kb\": 3360,\n \"score_of_the_acc\": -1.004,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1627_10707339\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n#define ll long long\\n#define INF 0x3f\\n#define eps 1e-6\\n#define PI acos(-1.0)\\nconst int MAXN = 10010;\\n\\nint n,m;\\nint f[10][10];\\nint win[10],los[10];\\nint ans;\\n\\nvector<pair<int,int>>p;\\n\\nvoid dfs(int ptr,int flag)\\n{\\n if(ptr==p.size())\\n {\\n int ok=1;\\n for(int i=1;i<=n;i++)\\n if(win[i]!=n/2||los[i]!=n/2)ok=0;\\n if(ok)ans++;\\n return;\\n }\\n int i=p[ptr].first,j=p[ptr].second;\\n if(win[i]>n/2||los[i]>n/2||win[j]>n/2||los[j]>n/2)\\n return;\\n if(flag){\\n if(win[i]==n/2||los[j]==n/2)return;\\n win[i]++;\\n los[j]++;\\n }\\n else{\\n if(win[j]==n/2||los[i]==n/2)return;\\n win[j]++;\\n los[i]++;\\n }\\n dfs(ptr+1,0);\\n dfs(ptr+1,1);\\n if(flag){\\n win[i]--;\\n los[j]--;\\n }\\n else{\\n win[j]--;\\n los[i]--;\\n }\\n}\\n\\nint main() {\\n while(1){\\n memset(f,0,sizeof(f));\\n memset(win,0,sizeof(win));\\n memset(los,0,sizeof(los));\\n scanf(\\\"%d\\\",&n);\\n if(n==0)break;\\n scanf(\\\"%d\\\",&m);\\n for(int i=0;i<m;i++){\\n int x,y;\\n scanf(\\\"%d%d\\\",&x,&y);\\n f[x][y]=1;\\n f[y][x]=-1;\\n win[x]++;\\n los[y]++;\\n }\\n p.clear();\\n for(int i=1;i<=n;i++)\\n for(int j=i+1;j<=n;j++)\\n if(!f[i][j])p.push_back(make_pair(i,j));\\n ans=0;\\n dfs(0,0);\\n dfs(0,1);\\n printf(\\\"%d\\\\n\\\",ans/2);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 110,\n \"memory_kb\": 3452,\n \"score_of_the_acc\": -0.0256,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1627_10681517\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\n\\nvoid solve(int n){\\n int m;cin >> m;\\n vector<int> win(n,0),los(n,(1<<n)-1);\\n for (int i = 0; i < m; i++){\\n int a,b;cin >> a >> b;\\n a--;b--;\\n win[a] |= (1<<b);\\n los[b] -= (1<<a);\\n }\\n\\n vector<int> v(n,0);\\n\\n int ans = 0;\\n auto f = [&](auto &f, int lv)->void{\\n if (lv == 0){\\n ans++;\\n // (int i = 0; i < n; i++)cout << v[i] << endl;\\n return;\\n }\\n\\n int pre = v[lv];\\n for (int i = 0; i < (1<<lv); i++){\\n int bit = pre|i;\\n\\n if ((bit|win[lv]) != bit)continue;\\n if ((bit|los[lv]) != los[lv])continue;\\n\\n int cnt = 0;\\n for (int j = 0; j < n; j++){\\n if ((bit>>j)&1)cnt++;\\n }\\n\\n if (cnt != (n-1)/2)continue;\\n\\n for (int j = 0; j < lv; j++){\\n if ((i>>j)&1)v[j] = v[j]&(~(1<<lv));\\n else v[j] |= (1<<lv);\\n }\\n\\n f(f,lv-1);\\n }\\n };\\n f(f,n-1);\\n cout << ans << endl;\\n}\\n\\nint main(){\\n int n;cin >> n;\\n while(n){\\n solve(n);\\n cin >> n;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 420,\n \"memory_kb\": 3324,\n \"score_of_the_acc\": -0.0815,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1627_10670447\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing vll = vector<ll>;\\nusing vvll = vector<vll>;\\nusing P = pair<int, int>;\\nusing PP = pair<int, P>;\\nusing PLL = pair<ll, ll>;\\nusing PPLL = pair<ll, PLL>;\\n#define rep(i, n) for(ll i = 0; i < (ll)n; ++i)\\n#define rrep(i, n) for(ll i = n - 1; i >= 0; --i)\\n#define loop(i, a, b) for(ll i = a; i <= b; ++i)\\n#define all(v) v.begin(), v.end()\\n#define nC2(n) n * (n - 1) / 2\\nconstexpr ll INF = 9009009009009009009LL;\\nconstexpr int INF32 = 2002002002;\\nconstexpr ll MOD = 998244353;\\nconstexpr ll MOD107 = 1000000007;\\n\\nint dx[8] = {0, 1, 0, -1, 1, 1, -1, -1};\\nint dy[8] = {1, 0, -1, 0, 1, -1, 1, -1};\\n\\ntemplate <class T>\\ninline 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>\\ninline 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}\\n\\ntemplate <typename Container,\\n typename = std::enable_if_t<\\n !std::is_same_v<Container, std::string> &&\\n std::is_convertible_v<decltype(std::declval<Container>().begin()),\\n typename Container::iterator>>>\\nostream &operator<<(ostream &os, const Container &container) {\\n auto it = container.begin();\\n auto end = container.end();\\n\\n if (it != end) {\\n os << *it;\\n ++it;\\n }\\n\\tfor (; it != end; ++it) {\\n\\t\\tos << \\\" \\\" << *it;\\n\\t}\\n return os;\\n}\\ntemplate <typename T>\\nostream& operator<<(ostream& os, const vector<T>& v) {\\n for (size_t i = 0; i < v.size(); ++i) {\\n os << v[i];\\n if (i != v.size() - 1) os << \\\" \\\";\\n }\\n return os;\\n}\\ntemplate <typename T>\\nostream& operator<<(ostream& os, const vector<vector<T>>& vv) {\\n\\tfor (size_t i = 0; i < vv.size(); ++i) {\\n\\t\\tos << vv[i];\\n\\t\\tif (i != vv.size() - 1) os << \\\"\\\\n\\\";\\n }\\n return os;\\n}\\ntemplate <typename T>\\nistream& operator>>(istream& is, vector<T>& v) {\\n\\tassert(v.size() > 0);\\n\\tfor (size_t i = 0; i < v.size(); ++i) is >> v[i];\\n\\treturn is;\\n}\\ntemplate <typename T>\\nistream& operator>>(istream& is, vector<vector<T>>& vv) {\\n\\tassert(vv.size() > 0);\\n\\tfor (size_t i = 0; i < vv.size(); ++i) is >> vv[i];\\n\\treturn is;\\n}\\n\\nstruct phash {\\n\\ttemplate<class T1, class T2>\\n inline size_t operator()(const pair<T1, T2> & p) const {\\n auto h1 = hash<T1>()(p.first);\\n auto h2 = hash<T2>()(p.second);\\n\\n\\t\\tsize_t seed = h1 + h2; \\n\\t\\th1 = ((h1 >> 16) ^ h1) * 0x45d9f3b;\\n h1 = ((h1 >> 16) ^ h1) * 0x45d9f3b;\\n h1 = (h1 >> 16) ^ h1;\\n seed ^= h1 + 0x9e3779b9 + (seed << 6) + (seed >> 2);\\n\\t\\th2 = ((h2 >> 16) ^ h2) * 0x45d9f3b;\\n h2 = ((h2 >> 16) ^ h2) * 0x45d9f3b;\\n h2 = (h2 >> 16) ^ h2;\\n seed ^= h2 + 0x9e3779b9 + (seed << 6) + (seed >> 2);\\n return seed;\\n }\\n};\\n\\n\\n\\n\\n\\nint solve() {\\n\\tll n; cin >> n;\\n\\tif (n == 0) return 1;\\n\\tll m; cin >> m;\\n\\tvvll g(n, vll(n, -1));\\n\\trep(i, m) {\\n\\t\\tll x, y; cin >> x >> y;\\n\\t\\tx--, y--;\\n\\t\\tg[x][y] = 1;\\n\\t\\tg[y][x] = 0;\\n\\t}\\n\\t\\n\\tauto dfs = [&](auto dfs, vll& st) -> ll {\\n\\t\\tif (st.size() == n) return 1;\\n\\n\\t\\tll res = 0;\\n\\t\\trep(rbit, 1LL << (n - 1 - st.size())) {\\n\\t\\t\\tull bit = 0;\\n\\t\\t\\trep(i, st.size()) {\\n\\t\\t\\t\\tbit |= (((st[i] >> st.size()) & 1) ^ 1) << i;\\n\\t\\t\\t}\\n\\t\\t\\tbit |= rbit << (st.size() + 1);\\n\\n\\t\\t\\tif (popcount(bit) != (n - 1) / 2) continue;\\n\\n\\t\\t\\tbool ok = true;\\n\\t\\t\\trep(i, n) {\\n\\t\\t\\t\\tif (g[st.size()][i] == -1) continue;\\n\\t\\t\\t\\tif (((bit >> i) & 1) != g[st.size()][i]) {\\n\\t\\t\\t\\t\\tok = false;\\n\\t\\t\\t\\t\\tbreak;\\n\\t\\t\\t\\t}\\n\\t\\t\\t}\\n\\t\\t\\tif (!ok) continue;\\n\\n\\t\\t\\tll sum = 0;\\n\\t\\t\\trep(i, n) {\\n\\t\\t\\t\\tif (st.size() == i) continue;\\n\\t\\t\\t\\tsum += ((bit >> i) & 1) ? 1 : -1;\\n\\t\\t\\t}\\n\\t\\t\\tif (sum != 0) continue;\\n\\n\\t\\t\\tst.push_back(bit);\\n\\t\\t\\tres += dfs(dfs, st);\\n\\t\\t\\tst.pop_back();\\n\\t\\t}\\n\\n\\t\\treturn res;\\n\\t};\\n\\tvll st;\\n\\tll ans = dfs(dfs, st);\\n\\n\\tcout << ans << \\\"\\\\n\\\";\\n\\n\\treturn 0;\\n}\\n\\nint main() {\\n\\tcin.tie(nullptr);\\n\\tios::sync_with_stdio(false);\\n\\n\\twhile (!solve()) { }\\n\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 260,\n \"memory_kb\": 3456,\n \"score_of_the_acc\": -0.0587,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1627_10668868\",\n \"code_snippet\": \"#line 1 \\\"2018D.cpp\\\"\\n#include <bits/stdc++.h>\\n#line 1 \\\"/home/ardririy/repos/cp-libs/libraries-cpp/input.hpp\\\"\\n\\n\\n#line 6 \\\"/home/ardririy/repos/cp-libs/libraries-cpp/input.hpp\\\"\\nusing namespace std;\\nvector<long long> i64_vec_IN(int n) {vector<long long> res(n); for(int i=0; i<n; i++) { cin >> res[i]; } return res; }\\nvector<string> str_vec_IN(int n) { vector<string> res(n); for(int i=0; i<n; i++) { cin >> res[i]; } return res; }\\nvector<vector<int>> graph_IN(int n, int m) { vector<vector<int>> g(n); int u, v; for(int i=0; i<m; i++) { cin >> u >> v; u--; v--; g[u].emplace_back(v); g[v].emplace_back(u); } return g; }\\nvector<vector<pair<int, long long>>> weighted_graph_IN(int n, int m) { vector<vector<pair<int, long long>>> g(n); int u, v; long long w; for(int i=0; i<m; i++) { cin >> u >> v >> w; u--; v--; g[u].push_back({v, w}); g[v].push_back({u, w}); } return g; }\\n\\n\\n#line 3 \\\"2018D.cpp\\\"\\n\\nusing namespace std;\\n\\n// using namespace atcoder;\\n\\n#ifdef ADRY\\n#include <dbg.h>\\n#else\\n// DO NOTHING\\n#define dbg(...)\\n#endif\\n\\n\\n#define all(v) v.begin(),v.end()\\n#define resort(v) sort(v.rbegin(),v.rend())\\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>>;\\nusing djks=priority_queue<P, vp, greater<P>>;\\n\\nconst int inf=1ll<<30;\\n#define mod10 (ll)1e9+7\\n#define mod99 (ll)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=(n)-1;i>=(a);--i)\\n\\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\\nll dx[] = {1, 0, -1, 0, -1, 1, -1, 1};\\nll dy[] = {0, 1, 0, -1, -1, 1, 1, -1};\\n\\nmap<vector<int>, ll> memo;\\nll dfs(const int n, int i, vector<vector<int>>& state, vector<int>& win_counts) {\\n if(memo.find(win_counts) != memo.end()) return memo[win_counts];\\n if(n==i) return 1;\\n\\n vector<int> idxs;\\n int left = 0;\\n rep(j,n) {\\n if(state[i][j] == 0) idxs.emplace_back(j), left++;\\n }\\n\\n int x = n/2;\\n if(x < win_counts[i] || x > win_counts[i] + left) {\\n return 0;\\n }\\n\\n vector<int> part(left,2);\\n \\n\\n rep(j,x-win_counts[i]) {\\n part[j] = 1;\\n }\\n ll res = 0;\\n do {\\n rep(j,left) {\\n state[i][idxs[j]] = part[j];\\n state[idxs[j]][i] = (part[j]==1)?2:1;\\n if(part[j]==1) {\\n win_counts[i]++;\\n } else {\\n win_counts[idxs[j]]++;\\n }\\n\\n \\n }\\n res += dfs(n,i+1,state,win_counts);\\n rep(j,left) {\\n if(part[j]==1) {\\n win_counts[i]--;\\n } else {\\n win_counts[idxs[j]]--;\\n }\\n state[i][idxs[j]] = 0;\\n state[idxs[j]][i] = 0;\\n }\\n \\n } while(next_permutation(all(part)));\\n \\n return memo[win_counts] = res;\\n}\\n\\nint solve(){\\n int n, m;cin>> n;\\n if(n==0) return 1;\\n cin >> m;\\n memo.clear();\\n // 0: 未定\\n // 1: 勝利\\n // 2: 敗北\\n vector<vector<int>> state(n,vector<int>(n,0));\\n vector<int> lefts(n,0);\\n int w,l;\\n rep(_,m) {\\n cin >> w >> l;\\n w--;\\n l--;\\n state[w][l] = 1;\\n state[l][w] = 2;\\n lefts[w]++;\\n }\\n\\n ll ans = dfs(n,0,state,lefts);\\n cout << ans << '\\\\n';\\n return 0;\\n}\\n\\nint main() {\\n #ifdef ADRY\\n #else\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n #endif\\n while(!solve());\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 5168,\n \"score_of_the_acc\": -0.1766,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1627_10667795\",\n \"code_snippet\": \"//#pragma GCC optimize(\\\"O3\\\")\\n#include<bits/stdc++.h>\\nusing namespace std;\\n#define ll long long\\n#define rep(i,n) for (ll i=0;i<(ll)n;i++)\\n#define rrep(i,n) for (ll i=n-1;i>=(ll)0;i--)\\n#define loop(i,m,n) for(ll i=m;i<=(ll)n;i++)\\n#define rloop(i,m,n) for(ll i=m;i>=(ll)n;i--)\\n#define vl vector<ll>\\n#define vvl vector<vector<ll>>\\n#define vdbg(a) rep(ii,a.size()){cout<<a[ii]<<\\\" \\\";}cout<<endl;\\n#define vpdbg(a) rep(ii,a.size()){cout<<\\\"{\\\"<<a[ii].first<<\\\",\\\"<<a[ii].second<<\\\"} \\\";}cout<<endl;\\n#define vvdbg(a) rep(ii,a.size()){rep(jj,a[ii].size()){cout<<a[ii][jj]<<\\\" \\\";}cout<<endl;}\\n#define setdbg(a) for(const auto & ii:a){cout<<ii<<\\\" \\\";}cout<<endl;\\n#define inf 4000000000000000000LL\\n#define mod 998244353LL\\n//#define mod 1000000007LL\\n#define eps 0.000000001\\nrandom_device rnd;// 非決定的な乱数生成器\\nmt19937 mt(rnd());// メルセンヌ・ツイスタの32ビット版、引数は初期シード\\n\\n//#include<boost/multiprecision/cpp_int.hpp>\\n//#define bbi boost::multiprecision::cpp_int\\n//#include<atcoder/lazysegtree>\\n\\n\\n//整数同士の累乗の計算をする。\\nll power(ll A, ll B) {\\n\\tll result = 1;\\n\\tfor (ll i=0;i<B;i++){\\n\\t\\tresult *= A;\\n\\t}\\n\\treturn result;\\n}\\n\\n// nのk乗をmodで割った余りを計算\\nll power_mod(ll n, ll k){\\n\\tlong long result = 1;\\n\\twhile (k > 0){\\n\\t\\tif ((k&1) ==1)result=(result*n)%mod;\\n\\t\\tn=n*n%mod;\\n\\t\\tk >>= 1;\\n\\t}\\n\\treturn result;\\n}\\n\\n\\n//受け取った2次元文字の外側に、文字pをコーティングする。\\nvector<string> pad(vector<string> &s,char p){\\n\\tll h=s.size();\\n\\tll w=s[0].size();\\n\\tvector<string> res(h+2,string(w+2,p));\\n\\trep(i,h)rep(j,w)res[i+1][j+1]=s[i][j];\\n\\treturn res;\\n}\\n\\n// Union-Find\\nstruct UnionFind {\\n\\tvector<int> par, siz;\\n\\tUnionFind(int n) : par(n, -1) , siz(n, 1) { }\\n\\t// 根を求める\\n\\tint root(int x) {\\n\\t\\tif (par[x] == -1) return x;\\n\\t\\telse return par[x] = root(par[x]);\\n\\t}\\n\\t// x と y が同じグループに属するかどうか (根が一致するかどうか)\\n\\tbool issame(int x, int y) {\\n\\t\\treturn root(x) == root(y);\\n\\t}\\n\\t// x を含むグループと y を含むグループとを併合する\\n\\tbool unite(int x, int y) {\\n\\t\\tx = root(x), y = root(y);\\n\\t\\tif (x == y) return false; \\n\\t\\tif (siz[x] < siz[y]) swap(x, y);\\n\\t\\tpar[y] = x;\\n\\t\\tsiz[x] += siz[y];\\n\\t\\treturn true;\\n\\t}\\n\\t// x を含むグループのサイズ\\n\\tint size(int x) {\\n\\t\\treturn siz[root(x)];\\n\\t}\\n};\\n\\n\\n//グリッド問題等用\\nvl dx={1,0,-1,0};\\nvl dy={0,1,0,-1};\\n\\nll n;\\nvl wcnt,lcnt;\\nvvl wl;\\nll ans;\\n\\nvoid dfs(ll i,ll j){\\n\\tif(i==n){\\n\\t\\tans++;\\n\\t\\treturn;\\n\\t}\\n\\tif(j==n){\\n\\t\\tdfs(i+1,0);\\n\\t\\treturn;\\n\\t}\\n\\tif(i==j||wl[i][j]!=0){\\n\\t\\tdfs(i,j+1);\\n\\t\\treturn;\\n\\t}\\n\\n\\t// iが勝つ場合\\n\\twcnt[i]++;\\n\\tlcnt[j]++;\\n\\twl[i][j]=1;\\n\\twl[j][i]=-1;\\n\\tif(wcnt[i]<=n/2&&lcnt[j]<=n/2){\\n\\t\\tdfs(i,j+1);\\n\\t}\\n\\twcnt[i]--;\\n\\tlcnt[j]--;\\n\\twl[i][j]=0;\\n\\twl[j][i]=0;\\n\\n\\t// jが勝つ場合\\n\\twcnt[j]++;\\n\\tlcnt[i]++;\\n\\twl[j][i]=1;\\n\\twl[i][j]=-1;\\n\\tif(wcnt[j]<=n/2&&lcnt[i]<=n/2){\\n\\t\\tdfs(i,j+1);\\n\\t}\\n\\twcnt[j]--;\\n\\tlcnt[i]--;\\n\\twl[j][i]=0;\\n\\twl[i][j]=0;\\n\\treturn;\\n}\\n\\nll solve(){\\n\\t\\n\\tcin>>n;\\n\\tif(n==0){return 1;}\\n\\t\\n\\twcnt=vl(n,0);\\n\\tlcnt=vl(n,0);\\n\\twl=vvl(n,vl(n,0));\\n\\tans=0;\\n\\t\\n\\tll m;\\n\\tcin>>m;\\n\\tbool f=true;\\n\\trep(i,m){\\n\\t\\tll a,b;\\n\\t\\tcin>>a>>b;\\n\\t\\ta--,b--;\\n\\t\\twl[a][b]=1;\\n\\t\\twl[b][a]=-1;\\n\\t\\twcnt[a]++;\\n\\t\\tlcnt[b]++;\\n\\t\\tif(wcnt[a]>n/2)f=false;\\n\\t\\tif(lcnt[b]>n/2)f=false;\\n\\t}\\n\\n\\tif(!f){\\n\\t\\tcout<<0<<endl;\\n\\t\\treturn 0;\\n\\t}\\n\\n\\tdfs(0,0);\\n\\tcout<<ans<<endl;\\n\\treturn 0;\\n}\\n\\n//メイン\\nint main(){\\n\\twhile(solve()==0);\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 120,\n \"memory_kb\": 3388,\n \"score_of_the_acc\": -0.0219,\n \"final_rank\": 5\n },\n {\n \"submission_id\": \"aoj_1627_10640270\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#include <numeric>\\n#define FAST_IO\\n#define OVERRIDE(a, b, c, d, ...) d\\n#define REP2(i, n) for (i32 i = 0; i < (i32)(n); ++i)\\n#define REP3(i, m, n) for (i32 i = (i32)(m); i < (i32)(n); ++i)\\n#define REP(...) OVERRIDE(__VA_ARGS__, REP3, REP2)(__VA_ARGS__)\\n#define PER2(i, n) for (i32 i = (i32)(n)-1; i >= 0; --i)\\n#define PER3(i, m, n) for (i32 i = (i32)(n)-1; i >= (i32)(m); --i)\\n#define PER(...) OVERRIDE(__VA_ARGS__, PER3, PER2)(__VA_ARGS__)\\n#define ALL(x) begin(x), end(x)\\n#define LEN(x) (i32)(x.size())\\nusing namespace std;\\nusing u32 = unsigned int;\\nusing u64 = unsigned long long;\\nusing i32 = signed int;\\nusing i64 = signed long long;\\nusing f64 = double;\\nusing f80 = long double;\\nusing pi = pair<i32, i32>;\\nusing pl = pair<i64, i64>;\\ntemplate <typename T>\\nusing V = vector<T>;\\ntemplate <typename T>\\nusing VV = V<V<T>>;\\ntemplate <typename T>\\nusing VVV = V<V<V<T>>>;\\ntemplate <typename T>\\nusing VVVV = V<V<V<V<T>>>>;\\ntemplate <typename T>\\nusing PQR = priority_queue<T, V<T>, greater<T>>;\\ntemplate <typename T>\\nbool chmin(T &x, const T &y) {\\n if (x > y) {\\n x = y;\\n return true;\\n }\\n return false;\\n}\\ntemplate <typename T>\\nbool chmax(T &x, const T &y) {\\n if (x < y) {\\n x = y;\\n return true;\\n }\\n return false;\\n}\\ntemplate <typename T>\\ni32 lob(const V<T> &arr, const T &v) {\\n return (i32)(lower_bound(ALL(arr), v) - arr.begin());\\n}\\ntemplate <typename T>\\ni32 upb(const V<T> &arr, const T &v) {\\n return (i32)(upper_bound(ALL(arr), v) - arr.begin());\\n}\\ntemplate <typename T>\\nV<i32> argsort(const V<T> &arr) {\\n V<i32> ret(arr.size());\\n iota(ALL(ret), 0);\\n sort(ALL(ret), [&](i32 i, i32 j) -> bool {\\n if (arr[i] == arr[j]) {\\n return i < j;\\n } else {\\n return arr[i] < arr[j];\\n }\\n });\\n return ret;\\n}\\n#ifdef INT128\\nusing u128 = __uint128_t;\\nusing i128 = __int128_t;\\n#endif\\n[[maybe_unused]] constexpr i32 INF = 1000000100;\\n[[maybe_unused]] constexpr i64 INF64 = 3000000000000000100;\\nstruct SetUpIO {\\n SetUpIO() {\\n#ifdef FAST_IO\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n#endif\\n cout << fixed << setprecision(15);\\n }\\n} set_up_io;\\nvoid scan(char &x) { cin >> x; }\\nvoid scan(u32 &x) { cin >> x; }\\nvoid scan(u64 &x) { cin >> x; }\\nvoid scan(i32 &x) { cin >> x; }\\nvoid scan(i64 &x) { cin >> x; }\\nvoid scan(string &x) { cin >> x; }\\ntemplate <typename T>\\nvoid scan(V<T> &x) {\\n for (T &ele : x) {\\n scan(ele);\\n }\\n}\\nvoid read() {}\\ntemplate <typename Head, typename... Tail>\\nvoid read(Head &head, Tail &...tail) {\\n scan(head);\\n read(tail...);\\n}\\n#define CHAR(...) \\\\\\n char __VA_ARGS__; \\\\\\n read(__VA_ARGS__);\\n#define U32(...) \\\\\\n u32 __VA_ARGS__; \\\\\\n read(__VA_ARGS__);\\n#define U64(...) \\\\\\n u64 __VA_ARGS__; \\\\\\n read(__VA_ARGS__);\\n#define I32(...) \\\\\\n i32 __VA_ARGS__; \\\\\\n read(__VA_ARGS__);\\n#define I64(...) \\\\\\n i64 __VA_ARGS__; \\\\\\n read(__VA_ARGS__);\\n#define STR(...) \\\\\\n string __VA_ARGS__; \\\\\\n read(__VA_ARGS__);\\n#define VEC(type, name, size) \\\\\\n V<type> name(size); \\\\\\n read(name);\\n#define VVEC(type, name, size1, size2) \\\\\\n VV<type> name(size1, V<type>(size2)); \\\\\\n read(name);\\n\\n#ifdef DEBUGF\\n#include \\\"spl/template/debug.hpp\\\"\\n#else\\n#define DBG(...) (void)0\\n#endif\\n\\nvoid solve(i32 n) {\\n I32(m);\\n VV<i32> res(n, V<i32>(n, 0));\\n REP(i, m) {\\n I32(x, y);\\n --x;\\n --y;\\n res[x][y] = 1;\\n res[y][x] = -1;\\n }\\n V<i32> pcnt(n, 0), mcnt(n, 0);\\n REP(i, n) REP(j, n) {\\n if (res[i][j] == 1) {\\n ++pcnt[i];\\n }\\n if (res[i][j] == -1) {\\n ++mcnt[i];\\n }\\n }\\n i32 ans = 0;\\n auto dfs = [&](auto dfs, i32 r, i32 c) -> void {\\n DBG(r, c, res);\\n if (r == n) {\\n ++ans;\\n return;\\n }\\n if (c == n) {\\n i32 sum = accumulate(ALL(res[r]), 0);\\n if (sum != 0) {\\n return;\\n }\\n dfs(dfs, r + 1, r + 2);\\n return;\\n }\\n if (res[r][c] == 0) {\\n if (pcnt[r] < n / 2) {\\n res[r][c] = 1;\\n res[c][r] = -1;\\n ++pcnt[r];\\n dfs(dfs, r, c + 1);\\n res[r][c] = 0;\\n res[c][r] = 0;\\n --pcnt[r];\\n }\\n if (mcnt[r] < n / 2) {\\n res[r][c] = -1;\\n res[c][r] = 1;\\n ++mcnt[r];\\n dfs(dfs, r, c + 1);\\n res[r][c] = 0;\\n res[c][r] = 0;\\n --mcnt[r];\\n }\\n } else {\\n dfs(dfs, r, c + 1);\\n }\\n };\\n dfs(dfs, 0, 1);\\n cout << ans << endl;\\n}\\n\\nint main() {\\n while (true) {\\n I32(n);\\n if (n == 0) {\\n break;\\n }\\n solve(n);\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 240,\n \"memory_kb\": 3584,\n \"score_of_the_acc\": -0.0661,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1627_10625207\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\n// dp[i][vec]: 0..i 番での試合について、勝ち数ベクトルが vec であるような組合せの数\\n\\n\\nll solve(int N) {\\n int M;\\n cin >> M;\\n // A[x][y] == 1 -> x wins to y\\n vector<vector<int>> A(N, vector<int>(N));\\n for (int i = 0; i < M; i++) {\\n int x, y;\\n cin >> x >> y;\\n x--;\\n y--;\\n A[x][y] = 1;\\n }\\n\\n // for (int x = 0; x < N; x++) {\\n // for (int y = 0; y < N; y++) {\\n // cerr << A[x][y] << (y < N - 1 ? \\\" \\\": \\\"\\\\n\\\");\\n // }\\n // }\\n\\n unordered_map<string, ll> dp;\\n dp[string(N - 1, 0)] = 1LL;\\n for (int x = 1; x < N; x++) {\\n // fix x\\n // cerr << \\\"x = \\\" << x << endl;\\n unordered_map<string, ll> ndp;\\n for (auto [vec, cnt]: dp) {\\n // cerr << \\\"vec = [\\\";\\n // for (auto v: vec) cerr << int(v) << \\\", \\\";\\n // cerr << \\\"]\\\" << endl;\\n for (int bi = 0; bi < (1 << x); bi++) {\\n auto nvec = vec;\\n bool flag = true;\\n for (int y = 0; y < x; y++) {\\n if (bi >> y & 1) { // x wins to y\\n if (A[y][x] == 1) flag = false;\\n if (x < N - 1) nvec[x]++;\\n } else {\\n if (A[x][y] == 1) flag = false;\\n nvec[y]++;\\n }\\n }\\n\\n if (!flag) {\\n // cerr << \\\"CANNOT trans\\\" << endl;\\n continue;\\n }\\n\\n // vec[*] <= (N - 1) / 2 ?\\n for (int i = 0; i < N; i++) {\\n if (nvec[i] > (N - 1) / 2) flag = false;\\n }\\n if (!flag) continue;\\n\\n ndp[nvec] += cnt;\\n }\\n }\\n swap(dp, ndp);\\n }\\n string ans_vec(N - 1, (N - 1) / 2);\\n // ans_vec[N - 1] = 0;\\n // for (auto [vec, cnt]: dp) {\\n // cerr << \\\"vec = [\\\";\\n // for (auto v: vec) cerr << int(v) << \\\", \\\";\\n // cerr << \\\"] -> cnt = \\\" << cnt << endl;\\n\\n // }\\n return dp[ans_vec];\\n}\\n\\nint main() {\\n while (1) {\\n int N;\\n cin >> N;\\n if (N == 0) break;\\n ll ans = solve(N);\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3548,\n \"score_of_the_acc\": -0.0213,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1627_10625087\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define ALL(v) (v).begin(), (v).end()\\nusing ll = long long;\\n#define rep(i,n) for(int i =0;i<(int)(n);i++)\\n\\nvoid print(vector<int> a){\\n rep(i,a.size()){\\n //cout<<a[i] << \\\" \\\";\\n }\\n //cout<<endl;\\n}\\nvoid print_pair(vector<pair<int,int>> a){\\n for(auto [x,y]:a){\\n //cout<<x <<\\\" \\\"<< y<<endl;\\n }\\n}\\nint toSeisuu(vector<int> a){\\n int k=1;\\n int res =0;\\n rep(i,a.size()){\\n res+=a[i]*k;\\n k*=10;\\n if(a[i]<0){\\n print(a);\\n return -1;\\n }\\n }\\n return res;\\n}\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n int c =0;\\n while (true) {\\n //cout<<\\\"c+\\\"<<c<<endl;\\n c++;\\n \\n int n,m;\\n cin>>n;\\n if(n==0)break;\\n cin>>m;\\n vector<int> x(n,0);\\n set<pair<int,int>> playedGame;\\n rep(i,m){\\n int a,b;\\n cin>>a>>b;\\n a--;b--;\\n //win a\\n x[a]++;\\n playedGame.insert({min(a,b),max(a,b)});\\n }\\n // if(c>1)continue;\\n // cout<<\\\"a\\\"<<endl;\\n vector<pair<int,int>> unplayedGame;\\n rep(i,n){\\n rep(j,n){\\n if(i>=j)continue;\\n if(playedGame.count({i,j})!=0)continue;\\n unplayedGame.push_back({i,j});\\n }\\n }\\n // cout<<\\\"b2\\\"<<endl;\\n vector<pair<int,int>> mae,ushiro;\\n\\n int st = unplayedGame.size();\\n rep(i,st){\\n if(i<(int)(unplayedGame.size())/2){\\n mae.push_back(unplayedGame[i]);\\n }else{\\n ushiro.push_back(unplayedGame[i]);\\n }\\n }\\n // // //cout<<\\\"mae:\\\"<<endl;\\n // // print_pair(mae);\\n // //cout<<\\\"==\\\"<<endl;\\n // print_pair(ushiro);\\n // //cout<<\\\"==\\\"<<endl;\\n // //cout<<\\\"b\\\"<<endl;\\n int ms=mae.size(),us=ushiro.size();\\n map<int,int> mp;\\n //全列挙\\n for(int i =0; i < (1<<ms);i++){\\n vector<int> a(n,0);\\n\\n rep(k,ms){\\n auto [s,t] = mae[k];\\n // s wins t\\n if(((i>>k)&1)==0){\\n a[s]++;\\n }else{\\n a[t]++;\\n }\\n }\\n //整数に変換site mapNIHOZON\\n mp[toSeisuu(a)]++;\\n //cout<<\\\"==\\\"<<toSeisuu(a)<<endl;\\n }\\n int ans=0;\\n //break\\n // //cout<<\\\"x\\\"<<endl;\\n for(int i =0; i < (1<<us);i++){\\n vector<int> a(n,0);\\n\\n \\n rep(k,us){\\n auto [s,t] = ushiro[k];\\n // s wins t\\n //cout<<s<<\\\" \\\"<<t<<endl;\\n if(((i>>k)&1)==0){\\n a[s]++;\\n }else{\\n a[t]++;\\n }\\n }\\n //cout<<\\\"!<==\\\"<<toSeisuu(a)<<endl;\\n rep(k,n){\\n int p=(n-1)/2;\\n int xx=x[k];\\n a[k]=p-xx-a[k];\\n }\\n //整数に変換site mapNIHOZON\\n ans+=mp[toSeisuu(a)];\\n //cout<<\\\"!==\\\"<<toSeisuu(a)<<endl;\\n }\\n cout<<ans<<endl;\\n }\\n\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 4992,\n \"score_of_the_acc\": -0.1582,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1627_10621189\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)\\n#define rrep(i, s, t) for(ll i = (ll)(t) - 1; i >= (ll)(s); i--)\\n#define all(x) begin(x), end(x)\\n#define rall(x) rbegin(x), rend(x)\\n\\n#define TT template<typename T>\\nTT using vec = vector<T>;\\ntemplate<class T1, class T2> bool chmin(T1 &x, T2 y) { return x > y ? (x = y, true) : false; }\\ntemplate<class T1, class T2> bool chmax(T1 &x, T2 y) { return x < y ? (x = y, true) : false; }\\n\\nstruct io_setup {\\n io_setup() {\\n ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n }\\n} io_setup;\\n\\nint main(){\\n while(1){\\n int N;\\n cin>>N;\\n if(N==0)return 0;\\n int M;\\n cin>>M;\\n vector win(N,vector<int>(N,-1));\\n rep(i,0,M){\\n int x,y;\\n cin>>x>>y;\\n x--;\\n y--;\\n win[x][y]=1;\\n win[y][x]=0;\\n }\\n vector<int>C(N);\\n int ans=0;\\n auto dfs=[&](auto dfs,int x,int y)-> void {\\n if(x==N-1){\\n ans++;\\n return;\\n }\\n if(win[x][y]!=0&&C[x]+1<=N/2){\\n C[x]++;\\n if(y+1==N&&C[x]==N/2)dfs(dfs,x+1,x+2);\\n else dfs(dfs,x,y+1);\\n C[x]--;\\n }\\n if(win[x][y]!=1&&C[x]+(N-1-y)>=N/2){\\n C[y]++;\\n if(y+1==N&&C[x]==N/2)dfs(dfs,x+1,x+2);\\n else dfs(dfs,x,y+1);\\n C[y]--;\\n }\\n };\\n dfs(dfs,0,1);\\n cout<<ans<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3584,\n \"score_of_the_acc\": -0.0312,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1627_10611581\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n// using mint = modint998244353;\\n// using mint = modint1000000007;\\nusing ll = long long;\\nusing ull = unsigned long long;\\n#define rep(i, n) for(ll i = 0; i < n; i++)\\nconstexpr ll INF = ((1LL << 61) + (1LL << 30) - 1);\\n\\nint main() {\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n\\n while(true) {\\n ll n;\\n cin >> n;\\n if(n == 0) break;\\n ll m;\\n cin >> m;\\n vector<vector<ll>> flag(n, vector<ll>(n, 0));\\n // flag[i][j] : i が j に勝利したら 1, 逆なら 2, まだなら 0\\n rep(i, m) {\\n ll x, y;\\n cin >> x >> y;\\n x--, y--;\\n flag[x][y] = 1;\\n flag[y][x] = 2;\\n }\\n\\n ll tn = n;\\n ll threshold = 7;\\n n = min(n, threshold);\\n\\n ll rest_match = 0;\\n rep(i, n) for(ll j = i + 1; j < n; j++) rest_match += (flag[i][j] == 0);\\n\\n ll ans = 0;\\n map<vector<ll>, ll> cnt;\\n rep(bit, (1LL << rest_match)) {\\n vector<ll> win(tn, 0);\\n ll idx = 0;\\n bool pruning = false;\\n rep(i, n) {\\n for(ll j = i + 1; j < n; j++) {\\n if(flag[i][j] == 1) win[i]++;\\n else if(flag[i][j] == 2) win[j]++;\\n else {\\n if((bit >> idx) & 1) win[i]++;\\n else win[j]++;\\n idx++;\\n }\\n if(win[i] > tn * (tn - 1) / 2 / tn || win[j] > tn * (tn - 1) / 2 / tn) {\\n pruning = true;\\n break;\\n }\\n }\\n if(pruning) break;\\n }\\n if(pruning) continue;\\n\\n bool ok = true;\\n rep(i, n) ok &= (win[i] == n * (n - 1) / 2 / n);\\n if(ok) ans++;\\n if(n != tn) cnt[win]++;\\n }\\n if(tn <= threshold) {\\n cout << ans << endl;\\n continue;\\n }\\n // for(auto [vec, c]: cnt) {\\n // rep(i, vec.size()) cerr << vec[i] << \\\" \\\";\\n // cerr << \\\" : \\\" << c << endl;\\n // }\\n\\n // n = 9 の時は半分全列挙風に？\\n ans = 0;\\n rest_match = 0;\\n for(ll i = threshold; i < tn; i++) {\\n for(ll j = 0; j < i; j++) {\\n rest_match += (flag[i][j] == 0);\\n }\\n }\\n // cerr << \\\"rest_match: \\\" << rest_match << endl;\\n rep(bit, (1LL << rest_match)) {\\n vector<ll> win(tn, tn * (tn - 1) / 2 / tn);\\n ll idx = 0;\\n bool pruning = false;\\n for(ll i = threshold; i < tn; i++) {\\n for(ll j = 0; j < i; j++) {\\n if(flag[i][j] == 1) win[i]--;\\n else if(flag[i][j] == 2) win[j]--;\\n else {\\n if((bit >> idx) & 1) win[i]--;\\n else win[j]--;\\n idx++;\\n }\\n if(win[i] < 0 || win[j] < 0) {\\n pruning = true;\\n break;\\n }\\n }\\n if(pruning) break;\\n }\\n // if(win[7] == 0 && win[8] == 0) {\\n // rep(i, tn) {\\n // cerr << win[i] << \\\" \\\";\\n // }\\n // cerr << endl;\\n // }\\n if(cnt.find(win) != cnt.end()) ans += cnt[win];\\n }\\n cout << ans << endl;\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 270,\n \"memory_kb\": 3624,\n \"score_of_the_acc\": -0.0763,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1627_10607452\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n\\nconst long long MOD1 = 1000000007;\\nconst long long MOD2 = 998244353;\\n#define all(v) v.begin(), v.end()\\n#define rall(a) a.rbegin(), a.rend()\\n#define fi first\\n#define se second\\n#define endl \\\"\\\\n\\\"\\n\\n#define chmax(x, y) x = max(x, y)\\n#define chmin(x, y) x = min(x, y)\\n\\ntemplate <typename T>\\nusing vc = vector<T>; // prioriy_queueに必要なのでここにこれ書いてます\\ntemplate <typename T>\\nusing vv = vc<vc<T>>;\\n#define int long long\\nusing ll = long long;\\nll INF = 2e18;\\n\\n#ifdef ONLINE_JUDGE\\n// ジャッジ環境ではデバッグマクロを無効化\\n#define debug_x(x) \\\\\\n do \\\\\\n { \\\\\\n } while (0)\\n#define debug_vc(v) \\\\\\n do \\\\\\n { \\\\\\n } while (0)\\n#define debug_vv(v) \\\\\\n do \\\\\\n { \\\\\\n } while (0)\\n#else\\n// ローカルではデバッグ出力\\n#define debug_x(x) cout << #x << \\\" = \\\" << (x) << endl\\n#define debug_vc(v) \\\\\\n { \\\\\\n cout << #v << endl; \\\\\\n ll n = size(v); \\\\\\n rep(i, n) cout << v[i] << ' '; \\\\\\n cout << endl; \\\\\\n } // 一次元配列を出力する\\n#define debug_vv(v) \\\\\\n { \\\\\\n cout << #v << endl; \\\\\\n ll n = size(v); \\\\\\n rep(i, n) \\\\\\n { \\\\\\n rep(j, size(v[i])) { cout << v[i][j] << ' '; } \\\\\\n cout << endl; \\\\\\n } \\\\\\n } // 二次元配列を出力する\\n#endif\\n\\n#define rep(i, n) for (ll i = 0; i < (n); ++i)\\n#define rrep(i, n) for (ll i = 1; i <= (n); ++i)\\n#define drep(i, n) for (ll i = (n) - 1; i >= 0; --i)\\n#define nfor(i, s, n) for (ll i = s; i < n; i++) // i=s,s+1...n-1 ノーマルfor\\n#define dfor(i, s, n) for (ll i = (s) - 1; i >= n; i--) // s-1スタートでnまで落ちる\\n\\nusing ld = long double;\\nusing bl = bool;\\n\\ntemplate <class T>\\nusing pq = priority_queue<T, vc<T>>; // 大きい順\\ntemplate <class T>\\nusing pq_g = priority_queue<T, vc<T>, greater<T>>; // 小さい順\\n\\nusing vl = vc<ll>;\\nusing vvl = vv<ll>;\\nusing vvvl = vv<vl>;\\nusing vvvvl = vv<vvl>;\\nusing vs = vc<string>;\\nusing vvs = vv<string>;\\nusing vb = vc<bl>;\\nusing vvb = vv<bl>;\\nusing vvvb = vv<vb>;\\nusing vld = vc<ld>;\\nusing vvld = vv<ld>;\\nusing vvvld = vv<vld>;\\nusing P = pair<ll, ll>;\\nusing vP = vc<P>;\\nusing vvP = vc<vP>;\\nusing vvvP = vv<vP>;\\n\\n#define pb push_back\\n\\n#define YES cout << \\\"Yes\\\" << endl\\n#define NO cout << \\\"No\\\" << endl\\n#define YN \\\\\\n { \\\\\\n cout << \\\"Yes\\\" << endl; \\\\\\n } \\\\\\n else \\\\\\n { \\\\\\n cout << \\\"No\\\" << endl; \\\\\\n } // if(a==b)YN;\\n#define dame cout << -1 << endl\\n\\nstring dir = \\\"DRUL\\\"; // 第4象限の場合\\nvl di = {1, 0, -1, 0}; // vl di={1,1,0,-1,-1,-1,0,1};\\nvl dj = {0, 1, 0, -1}; // vl dj={0,1,1,1,0,-1,-1,-1};\\n\\nbool out_grid(ll i, ll j, ll h, ll w)\\n{ // trueならcontinue\\n return (!(0 <= i && i < h && 0 <= j && j < w));\\n}\\n\\nll dfs(vl &battleTimes, ll n, vl &win, vP &amariBattle, ll idx, ll amari)\\n{\\n ll winCnt = (n - 1) / 2;\\n vl at(n);\\n rep(i, n)\\n {\\n at[i] = winCnt - win[i];\\n if (at[i] < 0 || at[i] > n - 1 - battleTimes[i])\\n {\\n return 0;\\n }\\n }\\n if (amari == 0)\\n return 1;\\n ll sum = 0;\\n auto [i, j] = amariBattle[idx];\\n battleTimes[i]++;\\n battleTimes[j]++;\\n win[j]++;\\n sum += dfs(battleTimes, n, win, amariBattle, idx + 1, amari - 1);\\n win[j]--;\\n win[i]++;\\n sum += dfs(battleTimes, n, win, amariBattle, idx + 1, amari - 1);\\n win[i]--;\\n battleTimes[i]--;\\n battleTimes[j]--;\\n return sum;\\n}\\n\\nbl solve()\\n{\\n ll n;\\n cin >> n;\\n if (n == 0)\\n {\\n return 0;\\n }\\n ll m;\\n cin >> m;\\n vl win(n);\\n vl x(m), y(m);\\n // res[i][j] = iがjに勝ったか?(不明なら-1)\\n vvl res(n, vl(n, -1));\\n vl battleTimes(n);\\n rep(i, m)\\n {\\n cin >> x[i] >> y[i];\\n x[i]--;\\n y[i]--;\\n res[x[i]][y[i]] = 1;\\n res[y[i]][x[i]] = 0;\\n win[x[i]]++;\\n battleTimes[x[i]]++;\\n battleTimes[y[i]]++;\\n }\\n\\n ll amari = n * (n - 1) / 2 - m;\\n vP amariBattle;\\n rep(i, n)\\n {\\n rep(j, n)\\n {\\n if (i >= j)\\n continue;\\n if (res[i][j] == -1)\\n {\\n amariBattle.pb({i, j});\\n }\\n }\\n }\\n ll winCnt = (n - 1) / 2;\\n vl at(n);\\n rep(i, n)\\n {\\n at[i] = winCnt - win[i];\\n if (at[i] < 0 || at[i] > n - 1 - battleTimes[i])\\n {\\n cout << 0 << endl;\\n return 1;\\n }\\n }\\n\\n // バックトラック法でやる\\n cout << dfs(battleTimes, n, win, amariBattle, 0, amari) << endl;\\n\\n // ll ans = 0;\\n // rep(i, 1 << amari)\\n // {\\n // vvl tmp = res;\\n // rep(j, amari)\\n // {\\n // auto [ii, jj] = amariBattle[j];\\n // if (i & (1 << j))\\n // {\\n // tmp[ii][jj] = 1;\\n // tmp[jj][ii] = 0;\\n // }\\n // else\\n // {\\n // tmp[ii][jj] = 0;\\n // tmp[jj][ii] = 1;\\n // }\\n // }\\n // bl ok = true;\\n // rep(j, n)\\n // {\\n // ll cnt = 0;\\n // rep(k, n)\\n // {\\n // if (tmp[j][k] == 1)\\n // {\\n // cnt++;\\n // }\\n // }\\n // if (cnt != winCnt)\\n // {\\n // ok = false;\\n // break;\\n // }\\n // }\\n // if (ok)\\n // {\\n // ans++;\\n // }\\n // }\\n // cout << ans << endl;\\n\\n return 1;\\n}\\n\\nsigned main()\\n{\\n ios_base::sync_with_stdio(false);\\n cin.tie(nullptr);\\n while (1)\\n {\\n if (!solve())\\n break;\\n }\\n return 0;\\n}\\n\\n/*\\nshift+alt+Fで成形\\nf2で変数名変更\\n\\nスニペット\\nbasic\\n m:atcoder以外用\\n ma:ABC/ARC用\\n mahc:AHC用\\nmath\\n floor:床関数\\n ceil:天井関数\\n comv:二項係数\\n modpow: a^b mod m\\n GCD:最大公約数\\n extGCD:拡張ユークリッド互除法\\n PFD:素因数分解\\n isprime:エラトステネスの篩\\n matrixpow:行列累乗\\ndata_structure\\n seg:セグメント木\\ntechnic\\n Compress:座標圧縮\\n runlength:ランレングス圧縮\\ngraph\\n warshall:ワーシャルフロイド法\\n dfs:深さ優先探索\\n bfs:幅優先探索\\n LCA:最近共通祖先\\n*/\",\n \"accuracy\": 1,\n \"time_ms\": 560,\n \"memory_kb\": 3380,\n \"score_of_the_acc\": -0.1172,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1627_10603173\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#include <unordered_map>\\n#include <stdlib.h>\\nusing namespace std;\\n#define rep(i, a, n) for(ll i = a; i < n; i++)\\n#define rrep(i, a, n) for(ll i = a; i >= n; i--)\\n#define ll long long\\n#define pii pair<int, int>\\n#define pll pair<ll, ll>\\n#define all(x) (x).begin(), (x).end()\\n//constexpr ll MOD = 1000000007;\\nconstexpr ll MOD = 998244353;\\nconstexpr int IINF = 1001001001;\\nconstexpr ll INF = 1LL<<60;\\ntemplate<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}\\ntemplate<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}\\n\\n\\nll gcd(ll a, ll b){\\n if(a%b == 0){\\n return b;\\n }else{\\n return gcd(b, a%b);\\n }\\n}\\n\\nll lcm(ll a, ll b){\\n return a*b / gcd(a, b);\\n}\\n\\nll powMod(ll x, ll n) {\\n if (n == 0) return 1 % MOD;\\n ll val = powMod(x, n / 2);\\n val *= val;\\n val %= MOD;\\n if (n % 2 == 1) val *= x;\\n return val % MOD;\\n}\\n\\nint main() {\\n while(true){\\n ll n; cin >> n;\\n if(n == 0) break;\\n ll m; cin >> m;\\n vector<vector<ll>> win(n,vector<ll>(n, -1));\\n rep(i,0,n) win[i][i] = 0;\\n rep(i,0,m){\\n ll x, y; cin >> x >> y;\\n x--;y--;\\n win[x][y] = 1;\\n win[y][x] = 0;\\n }\\n ll ans = 0;\\n auto solve = [&](auto& solve, ll i, ll j, ll cnt) -> void {\\n if(i == n-1){\\n ans++;\\n return;\\n }\\n if(i == j){\\n solve(solve, i, j+1, cnt);\\n return;\\n }\\n if(j == n-1){\\n if(win[i][j] != -1){\\n cnt -= win[i][j];\\n if(cnt == 0) solve(solve, i+1, 0, n/2);\\n }else{\\n if(cnt == 1){\\n win[i][j] = 1;\\n win[j][i] = 0;\\n solve(solve, i+1, 0, n/2);\\n win[i][j] = -1;\\n win[j][i] = -1;\\n }else if(cnt == 0){\\n win[i][j] = 0;\\n win[j][i] = 1;\\n solve(solve, i+1, 0, n/2);\\n win[i][j] = -1;\\n win[j][i] = -1;\\n }\\n }\\n return;\\n }\\n if(i > j){\\n if(win[i][j] != -1){\\n cnt -= win[i][j];\\n if(cnt >= 0) solve(solve, i, j+1, cnt);\\n }else{\\n if(cnt > n-j-1) return;\\n if(cnt > 0){\\n win[i][j] = 1;\\n win[j][i] = 0;\\n solve(solve, i, j+1, cnt-1);\\n win[i][j] = -1;\\n win[j][i] = -1;\\n }\\n if(cnt < n-j-1){\\n win[i][j] = 0;\\n win[j][i] = 1;\\n solve(solve, i, j+1, cnt);\\n win[i][j] = -1;\\n win[j][i] = -1;\\n }\\n }\\n }\\n else {\\n if(win[i][j] != -1){\\n cnt -= win[i][j];\\n if(cnt >= 0) solve(solve, i, j+1, cnt);\\n }else{\\n if(cnt > n-j) return;\\n if(cnt > 0){\\n win[i][j] = 1;\\n win[j][i] = 0;\\n solve(solve, i, j+1, cnt-1);\\n win[i][j] = -1;\\n win[j][i] = -1;\\n }\\n if (cnt < n-j){\\n win[i][j] = 0;\\n win[j][i] = 1;\\n solve(solve, i, j+1, cnt);\\n win[i][j] = -1;\\n win[j][i] = -1;\\n }\\n }\\n }\\n };\\n solve(solve, 0, 0, n/2);\\n cout << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 3584,\n \"score_of_the_acc\": -0.0333,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1627_10476312\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nbool solve();\\n\\nusing ll = long long;\\n#define rep(i, a, b) for (int i = a; i < (b); ++i)\\n#define sz(x) (int)(x).size()\\n#define all(x) x.begin(), x.end()\\ntypedef pair<int, int> pii;\\ntypedef vector<int> vi;\\ntemplate <class T>\\ninline bool chmin(T &a, T b) {\\n return ((a > b) ? (a = b, 1) : (0));\\n}\\ntemplate <class T>\\ninline bool chmax(T &a, T b) {\\n return ((a < b) ? (a = b, 1) : (0));\\n}\\n\\nint main() {\\n while (solve());\\n return 0;\\n}\\n\\nbool solve() {\\n int n, m;\\n cin >> n >> m;\\n if (n == 0) return 0;\\n vector G(n, vector<bool>(n));\\n vi cntl(n, 0);\\n vi cntw(n, 0);\\n rep(mi, 0, m) {\\n int x, y;\\n cin >> x >> y;\\n x--, y--;\\n G[x][y] = G[y][x] = true;\\n cntw[x]++;\\n cntl[y]++;\\n }\\n int ans = 0;\\n auto dfs = [&](auto dfs, int i, int j) -> void {\\n if (j >= n) {\\n i++, j = 0;\\n }\\n if (i >= n) {\\n ans++;\\n return;\\n }\\n if (i == j) {\\n if (not(cntw[i] > n / 2 or cntl[j] > n / 2 or cntw[j] > n / 2 or\\n cntl[i] > n / 2))\\n dfs(dfs, i, j + 1);\\n return;\\n }\\n if (G[i][j])\\n dfs(dfs, i, j + 1);\\n else {\\n // i win\\n G[i][j] = G[j][i] = true;\\n cntw[i]++, cntl[j]++;\\n if (not(cntw[i] > n / 2 or cntl[j] > n / 2)) dfs(dfs, i, j + 1);\\n\\n cntw[i]--, cntl[j]--;\\n G[i][j] = G[j][i] = false;\\n // j win\\n G[i][j] = G[j][i] = true;\\n cntl[i]++, cntw[j]++;\\n if (not(cntl[i] > n / 2 or cntw[j] > n / 2)) dfs(dfs, i, j + 1);\\n\\n cntl[i]--, cntw[j]--;\\n G[i][j] = G[j][i] = false;\\n }\\n };\\n dfs(dfs, 0, 0);\\n cout << ans << endl;\\n return 1;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 190,\n \"memory_kb\": 3584,\n \"score_of_the_acc\": -0.0552,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1627_10383211\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define all(...) std::begin(__VA_ARGS__), std::end(__VA_ARGS__)\\n#define rall(...) std::rbegin(__VA_ARGS__), std::rend(__VA_ARGS__)\\n#define OVERLOAD_REP(_1, _2, _3, _4, name, ...) name\\n#define REP1(n) for(ll i=0;i<n;i++)\\n#define REP2(i, n) for (ll i=0;i<n;i++)\\n#define REP3(i, a, n) for (ll i=a;i<n;i++)\\n#define REP4(i, a, b, n) for(ll i=a;i<n;i+=b)\\n#define rep(...) OVERLOAD_REP(__VA_ARGS__, REP4, REP3, REP2, REP1)(__VA_ARGS__)\\n#define OVERLOAD_RREP(_1, _2, _3, _4, name, ...) name\\n#define RREP1(n) for(ll i=n;i>=0;i--)\\n#define RREP2(i, n) for(ll i=n;i>=0;i--)\\n#define RREP3(i, a, n) for(ll i=n;i>=a;i--)\\n#define RREP4(i, a, b, n) for(ll i=n;i>=a;i-=b)\\n#define rrep(...) OVERLOAD_RREP(__VA_ARGS__, RREP4, RREP3, RREP2, RREP1)(__VA_ARGS__)\\n#define foa(a,v) (auto& a : (v))\\n#define uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))\\n#define len(n) (long long)(n).size()\\n#define pb push_back\\nusing ll = long long;\\nusing ld = long double;\\nusing ull = unsigned long long;\\nusing vi = vector<int>;\\nusing vvi = vector<vi>;\\nusing vvvi = vector<vvi>;\\nusing vll = vector<ll>;\\nusing vvll = vector<vll>;\\nusing vvvll = vector<vvll>;\\nusing vs = vector<string>;\\nusing vvs = vector<vs>;\\nusing vvvs = vector<vvs>;\\nusing vld = vector<ld>;\\nusing vvld = vector<vld>;\\nusing vvvld = vector<vvld>;\\nusing vc = vector<char>;\\nusing vvc = vector<vc>;\\nusing vvvc = vector<vvc>;\\nusing pll = pair<ll,ll>;\\nusing vpll = vector<pll>;\\ntemplate<class... T>\\nconstexpr auto min(T... a){\\n return min(initializer_list<common_type_t<T...>>{a...});\\n}\\ntemplate<class... T>\\nconstexpr auto max(T... a){\\n return max(initializer_list<common_type_t<T...>>{a...});\\n}\\ntemplate<class... T>\\nvoid input(T&... a){\\n (cin >> ... >> a);\\n}\\nll modpow(ll a,ll b,ll c){\\n ll ans = 1;\\n while (b){\\n if (b & 1){\\n ans *= a;\\n ans %= c;\\n }\\n a *= a;\\n a %= c;\\n b /= 2;\\n }\\n return ans;\\n}\\n#define INT(...) int __VA_ARGS__; input(__VA_ARGS__)\\n#define LL(...) ll __VA_ARGS__; input(__VA_ARGS__)\\n#define ULL(...) ull __VA_ARGS__; input(__VA_ARGS__)\\n#define LD(...) ld __VA_ARGS__; input(__VA_ARGS__)\\n#define STR(...) string __VA_ARGS__; input(__VA_ARGS__)\\n#define CHA(...) char __VA_ARGS__; input(__VA_ARGS__)\\n#define VLL(name,length) vll name(length);rep(i,length){cin >> name[i];}\\n#define VVLL(name,h,w) vvll name(h,vll(w));rep(i,h)rep(j,w){cin >> name[i][j];}\\n#define VVVLL(name,a,b,c) vvvll name(a,vvll(b,vll(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}\\n#define VI(name,length) vi name(length);rep(i,length){cin >> name[i];}\\n#define VVI(name,h,w) vvi name(h,vi(w));rep(i,h)rep(j,w){cin >> name[i][j];}\\n#define VVVI(name,a,b,c) vvvi name(a,vvll(b,vi(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}\\n#define VLD(name,length) vld name(length);rep(i,length){cin >> name[i];}\\n#define VVLD(name,h,w) vvld name(h,vld(w));rep(i,h)rep(j,w){cin >> name[i][j];}\\n#define VVVLD(name,a,b,c) vvvld name(a,vvld(b,vld(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}\\n#define VC(name,length) vc name(length);rep(i,length){cin >> name[i];}\\n#define VVC(name,h,w) vvc name(h,vc(w));rep(i,h)rep(j,w){cin >> name[i][j];}\\n#define VVVC(name,a,b,c) vvvc name(a,vvc(b,vc(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}\\n#define VS(name,length) vs name(length);rep(i,length){cin >> name[i];}\\n#define VVS(name,h,w) vvs name(h,vs(w));rep(i,h)rep(j,w){cin >> name[i][j];}\\n#define VVVS(name,a,b,c) vvvs name(a,vvs(b,vs(c)));rep(i,a)rep(j,b)rep(k,c){cin >> name[i][j][k];}\\n#define PLL(name) pll name;cin>>name.first>>name.second;\\n#define VPLL(name,length) vpll name(length);rep(i,length){cin>>name[i].first>>name[i].second;}\\n\\nvoid print(){cout << \\\"\\\\n\\\";}\\ntemplate<class T, class... Ts>\\nvoid print(const T& a, const Ts&... b){cout << a;(cout << ... << (cout << ' ', b));cout << '\\\\n';}\\nvoid print(vll x){rep(i,len(x)){cout << x[i];if(i!=len(x)-1){cout << \\\" \\\";}else{cout << '\\\\n';}}}\\nvoid print(vvll x){rep(i,len(x))rep(j,len(x[i])){cout << x[i][j];if(j!=len(x[i])-1){cout << \\\" \\\";}else{cout << '\\\\n';}}}\\n\\n\\n\\nvoid solve(ll n,ll o,vpll a){\\n ll m = n*(n-1)/2;\\n vvll b(n,vll(n,-1));\\n rep(i,o){\\n auto [x,y] = a[i];\\n x--;\\n y--;\\n b[x][y] = 1;\\n b[y][x] = 0;\\n }\\n vpll c;\\n rep(x,n){\\n rep(y,x+1,n){\\n c.push_back({x,y});\\n }\\n }\\n map<vector<ll>,ll> mp1,mp2;\\n ll l = m/2;\\n rep(i,(1<<l)){\\n vll temp(n,0);\\n ll check = 1;\\n rep(j,l){\\n auto [x,y] = c[j];\\n if((((i >> j) & 1) == 0 && b[x][y] == 1) || (((i >> j) & 1) == 1 && b[x][y] == 0)){\\n check = 0;\\n break;\\n }\\n if(((i >> j) & 1) == 0){\\n temp[y]++;\\n }\\n else{\\n temp[x]++;\\n }\\n }\\n if(!check){continue;}\\n\\n\\n mp1[temp]++;\\n }\\n\\n l = m - m/2;\\n\\n rep(i,(1<<l)){\\n vll temp(n,0);\\n ll check = 1;\\n rep(j,l){\\n auto [x,y] = c[j + m/2];\\n if((((i >> j) & 1) == 0 && b[x][y] == 1) || (((i >> j) & 1) == 1 && b[x][y] == 0)){\\n check = 0;\\n break;\\n }\\n if(((i >> j) & 1) == 0){\\n temp[y]++;\\n }\\n else{\\n temp[x]++;\\n }\\n }\\n if(!check){continue;}\\n \\n mp2[temp]++;\\n }\\n ll ans = 0;\\n for(auto [key,value]:mp1){\\n vll temp(n,n/2);\\n rep(i,n){\\n temp[i] -= key[i];\\n }\\n \\n ans += mp2[temp] * value;\\n }\\n print(ans);\\n return;\\n}\\n\\n\\nint main(){\\n while(1){\\n LL(n);\\n if(n == 0){return 0;}\\n LL(m);\\n VPLL(a,m);\\n solve(n,m,a);\\n //break;\\n }\\n \\n}\",\n \"accuracy\": 1,\n \"time_ms\": 420,\n \"memory_kb\": 14208,\n \"score_of_the_acc\": -1.0808,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1627_10235630\",\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;\\nll myceil(ll a, ll b) {return (a+b-1)/b;}\\n\\nint n;\\nvector<vector<int>> v(9,vector<int> (9));\\nvector<int> win(9);\\nvector<int> lose(9);\\nll ans;\\n\\n\\nvoid f(int a, int b) {\\n\\tint na,nb;\\n\\n\\t// cout << a << ' ' << b << endl;\\n\\n\\tif (a == n-1) {\\n\\t\\trep(i,n) {\\n\\t\\t\\tif (win[i] != n/2 || lose[i] != n/2) {\\n\\t\\t\\t\\tbreak;\\n\\t\\t\\t} \\n\\t\\t\\tif (i == n-1) ans++;\\n\\t\\t}\\n\\t\\treturn;\\n\\t}\\n\\n\\tif (b == n-1) {\\n\\t\\tna = a+1;\\n\\t\\tnb = na+1;\\n\\t}\\n\\telse {\\n\\t\\tna = a;\\n\\t\\tnb = b+1;\\n\\t}\\n\\n\\t// cout << na << ' ' << nb << endl;\\n\\n\\n\\tif (v[a][b] == -1) {\\n\\t\\twin[a]++;\\n\\t\\tlose[b]++;\\n\\t\\tif (win[a] <= n/2 && lose[b] <= n/2) f(na,nb);\\n\\t\\twin[a]--;\\n\\t\\tlose[b]--;\\n\\n\\t\\twin[b]++;\\n\\t\\tlose[a]++;\\n\\t\\tif (win[b] <= n/2 && lose[a] <= n/2) f(na,nb);\\n\\t\\twin[b]--;\\n\\t\\tlose[a]--;\\n\\t}\\n\\telse {\\n\\t\\tf(na,nb);\\n\\t}\\n\\n\\treturn;\\n}\\n\\n\\n\\nvoid solve() {\\n\\tint m;\\n\\tcin >> m;\\n\\trep(i,n) {\\n\\t\\trep(j,n) {\\n\\t\\t\\tv[i][j] = -1;\\n\\t\\t}\\n\\t}\\n\\trep(i,9) {\\n\\t\\twin[i] = 0;\\n\\t\\tlose[i] = 0;\\n\\t}\\n\\n\\tint a,b;\\n\\trep(i,m) {\\n\\t\\tcin >> a >> b;\\n\\t\\ta--;\\n\\t\\tb--;\\n\\t\\tv[a][b] = 1;\\n\\t\\tv[b][a] = 0;\\n\\t\\twin[a]++;\\n\\t\\tlose[b]++;\\n\\n\\n\\t}\\n\\n\\tans = 0;\\n\\n\\tf(0,1);\\n\\n\\n\\tcout << ans << endl;\\n\\treturn;\\n}\\n\\n\\n\\nint main() {\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n\\n\\twhile (cin >> n && n != 0) {\\n\\t\\tsolve();\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 70,\n \"memory_kb\": 3340,\n \"score_of_the_acc\": -0.0066,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1627_10235611\",\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;\\nll myceil(ll a, ll b) {return (a+b-1)/b;}\\n\\nint n;\\nvector<vector<int>> v(9,vector<int> (9));\\nvector<int> win(9);\\nvector<int> lose(9);\\nll ans;\\n\\n\\nvoid f(int a, int b) {\\n\\tint na,nb;\\n\\n\\t// cout << a << ' ' << b << endl;\\n\\n\\tif (a == n-1) {\\n\\t\\tans++;\\n\\t\\treturn;\\n\\t}\\n\\n\\tif (b == n-1) {\\n\\t\\tna = a+1;\\n\\t\\tnb = na+1;\\n\\t}\\n\\telse {\\n\\t\\tna = a;\\n\\t\\tnb = b+1;\\n\\t}\\n\\n\\t// cout << na << ' ' << nb << endl;\\n\\n\\n\\tif (v[a][b] == -1) {\\n\\t\\twin[a]++;\\n\\t\\tlose[b]++;\\n\\t\\tif (win[a] <= n/2 && lose[b] <= n/2) f(na,nb);\\n\\t\\twin[a]--;\\n\\t\\tlose[b]--;\\n\\n\\t\\twin[b]++;\\n\\t\\tlose[a]++;\\n\\t\\tif (win[b] <= n/2 && lose[a] <= n/2) f(na,nb);\\n\\t\\twin[b]--;\\n\\t\\tlose[a]--;\\n\\t}\\n\\telse {\\n\\t\\tif (win[a] <= n/2 && lose[a] <= n/2 && win[b] <= n/2 && lose[b] <= n/2) {\\n\\t\\t\\tf(na,nb);\\n\\t\\t}\\n\\t}\\n\\n\\treturn;\\n}\\n\\n\\n\\nvoid solve() {\\n\\tint m;\\n\\tcin >> m;\\n\\trep(i,n) {\\n\\t\\trep(j,n) {\\n\\t\\t\\tv[i][j] = -1;\\n\\t\\t}\\n\\t}\\n\\trep(i,9) {\\n\\t\\twin[i] = 0;\\n\\t\\tlose[i] = 0;\\n\\t}\\n\\n\\tint a,b;\\n\\trep(i,m) {\\n\\t\\tcin >> a >> b;\\n\\t\\ta--;\\n\\t\\tb--;\\n\\t\\tv[a][b] = 1;\\n\\t\\tv[b][a] = 0;\\n\\t\\twin[a]++;\\n\\t\\tlose[b]++;\\n\\n\\n\\t}\\n\\n\\tans = 0;\\n\\n\\tf(0,1);\\n\\n\\n\\tcout << ans << endl;\\n\\treturn;\\n}\\n\\n\\n\\nint main() {\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n\\n\\twhile (cin >> n && n != 0) {\\n\\t\\tsolve();\\n\\t}\\n\\treturn 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3372,\n \"score_of_the_acc\": -0.0073,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1627_10235597\",\n \"code_snippet\": \"// (◕ᴗ◕✿)\\n\\n// #pragma GCC target(\\\"avx2\\\")\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#include <bits/stdc++.h>\\n#define rep(i, n) for (ll i = 0; i < (n); i++)\\n#define srep(i, s, n) for (ll i = s; i < (n); i++)\\n#define len(x) ((int)(x).size())\\n#define all(x) (x).begin(), (x).end()\\nusing namespace std;\\ntemplate<typename T> using vc = vector<T>;\\ntemplate<typename T> using vv = vc<vc<T>>;\\ntemplate<typename T> using vvv = vv<vc<T>>;\\nusing vi = vc<int>;using vvi = vv<int>; using vvvi = vv<vi>;\\nusing ll = long long;using vl = vc<ll>;using vvl = vv<ll>; using vvvl = vv<vl>;\\nusing ld = long double; using vld = vc<ld>; using vvld = vc<vld>; using vvvld = vc<vvld>;\\nusing uint = unsigned int;\\nusing ull = unsigned long long;\\nconst ld pi = acos(-1.0);\\nconst int inf = 0x3f3f3f3f;\\nconst ll INF = 0x3f3f3f3f3f3f3f3f;\\n// const ll mod = 1000000007;\\nconst ll mod = 998244353;\\ninline bool inside(ll y, ll x, ll H, ll W) {return 0 <= (y) and (y) < (H) and 0 <= (x) and (x) < (W); }\\n\\n#define debug(var) do{std::cout << #var << \\\" : \\\\n\\\";view(var);}while(0)\\ntemplate<typename T> void view(T e){cout << e << endl;}\\ntemplate<typename T> void view(const vc<T>& v){for(const auto& e : v){ cout << e << \\\" \\\"; } cout << endl;}\\ntemplate<typename T> void view(const vv<T>& vv){ for(const auto& v : vv){ view(v); } }\\n\\nint N;\\nint winlose[9 * 9];\\nint win[9], lose[9];\\n\\nint f(int i, int j){\\n // cout << i << \\\" \\\" << j << endl;\\n // rep(ni, N) cout << win[ni] << \\\" \\\";\\n // cout << endl;\\n // rep(ni, N) cout << lose[ni] << \\\" \\\";\\n // cout << endl;\\n if (i == N - 1) return 1;\\n int ret = 0;\\n if (winlose[i * N + j] != 0){\\n win[i]++;\\n lose[j]++;\\n if (win[i] <= N / 2 && lose[j] <= N / 2){\\n int ni = i, nj = j + 1;\\n if (nj == N){\\n ni++;\\n nj = ni + 1;\\n }\\n ret += f(ni, nj);\\n }\\n win[i]--;\\n lose[j]--;\\n }\\n if (winlose[i * N + j] != 1){\\n win[j]++;\\n lose[i]++;\\n if (win[j] <= N / 2 && lose[i] <= N / 2){\\n int ni = i, nj = j + 1;\\n if (nj == N){\\n ni++;\\n nj = ni + 1;\\n }\\n ret += f(ni, nj);\\n }\\n win[j]--;\\n lose[i]--;\\n }\\n return ret;\\n}\\nvoid solve(){\\n int M; cin >> M;\\n rep(i, M){\\n int x, y; cin >> x >> y; x--; y--;\\n if (x < y) winlose[x * N + y] = 1;\\n else winlose[y * N + x] = 0;\\n }\\n cout << f(0, 1) << endl;\\n}\\n\\nint main(){\\n while (true){\\n cin >> N;\\n if (N == 0) break;\\n rep(i, N * N) winlose[i] = -1;\\n rep(i, N){\\n win[i] = 0;\\n lose[i] = 0;\\n }\\n solve();\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 60,\n \"memory_kb\": 3316,\n \"score_of_the_acc\": -0.0022,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1627_9769611\",\n \"code_snippet\": \"#if !defined(__clang__) && defined(__GNUC__)\\n#include <bits/stdc++.h>\\n#pragma GCC optimize(\\\"O3,unroll-loops\\\")\\n#ifdef ONLINE_JUDGE\\n#pragma GCC target(\\\"avx2,fma,popcnt,bmi,bmi2\\\")\\n#endif\\n#elif defined(__clang__)\\n#include <algorithm>\\n#include <bitset>\\n#include <cassert>\\n#include <chrono>\\n#include <cmath>\\n#include <complex>\\n#include <deque>\\n#include <fstream>\\n#include <functional>\\n#include <iomanip>\\n#include <iostream>\\n#include <limits>\\n#include <map>\\n#include <numeric>\\n#include <queue>\\n#include <random>\\n#include <set>\\n#include <sstream>\\n#include <stack>\\n#include <string>\\n#include <tuple>\\n#include <unordered_map>\\n#include <unordered_set>\\n#include <vector>\\n#else\\n#error \\\"We don't know this compiler lol\\\"\\n#endif\\n#if __has_include(<atcoder/all>)\\n#include <atcoder/all>\\nusing namespace atcoder;\\nstd::ostream &operator<<(std::ostream &os, const modint998244353 &a) {\\n return os << a.val();\\n}\\nstd::ostream &operator<<(std::ostream &os, const modint1000000007 &a) {\\n return os << a.val();\\n}\\nstd::istream &operator>>(std::istream &is, modint998244353 &a) {\\n long long t;\\n is >> t;\\n a = t;\\n return is;\\n}\\nstd::istream &operator>>(std::istream &is, modint1000000007 &a) {\\n long long t;\\n is >> t;\\n a = t;\\n return is;\\n}\\n#endif\\nusing namespace std;\\n// # Type Aliases\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing ld = long double;\\ntemplate <class T>\\nusing V = vector<T>;\\ntemplate <class T, class U>\\nusing P = pair<T, U>;\\ntemplate <class T>\\nusing max_heap = priority_queue<T>;\\ntemplate <class T>\\nusing min_heap = priority_queue<T, vector<T>, greater<T>>;\\n// # Repeat Macros\\n#define OVERLOADER(_1, _2, _3, NAME, ...) NAME\\n#define REP2(i, a, b) for (ll i = (a); i < (ll)(b); ++i)\\n#define REP(i, n) REP2(i, 0, n)\\n#define rep(...) OVERLOADER(__VA_ARGS__, REP2, REP)(__VA_ARGS__)\\n#define repd(i, a, b) for (ll i = (ll)(b) - 1; i >= (ll)(a); --i)\\n// # Abbreviation Macros\\n#define pb push_back\\n#define eb emplace_back\\n#define ALL(a) begin(a), end(a)\\n#define RALL(a) a.rbegin(), a.rend()\\n// # Fast IO and IO Settings\\nstruct IO_Setting {\\n IO_Setting() {\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n cout << fixed << setprecision(15);\\n cerr << fixed << setprecision(3);\\n }\\n} io_setting;\\n// # Input Overloads\\ntemplate <class T, class U>\\nistream &operator>>(istream &is, P<T, U> &p) {\\n return is >> p.first >> p.second;\\n}\\ntemplate <class T>\\nistream &operator>>(istream &is, V<T> &v) {\\n for (T &e : v) is >> e;\\n return is;\\n}\\n// # Output Overloads\\ntemplate <class T, class U>\\nostream &operator<<(ostream &os, const P<T, U> &p) {\\n return os << p.first << ' ' << p.second;\\n}\\ntemplate <class T>\\nostream &operator<<(ostream &os, const V<T> &v) {\\n int ss = v.size();\\n rep(ii, ss) { os << v[ii] << (ii + 1 == ss ? \\\"\\\" : \\\" \\\"); }\\n return os;\\n}\\n// # Function Definition\\ntemplate <class T>\\nT sq(T x) {\\n return x * x;\\n}\\ntemplate <class T, class U>\\ninline bool chmin(T &a, U b) {\\n if (a > b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\ntemplate <class T, class U>\\ninline bool chmax(T &a, U b) {\\n if (a < b) {\\n a = b;\\n return 1;\\n }\\n return 0;\\n}\\nll max(ll lhs, ll rhs) { return std::max<ll>(lhs, rhs); }\\nll min(ll lhs, ll rhs) { return std::min<ll>(lhs, rhs); }\\nll ceil_div(ll a, ll b) { return a / b + ((a ^ b) >= 0 && a % b); }\\nll floor_div(ll a, ll b) { return a / b - ((a ^ b) < 0 && a % b); }\\ntemplate <class Container>\\nContainer reversed(const Container &v) {\\n return Container(v.rbegin(), v.rend());\\n}\\ntemplate <class Container>\\nContainer sorted(const Container &v, bool rev = false) {\\n Container r = v;\\n rev ? sort(r.rbegin(), r.rend()) : sort(r.begin(), r.end());\\n return r;\\n}\\ntemplate <class T>\\nvoid uniqify(V<T> &v) {\\n v.erase(unique(ALL(v)), v.end());\\n}\\ntemplate <class T>\\nV<T> compress(V<T> &v) {\\n V<T> vals = v;\\n sort(ALL(vals));\\n uniqify(vals);\\n rep(i, v.size()) v[i] = lower_bound(ALL(vals), v[i]) - vals.begin();\\n return vals;\\n}\\ntemplate <class T>\\nV<T> sum_array(const V<T> &v) {\\n int n = v.size();\\n V<T> sum(n + 1);\\n rep(i, n) sum[i + 1] = sum[i] + v[i];\\n return sum;\\n}\\ntemplate <class T>\\ninline void drop(T &&x) {\\n cout << x << endl;\\n exit(0);\\n}\\ninline void yesno(bool f) { cout << (f ? \\\"Yes\\\" : \\\"No\\\") << '\\\\n'; }\\n// # Constant Definition\\nconstexpr char ENDL = '\\\\n';\\nconstexpr ll INF = (1LL << 30) - 1; // 問題毎にfit\\nconstexpr ll INFLL = (1LL << 62) - 1; // 問題毎にfit\\nconst ld PI = acos(static_cast<long double>(-1));\\nconstexpr int dy[] = {0, 1, 0, -1};\\nconstexpr int dx[] = {1, 0, -1, 0};\\n// constexpr int dy[]={0, 1, 1, 1, 0, -1, -1, -1};\\n// constexpr int dx[]={1, 1, 0, -1, -1, -1, 0, 1};\\n// # Debug Macro\\n#ifdef LOCAL\\n// #include \\\"CP-library/debug_print.hpp\\\"\\n// #define debug(...) debug_impl(__LINE__, __VA_ARGS__)\\n// #define debug_impl(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)\\n#include \\\"cpp-dump/cpp-dump.hpp\\\"\\n#define dump(...) cpp_dump(__VA_ARGS__)\\n#if __has_include(<atcoder/modint>)\\n#include <atcoder/modint>\\nnamespace cpp_dump::_detail {\\ntemplate <int m>\\ninline std::string export_var(const atcoder::static_modint<m> &mint,\\n const std::string &indent,\\n std::size_t last_line_length,\\n std::size_t current_depth, bool fail_on_newline,\\n const export_command &command) {\\n return export_var(mint.val(), indent, last_line_length, current_depth,\\n fail_on_newline, command);\\n}\\ntemplate <int m>\\ninline std::string export_var(const atcoder::dynamic_modint<m> &mint,\\n const std::string &indent,\\n std::size_t last_line_length,\\n std::size_t current_depth, bool fail_on_newline,\\n const export_command &command) {\\n return export_var(mint.val(), indent, last_line_length, current_depth,\\n fail_on_newline, command);\\n}\\n} // namespace cpp_dump::_detail\\n#endif // __has_include(<atcoder/modint>)\\nnamespace cp = cpp_dump;\\nCPP_DUMP_SET_OPTION_GLOBAL(max_line_width, 100);\\nCPP_DUMP_SET_OPTION_GLOBAL(log_label_func, cp::log_label::line());\\n// CPP_DUMP_DEFINE_EXPORT_OBJECT(Type, properties..., methods...);\\n#define INLOCALDO(...) \\\\\\n do { \\\\\\n __VA_ARGS__ \\\\\\n } while (false)\\n#else\\n#define debug(...)\\n#define dump(...)\\n#define INLOCAL(...)\\n#endif\\n// using mint = modint1000000007;\\n// using mint = modint998244353;\\n\\nint main() {\\n while (true) {\\n ll n;\\n cin >> n;\\n if (n == 0) break;\\n ll m;\\n cin >> m;\\n array<array<int, 9>, 9> res{};\\n rep(i, n) rep(j, n) res[i][j] = -1;\\n rep(i, m) {\\n ll x, y;\\n cin >> x >> y;\\n x--;\\n y--;\\n int b = 1;\\n if (x > y) swap(x, y), b = 1 - b;\\n res[x][y] = b;\\n }\\n using Arr = array<ll, 9>;\\n using mp = map<array<ll, 9>, ll>;\\n mp dp;\\n ll rem = n * (n - 1) / 2;\\n auto ok = [&n, &rem](const Arr& arr) -> bool {\\n ll mx = *std::max_element(ALL(arr));\\n ll def = 0;\\n rep(i, n) def += mx - arr[i];\\n return def <= rem;\\n };\\n dp[{0, 0, 0, 0, 0, 0, 0, 0, 0}] = 1;\\n {\\n int i = 0, j = 1;\\n while (i != n - 1) {\\n // dump(i, j, dp.size());\\n mp ndp;\\n rem--;\\n for (auto p : dp) {\\n auto arr = p.first;\\n auto val = p.second;\\n // i が かつ\\n if (res[i][j] != 0) {\\n arr[i]++;\\n if(ok(arr)) ndp[arr] += val;\\n arr[i]--;\\n }\\n // i が j に負ける\\n if (res[i][j] != 1) {\\n arr[j]++;\\n if(ok(arr)) ndp[arr] += val;\\n arr[j]--;\\n }\\n }\\n swap(ndp, dp);\\n\\n j++;\\n if (j == n) {\\n i++;\\n j = i + 1;\\n }\\n }\\n }\\n ll ans = 0;\\n for (auto [key, val] : dp) {\\n bool f = true;\\n rep(i, n - 1) {\\n if(key[i] != key[i+1]) f = false;\\n }\\n if(f) ans += val;\\n }\\n cout << ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 150,\n \"memory_kb\": 10428,\n \"score_of_the_acc\": -0.6748,\n \"final_rank\": 18\n }\n]","isConversational":false}}},{"rowIdx":999,"cells":{"group_id":{"kind":"string","value":"aoj_1626_cpp"},"problem_description":{"kind":"string","value":"Skyscraper \"MinatoHarukas\"\nMr. Port plans to start a new business renting one or more floors\nof the new skyscraper with one giga floors, MinatoHarukas.\n \nHe wants to rent as many vertically adjacent floors as possible, \nbecause he wants to show advertisement on as many vertically\nadjacent windows as possible.\n\nThe rent for one floor is proportional to the floor number,\nthat is, the rent per month for the\nn\n-th floor is\nn\ntimes\nthat of the first floor.\nHere, the ground floor is called the first floor in the American style,\nand basement floors are out of consideration for the renting.\n\nIn order to help Mr. Port, you should write a program that computes\nthe vertically adjacent floors satisfying his requirement and\nwhose total rental cost per month is\nexactly equal\nto his budget.\nFor example, when his budget is 15 units, \nwith one unit being the rent of the first floor,\nthere are four possible rent plans,\n1+2+3+4+5, 4+5+6, 7+8, and 15. \nFor all of them, the sums are equal to 15.\nOf course in this example the rent of maximal number of the floors \nis that of 1+2+3+4+5, that is, the rent from the first floor to the fifth floor.\nInput\nThe input consists of multiple datasets,\neach in the following format.\nb\nA dataset consists of one line,\nthe budget of Mr. Port\nb\nas multiples of the rent of the first floor.\nb\nis a positive integer satisfying 1 <\nb\n< 10\n9\n.\nThe end of the input is indicated by a line containing a zero.\nThe number of datasets does not exceed 1000.\nOutput\nFor each dataset, output a single line containing two positive integers\nrepresenting the plan with the maximal number of vertically adjacent floors\nwith its rent price exactly equal to the budget of Mr. Port.\nThe first should be the lowest floor number and\nthe second should be the number of floors.\nSample Input\n15\n16\n2\n3\n9699690\n223092870\n847288609\n900660121\n987698769\n999999999\n0\nOutput for the Sample Input\n1 5\n16 1\n2 1\n1 2\n16 4389\n129 20995\n4112949 206\n15006 30011\n46887 17718\n163837 5994"},"candidates":{"kind":"list like","value":[{"submission_id":"aoj_1626_10867577","code_snippet":"#include<bits/stdc++.h>\nusing namespace std ;\nint ans , p , n ;\nvoid deal( int x ){\n if ( ( n / x ) % 2 == 1 ){\n int y = x - ( n / x ) / 2 ;\n if ( y > 0 ){\n if ( n / x > ans ){\n ans = n / x ;\n p = y ;\n }\n }\n }\n if ( x > 1 && x % 2 == 1 ){\n int y = x / 2 - n / x + 1 ;\n if ( 2 * n / x > ans && y > 0 ){\n ans = 2 * n / x ;\n p = y ;\n }\n }\n}\nint main(){\n while( 1 ){\n scanf( \"%d\" , &n ) ;\n if ( n == 0 ) break ;\n ans = 0 ; p = 0 ;\n for( int i = 1 ; i <= sqrt( n ) ; i++ ){\n if ( n % i == 0 ){\n deal( i ) ; deal( n / i ) ;\n }\n }\n printf( \"%d %d\\n\" , p , ans ) ;\n }\n return 0 ;\n}","accuracy":1,"time_ms":40,"memory_kb":3508,"score_of_the_acc":-0.8031,"final_rank":13},{"submission_id":"aoj_1626_10676087","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nvoid solve(ll b){\n pair<ll,ll> ans;\n\n for (ll i = 1; i*i <= 2*b; i++){\n if (2*b%i)continue;\n\n ll n = i;\n ll m = 2*b / n;\n if ((m-n+1)%2)continue;\n\n ll l = (m-n+1)/2;\n ans.first = l;\n ans.second = i;\n }\n cout << ans.first << ' ' << ans.second << endl;\n}\n\nint main(){\n ll b;cin >> b;\n while(b){\n solve(b);\n cin >> b;\n }\n}","accuracy":1,"time_ms":80,"memory_kb":3436,"score_of_the_acc":-0.6212,"final_rank":8},{"submission_id":"aoj_1626_10643907","code_snippet":"#pragma GCC target(\"avx\")\n#pragma GCC optimize(\"O3\")\n#pragma GCC optimize(\"unroll-loops\")\n#include<bits/stdc++.h>\n#define fast std::ios::sync_with_stdio(false); std::cin.tie(nullptr); std::cout.tie(nullptr)\n#define eb emplace_back\n#define mp make_pair\n#define all(x) (x).begin(), (x).end()\nusing namespace std;\nusing ll = long long;\nusing u64 = uint64_t;\nusing u128 = __uint128_t;\nusing ull = unsigned long long;\nconstexpr ll inf = 2e18;\nconstexpr ll mod = 998244353;\n#ifdef LOCAL\n#define debug(x) std::cerr << #x << \" = \" << (x) << std::endl;\n#else\n#define debug(x)\n#endif\nstatic void judge(bool c) {\n std::cout << (c ? \"Yes\" : \"No\") << '\\n';\n}\n\n\nll b;\nll isok(ll x){\n if(x * x > b) return 0;\n ll c = b - x * x;\n if(c % x) return 0;\n c /= x;\n c++;\n if(c % 2) return 0;\n c /= 2;\n assert(x * x + (2 * c - 1) * x == b);\n return c;\n}\nint main() {\n fast;\n while(1){\n ll ans = -1,st = -1;\n cin >> b;\n b *= 2;\n if(b == 0) return 0;\n for(ll i = 1; i * i <= b; i++){\n if(b % i == 0){\n if(isok(i)) ans = max(ans,i),st = isok(i);\n }\n }\n assert(ans != -1 && st != -1);\n cout << st << \" \"<< ans << endl;\n }\n}","accuracy":1,"time_ms":80,"memory_kb":3384,"score_of_the_acc":-0.4783,"final_rank":4},{"submission_id":"aoj_1626_10639591","code_snippet":"// C++ includes used for precompiling -*- C++ -*-\n// Copyright (C) 2003-2013 Free Software Foundation, Inc.\n//\n// This file is part of the GNU ISO C++ Library. This library is free\n// software; you can redistribute it and/or modify it under the\n// terms of the GNU General Public License as published by the\n// Free Software Foundation; either version 3, or (at your option)\n// any later version.\n// This library is distributed in the hope that it will be useful,\n// but WITHOUT ANY WARRANTY; without even the implied warranty of\n// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\n// GNU General Public License for more details.\n// Under Section 7 of GPL version 3, you are granted additional\n// permissions described in the GCC Runtime Library Exception, version\n// 3.1, as published by the Free Software Foundation.\n// You should have received a copy of the GNU General Public License and\n// a copy of the GCC Runtime Library Exception along with this program;\n// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see\n// <http://w...content-available-to-author-only...u.org/licenses/>.\n/** @file stdc++.h\n * This is an implementation file for a precompiled header.\n */\n// 17.4.1.2 Headers\n// C\n#ifndef _GLIBCXX_NO_ASSERT\n#include <cassert>\n#endif\n#include <cctype>\n#include <cerrno>\n#include <cfloat>\n#include <ciso646>\n#include <climits>\n#include <clocale>\n#include <cmath>\n#include <csetjmp>\n#include <csignal>\n#include <cstdarg>\n#include <cstddef>\n#include <cstdio>\n#include <cstdlib>\n#include <cstring>\n#include <ctime>\n#if __cplusplus >= 201103L\n#include <ccomplex>\n#include <cfenv>\n#include <cinttypes>\n#include <cstdbool>\n#include <cstdint>\n#include <ctgmath>\n#include <cwchar>\n#include <cwctype>\n#endif\n// C++\n#include <algorithm>\n#include <bitset>\n#include <complex>\n#include <deque>\n#include <exception>\n#include <fstream>\n#include <functional>\n#include <iomanip>\n#include <ios>\n#include <iosfwd>\n#include <iostream>\n#include <istream>\n#include <iterator>\n#include <limits>\n#include <list>\n#include <locale>\n#include <map>\n#include <memory>\n#include <new>\n#include <numeric>\n#include <ostream>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <stack>\n#include <stdexcept>\n#include <streambuf>\n#include <string>\n#include <typeinfo>\n#include <utility>\n#include <valarray>\n#include <vector>\n#if __cplusplus >= 201103L\n#include <array>\n#include <atomic>\n#include <chrono>\n#include <condition_variable>\n#include <forward_list>\n#include <future>\n#include <initializer_list>\n#include <mutex>\n#include <random>\n#include <ratio>\n#include <regex>\n#include <scoped_allocator>\n#include <system_error>\n#include <thread>\n#include <tuple>\n#include <type_traits>\n#include <typeindex>\n#include <unordered_map>\n#include <unordered_set>\n\n#endif\nusing namespace std;\nusing ll = long long;\nusing ull = unsigned long long;\nusing uint = unsigned int;\n#define rep(i, n) for (int i = 0; i < n; i++)\n#define all(v) v.begin(), v.end()\ntemplate <class T, class U>\ninline bool chmax(T &a, U b) {\n if (a < b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T, class U>\ninline bool chmin(T &a, U b) {\n if (a > b) {\n a = b;\n return true;\n }\n return false;\n}\ntemplate <class T>\ninline void compress(vector<T> &a) {\n sort(a.begin(), a.end());\n a.erase(unique(a.begin(), a.end()), a.end());\n}\ntemplate <class T>\nT rand(T l, T r) {\n static mt19937 mt(random_device{}());\n // [l, r)\n if constexpr (is_integral_v<T>) {\n return uniform_int_distribution<T>(l, r - 1)(mt);\n } else if constexpr (is_floating_point_v<T>) {\n return uniform_real_distribution<T>(l, r)(mt);\n }\n}\nconstexpr int INF = 1001001001;\nconstexpr ll llINF = 3000000000000000010;\nstruct linear_sieve {\n vector<int> least_factor, prime_list;\n linear_sieve(int n) : least_factor(n + 1, 0) {\n for (int i = 2; i <= n; i++) {\n if (least_factor[i] == 0) {\n least_factor[i] = i;\n prime_list.push_back(i);\n }\n for (int p : prime_list) {\n if (ll(i) * p > n || p > least_factor[i]) break;\n least_factor[i * p] = p;\n }\n }\n }\n};\ntemplate <int modulo>\nstruct modint {\n int x;\n modint() : x(0) {}\n modint(int64_t y) : x(y >= 0 ? y % modulo : (modulo - (-y) % modulo) % modulo) {}\n modint &operator+=(const modint &p) {\n if ((x += p.x) >= modulo) x -= modulo;\n return *this;\n }\n modint &operator-=(const modint &p) {\n if ((x += modulo - p.x) >= modulo) x -= modulo;\n return *this;\n }\n modint &operator*=(const modint &p) {\n x = (int)(1LL * x * p.x % modulo);\n return *this;\n }\n modint &operator/=(const modint &p) {\n *this *= p.inv();\n return *this;\n }\n modint operator-() const { return modint(-x); }\n modint operator+(const modint &p) const { return modint(*this) += p; }\n modint operator-(const modint &p) const { return modint(*this) -= p; }\n modint operator*(const modint &p) const { return modint(*this) *= p; }\n modint operator/(const modint &p) const { return modint(*this) /= p; }\n bool operator==(const modint &p) const { return x == p.x; }\n bool operator!=(const modint &p) const { return x != p.x; }\n modint inv() const {\n int a = x, b = modulo, u = 1, v = 0, t;\n while (b > 0) {\n t = a / b;\n swap(a -= t * b, b);\n swap(u -= t * v, v);\n }\n return modint(u);\n }\n modint pow(int64_t n) const {\n modint ret(1), mul(x);\n while (n > 0) {\n if (n & 1) ret *= mul;\n mul *= mul;\n n >>= 1;\n }\n return ret;\n }\n friend ostream &operator<<(ostream &os, const modint &p) { return os << p.x; }\n friend istream &operator>>(istream &is, modint &a) {\n int64_t t;\n is >> t;\n a = modint<modulo>(t);\n return (is);\n }\n int val() const { return x; }\n static constexpr int mod() { return modulo; }\n static constexpr int half() { return (modulo + 1) >> 1; }\n};\nll extgcd(ll a, ll b, ll &x, ll &y) {\n // ax+by=gcd(|a|,|b|)\n if (a < 0 || b < 0) {\n ll d = extgcd(abs(a), abs(b), x, y);\n if (a < 0) x = -x;\n if (b < 0) y = -y;\n return d;\n }\n if (b == 0) {\n x = 1;\n y = 0;\n return a;\n }\n ll d = extgcd(b, a % b, y, x);\n y -= a / b * x;\n return d;\n}\ntemplate <typename T>\nstruct Binomial {\n vector<T> inv, fact, factinv;\n Binomial(int n) {\n inv.resize(n + 1);\n fact.resize(n + 1);\n factinv.resize(n + 1);\n inv[0] = fact[0] = factinv[0] = 1;\n for (int i = 1; i <= n; i++) fact[i] = fact[i - 1] * i;\n factinv[n] = fact[n].inv();\n inv[n] = fact[n - 1] * factinv[n];\n for (int i = n - 1; i >= 1; i--) {\n factinv[i] = factinv[i + 1] * (i + 1);\n inv[i] = fact[i - 1] * factinv[i];\n }\n }\n T C(int n, int r) {\n if (n < 0 || n < r || r < 0) return 0;\n return fact[n] * factinv[n - r] * factinv[r];\n }\n T P(int n, int r) {\n if (n < 0 || n < r || r < 0) return 0;\n return fact[n] * factinv[n - r];\n }\n T H(int n, int r) {\n if (n == 0 && r == 0) return 1;\n if (n < 0 || r < 0) return 0;\n return r == 0 ? 1 : C(n + r - 1, r);\n }\n};\ntemplate <class T>\nvector<T> dijkstra(vector<vector<pair<int, T>>> &g, vector<int> start) {\n using P = pair<T, int>;\n vector<T> dp(g.size(), numeric_limits<T>::max());\n priority_queue<P, vector<P>, greater<P>> que;\n for (int s : start) {\n dp[s] = 0;\n que.push({0, s});\n }\n while (que.size()) {\n auto [d, v] = que.top();\n que.pop();\n if (dp[v] != d) continue;\n for (auto [u, c] : g[v]) {\n if (chmin(dp[u], d + c)) que.push({dp[u], u});\n }\n }\n return dp;\n}\n\nvector<int> BFS01(vector<vector<pair<int, int>>> &g, vector<int> start) {\n vector<int> dp(g.size(), numeric_limits<int>::max());\n deque<int> que;\n for (int s : start) {\n dp[s] = 0;\n que.push_front(s);\n }\n while (que.size()) {\n auto v = que.front();\n que.pop_front();\n for (auto [u, c] : g[v]) {\n if (chmin(dp[u], dp[v] + c)) {\n if (c == 0)\n que.push_front(u);\n else\n que.push_back(u);\n }\n }\n }\n return dp;\n}\ntemplate <typename T, typename U>\ninline istream &operator>>(istream &is, pair<T, U> &rhs) {\n return is >> rhs.first >> rhs.second;\n}\ntemplate <typename T>\ninline istream &operator>>(istream &is, vector<T> &v) {\n for (auto &e : v) is >> e;\n return is;\n}\ntemplate <typename T, typename U>\ninline ostream &operator<<(ostream &os, const pair<T, U> &rhs) {\n return os << rhs.first << \" \" << rhs.second;\n}\ntemplate <typename T>\ninline ostream &operator<<(ostream &os, const vector<T> &v) {\n for (auto itr = v.begin(), end_itr = v.end(); itr != end_itr;) {\n os << *itr;\n if (++itr != end_itr) os << \" \";\n }\n return os;\n}\n\nstruct UnionFind {\n vector<int> par, siz;\n UnionFind(int x) {\n par.resize(x);\n siz.resize(x);\n for (int i = 0; i < x; i++) {\n par[i] = i;\n siz[i] = 1;\n }\n }\n int find(int x) {\n if (par[x] == x) return x;\n return par[x] = find(par[x]);\n }\n bool unite(int x, int y) {\n x = find(x), y = find(y);\n if (x == y) return false;\n if (siz[x] < siz[y]) swap(x, y);\n par[y] = x;\n siz[x] += siz[y];\n\n return true;\n }\n bool same(int x, int y) { return find(x) == find(y); }\n int size(int x) { return siz[find(x)]; }\n};\ntemplate <class T>\nstruct BIT {\n // 1-indexed\n int n, beki = 1;\n vector<T> bit;\n BIT(int x) {\n bit.resize(x + 1, 0);\n n = x;\n while (beki * 2 <= n) beki *= 2;\n }\n T sum(int i) {\n T res = 0;\n while (i > 0) {\n res += bit[i];\n i -= i & -i;\n }\n return res;\n }\n T sum(int l, int r) {\n //[l,r]\n return sum(r) - (l == 0 ? 0 : sum(l - 1));\n }\n void add(int i, T x) {\n while (i <= n) {\n bit[i] += x;\n i += i & -i;\n }\n }\n int lowerbound(T w) {\n if (w <= 0) return 0;\n int x = 0;\n for (int k = beki; k > 0; k >>= 1) {\n if (x + k <= n && bit[x + k] < w) {\n w -= bit[x + k];\n x += k;\n }\n }\n return x + 1;\n }\n};\nusing mint = modint<998244353>;\n\nvoid solve() {\n ll b;\n cin>>b;\n if(b==0){\n exit(0);\n }\n b*=2;\n ll ans1=-1,ans2=-1;\n for(ll i=1;i*i<=b;i++){\n if(b%i==0){\n ll j=b/i;\n j+=1;\n if(i%2!=j%2)continue;\n ans1=(j-i)/2,ans2=(i+j)/2;\n }\n }\n cout<<ans1<<\" \"<<ans2-ans1<<endl;\n}\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n int t = 1;\n // cin >> t;\n while (1) solve();\n}","accuracy":1,"time_ms":30,"memory_kb":3584,"score_of_the_acc":-1.0079,"final_rank":16},{"submission_id":"aoj_1626_10625065","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#if __has_include(<atcoder/all>)\n#include <atcoder/all>\nusing namespace atcoder;\n#endif\n#define ll long long\n#define vi vector<int>\n#define vvi vector<vector<int>>\n#define vvvi vector<vector<vector<int>>>\n#define vd vector<double>\n#define vvd vector<vector<double>>\n#define vvvd vector<vector<vector<double>>>\n#define vll vector<long long>\n#define vvll vector<vector<long long>>\n#define vvvll vector<vector<vector<long long>>>\n#define vmi vector<mint>\n#define vvmi vector<vector<mint>>\n#define vb vector<bool>\n#define vs vector<string>\n#define vc vector<char>\n#define vvc vector<vector<char>>\n#define pi pair<int,int>\n#define pll pair<long long, long long>\n#define vpi vector<pair<int,int>>\n#define vvpi vector<vector<pair<int,int>>>\n#define gi greater<int>\n#define gll greater<long long>\n#define gpi greater<pair<int,int>>\n#define eb emplace_back\n#define ef emplace_front\n#define pq priority_queue\n\nll sum(ll n){return n*(n+1)/2;}\n\nll largestCount(ll n){\n ll left = 0;\n ll right = LLONG_MAX;\n while(left<right){\n ll mid = right - (right - left) / 2;\n if(sum(mid)>n)right = mid - 1;\n else if(sum(mid)<n)left = mid + 1;\n else if(sum(mid)==n) return mid;\n }\n return left;\n}\n\nvoid solve() {\n while(true){\n ll n; cin >> n;\n if(n==0)return;\n ll cnt = 0;\n ll m = 0;\n for (int i=1; i<sqrt(2 * n) + 1; i++)\n {\n ll tmp = cnt;\n if (i % 2 == 0){\n cnt += (n % i == i / 2);\n }\n else{\n cnt += (n % i == 0);\n }\n if(tmp != cnt){\n m = i;\n }\n }\n if ((2 * n / m - m - 1) / 2 + 1 == 0){\n cout << 1 << ' ' << m - 1 << endl;\n }else{\n cout << (2 * n / m - m - 1) / 2 + 1 << ' ' << m << endl;\n }\n }\n}\n\nint main() {\n cin.tie(nullptr);\n ios::sync_with_stdio(false);\n solve();\n}","accuracy":1,"time_ms":90,"memory_kb":3220,"score_of_the_acc":-0.0317,"final_rank":1},{"submission_id":"aoj_1626_10625054","code_snippet":"#include <iostream>\n#include <cmath>\nusing namespace std;\n\nint main(){\n\n while(true){\n int b;\n cin >> b;\n if(b == 0) break;\n for(int i = (int)sqrt(2*b); i >= 1; i--){\n if((2*b)%i == 0 && (2*b/i - i+1)/2 >= 1 && (2*b/i - i+1)%2 == 0){\n cout << (2*b/i - i+1)/2 << \" \" << i << endl;\n break;\n }\n }\n }\n\n return 0;\n}","accuracy":1,"time_ms":10,"memory_kb":3288,"score_of_the_acc":-0.1868,"final_rank":2},{"submission_id":"aoj_1626_10624772","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#define ALL(v) (v).begin(), (v).end()\nusing ll = long long;\n\nint main() {\n while (true) {\n ll B; cin >> B;\n if (B == 0) break;\n B <<= 1;\n vector<ll> div;\n for (ll i = 1; i*i <= B; i++) {\n if (B % i == 0) {\n div.emplace_back(i);\n if (B / i != i) div.emplace_back(B / i);\n }\n }\n sort(ALL(div));\n ll len = 0;\n ll lans = -1, rans = -1;\n for (auto m : div) {\n ll x = B / m;\n for (ll i = 1; i*i <= x; i++) {\n if (x % i == 0) {\n {\n ll n = x / i;\n ll r = (i + n - 1);\n ll l = (i - n + 1);\n if ((l & 1) || (r & 1)) continue;\n l >>= 1;\n r >>= 1;\n if (1 <= l && l <= r && n > len) {\n len = n;\n lans = l;\n rans = r;\n }\n }\n {\n ll n = i;\n ll r = (x / i + n - 1);\n ll l = (x / i - n + 1);\n if ((l & 1) || (r & 1)) continue;\n l >>= 1;\n r >>= 1;\n if (1 <= l && l <= r && n > len) {\n len = n;\n lans = l;\n rans = r;\n }\n }\n }\n }\n }\n cout << lans << \" \" << len << \"\\n\";\n }\n}","accuracy":1,"time_ms":130,"memory_kb":3456,"score_of_the_acc":-0.696,"final_rank":11},{"submission_id":"aoj_1626_10620654","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)\n#define rrep(i, s, t) for(ll i = (ll)(t) - 1; i >= (ll)(s); i--)\n#define all(x) begin(x), end(x)\n#define rall(x) rbegin(x), rend(x)\n\n#define TT template<typename T>\nTT using vec = vector<T>;\ntemplate<class T1, class T2> bool chmin(T1 &x, T2 y) { return x > y ? (x = y, true) : false; }\ntemplate<class T1, class T2> bool chmax(T1 &x, T2 y) { return x < y ? (x = y, true) : false; }\n\nstruct io_setup {\n io_setup() {\n ios::sync_with_stdio(false);\n std::cin.tie(nullptr);\n cout << fixed << setprecision(15);\n }\n} io_setup;\n\nint main(){\n while(1){\n ll B;\n cin>>B;\n if(B==0)return 0;\n B*=2;\n ll nl=0,ns=0;\n for(ll d=1;d*d<=B;d++){\n if(B%d!=0)continue;\n ll e=B/d;\n if((d-e+1)%2!=0)continue;\n ll r=(d+e-1)/2;\n ll l=e-r;\n if(l<=r){\n if(chmax(ns,r-l+1)){\n nl=l;\n }\n }\n }\n cout<<nl<<\" \"<<ns<<endl;\n }\n}","accuracy":1,"time_ms":30,"memory_kb":3584,"score_of_the_acc":-1.0079,"final_rank":16},{"submission_id":"aoj_1626_10613233","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing a2 = array<ll, 2>;\nusing a3 = array<ll, 3>;\n\ntemplate <typename A> void chmin(A &l, const A &r) {\n if(r < l)\n l = r;\n}\ntemplate <typename A> void chmax(A &l, const A &r) {\n if(l < r)\n l = r;\n}\n\nll mod = 998244353;\n\nvector<char> isprime;\nvoid init() {\n isprime.assign(1000005, 1);\n isprime[0] = 0;\n isprime[1] = 0;\n for(int i = 2; i < 1000005; i++) {\n if(isprime[i]) {\n for(int j = i * 2; j < 1000005; j += i) {\n isprime[j] = 0;\n }\n }\n }\n}\n\nll n;\nvector<a2> v;\nvoid input() { cin >> n; }\n\nvoid solve() {\n ll x=n,y=1;\n for(ll i = 2; i <= 100000; i++) {\n ll a = (i + 1) * i / 2;\n\n if(a <= n && (n - a) % i == 0) {\n x = (n-a)/i + 1;\n y = i;\n }\n }\n cout << x << ' ' << y << endl;\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(0);\n\n // init();\n while(1) {\n input();\n if(n == 0)\n break;\n solve();\n }\n\n return 0;\n}","accuracy":1,"time_ms":170,"memory_kb":3460,"score_of_the_acc":-0.7228,"final_rank":12},{"submission_id":"aoj_1626_10611962","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n#include <atcoder/all>\nusing namespace atcoder;\nusing ll = long long;\nusing str = string;\nusing un = unsigned;\nusing mint = modint998244353;\nstr Y = \"Yes\", N = \"No\";\nll MOD=1e+9 + 7,MOD2=998244353;\nll fast_pow(ll a,ll b){if (b < 0)return 0;ll res = 1;while (b > 0){if (b & 1)res = (res * a) % MOD;a = (a * a) % MOD;b = b / 2;}return res % MOD;};\nll fact(ll n){if (n == 0 || n == 1)return 1;return (n * fact(n - 1)) % MOD;};\nll nCr(ll n, ll r){return ((fact(n) * fast_pow(fact(r), MOD - 2)) % MOD * fast_pow(fact(n - r), MOD - 2)) % MOD;};\nvector<bool> sieve(int n) {vector<bool> is_prime(n + 1, true);is_prime[0] = is_prime[1] = false;for (int i = 2; i * i <= n; ++i) {if (is_prime[i]) {for (int j = i * i; j <= n; j += i) {is_prime[j] = false;}}}return is_prime;};\n//#define _GLIBCXX_DEBUG\n#define rep(i, n) for (ll i = 0; i < (n); ++i)\n#define repp(i, n) for (ll i = 1; i <= (n); ++i)\ntemplate <class C>\nvoid out_single (const C& v) {cout << v;}\nvoid out_single (ostream& (*func)(ostream)) {cout << func;}\nvoid out_single (const char& v) {cout << v;}\ntemplate <class ...C>\nvoid in (C&&...v) {(cin >> ... >> v);}\ntemplate <class ...C>\nvoid out (C&&...v) {(out_single(v), ...);}\ntemplate <typename T>\nusing vec = vector<T>;\ntemplate <typename T>\nusing vec2 = vector<vec<T>>;\n#define all(a) (a).begin(), (a).end()\n#define rall(a) (a).rbegin(), (a).rend()\n#define sall(a) sort(all(a))\n#define srall(a) sort(rall(a))\nusing V = vec<ll>;\nusing P = pair<ll,ll>;\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<typename T> void print(const vector<T>& v) {for (const auto& i : v) cout << i /*<< \" \"*/; cout << endl;}\ntemplate<typename T> void print(const vector<vector<T>>& v) {for (const auto& i : v) {for (const auto& j : i) cout << j /*<< \" \"*/; cout << endl;}}\nbool is_grid (ll h, ll w, ll y, ll x) {return (0 <= y && y < h && 0 <= x && x < w);}\nint main() {\n ios_base::sync_with_stdio(false);\n cin.tie(nullptr);\n while(1){\n ll b;in(b);\n if(b==0) break;\n ll ans=0;\n for(ll i=sqrt(2*b)+2;i>0;i--){\n ll x=2*b/i-(i-1);\n if(x>0&&x%2==0&&(2*b)%i==0){\n out(x/2,\" \",i,\"\\n\");\n break;\n }\n }\n }\n}","accuracy":1,"time_ms":20,"memory_kb":3584,"score_of_the_acc":-1.004,"final_rank":15},{"submission_id":"aoj_1626_10611778","code_snippet":"#include <bits/stdc++.h>\n#define rep(i,m,n) for (int i = m; i < (n); i++)\n#define REP(i,m,n) for (int i = m; i <= (n); i++)\nusing namespace std;\nusing ll = long long;\nusing pii = pair<int,int>;\nusing vi = vector<int>;\nusing vvi = vector<vector<int>>;\nusing vl = vector<ll>;\nusing vvl = vector<vector<ll>>;\nusing vc = vector<char>;\nusing vvc = vector<vector<char>>;\nint sum(int i){\n return i * (i + 1) / 2;\n}\nint main(){\n rep(l,0,1000){\n int b;\n cin >> b;\n if (b == 0) return 0;\n int size=ceil(sqrt(b));\n pii ans = {b, 1};\n int i = 1;\n while(sum(i) <= b){\n if(sum(i)%i==b%i&&((b-sum(i))/i)<b-i){\n ans={((b-sum(i))/i)+1, i};\n }\n i++;\n }\n cout << ans.first << \" \" << ans.second << endl;\n }\n}","accuracy":1,"time_ms":40,"memory_kb":3440,"score_of_the_acc":-0.6163,"final_rank":7},{"submission_id":"aoj_1626_10611357","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\n// using mint = modint998244353;\n// using mint = modint1000000007;\nusing ll = long long;\nusing ull = unsigned long long;\n#define rep(i, n) for(ll i = 0; i < n; i++)\nconstexpr ll INF = ((1LL << 61) + (1LL << 30) - 1);\n\nint main() {\n cin.tie(nullptr);\n ios_base::sync_with_stdio(false);\n\n // 公差 1 の 1 ~ n 項目までの等差数列の総和\n auto sum = [](ll n) -> ll {\n return n * (n + 1) / 2;\n };\n\n while(true) {\n ll b;\n cin >> b;\n if(b == 0) break;\n ll start = -1, total = -1;\n for(ll w = ((ll) sqrt(b)) * 2; w >= 1; w--) {\n ll left = 1, right = 1e9;\n while(right - left > 2) {\n ll m1 = (left + right) / 2, m2 = m1 + 1;\n ll s1 = sum(m1 + w - 1) - sum(m1 - 1);\n ll s2 = sum(m2 + w - 1) - sum(m2 - 1);\n if(abs(s1 - b) < abs(s2 - b)) right = m1;\n else left = m2;\n }\n // if(w <= 10) cerr << \"w: \" << w << \", left: \" << left << \", right: \" << right << \"\\n\";\n for(ll m = left; m <= right; m++) {\n ll s = sum(m + w - 1) - sum(m - 1);\n if(s == b) {\n start = m;\n total = w;\n break;\n }\n }\n if(total != -1) break;\n }\n cout << start << \" \" << total << \"\\n\";\n }\n\n return 0;\n}","accuracy":1,"time_ms":2530,"memory_kb":3344,"score_of_the_acc":-1.3407,"final_rank":19},{"submission_id":"aoj_1626_10602971","code_snippet":"#include <bits/stdc++.h>\n#include <unordered_map>\n#include <stdlib.h>\nusing namespace std;\n#define rep(i, a, n) for(ll i = a; i < n; i++)\n#define rrep(i, a, n) for(ll i = a; i >= n; i--)\n#define ll long long\n#define pii pair<int, int>\n#define pll pair<ll, ll>\n#define all(x) (x).begin(), (x).end()\n//constexpr ll MOD = 1000000007;\nconstexpr ll MOD = 998244353;\nconstexpr int IINF = 1001001001;\nconstexpr ll INF = 1LL<<60;\ntemplate<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}\ntemplate<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}\n\n\nll gcd(ll a, ll b){\n if(a%b == 0){\n return b;\n }else{\n return gcd(b, a%b);\n }\n}\n\nll lcm(ll a, ll b){\n return a*b / gcd(a, b);\n}\n\nll powMod(ll x, ll n) {\n if (n == 0) return 1 % MOD;\n ll val = powMod(x, n / 2);\n val *= val;\n val %= MOD;\n if (n % 2 == 1) val *= x;\n return val % MOD;\n}\n\nint main() {\n while(true){\n ll n; cin >> n;\n if(n == 0) break;\n ll ans = 1;\n ll start = n;\n rep(x,2,sqrt((double)n)*2+2){\n if((2*n)%x != 0) continue;\n ll num = ((2*n)/x-x+1);\n if(num >= 1 && num%2 == 0) ans = x, start = num/2;\n }\n cout << start << \" \" << ans << endl;\n }\n return 0;\n}","accuracy":1,"time_ms":40,"memory_kb":3456,"score_of_the_acc":-0.6603,"final_rank":9},{"submission_id":"aoj_1626_10556574","code_snippet":"#line 1 \"2018C.cpp\"\n#include <bits/stdc++.h>\n#line 1 \"/home/ardririy/repos/cp-libs/libraries-cpp/input.hpp\"\n\n\n#line 6 \"/home/ardririy/repos/cp-libs/libraries-cpp/input.hpp\"\nusing namespace std;\nvector<long long> i64_vec_IN(int n) {vector<long long> res(n); for(int i=0; i<n; i++) { cin >> res[i]; } return res; }\nvector<string> str_vec_IN(int n) { vector<string> res(n); for(int i=0; i<n; i++) { cin >> res[i]; } return res; }\nvector<vector<int>> graph_IN(int n, int m) { vector<vector<int>> g(n); int u, v; for(int i=0; i<m; i++) { cin >> u >> v; u--; v--; g[u].emplace_back(v); g[v].emplace_back(u); } return g; }\nvector<vector<pair<int, long long>>> weighted_graph_IN(int n, int m) { vector<vector<pair<int, long long>>> g(n); int u, v; long long w; for(int i=0; i<m; i++) { cin >> u >> v >> w; u--; v--; g[u].push_back({v, w}); g[v].push_back({u, w}); } return g; }\n\n\n#line 3 \"2018C.cpp\"\n\nusing namespace std;\n\n// using namespace atcoder;\n\n#ifdef ADRY\n#include <dbg.h>\n#else\n// DO NOTHING\n#define dbg(...)\n#endif\n\n\n#define all(v) v.begin(),v.end()\n#define resort(v) sort(v.rbegin(),v.rend())\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>>;\nusing djks=priority_queue<P, vp, greater<P>>;\n\nconst int inf=1ll<<30;\n#define mod10 (ll)1e9+7\n#define mod99 (ll)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=(n)-1;i>=(a);--i)\n\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\nll dx[] = {1, 0, -1, 0, -1, 1, -1, 1};\nll dy[] = {0, 1, 0, -1, -1, 1, 1, -1};\n\nvll divisors(ll n) {\n vll res;\n rep2(i,1, sqrt(n)+10) {\n if(n%i==0) {\n res.emplace_back(i);\n if(i!=n/i) res.emplace_back(n/i);\n }\n }\n\n return res;\n}\n\nint solve(){\n ll b;\n cin >> b;\n\n if(b==0) return 1;\n vll div = divisors(2*b);\n P ans = {-1,-1};\n for(auto di: div) {\n ll t = 2*b/di;\n ll rhs = t+1-di;\n if(rhs<=0 || rhs%2==1) continue;\n if(chmax(ans.second, di)) {\n ans.first = rhs/2;\n }\n }\n cout << ans.first << \" \" << ans.second << '\\n';\n return 0;\n}\n\nint main() {\n cin.tie(0);\n ios::sync_with_stdio(false);\n while(!solve());\n}","accuracy":1,"time_ms":90,"memory_kb":3412,"score_of_the_acc":-0.5592,"final_rank":6},{"submission_id":"aoj_1626_10542690","code_snippet":"#include <bits/stdc++.h>\n#include <atcoder/all>\nusing namespace std;\nusing namespace atcoder;\n#define int long long\n\nint floor_sqrt(int n) {\n int ok = 0;\n int ng = (long double)(1.2)*sqrtl(n)+1;\n while (abs(ok - ng) > 1) {\n int mid = (ok + ng) / 2;\n if (mid*mid<=n) ok = mid;\n else ng = mid;\n }\n return ok;\n}\n\nvoid solve(int b) {\n b *= 2;\n int sq = floor_sqrt(b);\n pair<int, int> ans = {-1, -1};\n for (int i=1; i<=sq; ++i) {\n if (b % i != 0) continue;\n int j = b / i;\n // cout << i << \" x \" << j << \" = \" << b << endl;\n if ((j-i) % 2 == 0) continue;\n int x = (j-i+1) / 2;\n int y = j - x;\n \n //k~l階を買える\n // cout << x << \" ~ \" << y << endl;\n ans = max(ans, {y-x+1, x});\n }\n cout << ans.second << ' ' << ans.first << endl;\n}\n\nsigned main() {\n while(true) {\n int b;\n cin >> b;\n if (b == 0) break;\n solve(b);\n }\n}\n\n/*\nmemo\n\n*/","accuracy":1,"time_ms":30,"memory_kb":3584,"score_of_the_acc":-1.0079,"final_rank":16},{"submission_id":"aoj_1626_10529939","code_snippet":"#include<iostream>\n#include<vector>\nusing namespace std;\nusing ll=long long;\nll sum(ll n){return n*(n+1)/2;}\nll cost(ll a,ll n){return sum(a+n-1)-sum(a-1);}\nint main()\n{\n\tios::sync_with_stdio(false);\n\tcin.tie(nullptr);\n\twhile(1)\n\t{\n\t\tint b;cin>>b;\n\t\tif(b==0)break;\n\t\tll ans1=0,ans2=0;\n\t\tfor(ll n=1;n*(n+1)/2<=b;n++)\n\t\t{\n\t\t\tll l=0,r=b+1;\n\t\t\twhile(r-l>1)\n\t\t\t{\n\t\t\t\tll a=(l+r)/2;\n\t\t\t\tll cur=cost(a,n);\n\t\t\t\tif(cur<=b)l=a;\n\t\t\t\telse r=a;\n\t\t\t}\n\t\t\tif(cost(l,n)==b)ans1=l,ans2=n;\n\t\t}\n\t\tcout<<ans1<<\" \"<<ans2<<endl;\n\t}\n}","accuracy":1,"time_ms":1550,"memory_kb":3584,"score_of_the_acc":-1.6111,"final_rank":20},{"submission_id":"aoj_1626_9902961","code_snippet":"#include <bits/stdc++.h>\n\n\nusing namespace std;\n//make -f ../makefile SRC=\n/*\n\n*/\n\n\n//------------------------------------------------------------------------------\nbool DEBUG = false;\nconst int INF = 2147483647;\n\n//const int MAX_N = 100000;\n//static int vect[MAX_N];\ntypedef pair<int,int> PA;\n//------------------------------------------------------------------------------\n// return {a, n}\nPA solve(int sum)\n{\n // (2*a + n-1)*n = 2*sum\n //--------------------------------------------------------------------------\n // base cases:\n if (sum == 1) return {1, 1};\n else if (sum == 2) return {2, 1};\n else if (sum == 3) return {1, 2};\n //--------------------------------------------------------------------------\n // init:\n sum *= 2;\n //--------------------------------------------------------------------------\n // compute:\n for (int n=sqrt(sum); n>0; --n)\n {\n if (sum%n != 0) continue;\n\n int q = sum/n;\n if (q < n+1) continue;\n\n int aa = q - n + 1;\n if (aa%2 != 0) continue;\n\n return {aa/2, n};\n }\n //--------------------------------------------------------------------------\n // report:\n return {-1, -1};\n}\n\n//------------------------------------------------------------------------------\nvoid test()\n{\n\n}\n\n//------------------------------------------------------------------------------\nint main()\n{\n //test(); return 0;\n //DEBUG = true;\n //--------------------------------------------------------------------------\n int N, K, sum, num;\n while (true)\n {\n num = scanf(\"%d \", &sum); if (sum == 0) break;\n PA p = solve(sum);\n printf(\"%d %d\\n\", p.first, p.second);\n }\n //--------------------------------------------------------------------------\n return 0;\n}\n//------------------------------------------------------------------------------","accuracy":1,"time_ms":10,"memory_kb":3580,"score_of_the_acc":-0.989,"final_rank":14},{"submission_id":"aoj_1626_9769461","code_snippet":"#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\n#if __cplusplus <= 201703L\n#define ssize(v) ((int)(v).size())\ntemplate<typename T> ll bit_ceil(T n) {\n ll r = 1;\n while(r < n) { r <<= 1; }\n return r;\n}\ntemplate<typename T> ll bit_width(T n) { return 64 - __builtin_clzll(n); }\ntemplate<typename T> ll countr_zero(T n) { return __builtin_ctzll(n); }\ntemplate<typename T> ll popcount(T n) { return __builtin_popcountll(n); }\nnamespace ranges {\ntemplate<typename T> void sort(vector<T> &v) { sort(v.begin(), v.end()); }\ntemplate<typename T> void stable_sort(vector<T> &v) { stable_sort(v.begin(), v.end()); }\ntemplate<typename T, typename F> void sort(vector<T> &v, const F &f) { sort(v.begin(), v.end(), f); }\ntemplate<typename T> void reverse(vector<T> &v) { reverse(v.begin(), v.end()); }\ntemplate<typename T> T max(const vector<T> &v) { return *max_element(v.begin(), v.end()); }\ntemplate<typename T> T min(const vector<T> &v) { return *min_element(v.begin(), v.end()); }\ntemplate<typename T, typename U> bool binary_search(const vector<T> &v, U x) { return binary_search(v.begin(), v.end(), x); }\ntemplate<typename T, typename F> bool all_of(const vector<T> &v, const F &f) { return all_of(v.begin(), v.end(), f); }\ntemplate<typename T, typename F> bool any_of(const vector<T> &v, const F &f) { return any_of(v.begin(), v.end(), f); }\ntemplate<typename T, typename F> bool none_of(const vector<T> &v, const F &f) { return none_of(v.begin(), v.end(), f); }\ntemplate<typename T, typename F> int count_if(const vector<T> &v, const F &f) { return count_if(v.begin(), v.end(), f); }\ntemplate<typename T, typename U> auto lower_bound(const vector<T> &v, U x) { return lower_bound(v.begin(), v.end(), x); }\ntemplate<typename T, typename U> auto upper_bound(const vector<T> &v, U x) { return upper_bound(v.begin(), v.end(), x); }\ntemplate<typename T, typename U, typename F> auto lower_bound(const vector<T> &v, U x, const F &f) { return lower_bound(v.begin(), v.end(), x, f); }\ntemplate<typename T, typename U, typename F> auto upper_bound(const vector<T> &v, U x, const F &f) { return upper_bound(v.begin(), v.end(), x, f); }\ntemplate<typename T> auto max_element(const vector<T> &v) { return max_element(v.begin(), v.end()); }\ntemplate<typename T> auto min_element(const vector<T> &v) { return min_element(v.begin(), v.end()); }\ntemplate<typename T, typename U> void fill(vector<T> &v, U x) { fill(v.begin(), v.end(), x); }\n} // namespace ranges\n#endif\n\nvector<ll> Divisor(ll n) {\n vector<ll> r;\n for(ll i = 1; i * i <= n; i++) {\n if(n % i == 0) {\n r.emplace_back(i);\n if(i * i != n) { r.emplace_back(n / i); }\n }\n }\n ranges::sort(r);\n return r;\n}\n\nint main() {\n ios::sync_with_stdio(false);\n cin.tie(nullptr);\n\n while(true) {\n ll N;\n cin >> N;\n if(!N) { break; }\n\n pair<ll, ll> ans = {1, N};\n for(auto &i : Divisor(N)) {\n if((N / i) & 1) {\n if(i - (N / i) / 2 >= 1) { ans = max(ans, {N / i, i - (N / i) / 2}); }\n }\n if(i & 1 && i / 2 - N / i >= 0) { ans = max(ans, {N / i * 2, i / 2 - N / i + 1}); }\n }\n\n cout << ans.second << \" \" << ans.first << \"\\n\";\n }\n}","accuracy":1,"time_ms":50,"memory_kb":3376,"score_of_the_acc":-0.4444,"final_rank":3},{"submission_id":"aoj_1626_9473726","code_snippet":"#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\ntypedef long double ld;\ntypedef vector<ll> vi;\ntypedef vector<vi> vvi;\ntypedef vector<vvi> vvvi;\ntypedef vector<vvvi> vvvvi;\ntypedef vector<bool> vb;\ntypedef vector<vb> vvb;\ntypedef vector<vvb> vvvb;\ntypedef vector<vvvb> vvvvb;\ntypedef pair<ll,ll> pi;\ntypedef pair<ll,pi> ppi;\n#define FOR(i,l,r) for(ll i=l;i<r;i++)\n#define REP(i,n) FOR(i,0,n)\n#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)\n#define RREP(i,n) RFOR(i,0,n)\n#define sz(A) (ll)(A.size())\n#define ALL(A) A.begin(),A.end()\n#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())\n#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())\n#define COU(A,x) (UB(A,x)-LB(A,x))\n#define F first\n#define S second\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\ntemplate<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.F<<\" \"<<p.S;return os;}\ntemplate<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}\ntemplate<typename T>ostream&operator<<(ostream&os,vector<T>&v){REP(i,sz(v))os<<v[i]<<(i+1!=sz(v)?\" \":\"\");return os;}\ntemplate<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}\ntemplate<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}\ntemplate<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}\nconst ll mod=998244353;\ntemplate<const long long int mod=998244353>\nstruct modint{\n using mint=modint<mod>;\n long long int x;\n modint(long long int _x=0):x(_x%mod){if(x<0)x+=mod;}\n long long int val(){return x;}\n mint&operator=(const mint&a){x=a.x;return *this;}\n mint&operator+=(const mint&a){x+=a.x;if(x>=mod)x-=mod;return *this;}\n mint&operator-=(const mint&a){x-=a.x;if(x<0)x+=mod;return *this;}\n mint&operator*=(const mint&a){x*=a.x;x%=mod;return *this;}\n friend mint operator+(const mint&a,const mint&b){return mint(a)+=b;}\n friend mint operator-(const mint&a,const mint&b){return mint(a)-=b;}\n friend mint operator*(const mint&a,const mint&b){return mint(a)*=b;}\n mint operator-()const{return mint(0)-*this;}\n mint pow(long long int n){\n if(!n)return 1;\n mint a=1;\n mint _x=x;\n while(n){\n if(n&1)a*=_x;\n _x=_x*_x;n>>=1;\n }\n return a;\n }\n mint inv(){return pow(mod-2);}\n mint&operator/=(mint&a){return *this*=a.inv();}\n friend mint operator/(const mint&a,mint b){return mint(a)/=b;}\n};\nusing mint=modint<998244353>;\nint main(){\n while(1){\n ll N;cin>>N;\n if(!N)return 0;\n set<ll>D;\n FOR(i,1,100000)if(2*N%i==0)D.insert(i),D.insert(2*N/i);\n ll l=N,r=N;\n for(auto d:D){\n if(2*N/d-d+1>0&&(2*N/d-d+1)%2==0)l=(2*N/d-d+1)/2,r=d;\n }\n cout<<l<<\" \"<<r<<endl;\n }\n return 0;\n}","accuracy":1,"time_ms":610,"memory_kb":3380,"score_of_the_acc":-0.6777,"final_rank":10},{"submission_id":"aoj_1626_9448932","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)), (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#include <unistd.h>\n\nnamespace fastio {\nstatic constexpr uint32_t SZ = 1 << 17;\nchar ibuf[SZ];\nchar obuf[SZ];\nchar out[100];\n// pointer of ibuf, obuf\n\n\nuint32_t pil = 0, pir = 0, por = 0;\n\nstruct Pre {\n char num[10000][4];\n constexpr Pre() : num() {\n for (int i = 0; i < 10000; i++) {\n int n = i;\n for (int j = 3; j >= 0; j--) {\n num[i][j] = n % 10 | '0';\n n /= 10;\n }\n }\n }\n} constexpr pre;\n\ninline void load() {\n memmove(ibuf, ibuf + pil, pir - pil);\n pir = pir - pil + fread(ibuf + pir - pil, 1, SZ - pir + pil, stdin);\n pil = 0;\n if (pir < SZ)\n ibuf[pir++] = '\\n';\n}\n\ninline void flush() {\n fwrite(obuf, 1, por, stdout);\n por = 0;\n}\n\nvoid rd(char &c) {\n do {\n if (pil + 1 > pir)\n load();\n c = ibuf[pil++];\n } while (isspace(c));\n}\n\nvoid rd(string &x) {\n x.clear();\n char c;\n do {\n if (pil + 1 > pir)\n load();\n c = ibuf[pil++];\n } while (isspace(c));\n do {\n x += c;\n if (pil == pir)\n load();\n c = ibuf[pil++];\n } while (!isspace(c));\n}\n\ntemplate <typename T> void rd_real(T &x) {\n string s;\n rd(s);\n x = stod(s);\n}\n\ntemplate <typename T> void rd_integer(T &x) {\n if (pil + 100 > pir)\n load();\n char c;\n do\n c = ibuf[pil++];\n while (c < '-');\n bool minus = 0;\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\n if (c == '-') {\n minus = 1, c = ibuf[pil++];\n }\n }\n x = 0;\n while ('0' <= c) {\n x = x * 10 + (c & 15), c = ibuf[pil++];\n }\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\n if (minus)\n x = -x;\n }\n}\n\nvoid rd(int &x) {\n rd_integer(x);\n}\nvoid rd(ll &x) {\n rd_integer(x);\n}\nvoid rd(i128 &x) {\n rd_integer(x);\n}\nvoid rd(uint &x) {\n rd_integer(x);\n}\nvoid rd(ull &x) {\n rd_integer(x);\n}\nvoid rd(u128 &x) {\n rd_integer(x);\n}\nvoid rd(double &x) {\n rd_real(x);\n}\nvoid rd(long double &x) {\n rd_real(x);\n}\n\ntemplate <class T, class U> void rd(pair<T, U> &p) {\n return rd(p.first), rd(p.second);\n}\ntemplate <size_t N = 0, typename T> void rd_tuple(T &t) {\n if constexpr (N < std::tuple_size<T>::value) {\n auto &x = std::get<N>(t);\n rd(x);\n rd_tuple<N + 1>(t);\n }\n}\ntemplate <class... T> void rd(tuple<T...> &tpl) {\n rd_tuple(tpl);\n}\n\ntemplate <size_t N = 0, typename T> void rd(array<T, N> &x) {\n for (auto &d : x)\n rd(d);\n}\ntemplate <class T> void rd(vector<T> &x) {\n for (auto &d : x)\n rd(d);\n}\n\nvoid read() {}\ntemplate <class H, class... T> void read(H &h, T &...t) {\n rd(h), read(t...);\n}\n\nvoid wt(const char c) {\n if (por == SZ)\n flush();\n obuf[por++] = c;\n}\nvoid wt(const string s) {\n for (char c : s)\n wt(c);\n}\nvoid wt(const char *s) {\n size_t len = strlen(s);\n for (size_t i = 0; i < len; i++)\n wt(s[i]);\n}\n\ntemplate <typename T> void wt_integer(T x) {\n if (por > SZ - 100)\n flush();\n if (x < 0) {\n obuf[por++] = '-', x = -x;\n }\n int outi;\n for (outi = 96; x >= 10000; outi -= 4) {\n memcpy(out + outi, pre.num[x % 10000], 4);\n x /= 10000;\n }\n if (x >= 1000) {\n memcpy(obuf + por, pre.num[x], 4);\n por += 4;\n } else if (x >= 100) {\n memcpy(obuf + por, pre.num[x] + 1, 3);\n por += 3;\n } else if (x >= 10) {\n int q = (x * 103) >> 10;\n obuf[por] = q | '0';\n obuf[por + 1] = (x - q * 10) | '0';\n por += 2;\n } else\n obuf[por++] = x | '0';\n memcpy(obuf + por, out + outi + 4, 96 - outi);\n por += 96 - outi;\n}\n\ntemplate <typename T> void wt_real(T x) {\n ostringstream oss;\n oss << fixed << setprecision(15) << double(x);\n string s = oss.str();\n wt(s);\n}\n\nvoid wt(int x) {\n wt_integer(x);\n}\nvoid wt(ll x) {\n wt_integer(x);\n}\nvoid wt(i128 x) {\n wt_integer(x);\n}\nvoid wt(uint x) {\n wt_integer(x);\n}\nvoid wt(ull x) {\n wt_integer(x);\n}\nvoid wt(u128 x) {\n wt_integer(x);\n}\nvoid wt(double x) {\n wt_real(x);\n}\nvoid wt(long double x) {\n wt_real(x);\n}\n\ntemplate <class T, class U> void wt(const pair<T, U> val) {\n wt(val.first);\n wt(' ');\n wt(val.second);\n}\ntemplate <size_t N = 0, typename T> void wt_tuple(const T t) {\n if constexpr (N < std::tuple_size<T>::value) {\n if constexpr (N > 0) {\n wt(' ');\n }\n const auto x = std::get<N>(t);\n wt(x);\n wt_tuple<N + 1>(t);\n }\n}\ntemplate <class... T> void wt(tuple<T...> tpl) {\n wt_tuple(tpl);\n}\ntemplate <class T, size_t S> void wt(const array<T, S> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i)\n wt(' ');\n wt(val[i]);\n }\n}\ntemplate <class T> void wt(const vector<T> val) {\n auto n = val.size();\n for (size_t i = 0; i < n; i++) {\n if (i)\n wt(' ');\n wt(val[i]);\n }\n}\n\nvoid print() {\n wt('\\n');\n}\ntemplate <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {\n wt(head);\n if (sizeof...(Tail))\n wt(' ');\n print(forward<Tail>(tail)...);\n}\nvoid __attribute__((destructor)) _d() {\n flush();\n}\n} // namespace fastio\n\n\nusing fastio::flush;\nusing fastio::print;\nusing fastio::read;\n\ninline void first(bool i = true) {\n print(i ? \"first\" : \"second\");\n}\ninline void Alice(bool i = true) {\n print(i ? \"Alice\" : \"Bob\");\n}\ninline void Takahashi(bool i = true) {\n print(i ? \"Takahashi\" : \"Aoki\");\n}\ninline void yes(bool i = true) {\n print(i ? \"yes\" : \"no\");\n}\ninline void Yes(bool i = true) {\n print(i ? \"Yes\" : \"No\");\n}\ninline void No() {\n print(\"No\");\n}\ninline void YES(bool i = true) {\n print(i ? \"YES\" : \"NO\");\n}\ninline void NO() {\n print(\"NO\");\n}\ninline void Yay(bool i = true) {\n print(i ? \"Yay!\" : \":(\");\n}\ninline void Possible(bool i = true) {\n print(i ? \"Possible\" : \"Impossible\");\n}\ninline void POSSIBLE(bool i = true) {\n print(i ? \"POSSIBLE\" : \"IMPOSSIBLE\");\n}\n\n/**\n * @brief Fast IO\n */\n\ntemplate <unsigned mod = 1000000007> struct fp {\n unsigned v;\n static constexpr int get_mod() {\n return mod;\n }\n constexpr unsigned inv() const {\n assert(v != 0);\n int x = v, y = mod, p = 1, q = 0, t = 0, tmp = 0;\n while (y > 0) {\n t = x / y;\n x -= t * y, p -= t * q;\n tmp = x, x = y, y = tmp;\n tmp = p, p = q, q = tmp;\n }\n if (p < 0)\n p += mod;\n return p;\n }\n constexpr fp(ll x = 0) : v(x >= 0 ? x % mod : (mod - (-x) % mod) % mod) {}\n fp operator-() const {\n return fp() - *this;\n }\n fp pow(ull t) {\n fp res = 1, b = *this;\n while (t) {\n if (t & 1)\n res *= b;\n b *= b;\n t >>= 1;\n }\n return res;\n }\n fp &operator+=(const fp &x) {\n if ((v += x.v) >= mod)\n v -= mod;\n return *this;\n }\n fp &operator-=(const fp &x) {\n if ((v += mod - x.v) >= mod)\n v -= mod;\n return *this;\n }\n fp &operator*=(const fp &x) {\n v = ull(v) * x.v % mod;\n return *this;\n }\n fp &operator/=(const fp &x) {\n v = ull(v) * x.inv() % mod;\n return *this;\n }\n fp operator+(const fp &x) const {\n return fp(*this) += x;\n }\n fp operator-(const fp &x) const {\n return fp(*this) -= x;\n }\n fp operator*(const fp &x) const {\n return fp(*this) *= x;\n }\n fp operator/(const fp &x) const {\n return fp(*this) /= x;\n }\n bool operator==(const fp &x) const {\n return v == x.v;\n }\n bool operator!=(const fp &x) const {\n return v != x.v;\n }\n friend istream &operator>>(istream &is, fp &x) {\n return is >> x.v;\n }\n friend ostream &operator<<(ostream &os, const fp &x) {\n return os << x.v;\n }\n};\n\ntemplate <unsigned mod> void rd(fp<mod> &x) {\n fastio::rd(x.v);\n}\ntemplate <unsigned mod> void wt(fp<mod> x) {\n fastio::wt(x.v);\n}\n\ntemplate <typename T> T Inv(ll n) {\n static const int md = T::get_mod();\n static vector<T> buf({0, 1});\n assert(n > 0);\n n %= md;\n while (SZ(buf) <= n) {\n int k = SZ(buf), q = (md + k - 1) / k;\n buf.push_back(buf[k * q - md] * q);\n }\n return buf[n];\n}\n\ntemplate <typename T> T Fact(ll n, bool inv = 0) {\n static const int md = T::get_mod();\n static vector<T> buf({1, 1}), ibuf({1, 1});\n assert(n >= 0 and n < md);\n while (SZ(buf) <= n) {\n buf.push_back(buf.back() * SZ(buf));\n ibuf.push_back(ibuf.back() * Inv<T>(SZ(ibuf)));\n }\n return inv ? ibuf[n] : buf[n];\n}\n\ntemplate <typename T> T nPr(int n, int r, bool inv = 0) {\n if (n < 0 || n < r || r < 0)\n return 0;\n return Fact<T>(n, inv) * Fact<T>(n - r, inv ^ 1);\n}\ntemplate <typename T> T nCr(int n, int r, bool inv = 0) {\n if (n < 0 || n < r || r < 0)\n return 0;\n return Fact<T>(n, inv) * Fact<T>(r, inv ^ 1) * Fact<T>(n - r, inv ^ 1);\n}\ntemplate <typename T> T nHr(int n, int r, bool inv = 0) {\n return nCr<T>(n + r - 1, r, inv);\n}\n\n/**\n * @brief Modint\n */\n\nint main() {\nwhile(1) {\n ll X;\n cin >> X;\n if (X == 0) return 0;\n X *= 2;\n vector<ll> V;\n for (ll i = 1; i * i <= X; i++) {\n if (X % i == 0) V.push_back(i);\n }\n reverse(V.begin(), V.end());\n for (ll P : V) {\n ll Q = X / P;\n if ((Q - P + 1) % 2 != 0) continue;\n if (Q - P + 1> 0) {\n cout << (Q - P + 1) / 2 << ' ' << P << endl;\n break;\n }\n }\n}\n}","accuracy":1,"time_ms":80,"memory_kb":3408,"score_of_the_acc":-0.5443,"final_rank":5}],"string":"[\n {\n \"submission_id\": \"aoj_1626_10867577\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std ;\\nint ans , p , n ;\\nvoid deal( int x ){\\n if ( ( n / x ) % 2 == 1 ){\\n int y = x - ( n / x ) / 2 ;\\n if ( y > 0 ){\\n if ( n / x > ans ){\\n ans = n / x ;\\n p = y ;\\n }\\n }\\n }\\n if ( x > 1 && x % 2 == 1 ){\\n int y = x / 2 - n / x + 1 ;\\n if ( 2 * n / x > ans && y > 0 ){\\n ans = 2 * n / x ;\\n p = y ;\\n }\\n }\\n}\\nint main(){\\n while( 1 ){\\n scanf( \\\"%d\\\" , &n ) ;\\n if ( n == 0 ) break ;\\n ans = 0 ; p = 0 ;\\n for( int i = 1 ; i <= sqrt( n ) ; i++ ){\\n if ( n % i == 0 ){\\n deal( i ) ; deal( n / i ) ;\\n }\\n }\\n printf( \\\"%d %d\\\\n\\\" , p , ans ) ;\\n }\\n return 0 ;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3508,\n \"score_of_the_acc\": -0.8031,\n \"final_rank\": 13\n },\n {\n \"submission_id\": \"aoj_1626_10676087\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\nvoid solve(ll b){\\n pair<ll,ll> ans;\\n\\n for (ll i = 1; i*i <= 2*b; i++){\\n if (2*b%i)continue;\\n\\n ll n = i;\\n ll m = 2*b / n;\\n if ((m-n+1)%2)continue;\\n\\n ll l = (m-n+1)/2;\\n ans.first = l;\\n ans.second = i;\\n }\\n cout << ans.first << ' ' << ans.second << endl;\\n}\\n\\nint main(){\\n ll b;cin >> b;\\n while(b){\\n solve(b);\\n cin >> b;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3436,\n \"score_of_the_acc\": -0.6212,\n \"final_rank\": 8\n },\n {\n \"submission_id\": \"aoj_1626_10643907\",\n \"code_snippet\": \"#pragma GCC target(\\\"avx\\\")\\n#pragma GCC optimize(\\\"O3\\\")\\n#pragma GCC optimize(\\\"unroll-loops\\\")\\n#include<bits/stdc++.h>\\n#define fast std::ios::sync_with_stdio(false); std::cin.tie(nullptr); std::cout.tie(nullptr)\\n#define eb emplace_back\\n#define mp make_pair\\n#define all(x) (x).begin(), (x).end()\\nusing namespace std;\\nusing ll = long long;\\nusing u64 = uint64_t;\\nusing u128 = __uint128_t;\\nusing ull = unsigned long long;\\nconstexpr ll inf = 2e18;\\nconstexpr ll mod = 998244353;\\n#ifdef LOCAL\\n#define debug(x) std::cerr << #x << \\\" = \\\" << (x) << std::endl;\\n#else\\n#define debug(x)\\n#endif\\nstatic void judge(bool c) {\\n std::cout << (c ? \\\"Yes\\\" : \\\"No\\\") << '\\\\n';\\n}\\n\\n\\nll b;\\nll isok(ll x){\\n if(x * x > b) return 0;\\n ll c = b - x * x;\\n if(c % x) return 0;\\n c /= x;\\n c++;\\n if(c % 2) return 0;\\n c /= 2;\\n assert(x * x + (2 * c - 1) * x == b);\\n return c;\\n}\\nint main() {\\n fast;\\n while(1){\\n ll ans = -1,st = -1;\\n cin >> b;\\n b *= 2;\\n if(b == 0) return 0;\\n for(ll i = 1; i * i <= b; i++){\\n if(b % i == 0){\\n if(isok(i)) ans = max(ans,i),st = isok(i);\\n }\\n }\\n assert(ans != -1 && st != -1);\\n cout << st << \\\" \\\"<< ans << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3384,\n \"score_of_the_acc\": -0.4783,\n \"final_rank\": 4\n },\n {\n \"submission_id\": \"aoj_1626_10639591\",\n \"code_snippet\": \"// C++ includes used for precompiling -*- C++ -*-\\n// Copyright (C) 2003-2013 Free Software Foundation, Inc.\\n//\\n// This file is part of the GNU ISO C++ Library. This library is free\\n// software; you can redistribute it and/or modify it under the\\n// terms of the GNU General Public License as published by the\\n// Free Software Foundation; either version 3, or (at your option)\\n// any later version.\\n// This library is distributed in the hope that it will be useful,\\n// but WITHOUT ANY WARRANTY; without even the implied warranty of\\n// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\\n// GNU General Public License for more details.\\n// Under Section 7 of GPL version 3, you are granted additional\\n// permissions described in the GCC Runtime Library Exception, version\\n// 3.1, as published by the Free Software Foundation.\\n// You should have received a copy of the GNU General Public License and\\n// a copy of the GCC Runtime Library Exception along with this program;\\n// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see\\n// <http://w...content-available-to-author-only...u.org/licenses/>.\\n/** @file stdc++.h\\n * This is an implementation file for a precompiled header.\\n */\\n// 17.4.1.2 Headers\\n// C\\n#ifndef _GLIBCXX_NO_ASSERT\\n#include <cassert>\\n#endif\\n#include <cctype>\\n#include <cerrno>\\n#include <cfloat>\\n#include <ciso646>\\n#include <climits>\\n#include <clocale>\\n#include <cmath>\\n#include <csetjmp>\\n#include <csignal>\\n#include <cstdarg>\\n#include <cstddef>\\n#include <cstdio>\\n#include <cstdlib>\\n#include <cstring>\\n#include <ctime>\\n#if __cplusplus >= 201103L\\n#include <ccomplex>\\n#include <cfenv>\\n#include <cinttypes>\\n#include <cstdbool>\\n#include <cstdint>\\n#include <ctgmath>\\n#include <cwchar>\\n#include <cwctype>\\n#endif\\n// C++\\n#include <algorithm>\\n#include <bitset>\\n#include <complex>\\n#include <deque>\\n#include <exception>\\n#include <fstream>\\n#include <functional>\\n#include <iomanip>\\n#include <ios>\\n#include <iosfwd>\\n#include <iostream>\\n#include <istream>\\n#include <iterator>\\n#include <limits>\\n#include <list>\\n#include <locale>\\n#include <map>\\n#include <memory>\\n#include <new>\\n#include <numeric>\\n#include <ostream>\\n#include <queue>\\n#include <set>\\n#include <sstream>\\n#include <stack>\\n#include <stdexcept>\\n#include <streambuf>\\n#include <string>\\n#include <typeinfo>\\n#include <utility>\\n#include <valarray>\\n#include <vector>\\n#if __cplusplus >= 201103L\\n#include <array>\\n#include <atomic>\\n#include <chrono>\\n#include <condition_variable>\\n#include <forward_list>\\n#include <future>\\n#include <initializer_list>\\n#include <mutex>\\n#include <random>\\n#include <ratio>\\n#include <regex>\\n#include <scoped_allocator>\\n#include <system_error>\\n#include <thread>\\n#include <tuple>\\n#include <type_traits>\\n#include <typeindex>\\n#include <unordered_map>\\n#include <unordered_set>\\n\\n#endif\\nusing namespace std;\\nusing ll = long long;\\nusing ull = unsigned long long;\\nusing uint = unsigned int;\\n#define rep(i, n) for (int i = 0; i < n; i++)\\n#define all(v) v.begin(), v.end()\\ntemplate <class T, class U>\\ninline bool chmax(T &a, U b) {\\n if (a < b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <class T, class U>\\ninline bool chmin(T &a, U b) {\\n if (a > b) {\\n a = b;\\n return true;\\n }\\n return false;\\n}\\ntemplate <class T>\\ninline void compress(vector<T> &a) {\\n sort(a.begin(), a.end());\\n a.erase(unique(a.begin(), a.end()), a.end());\\n}\\ntemplate <class T>\\nT rand(T l, T r) {\\n static mt19937 mt(random_device{}());\\n // [l, r)\\n if constexpr (is_integral_v<T>) {\\n return uniform_int_distribution<T>(l, r - 1)(mt);\\n } else if constexpr (is_floating_point_v<T>) {\\n return uniform_real_distribution<T>(l, r)(mt);\\n }\\n}\\nconstexpr int INF = 1001001001;\\nconstexpr ll llINF = 3000000000000000010;\\nstruct linear_sieve {\\n vector<int> least_factor, prime_list;\\n linear_sieve(int n) : least_factor(n + 1, 0) {\\n for (int i = 2; i <= n; i++) {\\n if (least_factor[i] == 0) {\\n least_factor[i] = i;\\n prime_list.push_back(i);\\n }\\n for (int p : prime_list) {\\n if (ll(i) * p > n || p > least_factor[i]) break;\\n least_factor[i * p] = p;\\n }\\n }\\n }\\n};\\ntemplate <int modulo>\\nstruct modint {\\n int x;\\n modint() : x(0) {}\\n modint(int64_t y) : x(y >= 0 ? y % modulo : (modulo - (-y) % modulo) % modulo) {}\\n modint &operator+=(const modint &p) {\\n if ((x += p.x) >= modulo) x -= modulo;\\n return *this;\\n }\\n modint &operator-=(const modint &p) {\\n if ((x += modulo - p.x) >= modulo) x -= modulo;\\n return *this;\\n }\\n modint &operator*=(const modint &p) {\\n x = (int)(1LL * x * p.x % modulo);\\n return *this;\\n }\\n modint &operator/=(const modint &p) {\\n *this *= p.inv();\\n return *this;\\n }\\n modint operator-() const { return modint(-x); }\\n modint operator+(const modint &p) const { return modint(*this) += p; }\\n modint operator-(const modint &p) const { return modint(*this) -= p; }\\n modint operator*(const modint &p) const { return modint(*this) *= p; }\\n modint operator/(const modint &p) const { return modint(*this) /= p; }\\n bool operator==(const modint &p) const { return x == p.x; }\\n bool operator!=(const modint &p) const { return x != p.x; }\\n modint inv() const {\\n int a = x, b = modulo, u = 1, v = 0, t;\\n while (b > 0) {\\n t = a / b;\\n swap(a -= t * b, b);\\n swap(u -= t * v, v);\\n }\\n return modint(u);\\n }\\n modint pow(int64_t n) const {\\n modint ret(1), mul(x);\\n while (n > 0) {\\n if (n & 1) ret *= mul;\\n mul *= mul;\\n n >>= 1;\\n }\\n return ret;\\n }\\n friend ostream &operator<<(ostream &os, const modint &p) { return os << p.x; }\\n friend istream &operator>>(istream &is, modint &a) {\\n int64_t t;\\n is >> t;\\n a = modint<modulo>(t);\\n return (is);\\n }\\n int val() const { return x; }\\n static constexpr int mod() { return modulo; }\\n static constexpr int half() { return (modulo + 1) >> 1; }\\n};\\nll extgcd(ll a, ll b, ll &x, ll &y) {\\n // ax+by=gcd(|a|,|b|)\\n if (a < 0 || b < 0) {\\n ll d = extgcd(abs(a), abs(b), x, y);\\n if (a < 0) x = -x;\\n if (b < 0) y = -y;\\n return d;\\n }\\n if (b == 0) {\\n x = 1;\\n y = 0;\\n return a;\\n }\\n ll d = extgcd(b, a % b, y, x);\\n y -= a / b * x;\\n return d;\\n}\\ntemplate <typename T>\\nstruct Binomial {\\n vector<T> inv, fact, factinv;\\n Binomial(int n) {\\n inv.resize(n + 1);\\n fact.resize(n + 1);\\n factinv.resize(n + 1);\\n inv[0] = fact[0] = factinv[0] = 1;\\n for (int i = 1; i <= n; i++) fact[i] = fact[i - 1] * i;\\n factinv[n] = fact[n].inv();\\n inv[n] = fact[n - 1] * factinv[n];\\n for (int i = n - 1; i >= 1; i--) {\\n factinv[i] = factinv[i + 1] * (i + 1);\\n inv[i] = fact[i - 1] * factinv[i];\\n }\\n }\\n T C(int n, int r) {\\n if (n < 0 || n < r || r < 0) return 0;\\n return fact[n] * factinv[n - r] * factinv[r];\\n }\\n T P(int n, int r) {\\n if (n < 0 || n < r || r < 0) return 0;\\n return fact[n] * factinv[n - r];\\n }\\n T H(int n, int r) {\\n if (n == 0 && r == 0) return 1;\\n if (n < 0 || r < 0) return 0;\\n return r == 0 ? 1 : C(n + r - 1, r);\\n }\\n};\\ntemplate <class T>\\nvector<T> dijkstra(vector<vector<pair<int, T>>> &g, vector<int> start) {\\n using P = pair<T, int>;\\n vector<T> dp(g.size(), numeric_limits<T>::max());\\n priority_queue<P, vector<P>, greater<P>> que;\\n for (int s : start) {\\n dp[s] = 0;\\n que.push({0, s});\\n }\\n while (que.size()) {\\n auto [d, v] = que.top();\\n que.pop();\\n if (dp[v] != d) continue;\\n for (auto [u, c] : g[v]) {\\n if (chmin(dp[u], d + c)) que.push({dp[u], u});\\n }\\n }\\n return dp;\\n}\\n\\nvector<int> BFS01(vector<vector<pair<int, int>>> &g, vector<int> start) {\\n vector<int> dp(g.size(), numeric_limits<int>::max());\\n deque<int> que;\\n for (int s : start) {\\n dp[s] = 0;\\n que.push_front(s);\\n }\\n while (que.size()) {\\n auto v = que.front();\\n que.pop_front();\\n for (auto [u, c] : g[v]) {\\n if (chmin(dp[u], dp[v] + c)) {\\n if (c == 0)\\n que.push_front(u);\\n else\\n que.push_back(u);\\n }\\n }\\n }\\n return dp;\\n}\\ntemplate <typename T, typename U>\\ninline istream &operator>>(istream &is, pair<T, U> &rhs) {\\n return is >> rhs.first >> rhs.second;\\n}\\ntemplate <typename T>\\ninline istream &operator>>(istream &is, vector<T> &v) {\\n for (auto &e : v) is >> e;\\n return is;\\n}\\ntemplate <typename T, typename U>\\ninline ostream &operator<<(ostream &os, const pair<T, U> &rhs) {\\n return os << rhs.first << \\\" \\\" << rhs.second;\\n}\\ntemplate <typename T>\\ninline ostream &operator<<(ostream &os, const vector<T> &v) {\\n for (auto itr = v.begin(), end_itr = v.end(); itr != end_itr;) {\\n os << *itr;\\n if (++itr != end_itr) os << \\\" \\\";\\n }\\n return os;\\n}\\n\\nstruct UnionFind {\\n vector<int> par, siz;\\n UnionFind(int x) {\\n par.resize(x);\\n siz.resize(x);\\n for (int i = 0; i < x; i++) {\\n par[i] = i;\\n siz[i] = 1;\\n }\\n }\\n int find(int x) {\\n if (par[x] == x) return x;\\n return par[x] = find(par[x]);\\n }\\n bool unite(int x, int y) {\\n x = find(x), y = find(y);\\n if (x == y) return false;\\n if (siz[x] < siz[y]) swap(x, y);\\n par[y] = x;\\n siz[x] += siz[y];\\n\\n return true;\\n }\\n bool same(int x, int y) { return find(x) == find(y); }\\n int size(int x) { return siz[find(x)]; }\\n};\\ntemplate <class T>\\nstruct BIT {\\n // 1-indexed\\n int n, beki = 1;\\n vector<T> bit;\\n BIT(int x) {\\n bit.resize(x + 1, 0);\\n n = x;\\n while (beki * 2 <= n) beki *= 2;\\n }\\n T sum(int i) {\\n T res = 0;\\n while (i > 0) {\\n res += bit[i];\\n i -= i & -i;\\n }\\n return res;\\n }\\n T sum(int l, int r) {\\n //[l,r]\\n return sum(r) - (l == 0 ? 0 : sum(l - 1));\\n }\\n void add(int i, T x) {\\n while (i <= n) {\\n bit[i] += x;\\n i += i & -i;\\n }\\n }\\n int lowerbound(T w) {\\n if (w <= 0) return 0;\\n int x = 0;\\n for (int k = beki; k > 0; k >>= 1) {\\n if (x + k <= n && bit[x + k] < w) {\\n w -= bit[x + k];\\n x += k;\\n }\\n }\\n return x + 1;\\n }\\n};\\nusing mint = modint<998244353>;\\n\\nvoid solve() {\\n ll b;\\n cin>>b;\\n if(b==0){\\n exit(0);\\n }\\n b*=2;\\n ll ans1=-1,ans2=-1;\\n for(ll i=1;i*i<=b;i++){\\n if(b%i==0){\\n ll j=b/i;\\n j+=1;\\n if(i%2!=j%2)continue;\\n ans1=(j-i)/2,ans2=(i+j)/2;\\n }\\n }\\n cout<<ans1<<\\\" \\\"<<ans2-ans1<<endl;\\n}\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n int t = 1;\\n // cin >> t;\\n while (1) solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3584,\n \"score_of_the_acc\": -1.0079,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1626_10625065\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#if __has_include(<atcoder/all>)\\n#include <atcoder/all>\\nusing namespace atcoder;\\n#endif\\n#define ll long long\\n#define vi vector<int>\\n#define vvi vector<vector<int>>\\n#define vvvi vector<vector<vector<int>>>\\n#define vd vector<double>\\n#define vvd vector<vector<double>>\\n#define vvvd vector<vector<vector<double>>>\\n#define vll vector<long long>\\n#define vvll vector<vector<long long>>\\n#define vvvll vector<vector<vector<long long>>>\\n#define vmi vector<mint>\\n#define vvmi vector<vector<mint>>\\n#define vb vector<bool>\\n#define vs vector<string>\\n#define vc vector<char>\\n#define vvc vector<vector<char>>\\n#define pi pair<int,int>\\n#define pll pair<long long, long long>\\n#define vpi vector<pair<int,int>>\\n#define vvpi vector<vector<pair<int,int>>>\\n#define gi greater<int>\\n#define gll greater<long long>\\n#define gpi greater<pair<int,int>>\\n#define eb emplace_back\\n#define ef emplace_front\\n#define pq priority_queue\\n\\nll sum(ll n){return n*(n+1)/2;}\\n\\nll largestCount(ll n){\\n ll left = 0;\\n ll right = LLONG_MAX;\\n while(left<right){\\n ll mid = right - (right - left) / 2;\\n if(sum(mid)>n)right = mid - 1;\\n else if(sum(mid)<n)left = mid + 1;\\n else if(sum(mid)==n) return mid;\\n }\\n return left;\\n}\\n\\nvoid solve() {\\n while(true){\\n ll n; cin >> n;\\n if(n==0)return;\\n ll cnt = 0;\\n ll m = 0;\\n for (int i=1; i<sqrt(2 * n) + 1; i++)\\n {\\n ll tmp = cnt;\\n if (i % 2 == 0){\\n cnt += (n % i == i / 2);\\n }\\n else{\\n cnt += (n % i == 0);\\n }\\n if(tmp != cnt){\\n m = i;\\n }\\n }\\n if ((2 * n / m - m - 1) / 2 + 1 == 0){\\n cout << 1 << ' ' << m - 1 << endl;\\n }else{\\n cout << (2 * n / m - m - 1) / 2 + 1 << ' ' << m << endl;\\n }\\n }\\n}\\n\\nint main() {\\n cin.tie(nullptr);\\n ios::sync_with_stdio(false);\\n solve();\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 3220,\n \"score_of_the_acc\": -0.0317,\n \"final_rank\": 1\n },\n {\n \"submission_id\": \"aoj_1626_10625054\",\n \"code_snippet\": \"#include <iostream>\\n#include <cmath>\\nusing namespace std;\\n\\nint main(){\\n\\n while(true){\\n int b;\\n cin >> b;\\n if(b == 0) break;\\n for(int i = (int)sqrt(2*b); i >= 1; i--){\\n if((2*b)%i == 0 && (2*b/i - i+1)/2 >= 1 && (2*b/i - i+1)%2 == 0){\\n cout << (2*b/i - i+1)/2 << \\\" \\\" << i << endl;\\n break;\\n }\\n }\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3288,\n \"score_of_the_acc\": -0.1868,\n \"final_rank\": 2\n },\n {\n \"submission_id\": \"aoj_1626_10624772\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#define ALL(v) (v).begin(), (v).end()\\nusing ll = long long;\\n\\nint main() {\\n while (true) {\\n ll B; cin >> B;\\n if (B == 0) break;\\n B <<= 1;\\n vector<ll> div;\\n for (ll i = 1; i*i <= B; i++) {\\n if (B % i == 0) {\\n div.emplace_back(i);\\n if (B / i != i) div.emplace_back(B / i);\\n }\\n }\\n sort(ALL(div));\\n ll len = 0;\\n ll lans = -1, rans = -1;\\n for (auto m : div) {\\n ll x = B / m;\\n for (ll i = 1; i*i <= x; i++) {\\n if (x % i == 0) {\\n {\\n ll n = x / i;\\n ll r = (i + n - 1);\\n ll l = (i - n + 1);\\n if ((l & 1) || (r & 1)) continue;\\n l >>= 1;\\n r >>= 1;\\n if (1 <= l && l <= r && n > len) {\\n len = n;\\n lans = l;\\n rans = r;\\n }\\n }\\n {\\n ll n = i;\\n ll r = (x / i + n - 1);\\n ll l = (x / i - n + 1);\\n if ((l & 1) || (r & 1)) continue;\\n l >>= 1;\\n r >>= 1;\\n if (1 <= l && l <= r && n > len) {\\n len = n;\\n lans = l;\\n rans = r;\\n }\\n }\\n }\\n }\\n }\\n cout << lans << \\\" \\\" << len << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 130,\n \"memory_kb\": 3456,\n \"score_of_the_acc\": -0.696,\n \"final_rank\": 11\n },\n {\n \"submission_id\": \"aoj_1626_10620654\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n#define rep(i, s, t) for (ll i = s; i < (ll)(t); i++)\\n#define rrep(i, s, t) for(ll i = (ll)(t) - 1; i >= (ll)(s); i--)\\n#define all(x) begin(x), end(x)\\n#define rall(x) rbegin(x), rend(x)\\n\\n#define TT template<typename T>\\nTT using vec = vector<T>;\\ntemplate<class T1, class T2> bool chmin(T1 &x, T2 y) { return x > y ? (x = y, true) : false; }\\ntemplate<class T1, class T2> bool chmax(T1 &x, T2 y) { return x < y ? (x = y, true) : false; }\\n\\nstruct io_setup {\\n io_setup() {\\n ios::sync_with_stdio(false);\\n std::cin.tie(nullptr);\\n cout << fixed << setprecision(15);\\n }\\n} io_setup;\\n\\nint main(){\\n while(1){\\n ll B;\\n cin>>B;\\n if(B==0)return 0;\\n B*=2;\\n ll nl=0,ns=0;\\n for(ll d=1;d*d<=B;d++){\\n if(B%d!=0)continue;\\n ll e=B/d;\\n if((d-e+1)%2!=0)continue;\\n ll r=(d+e-1)/2;\\n ll l=e-r;\\n if(l<=r){\\n if(chmax(ns,r-l+1)){\\n nl=l;\\n }\\n }\\n }\\n cout<<nl<<\\\" \\\"<<ns<<endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3584,\n \"score_of_the_acc\": -1.0079,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1626_10613233\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\nusing a2 = array<ll, 2>;\\nusing a3 = array<ll, 3>;\\n\\ntemplate <typename A> void chmin(A &l, const A &r) {\\n if(r < l)\\n l = r;\\n}\\ntemplate <typename A> void chmax(A &l, const A &r) {\\n if(l < r)\\n l = r;\\n}\\n\\nll mod = 998244353;\\n\\nvector<char> isprime;\\nvoid init() {\\n isprime.assign(1000005, 1);\\n isprime[0] = 0;\\n isprime[1] = 0;\\n for(int i = 2; i < 1000005; i++) {\\n if(isprime[i]) {\\n for(int j = i * 2; j < 1000005; j += i) {\\n isprime[j] = 0;\\n }\\n }\\n }\\n}\\n\\nll n;\\nvector<a2> v;\\nvoid input() { cin >> n; }\\n\\nvoid solve() {\\n ll x=n,y=1;\\n for(ll i = 2; i <= 100000; i++) {\\n ll a = (i + 1) * i / 2;\\n\\n if(a <= n && (n - a) % i == 0) {\\n x = (n-a)/i + 1;\\n y = i;\\n }\\n }\\n cout << x << ' ' << y << endl;\\n}\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(0);\\n\\n // init();\\n while(1) {\\n input();\\n if(n == 0)\\n break;\\n solve();\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 170,\n \"memory_kb\": 3460,\n \"score_of_the_acc\": -0.7228,\n \"final_rank\": 12\n },\n {\n \"submission_id\": \"aoj_1626_10611962\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n#include <atcoder/all>\\nusing namespace atcoder;\\nusing ll = long long;\\nusing str = string;\\nusing un = unsigned;\\nusing mint = modint998244353;\\nstr Y = \\\"Yes\\\", N = \\\"No\\\";\\nll MOD=1e+9 + 7,MOD2=998244353;\\nll fast_pow(ll a,ll b){if (b < 0)return 0;ll res = 1;while (b > 0){if (b & 1)res = (res * a) % MOD;a = (a * a) % MOD;b = b / 2;}return res % MOD;};\\nll fact(ll n){if (n == 0 || n == 1)return 1;return (n * fact(n - 1)) % MOD;};\\nll nCr(ll n, ll r){return ((fact(n) * fast_pow(fact(r), MOD - 2)) % MOD * fast_pow(fact(n - r), MOD - 2)) % MOD;};\\nvector<bool> sieve(int n) {vector<bool> is_prime(n + 1, true);is_prime[0] = is_prime[1] = false;for (int i = 2; i * i <= n; ++i) {if (is_prime[i]) {for (int j = i * i; j <= n; j += i) {is_prime[j] = false;}}}return is_prime;};\\n//#define _GLIBCXX_DEBUG\\n#define rep(i, n) for (ll i = 0; i < (n); ++i)\\n#define repp(i, n) for (ll i = 1; i <= (n); ++i)\\ntemplate <class C>\\nvoid out_single (const C& v) {cout << v;}\\nvoid out_single (ostream& (*func)(ostream)) {cout << func;}\\nvoid out_single (const char& v) {cout << v;}\\ntemplate <class ...C>\\nvoid in (C&&...v) {(cin >> ... >> v);}\\ntemplate <class ...C>\\nvoid out (C&&...v) {(out_single(v), ...);}\\ntemplate <typename T>\\nusing vec = vector<T>;\\ntemplate <typename T>\\nusing vec2 = vector<vec<T>>;\\n#define all(a) (a).begin(), (a).end()\\n#define rall(a) (a).rbegin(), (a).rend()\\n#define sall(a) sort(all(a))\\n#define srall(a) sort(rall(a))\\nusing V = vec<ll>;\\nusing P = pair<ll,ll>;\\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<typename T> void print(const vector<T>& v) {for (const auto& i : v) cout << i /*<< \\\" \\\"*/; cout << endl;}\\ntemplate<typename T> void print(const vector<vector<T>>& v) {for (const auto& i : v) {for (const auto& j : i) cout << j /*<< \\\" \\\"*/; cout << endl;}}\\nbool is_grid (ll h, ll w, ll y, ll x) {return (0 <= y && y < h && 0 <= x && x < w);}\\nint main() {\\n ios_base::sync_with_stdio(false);\\n cin.tie(nullptr);\\n while(1){\\n ll b;in(b);\\n if(b==0) break;\\n ll ans=0;\\n for(ll i=sqrt(2*b)+2;i>0;i--){\\n ll x=2*b/i-(i-1);\\n if(x>0&&x%2==0&&(2*b)%i==0){\\n out(x/2,\\\" \\\",i,\\\"\\\\n\\\");\\n break;\\n }\\n }\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 20,\n \"memory_kb\": 3584,\n \"score_of_the_acc\": -1.004,\n \"final_rank\": 15\n },\n {\n \"submission_id\": \"aoj_1626_10611778\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#define rep(i,m,n) for (int i = m; i < (n); i++)\\n#define REP(i,m,n) for (int i = m; i <= (n); i++)\\nusing namespace std;\\nusing ll = long long;\\nusing pii = pair<int,int>;\\nusing vi = vector<int>;\\nusing vvi = vector<vector<int>>;\\nusing vl = vector<ll>;\\nusing vvl = vector<vector<ll>>;\\nusing vc = vector<char>;\\nusing vvc = vector<vector<char>>;\\nint sum(int i){\\n return i * (i + 1) / 2;\\n}\\nint main(){\\n rep(l,0,1000){\\n int b;\\n cin >> b;\\n if (b == 0) return 0;\\n int size=ceil(sqrt(b));\\n pii ans = {b, 1};\\n int i = 1;\\n while(sum(i) <= b){\\n if(sum(i)%i==b%i&&((b-sum(i))/i)<b-i){\\n ans={((b-sum(i))/i)+1, i};\\n }\\n i++;\\n }\\n cout << ans.first << \\\" \\\" << ans.second << endl;\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3440,\n \"score_of_the_acc\": -0.6163,\n \"final_rank\": 7\n },\n {\n \"submission_id\": \"aoj_1626_10611357\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\n// using mint = modint998244353;\\n// using mint = modint1000000007;\\nusing ll = long long;\\nusing ull = unsigned long long;\\n#define rep(i, n) for(ll i = 0; i < n; i++)\\nconstexpr ll INF = ((1LL << 61) + (1LL << 30) - 1);\\n\\nint main() {\\n cin.tie(nullptr);\\n ios_base::sync_with_stdio(false);\\n\\n // 公差 1 の 1 ~ n 項目までの等差数列の総和\\n auto sum = [](ll n) -> ll {\\n return n * (n + 1) / 2;\\n };\\n\\n while(true) {\\n ll b;\\n cin >> b;\\n if(b == 0) break;\\n ll start = -1, total = -1;\\n for(ll w = ((ll) sqrt(b)) * 2; w >= 1; w--) {\\n ll left = 1, right = 1e9;\\n while(right - left > 2) {\\n ll m1 = (left + right) / 2, m2 = m1 + 1;\\n ll s1 = sum(m1 + w - 1) - sum(m1 - 1);\\n ll s2 = sum(m2 + w - 1) - sum(m2 - 1);\\n if(abs(s1 - b) < abs(s2 - b)) right = m1;\\n else left = m2;\\n }\\n // if(w <= 10) cerr << \\\"w: \\\" << w << \\\", left: \\\" << left << \\\", right: \\\" << right << \\\"\\\\n\\\";\\n for(ll m = left; m <= right; m++) {\\n ll s = sum(m + w - 1) - sum(m - 1);\\n if(s == b) {\\n start = m;\\n total = w;\\n break;\\n }\\n }\\n if(total != -1) break;\\n }\\n cout << start << \\\" \\\" << total << \\\"\\\\n\\\";\\n }\\n\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 2530,\n \"memory_kb\": 3344,\n \"score_of_the_acc\": -1.3407,\n \"final_rank\": 19\n },\n {\n \"submission_id\": \"aoj_1626_10602971\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#include <unordered_map>\\n#include <stdlib.h>\\nusing namespace std;\\n#define rep(i, a, n) for(ll i = a; i < n; i++)\\n#define rrep(i, a, n) for(ll i = a; i >= n; i--)\\n#define ll long long\\n#define pii pair<int, int>\\n#define pll pair<ll, ll>\\n#define all(x) (x).begin(), (x).end()\\n//constexpr ll MOD = 1000000007;\\nconstexpr ll MOD = 998244353;\\nconstexpr int IINF = 1001001001;\\nconstexpr ll INF = 1LL<<60;\\ntemplate<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}\\ntemplate<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}\\n\\n\\nll gcd(ll a, ll b){\\n if(a%b == 0){\\n return b;\\n }else{\\n return gcd(b, a%b);\\n }\\n}\\n\\nll lcm(ll a, ll b){\\n return a*b / gcd(a, b);\\n}\\n\\nll powMod(ll x, ll n) {\\n if (n == 0) return 1 % MOD;\\n ll val = powMod(x, n / 2);\\n val *= val;\\n val %= MOD;\\n if (n % 2 == 1) val *= x;\\n return val % MOD;\\n}\\n\\nint main() {\\n while(true){\\n ll n; cin >> n;\\n if(n == 0) break;\\n ll ans = 1;\\n ll start = n;\\n rep(x,2,sqrt((double)n)*2+2){\\n if((2*n)%x != 0) continue;\\n ll num = ((2*n)/x-x+1);\\n if(num >= 1 && num%2 == 0) ans = x, start = num/2;\\n }\\n cout << start << \\\" \\\" << ans << endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 40,\n \"memory_kb\": 3456,\n \"score_of_the_acc\": -0.6603,\n \"final_rank\": 9\n },\n {\n \"submission_id\": \"aoj_1626_10556574\",\n \"code_snippet\": \"#line 1 \\\"2018C.cpp\\\"\\n#include <bits/stdc++.h>\\n#line 1 \\\"/home/ardririy/repos/cp-libs/libraries-cpp/input.hpp\\\"\\n\\n\\n#line 6 \\\"/home/ardririy/repos/cp-libs/libraries-cpp/input.hpp\\\"\\nusing namespace std;\\nvector<long long> i64_vec_IN(int n) {vector<long long> res(n); for(int i=0; i<n; i++) { cin >> res[i]; } return res; }\\nvector<string> str_vec_IN(int n) { vector<string> res(n); for(int i=0; i<n; i++) { cin >> res[i]; } return res; }\\nvector<vector<int>> graph_IN(int n, int m) { vector<vector<int>> g(n); int u, v; for(int i=0; i<m; i++) { cin >> u >> v; u--; v--; g[u].emplace_back(v); g[v].emplace_back(u); } return g; }\\nvector<vector<pair<int, long long>>> weighted_graph_IN(int n, int m) { vector<vector<pair<int, long long>>> g(n); int u, v; long long w; for(int i=0; i<m; i++) { cin >> u >> v >> w; u--; v--; g[u].push_back({v, w}); g[v].push_back({u, w}); } return g; }\\n\\n\\n#line 3 \\\"2018C.cpp\\\"\\n\\nusing namespace std;\\n\\n// using namespace atcoder;\\n\\n#ifdef ADRY\\n#include <dbg.h>\\n#else\\n// DO NOTHING\\n#define dbg(...)\\n#endif\\n\\n\\n#define all(v) v.begin(),v.end()\\n#define resort(v) sort(v.rbegin(),v.rend())\\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>>;\\nusing djks=priority_queue<P, vp, greater<P>>;\\n\\nconst int inf=1ll<<30;\\n#define mod10 (ll)1e9+7\\n#define mod99 (ll)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=(n)-1;i>=(a);--i)\\n\\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\\nll dx[] = {1, 0, -1, 0, -1, 1, -1, 1};\\nll dy[] = {0, 1, 0, -1, -1, 1, 1, -1};\\n\\nvll divisors(ll n) {\\n vll res;\\n rep2(i,1, sqrt(n)+10) {\\n if(n%i==0) {\\n res.emplace_back(i);\\n if(i!=n/i) res.emplace_back(n/i);\\n }\\n }\\n\\n return res;\\n}\\n\\nint solve(){\\n ll b;\\n cin >> b;\\n\\n if(b==0) return 1;\\n vll div = divisors(2*b);\\n P ans = {-1,-1};\\n for(auto di: div) {\\n ll t = 2*b/di;\\n ll rhs = t+1-di;\\n if(rhs<=0 || rhs%2==1) continue;\\n if(chmax(ans.second, di)) {\\n ans.first = rhs/2;\\n }\\n }\\n cout << ans.first << \\\" \\\" << ans.second << '\\\\n';\\n return 0;\\n}\\n\\nint main() {\\n cin.tie(0);\\n ios::sync_with_stdio(false);\\n while(!solve());\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 90,\n \"memory_kb\": 3412,\n \"score_of_the_acc\": -0.5592,\n \"final_rank\": 6\n },\n {\n \"submission_id\": \"aoj_1626_10542690\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n#include <atcoder/all>\\nusing namespace std;\\nusing namespace atcoder;\\n#define int long long\\n\\nint floor_sqrt(int n) {\\n int ok = 0;\\n int ng = (long double)(1.2)*sqrtl(n)+1;\\n while (abs(ok - ng) > 1) {\\n int mid = (ok + ng) / 2;\\n if (mid*mid<=n) ok = mid;\\n else ng = mid;\\n }\\n return ok;\\n}\\n\\nvoid solve(int b) {\\n b *= 2;\\n int sq = floor_sqrt(b);\\n pair<int, int> ans = {-1, -1};\\n for (int i=1; i<=sq; ++i) {\\n if (b % i != 0) continue;\\n int j = b / i;\\n // cout << i << \\\" x \\\" << j << \\\" = \\\" << b << endl;\\n if ((j-i) % 2 == 0) continue;\\n int x = (j-i+1) / 2;\\n int y = j - x;\\n \\n //k~l階を買える\\n // cout << x << \\\" ~ \\\" << y << endl;\\n ans = max(ans, {y-x+1, x});\\n }\\n cout << ans.second << ' ' << ans.first << endl;\\n}\\n\\nsigned main() {\\n while(true) {\\n int b;\\n cin >> b;\\n if (b == 0) break;\\n solve(b);\\n }\\n}\\n\\n/*\\nmemo\\n\\n*/\",\n \"accuracy\": 1,\n \"time_ms\": 30,\n \"memory_kb\": 3584,\n \"score_of_the_acc\": -1.0079,\n \"final_rank\": 16\n },\n {\n \"submission_id\": \"aoj_1626_10529939\",\n \"code_snippet\": \"#include<iostream>\\n#include<vector>\\nusing namespace std;\\nusing ll=long long;\\nll sum(ll n){return n*(n+1)/2;}\\nll cost(ll a,ll n){return sum(a+n-1)-sum(a-1);}\\nint main()\\n{\\n\\tios::sync_with_stdio(false);\\n\\tcin.tie(nullptr);\\n\\twhile(1)\\n\\t{\\n\\t\\tint b;cin>>b;\\n\\t\\tif(b==0)break;\\n\\t\\tll ans1=0,ans2=0;\\n\\t\\tfor(ll n=1;n*(n+1)/2<=b;n++)\\n\\t\\t{\\n\\t\\t\\tll l=0,r=b+1;\\n\\t\\t\\twhile(r-l>1)\\n\\t\\t\\t{\\n\\t\\t\\t\\tll a=(l+r)/2;\\n\\t\\t\\t\\tll cur=cost(a,n);\\n\\t\\t\\t\\tif(cur<=b)l=a;\\n\\t\\t\\t\\telse r=a;\\n\\t\\t\\t}\\n\\t\\t\\tif(cost(l,n)==b)ans1=l,ans2=n;\\n\\t\\t}\\n\\t\\tcout<<ans1<<\\\" \\\"<<ans2<<endl;\\n\\t}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 1550,\n \"memory_kb\": 3584,\n \"score_of_the_acc\": -1.6111,\n \"final_rank\": 20\n },\n {\n \"submission_id\": \"aoj_1626_9902961\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\n\\n\\nusing namespace std;\\n//make -f ../makefile SRC=\\n/*\\n\\n*/\\n\\n\\n//------------------------------------------------------------------------------\\nbool DEBUG = false;\\nconst int INF = 2147483647;\\n\\n//const int MAX_N = 100000;\\n//static int vect[MAX_N];\\ntypedef pair<int,int> PA;\\n//------------------------------------------------------------------------------\\n// return {a, n}\\nPA solve(int sum)\\n{\\n // (2*a + n-1)*n = 2*sum\\n //--------------------------------------------------------------------------\\n // base cases:\\n if (sum == 1) return {1, 1};\\n else if (sum == 2) return {2, 1};\\n else if (sum == 3) return {1, 2};\\n //--------------------------------------------------------------------------\\n // init:\\n sum *= 2;\\n //--------------------------------------------------------------------------\\n // compute:\\n for (int n=sqrt(sum); n>0; --n)\\n {\\n if (sum%n != 0) continue;\\n\\n int q = sum/n;\\n if (q < n+1) continue;\\n\\n int aa = q - n + 1;\\n if (aa%2 != 0) continue;\\n\\n return {aa/2, n};\\n }\\n //--------------------------------------------------------------------------\\n // report:\\n return {-1, -1};\\n}\\n\\n//------------------------------------------------------------------------------\\nvoid test()\\n{\\n\\n}\\n\\n//------------------------------------------------------------------------------\\nint main()\\n{\\n //test(); return 0;\\n //DEBUG = true;\\n //--------------------------------------------------------------------------\\n int N, K, sum, num;\\n while (true)\\n {\\n num = scanf(\\\"%d \\\", &sum); if (sum == 0) break;\\n PA p = solve(sum);\\n printf(\\\"%d %d\\\\n\\\", p.first, p.second);\\n }\\n //--------------------------------------------------------------------------\\n return 0;\\n}\\n//------------------------------------------------------------------------------\",\n \"accuracy\": 1,\n \"time_ms\": 10,\n \"memory_kb\": 3580,\n \"score_of_the_acc\": -0.989,\n \"final_rank\": 14\n },\n {\n \"submission_id\": \"aoj_1626_9769461\",\n \"code_snippet\": \"#include <bits/stdc++.h>\\nusing namespace std;\\nusing ll = long long;\\n\\n#if __cplusplus <= 201703L\\n#define ssize(v) ((int)(v).size())\\ntemplate<typename T> ll bit_ceil(T n) {\\n ll r = 1;\\n while(r < n) { r <<= 1; }\\n return r;\\n}\\ntemplate<typename T> ll bit_width(T n) { return 64 - __builtin_clzll(n); }\\ntemplate<typename T> ll countr_zero(T n) { return __builtin_ctzll(n); }\\ntemplate<typename T> ll popcount(T n) { return __builtin_popcountll(n); }\\nnamespace ranges {\\ntemplate<typename T> void sort(vector<T> &v) { sort(v.begin(), v.end()); }\\ntemplate<typename T> void stable_sort(vector<T> &v) { stable_sort(v.begin(), v.end()); }\\ntemplate<typename T, typename F> void sort(vector<T> &v, const F &f) { sort(v.begin(), v.end(), f); }\\ntemplate<typename T> void reverse(vector<T> &v) { reverse(v.begin(), v.end()); }\\ntemplate<typename T> T max(const vector<T> &v) { return *max_element(v.begin(), v.end()); }\\ntemplate<typename T> T min(const vector<T> &v) { return *min_element(v.begin(), v.end()); }\\ntemplate<typename T, typename U> bool binary_search(const vector<T> &v, U x) { return binary_search(v.begin(), v.end(), x); }\\ntemplate<typename T, typename F> bool all_of(const vector<T> &v, const F &f) { return all_of(v.begin(), v.end(), f); }\\ntemplate<typename T, typename F> bool any_of(const vector<T> &v, const F &f) { return any_of(v.begin(), v.end(), f); }\\ntemplate<typename T, typename F> bool none_of(const vector<T> &v, const F &f) { return none_of(v.begin(), v.end(), f); }\\ntemplate<typename T, typename F> int count_if(const vector<T> &v, const F &f) { return count_if(v.begin(), v.end(), f); }\\ntemplate<typename T, typename U> auto lower_bound(const vector<T> &v, U x) { return lower_bound(v.begin(), v.end(), x); }\\ntemplate<typename T, typename U> auto upper_bound(const vector<T> &v, U x) { return upper_bound(v.begin(), v.end(), x); }\\ntemplate<typename T, typename U, typename F> auto lower_bound(const vector<T> &v, U x, const F &f) { return lower_bound(v.begin(), v.end(), x, f); }\\ntemplate<typename T, typename U, typename F> auto upper_bound(const vector<T> &v, U x, const F &f) { return upper_bound(v.begin(), v.end(), x, f); }\\ntemplate<typename T> auto max_element(const vector<T> &v) { return max_element(v.begin(), v.end()); }\\ntemplate<typename T> auto min_element(const vector<T> &v) { return min_element(v.begin(), v.end()); }\\ntemplate<typename T, typename U> void fill(vector<T> &v, U x) { fill(v.begin(), v.end(), x); }\\n} // namespace ranges\\n#endif\\n\\nvector<ll> Divisor(ll n) {\\n vector<ll> r;\\n for(ll i = 1; i * i <= n; i++) {\\n if(n % i == 0) {\\n r.emplace_back(i);\\n if(i * i != n) { r.emplace_back(n / i); }\\n }\\n }\\n ranges::sort(r);\\n return r;\\n}\\n\\nint main() {\\n ios::sync_with_stdio(false);\\n cin.tie(nullptr);\\n\\n while(true) {\\n ll N;\\n cin >> N;\\n if(!N) { break; }\\n\\n pair<ll, ll> ans = {1, N};\\n for(auto &i : Divisor(N)) {\\n if((N / i) & 1) {\\n if(i - (N / i) / 2 >= 1) { ans = max(ans, {N / i, i - (N / i) / 2}); }\\n }\\n if(i & 1 && i / 2 - N / i >= 0) { ans = max(ans, {N / i * 2, i / 2 - N / i + 1}); }\\n }\\n\\n cout << ans.second << \\\" \\\" << ans.first << \\\"\\\\n\\\";\\n }\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 50,\n \"memory_kb\": 3376,\n \"score_of_the_acc\": -0.4444,\n \"final_rank\": 3\n },\n {\n \"submission_id\": \"aoj_1626_9473726\",\n \"code_snippet\": \"#include<bits/stdc++.h>\\nusing namespace std;\\ntypedef long long ll;\\ntypedef long double ld;\\ntypedef vector<ll> vi;\\ntypedef vector<vi> vvi;\\ntypedef vector<vvi> vvvi;\\ntypedef vector<vvvi> vvvvi;\\ntypedef vector<bool> vb;\\ntypedef vector<vb> vvb;\\ntypedef vector<vvb> vvvb;\\ntypedef vector<vvvb> vvvvb;\\ntypedef pair<ll,ll> pi;\\ntypedef pair<ll,pi> ppi;\\n#define FOR(i,l,r) for(ll i=l;i<r;i++)\\n#define REP(i,n) FOR(i,0,n)\\n#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)\\n#define RREP(i,n) RFOR(i,0,n)\\n#define sz(A) (ll)(A.size())\\n#define ALL(A) A.begin(),A.end()\\n#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())\\n#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())\\n#define COU(A,x) (UB(A,x)-LB(A,x))\\n#define F first\\n#define S second\\ntemplate<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;\\ntemplate<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>&p){os<<p.F<<\\\" \\\"<<p.S;return os;}\\ntemplate<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}\\ntemplate<typename T>ostream&operator<<(ostream&os,vector<T>&v){REP(i,sz(v))os<<v[i]<<(i+1!=sz(v)?\\\" \\\":\\\"\\\");return os;}\\ntemplate<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}\\ntemplate<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}\\ntemplate<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}\\nconst ll mod=998244353;\\ntemplate<const long long int mod=998244353>\\nstruct modint{\\n using mint=modint<mod>;\\n long long int x;\\n modint(long long int _x=0):x(_x%mod){if(x<0)x+=mod;}\\n long long int val(){return x;}\\n mint&operator=(const mint&a){x=a.x;return *this;}\\n mint&operator+=(const mint&a){x+=a.x;if(x>=mod)x-=mod;return *this;}\\n mint&operator-=(const mint&a){x-=a.x;if(x<0)x+=mod;return *this;}\\n mint&operator*=(const mint&a){x*=a.x;x%=mod;return *this;}\\n friend mint operator+(const mint&a,const mint&b){return mint(a)+=b;}\\n friend mint operator-(const mint&a,const mint&b){return mint(a)-=b;}\\n friend mint operator*(const mint&a,const mint&b){return mint(a)*=b;}\\n mint operator-()const{return mint(0)-*this;}\\n mint pow(long long int n){\\n if(!n)return 1;\\n mint a=1;\\n mint _x=x;\\n while(n){\\n if(n&1)a*=_x;\\n _x=_x*_x;n>>=1;\\n }\\n return a;\\n }\\n mint inv(){return pow(mod-2);}\\n mint&operator/=(mint&a){return *this*=a.inv();}\\n friend mint operator/(const mint&a,mint b){return mint(a)/=b;}\\n};\\nusing mint=modint<998244353>;\\nint main(){\\n while(1){\\n ll N;cin>>N;\\n if(!N)return 0;\\n set<ll>D;\\n FOR(i,1,100000)if(2*N%i==0)D.insert(i),D.insert(2*N/i);\\n ll l=N,r=N;\\n for(auto d:D){\\n if(2*N/d-d+1>0&&(2*N/d-d+1)%2==0)l=(2*N/d-d+1)/2,r=d;\\n }\\n cout<<l<<\\\" \\\"<<r<<endl;\\n }\\n return 0;\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 610,\n \"memory_kb\": 3380,\n \"score_of_the_acc\": -0.6777,\n \"final_rank\": 10\n },\n {\n \"submission_id\": \"aoj_1626_9448932\",\n \"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)), (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#include <unistd.h>\\n\\nnamespace fastio {\\nstatic constexpr uint32_t SZ = 1 << 17;\\nchar ibuf[SZ];\\nchar obuf[SZ];\\nchar out[100];\\n// pointer of ibuf, obuf\\n\\n\\nuint32_t pil = 0, pir = 0, por = 0;\\n\\nstruct Pre {\\n char num[10000][4];\\n constexpr Pre() : num() {\\n for (int i = 0; i < 10000; i++) {\\n int n = i;\\n for (int j = 3; j >= 0; j--) {\\n num[i][j] = n % 10 | '0';\\n n /= 10;\\n }\\n }\\n }\\n} constexpr pre;\\n\\ninline void load() {\\n memmove(ibuf, ibuf + pil, pir - pil);\\n pir = pir - pil + fread(ibuf + pir - pil, 1, SZ - pir + pil, stdin);\\n pil = 0;\\n if (pir < SZ)\\n ibuf[pir++] = '\\\\n';\\n}\\n\\ninline void flush() {\\n fwrite(obuf, 1, por, stdout);\\n por = 0;\\n}\\n\\nvoid rd(char &c) {\\n do {\\n if (pil + 1 > pir)\\n load();\\n c = ibuf[pil++];\\n } while (isspace(c));\\n}\\n\\nvoid rd(string &x) {\\n x.clear();\\n char c;\\n do {\\n if (pil + 1 > pir)\\n load();\\n c = ibuf[pil++];\\n } while (isspace(c));\\n do {\\n x += c;\\n if (pil == pir)\\n load();\\n c = ibuf[pil++];\\n } while (!isspace(c));\\n}\\n\\ntemplate <typename T> void rd_real(T &x) {\\n string s;\\n rd(s);\\n x = stod(s);\\n}\\n\\ntemplate <typename T> void rd_integer(T &x) {\\n if (pil + 100 > pir)\\n load();\\n char c;\\n do\\n c = ibuf[pil++];\\n while (c < '-');\\n bool minus = 0;\\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\\n if (c == '-') {\\n minus = 1, c = ibuf[pil++];\\n }\\n }\\n x = 0;\\n while ('0' <= c) {\\n x = x * 10 + (c & 15), c = ibuf[pil++];\\n }\\n if constexpr (is_signed<T>::value || is_same_v<T, i128>) {\\n if (minus)\\n x = -x;\\n }\\n}\\n\\nvoid rd(int &x) {\\n rd_integer(x);\\n}\\nvoid rd(ll &x) {\\n rd_integer(x);\\n}\\nvoid rd(i128 &x) {\\n rd_integer(x);\\n}\\nvoid rd(uint &x) {\\n rd_integer(x);\\n}\\nvoid rd(ull &x) {\\n rd_integer(x);\\n}\\nvoid rd(u128 &x) {\\n rd_integer(x);\\n}\\nvoid rd(double &x) {\\n rd_real(x);\\n}\\nvoid rd(long double &x) {\\n rd_real(x);\\n}\\n\\ntemplate <class T, class U> void rd(pair<T, U> &p) {\\n return rd(p.first), rd(p.second);\\n}\\ntemplate <size_t N = 0, typename T> void rd_tuple(T &t) {\\n if constexpr (N < std::tuple_size<T>::value) {\\n auto &x = std::get<N>(t);\\n rd(x);\\n rd_tuple<N + 1>(t);\\n }\\n}\\ntemplate <class... T> void rd(tuple<T...> &tpl) {\\n rd_tuple(tpl);\\n}\\n\\ntemplate <size_t N = 0, typename T> void rd(array<T, N> &x) {\\n for (auto &d : x)\\n rd(d);\\n}\\ntemplate <class T> void rd(vector<T> &x) {\\n for (auto &d : x)\\n rd(d);\\n}\\n\\nvoid read() {}\\ntemplate <class H, class... T> void read(H &h, T &...t) {\\n rd(h), read(t...);\\n}\\n\\nvoid wt(const char c) {\\n if (por == SZ)\\n flush();\\n obuf[por++] = c;\\n}\\nvoid wt(const string s) {\\n for (char c : s)\\n wt(c);\\n}\\nvoid wt(const char *s) {\\n size_t len = strlen(s);\\n for (size_t i = 0; i < len; i++)\\n wt(s[i]);\\n}\\n\\ntemplate <typename T> void wt_integer(T x) {\\n if (por > SZ - 100)\\n flush();\\n if (x < 0) {\\n obuf[por++] = '-', x = -x;\\n }\\n int outi;\\n for (outi = 96; x >= 10000; outi -= 4) {\\n memcpy(out + outi, pre.num[x % 10000], 4);\\n x /= 10000;\\n }\\n if (x >= 1000) {\\n memcpy(obuf + por, pre.num[x], 4);\\n por += 4;\\n } else if (x >= 100) {\\n memcpy(obuf + por, pre.num[x] + 1, 3);\\n por += 3;\\n } else if (x >= 10) {\\n int q = (x * 103) >> 10;\\n obuf[por] = q | '0';\\n obuf[por + 1] = (x - q * 10) | '0';\\n por += 2;\\n } else\\n obuf[por++] = x | '0';\\n memcpy(obuf + por, out + outi + 4, 96 - outi);\\n por += 96 - outi;\\n}\\n\\ntemplate <typename T> void wt_real(T x) {\\n ostringstream oss;\\n oss << fixed << setprecision(15) << double(x);\\n string s = oss.str();\\n wt(s);\\n}\\n\\nvoid wt(int x) {\\n wt_integer(x);\\n}\\nvoid wt(ll x) {\\n wt_integer(x);\\n}\\nvoid wt(i128 x) {\\n wt_integer(x);\\n}\\nvoid wt(uint x) {\\n wt_integer(x);\\n}\\nvoid wt(ull x) {\\n wt_integer(x);\\n}\\nvoid wt(u128 x) {\\n wt_integer(x);\\n}\\nvoid wt(double x) {\\n wt_real(x);\\n}\\nvoid wt(long double x) {\\n wt_real(x);\\n}\\n\\ntemplate <class T, class U> void wt(const pair<T, U> val) {\\n wt(val.first);\\n wt(' ');\\n wt(val.second);\\n}\\ntemplate <size_t N = 0, typename T> void wt_tuple(const T t) {\\n if constexpr (N < std::tuple_size<T>::value) {\\n if constexpr (N > 0) {\\n wt(' ');\\n }\\n const auto x = std::get<N>(t);\\n wt(x);\\n wt_tuple<N + 1>(t);\\n }\\n}\\ntemplate <class... T> void wt(tuple<T...> tpl) {\\n wt_tuple(tpl);\\n}\\ntemplate <class T, size_t S> void wt(const array<T, S> val) {\\n auto n = val.size();\\n for (size_t i = 0; i < n; i++) {\\n if (i)\\n wt(' ');\\n wt(val[i]);\\n }\\n}\\ntemplate <class T> void wt(const vector<T> val) {\\n auto n = val.size();\\n for (size_t i = 0; i < n; i++) {\\n if (i)\\n wt(' ');\\n wt(val[i]);\\n }\\n}\\n\\nvoid print() {\\n wt('\\\\n');\\n}\\ntemplate <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {\\n wt(head);\\n if (sizeof...(Tail))\\n wt(' ');\\n print(forward<Tail>(tail)...);\\n}\\nvoid __attribute__((destructor)) _d() {\\n flush();\\n}\\n} // namespace fastio\\n\\n\\nusing fastio::flush;\\nusing fastio::print;\\nusing fastio::read;\\n\\ninline void first(bool i = true) {\\n print(i ? \\\"first\\\" : \\\"second\\\");\\n}\\ninline void Alice(bool i = true) {\\n print(i ? \\\"Alice\\\" : \\\"Bob\\\");\\n}\\ninline void Takahashi(bool i = true) {\\n print(i ? \\\"Takahashi\\\" : \\\"Aoki\\\");\\n}\\ninline void yes(bool i = true) {\\n print(i ? \\\"yes\\\" : \\\"no\\\");\\n}\\ninline void Yes(bool i = true) {\\n print(i ? \\\"Yes\\\" : \\\"No\\\");\\n}\\ninline void No() {\\n print(\\\"No\\\");\\n}\\ninline void YES(bool i = true) {\\n print(i ? \\\"YES\\\" : \\\"NO\\\");\\n}\\ninline void NO() {\\n print(\\\"NO\\\");\\n}\\ninline void Yay(bool i = true) {\\n print(i ? \\\"Yay!\\\" : \\\":(\\\");\\n}\\ninline void Possible(bool i = true) {\\n print(i ? \\\"Possible\\\" : \\\"Impossible\\\");\\n}\\ninline void POSSIBLE(bool i = true) {\\n print(i ? \\\"POSSIBLE\\\" : \\\"IMPOSSIBLE\\\");\\n}\\n\\n/**\\n * @brief Fast IO\\n */\\n\\ntemplate <unsigned mod = 1000000007> struct fp {\\n unsigned v;\\n static constexpr int get_mod() {\\n return mod;\\n }\\n constexpr unsigned inv() const {\\n assert(v != 0);\\n int x = v, y = mod, p = 1, q = 0, t = 0, tmp = 0;\\n while (y > 0) {\\n t = x / y;\\n x -= t * y, p -= t * q;\\n tmp = x, x = y, y = tmp;\\n tmp = p, p = q, q = tmp;\\n }\\n if (p < 0)\\n p += mod;\\n return p;\\n }\\n constexpr fp(ll x = 0) : v(x >= 0 ? x % mod : (mod - (-x) % mod) % mod) {}\\n fp operator-() const {\\n return fp() - *this;\\n }\\n fp pow(ull t) {\\n fp res = 1, b = *this;\\n while (t) {\\n if (t & 1)\\n res *= b;\\n b *= b;\\n t >>= 1;\\n }\\n return res;\\n }\\n fp &operator+=(const fp &x) {\\n if ((v += x.v) >= mod)\\n v -= mod;\\n return *this;\\n }\\n fp &operator-=(const fp &x) {\\n if ((v += mod - x.v) >= mod)\\n v -= mod;\\n return *this;\\n }\\n fp &operator*=(const fp &x) {\\n v = ull(v) * x.v % mod;\\n return *this;\\n }\\n fp &operator/=(const fp &x) {\\n v = ull(v) * x.inv() % mod;\\n return *this;\\n }\\n fp operator+(const fp &x) const {\\n return fp(*this) += x;\\n }\\n fp operator-(const fp &x) const {\\n return fp(*this) -= x;\\n }\\n fp operator*(const fp &x) const {\\n return fp(*this) *= x;\\n }\\n fp operator/(const fp &x) const {\\n return fp(*this) /= x;\\n }\\n bool operator==(const fp &x) const {\\n return v == x.v;\\n }\\n bool operator!=(const fp &x) const {\\n return v != x.v;\\n }\\n friend istream &operator>>(istream &is, fp &x) {\\n return is >> x.v;\\n }\\n friend ostream &operator<<(ostream &os, const fp &x) {\\n return os << x.v;\\n }\\n};\\n\\ntemplate <unsigned mod> void rd(fp<mod> &x) {\\n fastio::rd(x.v);\\n}\\ntemplate <unsigned mod> void wt(fp<mod> x) {\\n fastio::wt(x.v);\\n}\\n\\ntemplate <typename T> T Inv(ll n) {\\n static const int md = T::get_mod();\\n static vector<T> buf({0, 1});\\n assert(n > 0);\\n n %= md;\\n while (SZ(buf) <= n) {\\n int k = SZ(buf), q = (md + k - 1) / k;\\n buf.push_back(buf[k * q - md] * q);\\n }\\n return buf[n];\\n}\\n\\ntemplate <typename T> T Fact(ll n, bool inv = 0) {\\n static const int md = T::get_mod();\\n static vector<T> buf({1, 1}), ibuf({1, 1});\\n assert(n >= 0 and n < md);\\n while (SZ(buf) <= n) {\\n buf.push_back(buf.back() * SZ(buf));\\n ibuf.push_back(ibuf.back() * Inv<T>(SZ(ibuf)));\\n }\\n return inv ? ibuf[n] : buf[n];\\n}\\n\\ntemplate <typename T> T nPr(int n, int r, bool inv = 0) {\\n if (n < 0 || n < r || r < 0)\\n return 0;\\n return Fact<T>(n, inv) * Fact<T>(n - r, inv ^ 1);\\n}\\ntemplate <typename T> T nCr(int n, int r, bool inv = 0) {\\n if (n < 0 || n < r || r < 0)\\n return 0;\\n return Fact<T>(n, inv) * Fact<T>(r, inv ^ 1) * Fact<T>(n - r, inv ^ 1);\\n}\\ntemplate <typename T> T nHr(int n, int r, bool inv = 0) {\\n return nCr<T>(n + r - 1, r, inv);\\n}\\n\\n/**\\n * @brief Modint\\n */\\n\\nint main() {\\nwhile(1) {\\n ll X;\\n cin >> X;\\n if (X == 0) return 0;\\n X *= 2;\\n vector<ll> V;\\n for (ll i = 1; i * i <= X; i++) {\\n if (X % i == 0) V.push_back(i);\\n }\\n reverse(V.begin(), V.end());\\n for (ll P : V) {\\n ll Q = X / P;\\n if ((Q - P + 1) % 2 != 0) continue;\\n if (Q - P + 1> 0) {\\n cout << (Q - P + 1) / 2 << ' ' << P << endl;\\n break;\\n }\\n }\\n}\\n}\",\n \"accuracy\": 1,\n \"time_ms\": 80,\n \"memory_kb\": 3408,\n \"score_of_the_acc\": -0.5443,\n \"final_rank\": 5\n }\n]","isConversational":false}}}],"truncated":false,"partial":false},"paginationData":{"pageIndex":9,"numItemsPerPage":100,"numTotalItems":2103,"offset":900,"length":100}},"jwt":"eyJhbGciOiJFZERTQSJ9.eyJyZWFkIjp0cnVlLCJwZXJtaXNzaW9ucyI6eyJyZXBvLmNvbnRlbnQucmVhZCI6dHJ1ZX0sImlhdCI6MTc3Mzk2ODA2NSwic3ViIjoiL2RhdGFzZXRzL09OTFlTTElNRS9BT0otQ29kZVJhbmstQmVuY2htYXJrIiwiZXhwIjoxNzczOTcxNjY1LCJpc3MiOiJodHRwczovL2h1Z2dpbmdmYWNlLmNvIn0.6K7JWqO15lZBlKmXUaq9MQOCUbVfK9dAzNGfmo69mXt6cZeC1McLY2ZvAJ-NoEryJ_DLIrDhmSCq_MHkz0NUBg","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_1465_cpp | Scheduling Two Meetings
You are the chief judge of the International Collegiate Quiz Contest (ICQC) this year. You want to hold judge meetings twice for preparing the problem set of the contest. You proposed candidate schedules for the meetings, and all the judges answered for each of the time slots whether they would attend the meeting on-site or remotely via a video conference tool.
You have to choose a pair of two distinct time slots, so that every judge attends at least one of the two meetings on-site. When there are multiple such pairs, you’d like to choose one with the largest number of judges attending both meetings on-site. If multiple pairs are still equally desirable with these criteria, one with the earlier first meeting is preferred. If there still remain multiple pairs with the same time slot for the first meeting, the one with the earliest second meeting should be chosen.
Input
The input consists of a single test case of the following format.
$n$ $m$
$a_{1,1}$ ... $a_{1,m}$
$\vdots$
$a_{n,1}$ ... $a_{n,m}$
Two integers $n$ and $m$ are given in the first line. The first integer $n$ ($2 \leq n \leq 2 \times 10^5$) is the number of candidate time slots. Here, the candidate time slots are numbered 1 through $n$, and smaller numbers mean earlier time slots. The second integer $m$ ($2 \leq m \leq 20$) is the number of judges.
In the following $n$ lines, $a_{i,j}$ is either a character
Y
indicating that the $j$-th judge attends a meeting at the $i$-th candidate time slot on-site, or a character
N
indicating remote attendance.
Output
Output a line containing the two time slot numbers of the most preferable choice, separated by a space, with the earlier time slot first. If there are no pairs of time slots satisfying the condition, output
No
.
Sample Input 1
4 3
NNY
YYN
YNY
NYY
Sample Output 1
2 3
Sample Input 2
3 6
NNNYYY
YYNYYN
YYYNNN
Sample Output 2
1 3
Sample Input 3
6 5
NNNNN
YNNNY
YYNNN
YYNNN
NYYNY
NNYYY
Sample Output 3
3 6
Sample Input 4
3 3
YNN
NYN
NNY
Sample Output 4
No
Sample Input 5
4 4
NYNN
YNYY
YNYN
NNYY
Sample Output 5
1 2 | [
{
"submission_id": "aoj_1465_11055654",
"code_snippet": "#include <bits/stdc++.h>\n#include <numeric>\nusing namespace std;\n\nusing i64 = int64_t;\n\n#define rep(i, n) for(i64 i = 0; i < (n); i++)\n#define each(x, a) for(auto& x: a)\n\ntemplate<class T, T id, T (*op)(T,T)>\nstruct SegTree{\n\ti64 n=1;\n\tv... |
aoj_1463_cpp | Greatest of the Greatest Common Divisors
You are given a sequence of integers and a number of intervals in the sequence. The intervals are specified by their leftmost and rightmost positions. An interval consisting of $k$ integers has $k(k − 1)/2$ pairs of integers at different positions, which have their greatest common divisors. For each given interval, find the greatest one among such greatest common divisors.
For example, when the sequence is ($a_1, . . . , a_6) = (10, 20, 30, 40, 50, 60)$, and the whole sequence is specified as the interval, the following 15 pairs of two integers at different positions $x$ and $y$, and their greatest common divisors should be considered.
x
1
1
1
1
1
2
2
2
2
3
3
3
4
4
5
y
2
3
4
5
6
3
4
5
6
4
5
6
5
6
6
ax
10
10
10
10
10
20
20
20
20
30
30
30
40
40
50
ay
20
30
40
50
60
30
40
50
60
40
50
60
50
60
60
gcd(ax, ay)
10
10
10
10
10
10
20
10
20
10
10
30
10
20
10
The greatest of the greatest common divisors of the 15 pairs is $gcd(30, 60) = 30$, in this case.
Input
The input consists of a single test case of the following format.
$n$
$a_1$ ... $a_n$
$q$
$l_1$ $r_1$
$\vdots$
$l_q$ $r_q$
The first line contains an integer n, which is the number of integers in the given sequence, satisfying $2 \leq n \leq 10^5$. The second line contains n positive integers a1 through an, specifying the sequence. None of them exceeds $10^5$.
The third line contains a positive integer $q$, specifying the number of intervals in the sequence to be considered, which does not exceed $10^5$. It is followed by $q$ lines, each specifying an interval in the sequence to be considered. The $i$-th line of them has two integers, $l_i$ and $r_i$ ($1 \leq l_i < r_i \leq n$), specifying the interval $a_{l_i}$ through $a_{r_i}$ in the sequence.
Output
Output $q$ lines, the $i$-th line of which should have the greatest of the greatest common divisors of all pairs in the interval specified by $l_i$ and $r_i$.
Sample Input 1
6
10 20 30 40 50 60
3
1 6
2 5
4 5
Sample Output 1
30
20
10
Sample Input 2
10
13 2 35 4 13 2 5 1 7 4
5
1 4
4 10
3 8
3 9
1 10
Sample Output 2
2
4
5
7
13 | [
{
"submission_id": "aoj_1463_11052822",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst ll INF = 1LL << 60;\n#define rep(i, a) for(ll i = 0; i < (a); i++)\n#define all(a) begin(a), end(a)\n#define sz(a) (a).size()\nbool chmin(auto &a, auto b) { return a > b ? a ... |
aoj_1506_cpp | Problem G: Dice
サイコロ３兄弟は三つ子であり一心同体、３つでひとつとも言ってもよい。三つ子であるため見分けがつかないほど似ている。そんなサイコロ３兄弟はA君のお気に入りのおもちゃだ。A君はいつも３つ１セットでサイコロを転がして遊んでいる。このようにA君が楽しく遊ぶおもちゃだが、実は大きな秘密があった。彼らは実は生きていて、話したり自由に動いたりできるのだ。子ども部屋は
r
×
c
の大きさのグリッドで表すことができ、とても大きいものが散乱している。
サイコロ３兄弟は室内を東西南北の４方向へ進行方向に向かって転がりながら移動する。その形ゆえに斜め移動ができないのが、少し気の毒である。進行方向にとても大きいものがある場合、サイコロは進行方向に進むことができない。
サイコロ３兄弟は３つで１セットであるため、一度にひとつのサイコロしか移動することができない。また、サイコロたちはその場で回転するなどという器用な能力は持っていない。
彼らが話したり動いたりしている事実は人間には知られてはいけないというのが「おもちゃのルール」である。このルールを破ったおもちゃはこの世から消滅してしまう。A君が出かけているときに動いたり話したりしているおもちゃたちだが、A君が帰宅して子ども部屋に入ってきたときにもとの位置に戻っていなければならない。A君が帰宅した直後は緊急事態であり、A君が子ども部屋にたどり着く前にあらゆるおもちゃは即座にもとの場所へ戻らなければならない。
A君は床を見下ろすかたちになるため、サイコロの場所と上を向いている数字が正しければ、移動したことに気づくことはない。また、サイコロたちは見分けがつかないほど似ているので、どの収納場所にどのサイコロが向かっても支障はない。
そんなある日、A君のおもちゃ箱の中で最も優秀なプログラマーであるあなたに、与えられたサイコロの位置情報と収納場所から最短何手でサイコロ達が収納場所に戻れるかを計算する任務が与えられた。
サイコロ３兄弟を溺愛しているA君の手からサイコロ３兄弟が消えてしまったら、A君は泣いてしまうので、とても重要な任務である。
Input
入力は以下のフォーマットで与えられる。
r
c
grid
1
.
.
.
grid
r
grid
i
は長さ
c
の文字列で、1から6までの数字か"."か”x”か”o”からなる。
数字は収納場所かつ、到着時のサイコロの上の値を示している。
“.”は普通の床を示している。
“x”はとてもおおきなものを示している。
“o”はサイコロを示している。
入力は以下の制約を満たす
1 ≤ r,c ≤ 20
初期状態でのサイコロの向きは以下の図に従う。
Output
それぞれの入力に対する、各サイコロがすべて収納できるまでの最短手数を求めよ。
Sample Input 1
3 3
4o.
4o.
4o.
Sample Output 1
３
各サイコロが西方向に移動すればよい。
Sample Input 2
4 4
4o..
.o3.
.o..
.5..
Sample Output2
3
1行目のにあるサイコロが西方向
2行目のにあるサイコロが東方向
3行目のにあるサイコロが南方向に移動すればよい。
Sample Input 3
6 10
1xxxxxxxxx
o.......o.
xxxx.xxxx4
xoxx.xxxx.
x....3xx..
x..xxxxx..
Sample Output 3
34 | [
{
"submission_id": "aoj_1506_10349794",
"code_snippet": "// AOJ #1506 Dice\n// 2025.4.5\n\n#include <bits/stdc++.h>\nusing namespace std;\nconst int INF = 10000000;\n\nint R, C;\nchar g[25][25];\nint goalX[3], goalY[3], goalTop[3];\n\nint tableArr[6][4] = {\n {1, 3, 4, 2},\n {0, 2, 5, 3},\n {0, 4, ... |
aoj_1502_cpp | Problem C : War
A国とB国という２つの国が戦争をしている。A国の軍人であるあなたは
n
人の兵士を率いて、B国の領土を占領する事になった。
B国の領土は２次元グリッドで表されている。あなたが最初に占領する場所は二次元グリッド上のある１マスである。
あなたが率いている兵士たちは、それぞれ
h
i
の体力を持っている。
それぞれの兵士は体力を1を消費して移動することができる。
現在いるマスを(a,b)とすると、(a+1,b),(a-1,b),(a,b+1),(a,b-1)の4方向を移動先として選ぶことが可能である。
兵士は体力が0になったらそこから動くことができなくなる。
一人以上の兵士が通過したマスはすべて占領することができる。
あなたの仕事は、最大でいくつのマスを占領することができるかを求めることである。
ただし、この２次元グリッドのサイズは無限に広いとすること。
Input
入力は以下のフォーマットで与えられる。
n
h
1
.
.
.
h
n
入力は以下の制約を満たす
1 ≤
n
≤ 500
1 ≤
h
i
≤ 10,000,000
Output
答えの値を１行に出力せよ
Sample Input 1
2
5
5
Sample Output 1
11
Sample Input 2
10
10
10
10
10
10
10
10
10
10
10
Sample Output 2
93
Sample Input 3
5
1
2
3
4
5
Sample Output 3
15 | [
{
"submission_id": "aoj_1502_7916695",
"code_snippet": "#include<bits/stdc++.h>\n#define rep(i, n) for(ll i = 0; i < (ll)(n); i++)\n\nusing namespace std;\nusing ll = long long;\n\nconst int MAX_N = 1e7+10;\nint main(){\n\tint N; cin >> N;\n\tvector<int> H(N);\n\trep(i, N) cin >> H[i];\n\n\tvector<ll> num(M... |
aoj_1466_cpp | Peculiar Protocol
The Kingdom of
Icpca
has a peculiar protocol in wedding ceremonies. That is, amounts of monetary gifts should be a multiple of a fixed quantity plus a fixed extra. When the fixed quantity is $d$ and the fixed extra is $r$, courteous amounts of wedding gifts are $k \times d + r$ for any non-negative integer multipliers $k$.
Initially, you have a pile of $n$ banknotes. Every time you attend a wedding ceremony, you draw out a contiguous portion from your current banknote pile as your gift that sums up to a courteous amount, that is, a multiple of $d$ plus additional $r$. If no contiguous portion sums up to such an amount, you cannot attend wedding ceremonies any more. After drawing out, the remaining banknotes are squeezed to form a single pile, keeping their relative order. The resultant pile of banknotes may have portions with such an amount, which allows you to attend more ceremonies.
Your monetary gifts are expected to raise your social reputation. As the additional amount r is considered mandatory, the multiplier $k$ is considered significant. Your reputation is raised in proportion to $k$ at each of the ceremonies you attend.
For example, assume $d = 5$ and $r = 1$, and you have banknotes whose values are 2, 2, 2, 4, and 4, piled up in this order. When you attend a wedding ceremony, there are following two possible ways to give courteous monetary gifts.
Give a monetary gift consisting of the first three banknotes from the top, totaling $2+2+2 = 6 = 1 \times d+r$. After drawing them out, you have banknotes with values 4 and 4. No contiguous portion of your remaining banknote pile sums up to a courteous amount. Thus, you cannot attend wedding ceremonies anymore.
Give a monetary gift consisting of the third and the fourth banknotes, totaling $2+4 = 6 = 1 \times d+r$. After drawing them out, you have banknotes with values 2, 2, and 4, in this order. You can attend another wedding ceremony because the second and the third banknotes total $2+4 = 6 = 1 \times d+r$, which is courteous.
In this example, the second way can maximize your social reputation by attending two ceremonies, because the total of the multipliers is $1 + 1 = 2$, which achieves the maximum possible.
In contrast, if the value of the first banknote is 12, giving the first three banknotes at a ceremony prevents you from attending more ceremonies. That, however, maximizes your social reputation because the total of the multipliers is 3, which achieves the maximum possible.
Compute the maximum possible total of the multipliers with your monetary gifts at wedding ceremonies. You may assume that you have so many unmarried relatives and friends that you can attend any number of wedding ceremonies as long as you can give courteous monetary gifts.
Input
The input consists of a single test case in the following format.
$n$ $d$ $r$
$a_1$ ... $a_n$
The first line has three integers $n$, $d$, and $r$. The integer $n$ ($1 \leq n \leq 500$) is the number of banknotes you have. Th
...(truncated) | [
{
"submission_id": "aoj_1466_10437156",
"code_snippet": "// AOJ #1486 Peculiar Protocol\n// 2025.5.1\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst ll INF = (ll)1e18;\n\n#define gc() getchar_unlocked()\n\nint Cin() {\n\tint n = 0, c = gc();\n\tdo n = 10*n + (c & 0xf), c = gc... |
aoj_1501_cpp | Problem B : Grid
r
×
c
の2次元グリッド上の２つの座標 (
a
1
,
a
2
) と (
b
1
,
b
2
) が与えられる。
あるマス (e,f) から (e+1,f)、(e-1,f)、(e,f+1)、(e,f-1) のどれかのマスに移動するコストを１とする。
また、(e,c-1) と (e,0)、(r-1,f) と (0,f) の間もコスト１で移動することができる。
この時に１つ目の座標から２つ目の座標へ最短コストで移動できる経路の数を求めよ。
Input
入力は以下のフォーマットで与えられる。
r
c
a
1
a
2
b
1
b
2
入力は以下の制約を満たす
1 ≤
r
,
c
≤ 1,000
0 ≤
a
1
,
b
1
< r
0 ≤
a
2
,
b
2
< c
Output
答えの値を100,000,007で割った余りを出力せよ。
Sample Input 1
4 4 0 0 3 3
Sample Output 1
2
Sample Input 2
4 4 0 0 1 1
Sample Output 2
2
Sample Input 3
2 3 0 0 1 2
Sample Output 3
4
Sample Input 4
500 500 0 0 200 200
Sample Output 4
34807775 | [
{
"submission_id": "aoj_1501_7916754",
"code_snippet": "#include<bits/stdc++.h>\n#define rep(i,n) for(int i =0; i<(n); i++)\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> P;\nconst int mod = 100000007;\nconst int inf ( 1<<30);\n\nint main(){\n\tint r,c; cin>>r>>c;\n\tvector<vector<ll>> ... |
aoj_1504_cpp | Problem E : Connect
r
×
c
のグリッドが与えられる。
グリッドのいくつかのマスには1から8までの数字が書かれている。
数字が書かれているマスと他の数字が書かれているマスを線で結ぶ必要がある。
数字が書かれているマスについて、そのマスに書かれている本数だけ、他のマスとの間に線を結ぶ必要がある。
ただし、線を結べるのは上下左右方向だけで、一つの方向について、最大２本までである。
他の数字を跨いで線で結ぶことはできない。
また、次のように交差してしまう結び方をすることはできない。
グリッドが入力として与えられるので、数字が書かれているマス全てを正しく結ぶ方法が、何通りあるのかを数えて欲しい。
Input
入力は以下のフォーマットで与えられる。
r
c
grid
1
.
.
.
grid
r-1
grid
i
は長さcの文字列で、1から8までの数字か"."からなる。
入力は以下の制約を満たす
1 ≤
r,c
≤ 10
Output
答えの値を100,000,007で割った余りを1行に出力せよ
Sample Input 1
3 3
.1.
1.1
.1.
Sample Output 1
0
Sample Input 2
1 3
1.1
Sample Output 2
1
Sample Input 3
3 3
4.2
...
2..
Sample Output 3
1
Sample Input 4
7 7
2.3.1.1
.......
2......
.......
..3.3..
.......
2.2.4.3
Sample Output 4
10 | [
{
"submission_id": "aoj_1504_10344187",
"code_snippet": "// AOJ #1504 Connect\n// 2025.4.2\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst int MOD = 100000007;\n\nint dp[2][3][60005];\nint d[11];\n\nint main(){\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n int H, W;\n... |
aoj_1500_cpp | Problem A : ID
A大学ではIDの入力ミスが多発していた。
そこで、A大学は入力ミス防止のため新しいIDを発行することにした。
新しいIDには入力ミス防止のためにIDが正しいかどうかチェックする方法がある。
・全ての桁の数字の総和を求める。
・ただし、右端の桁を１番目として、偶数番目の桁の数字を２倍にする。
・２倍することによって数字が１０以上になった時、１の位の数字と１０の位の数字を加算した数字をその桁の数字とする。
・総和が１０で割り切れれば正しいID、そうでなければ間違いとする。
例として、53579というIDをチェックする。
全ての桁の数字の総和を求めるので、
5 + 3 + 5 + 7 + 9
ただし、偶数番目の桁の数字を２倍にするので、
5 +
6
+ 5 +
14
+ 9
２倍することによって数字が１０以上になった時、１の位の数字と１０の位の数字を加算した数字をその桁の数字とするので、
5 + 6 + 5 +
(1 + 4)
+ 9
以上より、総和は30となる。30は10で割り切れるので、53579は正しいIDである。
B君はA大学の大学生であり、新しいIDを発行してもらったが、IDの一部の桁を忘れてしまった。
しかし、忘れてしまった部分にどんな数字が入るか、いくつか候補を絞ることに成功した。
あなたの仕事は、B君のIDの正しい組み合わせが何通りあるかを求めることである。
Input
入力は以下のフォーマットで与えられる。
n
ID
m
a
0
a
1
... a
m-1
n
は
ID
の桁の数である。
ID
の各桁には0~9の数字または忘れた桁であるということを示す'*'という文字が入る。
m
は'*'に入る数字の候補の数である。
a
i
は'*'に入る数字の候補である。
入力は以下の制約を満たす
1 ≤
n
≤ 100,000
1 ≤
m
≤ 10
0 ≤
a
i
≤ 9
1 ≤ '*'の数 ≤ 7
Output
答えの値を１行に出力せよ
Sample Input 1
5
5*57*
2
3 9
Sample Output 1
1
Sample Input 2
15
2***9*2*6*1199*
9
0 1 2 3 4 6 7 8 9
Sample Output 2
478297 | [
{
"submission_id": "aoj_1500_6006661",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <stdio.h>\n#include <vector>\nusing namespace std;\nconst int maxn=100010;\n\nint a[10]={0,2,4,6,8,1,3,5,7,9};\nint choose[10];\nint sum=0,sum2=0,sum3=0;\nint ans=0;\nint n,m;\nvoid dfs2(int x,int ss)... |
aoj_1505_cpp | Problem F : Dungeon (I)
あなたはとあるゲームの開発に携わっている。
そのゲームはランダムに生成されたダンジョンをプレイヤーが探索するというものである。
このゲームで生成されるダンジョンには
n
個の部屋が存在しており、0から
n-1
までの番号が割り振られている。
部屋と部屋は通路で結ばれている。部屋と部屋を結ぶ通路は、
m
本ある。
通路はどちらの方向へも進むことができる。
また、部屋と部屋の間には距離が設定されている。
生成されたダンジョンではいくつかの通路を経由して、ある部屋から他のすべての部屋へ行くことが可能である。
そして、プレイヤーがゲームを行う際に、0番の部屋がスタート地点、
n-1
番の部屋がゴール地点として選ばれる。
ユーザーがダンジョンを探索する際に、手助けになるようなアイテムが入った宝箱を、どこかの部屋に設置したい。
その時に、スタート地点から遠すぎたり、ゴール地点から近すぎると意味がない。
そこで、スタートから距離
fs
以内で辿りつけて、ゴールに辿り着くために最短経路を通った場合に、少なくとも
fg
かかる部屋を宝箱を設置する候補としたい。
生成されたダンジョンと、
q
が与えられる。
q
個のクエリーについて、宝箱を設置する場所の候補の数を数えて欲しい。
Input
入力は以下のフォーマットで与えられる。
n
m
a
1
b
1
c
1
.
.
.
a
m
b
m
c
m
q
fs
1
fg
1
.
.
.
fs
q
fg
q
a
i
b
i
c
i
は 部屋
a
i
と
b
i
を結ぶ通路の距離が
c
i
であることを表す。
入力は以下の制約を満たす
2 ≤
n
≤ 100,000
0 ≤
a
i
,
b
i
<
n
0 ≤
c
i
≤ 100,000
n-1
≤
m
≤ 100,000
1 ≤
q
≤ 100,000
0 ≤
fs
i
,
fg
i
≤ 2
60
Output
各クエリーについて、答えの値を1行に出力せよ
Sample Input 1
4 4
0 1 3
1 3 4
0 2 2
2 3 1
4
0 0
2 2
2 1
3 4
Sample Output 1
1
1
2
1 | [
{
"submission_id": "aoj_1505_10000615",
"code_snippet": "#include <cstdio>\n#include <algorithm>\n#include <vector>\n#include <queue>\nusing namespace std;\ntypedef long long ll;\ntypedef pair<ll,int> P;\n#define pu push\n#define pb push_back\n#define mp make_pair\n#define INF 10000000000000000\nint n,m;\nl... |
aoj_1503_cpp | Problem D : Numbers
n
が与えられるので、
n
個の連続した正の整数を求めよ。
ただしすべての数が、１とその数自身以外の約数をもたなくてはならない。
Input
入力は以下のフォーマットで与えられる。
n
入力は以下の制約を満たす。
1 ≤
n
≤ 1,500
Output
最初の行に、あなたが選んだ連続した
n
個の正の整数の中で一番小さいものを出力せよ。
2行目から
n+1
行目に、それぞれの値に対する約数を出力せよ。
約数は1かその数自身でなければどの値を出力しても良い。
1行目に出力した数を
x
として、i行目には
x+i-2
の約数を出力せよ。
出力する値は5,000桁を超えてはいけない。
Sample Input 1
2
Sample Output 1
8
2
3
Sample Input 2
3
Sample Output 2
8
2
3
5
Hint
Sample Output 2では、8,9,10を3個の連続した整数として選んでいる。
2行目に、8の約数として2,3行目は9の約数として3,４行目には10の約数として5,を出力している。 | [
{
"submission_id": "aoj_1503_3430839",
"code_snippet": "#include<bits/stdc++.h>\n#include <boost/multiprecision/cpp_dec_float.hpp>\n#include <boost/multiprecision/cpp_int.hpp>\n#include <boost/rational.hpp>\nusing namespace std;\n\n#define lint long long\n#define P pair<int, int>\n#define LLP pair<long long... |
aoj_1507_cpp | Problem H : Dungeon (II)
あなたはとあるゲームの開発に携わっている。
そのゲームはランダムに生成されたダンジョンをプレイヤーが探索するというものである。
ゲームの仕様として、プレイヤーに予めダンジョンの危険度を提示し、生成されたダンジョンを探索するのか、それとも新しくダンジョンを生成しなおすかを、選択できるようにしたい。
このゲームで生成されるダンジョンには
n
個の部屋が存在しており、0から
n-1
までの番号が割り振られている。
部屋と部屋は通路で結ばれている。部屋と部屋を結ぶ通路は、合計で
n-1
本存在している。
通路はどちらの方向へも進むことができる。
また、部屋と部屋の間には距離が設定されている。
生成されたダンジョンではいくつかの通路を経由して、ある部屋から他のすべての部屋へ行くことが可能である。
そして、プレイヤーがゲームを行う際に、２つの異なる部屋がスタート地点とゴール地点として選ばれる。
あなたはダンジョンの評価を行うために、危険度の評価方法を決めることにした。
まず、ある部屋から別の部屋までに移動する際の危険度を、部屋間を最短で移動するために使う通路の中で、最もコスト高い通路の値とする。
そして、ダンジョンの危険度を、
i
<
j
となる部屋のペアの間を移動する際の危険度の総和とすることにした。
ランダムに生成されたダンジョンのが入力として与えられる。
まず、
i
<
j
となるすべての部屋のペアについて、移動する際の危険度を計算して欲しい。
そして、その総和を問題の答えとして出力せよ。
Input
入力は以下のフォーマットで与えられる。
n
a
1
b
1
c
1
.
.
.
a
n-1
b
n-1
c
n-1
a
i
b
i
c
i
は 部屋
a
i
と
b
i
を結ぶ通路の距離が
c
i
であることを表す。
入力は以下の制約を満たす
2 ≤
n
≤ 200,000
0 ≤
a
i
,
b
i
<
n
0 ≤
c
i
≤ 100,000
Output
答えの値を1行に出力せよ
Sample Input 1
4
0 1 3
1 2 5
1 3 2
Sample Output 1
23
Sample Input 2
6
0 2 5
2 1 1
2 3 10
3 5 4
3 4 2
Sample Output 2
111 | [
{
"submission_id": "aoj_1507_10772260",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\n#define lint long long\n#define P pair<int, int>\n#define LLP pair<long long, long long>\n#define REP(i, x, n) for(int i = (x), i##_len = (int)(n) ; i < i##_len ; ++i)\n#define rep(i, n) for(int i = 0, ... |
aoj_1509_cpp | Problem A: Rental DVD Shop NEO
Problem
僕はレンタルDVDショップ、「NEO」でアルバイトを始めた。まずはこの店の料金システムを勉強することになった。
レンタルDVDは旧作、準新作、新作の3種類存在し、1本のレンタル料金がそれぞれ
a
円、
b
円、
c
円である。
会計の際に以下に示すセットレンタルを複数回適用することができる。
まだセットレンタルを適用していないDVDを数本選ぶ。
選んだDVDの本数が
d
本以上の場合、選んだDVDの合計金額が、
(選んだDVDの本数)
*
e
円を超える場合は、それらを
(選んだDVDの本数)
*
e
円でレンタル出来る。
選んだDVDの本数が
d
本未満の場合、選んだDVDの合計金額が
d
*
e
円を超える場合は、それらを
d
*
e
円でレンタル出来る。
上記に当てはまらない場合、選んだDVDは通常料金でレンタルとなる。
ここで僕はある問題に気づいた。セットレンタルはレジに通した時に自動的に適用されるのではなく、手動で適用しているのだ。これでは最適ではない（もっと安くなる余地がある）セットレンタルの適用をしてしまう可能性がある。これではクレームが発生しかねない。僕はクレーム対応が嫌いなので、セットレンタルを最適に適用した時の料金を計算するプログラムを作成することにした。
Input
入力は複数のデータセットからなる。
各データセットは以下で表される。
1行目は5つの整数
a
,
b
,
c
,
d
,
e
がスペース区切りで与えられる。
2行目にはレンタル本数が与えられる。3つの整数
na
,
nb
,
nc
がスペース区切りで与えられる。それぞれ旧作、準新作、新作のDVDの本数を表す。
入力の終わりは5つのゼロからなる。
a
b
c
d
e
na
nb
nc
Constraints
入力は以下の条件を満たす。
入力に含まれる値はすべて整数
0 <
a
<
b
<
e
<
c
≤ 1000
0 <
d
≤ 100000
0 ≤
na
,
nb
,
nc
≤ 100000
0 <
na
+
nb
+
nc
データセットの数は100個以下
Output
各データセットにつき、セットレンタルを最適に適用した時の料金を1行に出力せよ。
Sample Input
70 100 340 4 200
1 1 4
70 100 340 4 200
0 1 3
70 100 340 4 200
1 1 2
0 0 0 0 0
Sample Output
970
800
800 | [
{
"submission_id": "aoj_1509_8293237",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nlong long A, B, C, D, E;\nlong long NA, NB, NC;\n\nint main() {\n\twhile (true) {\n\t\t// Step 1. Input\n\t\tcin >> A >> B >> C >> D >> E; if (A + B + C + D + E == 0)... |
aoj_1510_cpp | Problem B: Independent Research
Problem
僕は夏休みの自由研究のテーマとして、生き物観察を選択し、生き物観察キットを購入した。
この生き物は3次元グリッド状の空間を好んで生息する。
各セルには最大1匹までしか入れない。
周囲の環境に合わせ1日が経過するごとに誕生と死滅を繰り返す。
誕生と死滅の条件は、セルに隣接する生き物の数に依存する。
ここで、あるセルに生き物が隣接するとは、あるセルと生き物が生息しているもう一つのセルが面、辺、または点を共有していることを言う。
誕生と死滅のルールは次のようになる。
生き物が生息していないセルにおいて、隣接する生き物の数が
a
i
(1 ≤
i
≤
M
1
) 匹であるような
i
がある場合、そのセルに生き物が誕生する。
生き物が生息しているセルにおいて、隣接する生き物の数が
b
j
(1 ≤
j
≤
M
2
) 匹であるような
j
がない場合、そのセルの生き物は死滅する。
今回購入した飼育箱はセルの数が5*5*5である立方体の飼育箱だ。
この飼育箱ではこの生き物はどのような振る舞いをするのだろうか…？ とても楽しみである。
〜数日後〜
とりあえず、飼育してみたが…
毎日観察するなんて時間がかかるし、僕にはめんどくさくてやる気がおきない。
そうだ、コンピューターとプログラムを使ってシミュレートしよう。
Input
入力は複数のデータセットからなる。
各データセットは以下のフォーマットで与えられる。
N
(
z
= 0 の飼育箱の状態)
(空行)
(
z
= 1 の飼育箱の状態)
(空行)
(
z
= 2 の飼育箱の状態)
(空行)
(
z
= 3 の飼育箱の状態)
(空行)
(
z
= 4 の飼育箱の状態)
(空行)
M
1
a
1
a
2
…
a
M
1
M
2
b
1
b
2
…
b
M
2
最初にシミュレートする日数
N
が与えられる。
次に飼育箱の初期状態の情報が与えられる。これは5つの5*5の2次元グリッドで与えられる。
各2次元グリッドは0と1から成り立ち、1は生き物がいることを示し、0は何もいないことを示す。
例えば、
z
= 0のセルの状態の2次元グリッドの4行2列目の値が1だった場合、飼育箱の座標(1, 3, 0)の位置に生き物がいることを表す。
次に、整数
M
1
が与えられ、そのあとに
M
1
個の数字
a
i
が与えられる。
次に、整数
M
2
が与えられ、そのあとに
M
2
個の数字
b
j
が与えられる。
入力の終わりは
N
= 0で表される。
Constraints
入力は以下の条件を満たす。
1 ≤
N
≤ 100
0 ≤
M
1
,
M
2
≤ 27
0 ≤
a
i
,
b
j
≤ 26
(1 ≤
i
≤
M
1
, 1 ≤
j
≤
M
2
)
任意の
i
,
j
(1 ≤
i
<
j
≤
M
1
)
において、
a
i
≠
a
j
任意の
i
,
j
(1 ≤
i
<
j
≤
M
2
)
において、
b
i
≠
b
j
Output
各データセットに対し、
N
日経過後の状態を出力せよ。
出力は以下のフォーマットに従う。
Case (テストケースの番号):
(
z
= 0 の飼育箱の状態)
(空行)
(
z
= 1 の飼育箱の状態)
(空行)
(
z
= 2 の飼育箱の状態)
(空行)
(
z
= 3 の飼育箱の状態)
(空行)
(
z
= 4 の飼育箱の状態)
1行目にテストケース番号を出力し、次の行から
N
日経過後の状態として、5*5の2次元グリッドを5つ出力せよ。
各テストケースの出力間には空行を出力しなさい。
Sample Input
5
00000
01010
00000
00100
00000
00000
01010
00000
01010
00000
00000
00100
00000
01010
00000
00000
01010
00000
00100
00000
00000
00000
00100
00000
00000
1 2
2 3 4
4
01110
00100
00100
00100
01110
01110
10001
10000
10001
01110
11111
10001
11111
10000
10000
01110
10001
10000
10001
01110
00000
00000
00000
00000
00000
2 3 4
1 2
100
00100
01010
01110
10001
10001
01110
00100
00100
00100
01110
00000
00000
00000
00000
00000
11111
00010
00100
01000
11111
10001
10001
10001
10001
01110
5 1 3 5 7 9
5 0 2 4 6 8
0
Sample Output
Case 1:
00000
00000
01010
01110
10101
00000
10001
00000
00000
00000
00000
00000
11111
10001
00000
00000
00000
00000
00000
01010
00000
00000
01110
00100
11111
Case 2:
00010
10110
00000
11000
10000
00001
00000
10101
00010
00100
10001
00000
00000
00000
00010
01110
10001
00000
00001
10000
00000
00000
00111
01001
01000
Case 3:
00000
00000
00000
00000
00000
00000
00000
00000
00000
00000
00000
00000
00000
00000
00000
00000
00000
00000
00000
00000
00000
00000
00000
00000
00000 | [
{
"submission_id": "aoj_1510_2169979",
"code_snippet": "#include<bits/stdc++.h>\n#define rep(i,n)for(int i=0;i<(n);i++)\nusing namespace std;\n\nint f[2][5][5][5], m1, a[27], m2, b[27];\nint main() {\n\tint n, cnt = 1;\n\twhile (scanf(\"%d\", &n), n) {\n\t\tif (cnt != 1)printf(\"\\n\");\n\t\trep(i, 5)rep(j,... |
aoj_1511_cpp | Problem C: General of Taiko
Problem
とあるゲームセンターには、曲に合わせて流れてくる譜面通りに和太鼓を叩くゲームがあります。
譜面は長さ
L
のセルからなり、各セルには何もない、またはノートと呼ばれるプレイヤーがとるべき行動を表した記号があります。
ノートは2種類ありそれぞれ、和太鼓の面を叩く「トン」、和太鼓の縁を叩く「コツ」があります。
これらのノートに合わせて和太鼓を叩くと得点を得ることができます。
この得点の合計が10000点以上であればクリアとなります。
このとき、プレイヤーが曲をクリアできる確率を求めなさい。ただし、プレイヤーは常に最適な行動をとることにします。
プレイヤーが譜面通りに和太鼓を叩く精度は11段階あり、それぞれ、
0%, 10%, 20%, ..., 90%, 100%の確率で譜面通りに和太鼓を叩くことができます。
上記の二種類の動作は右腕と左腕どちらででも行うことができます。
プレイヤーの情報として、それぞれの腕で行った場合の精度の安定率を表す値が16種類、下記のように与えられます。
lt
_
lt
lt
_
rt
lt
_
lk
lt
_
rk
rt
_
lt
rt
_
rt
rt
_
lk
rt
_
rk
lk
_
lt
lk
_
rt
lk
_
lk
lk
_
rk
rk
_
lt
rk
_
rt
rk
_
lk
rk
_
rk
ただし、
lt
は左腕でトン,
rt
は右腕でトン,
lk
は左腕でコツ,
rk
は右腕でコツの動作を表します。
例えば、
lt
_
rk
は左腕でトンのあとに右腕でコツを行った時の精度の安定の度合いを表し、この値によって左腕でトンのあとに右腕でコツを行うときの精度が、下記のように変化します。
プレイヤーの精度 = max(0, (精度の安定率 - 10) * 10 + 一つ前の精度) (%)
曲の情報は以下のとおりです。
曲の長さを表す
L
、譜面を表す
L
個の数字
s
i
(0 ≤
i
<
L
)で示される。譜面の先頭は
s
0
である。
s
i
の値は以下の3つです。
0 ... ノートなし
1 ... トン
2 ... コツ
プレイヤーが最初に和太鼓を叩くときの精度は100%です。
また、プレイヤーは譜面を無視することができます。
ノートがなかったり、ノートを無視した場合、プレイヤーの精度は100%になります。
各ノートに合わせて和太鼓を叩いたときの得点は下記のようになります。
得点 =
A
+
B
* min(コンボ数, 10)
この問題におけるコンボ数とは、連続してノートに合わせて和太鼓を叩けた数です。
プレイヤーがノートに合わせて叩いた場合、上記の式を元に得点が入り、その後にコンボ数が1増えます。
ノートに合わせて和太鼓を叩けなかった場合、コンボが途切れ、コンボ数が0になります。
Input
入力は複数のデータセットからなります。
各データセットは以下のとおりです。
lt
_
lt
lt
_
rt
lt
_
lk
lt
_
rk
rt
_
lt
rt
_
rt
rt
_
lk
rt
_
rk
lk
_
lt
lk
_
rt
lk
_
lk
lk
_
rk
rk
_
lt
rk
_
rt
rk
_
lk
rk
_
rk
L
s
0
s
1
s
2
…
s
L - 1
A
B
入力の終わりは負の整数4つからなります。
Constraints
入力は以下の条件を満たします。
0 <
L
≤ 100
0 ≤ 精度の安定率 ≤ 10
精度の安定率は整数
0 <
A
,
B
≤ 10000
A
と
B
はともに100の倍数
データセットの数は100個以下
Output
各入力に対して、クリアできる確率を1行で出力しなさい。
ただし、出力は0.001以下の誤差を含んでも良いです。
Sample Input
9 0 0 0
0 9 0 0
0 0 0 0
0 0 0 0
5
1 1 1 1 1
1000 500
10 10 10 10
10 10 10 10
10 10 10 10
10 10 10 10
5
1 0 2 0 1
1000 2000
3 8 6 10
0 1 6 8
10 2 4 7
8 6 6 8
19
2 2 0 2 2 0 2 1 0 1 2 0 1 2 0 1 0 2 2
200 100
-1 -1 -1 -1
Sample Output
0.3024000000
0.0000000000
0.5120000000 | [
{
"submission_id": "aoj_1511_9613108",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <cmath>\n#include <string>\n#include <vector>\n#include <stack>\n#include <queue>\n#include <set>\n#include <map>\n#include <cassert>\n#include <random>\n#include <iomanip>\n#pragma GCC optimize(\"O3\... |
aoj_1512_cpp | Problem D: Smartphone Game
Problem
人気のスマフォゲームの一機能を実装してみよう。ゲームは以下の仕様に基づく。
5*5のマスに、5種類のブロックが設置されている。
それぞれの種類のブロックには得点が設定されている。
得点には、ブロックの得点の他に、ボーナス得点が設定されている。最初のボーナス得点は1である。
ブロックを任意に1つだけ決めて、最大で
n
回まで上下左右に移動できる。移動先のブロックは移動元のブロックのあった場所に移動する。つまり、隣接したブロックを交換する事になる。
移動した後、同じ種類のブロックが縦3個以上又は横3個以上に並んだ場合、並んだブロックは全て消える。
消えるべきブロックが全て消えた後、あるブロックの下に別のブロックが存在しない場合、そのブロックは落下する。落下とは、あるブロックの１つ上に辿り着くまで下に移動する事をいう。ブロックが下に存在しない場合は一番下に移動する。
全てのブロックの落下後にボーナス得点が1だけ加算される。
その後にブロックが並んだ場合、さらに消え、落下する。
ブロックが消える時に、ブロック１つにつき「ブロックの得点*ボーナス得点」が自分の得点に加算される。
１回のプレイで得られる最大の点数を求めよ。
Input
入力は複数のデータセットからなる。
各データセットは以下で表される。
n
a
11
..
a
15
.
.
a
51
..
a
55
score
1
..
score
5
a
ij
は1から5までの数字で、ブロックの種類を表す。
score
i
は
i
種類目のブロック１つ分の得点を表す。
n
= -1 の時、入力が終了する。
Constraints
入力は以下の条件を満たす。
0 ≤
n
≤ 5
1 ≤
a
ij
≤ 5
0 ≤
score
i
≤ 100
テストケースの数は 10 を超えない。
入力に含まれる値は全て整数である。
Output
各データセット毎に、答えを一行に出力しなさい。
Sample Input
0
1 1 1 5 5
5 5 5 5 5
5 5 1 5 5
5 1 1 1 5
5 5 5 5 5
0 0 0 0 1
2
1 2 3 4 5
2 3 4 5 5
2 3 4 5 5
3 4 5 5 1
5 4 3 2 1
100 99 98 97 96
5
1 2 3 4 5
2 3 4 5 1
1 2 3 4 5
5 4 3 2 1
1 2 3 4 5
99 79 31 23 56
-1
Sample Output
17
2040
926 | [
{
"submission_id": "aoj_1512_10235110",
"code_snippet": "// AOJ #1512 Smartphone Game\n// 2025.2.20\n\n#include <bits/stdc++.h>\nusing namespace std;\n\nconst int NROWS = 5, NCOLS = 5;\nint dr[4] = {-1,1,0,0};\nint dc[4] = {0,0,-1,1};\n\nvector<int> blockScore(6);\n\nint simulateChain(vector<vector<int>> bo... |
aoj_1514_cpp | Problem F: Ballon Contest
Problem
空の様子がいつもと違う。色とりどりの多彩な熱気球が空を覆っていた。今日は熱気球の大会だ。
熱気球から落とされた得点付きボールを参加者全員で取り合うらしい。
せっかくなので優勝者を予想してみることにした。
レクリエーションにはN人参加する。
N
人の参加者はそれぞれ自分の位置が与えられる。複数の参加者に同じ位置が与えられる事はない。
上空の熱気球からM個のボールが１個ずつ落下する。
参加者は全員同じタイミングで走り始め、ボールに向かって同じ速度で一直線に走る。
ボールの落下位置に一番早く辿り着けた人がボールを取得できる。同時に複数人辿り着いた場合は、一様な確率で取得できる人が決まる。
参加者がボールを取得すると参加者全員が元の位置に戻る。
参加者が走り始めてから参加者の全員が元の位置に戻るまでに別のボールが落下する事はない。
各ボールには得点と落下する位置が与えられ、ボールを取得すると得点を得られる。
ボールは落下中に空気抵抗を受けるため、実際に落下する地点にはズレが発生する。落下予定の位置より最大でX軸方向に±
dx
、Y軸方向に±
dy
だけ一様な確率でズレる。
得られる得点の期待値を求め、期待値の最も大きい参加者の期待値を出力せよ。
Input
入力は複数のデータセットからなる。
各データセットは以下で表される。
N
M
x
1
y
1
.
.
x
N
y
N
bx
1
by
1
dx
1
dy
1
score
1
.
.
bx
M
by
M
dx
M
dy
M
score
M
1行目には、参加者の人数
N
、ボールの数
M
が与えられる。
2行目から
N
+1行目までには、参加者の情報が与えられる。
x
i
,
y
i
は、それぞれ参加者の位置のX座標・Y座標である。
N
+2行目から
N
+
M
+1行目までには、ボールの情報が与えられる。各ボールが実際に落下する地点のX座標・Y座標はそれぞれ
bx
j
-
dx
j
から
bx
j
+
dx
j
まで、
by
j
-
dy
j
から
by
j
+
dy
j
までの範囲のどこかである。
score
j
はボールの得点である。
入力の終わりは2つのゼロからなる。
Constraints
入力は以下の条件を満たす。
1 ≤
N
≤ 100
1 ≤
M
≤ 10
0 ≤
x
i
,
y
i
,
bx
j
,
by
j
≤ 10000
1 ≤
dx
j
,
dy
j
≤ 10000
1 ≤
score
j
≤ 100
テストケースの数は 10 を超えない。
入力に含まれる値は全て整数である。
Output
各データセット毎に、答えを一行に出力しなさい。
出力は0.0001以下の誤差を含んでもよい。
Sample Input
3 4
10 75
50 5
90 75
50 50 10 10 2
40 90 1 1 3
10 20 10 15 1
50 70 50 50 4
4 2
25 25
25 75
75 75
75 25
50 50 10 10 1
50 50 15 15 2
1 1
5 5
1 1 1 1 1
0 0
Sample Output
5.442857
0.750000
1.000000 | [
{
"submission_id": "aoj_1514_9729453",
"code_snippet": "#include <cstdio>\n#include <iostream>\n#include <vector>\n#include <algorithm>\n#include <complex>\n#include <cmath>\nusing namespace std;\n\n#define EPS 1e-8\n#define INF 1e100\n\ntypedef complex<double> P;\ntypedef vector<P> vP;\n\nconst P iu(0.0, 1... |
aoj_1522_cpp | Planarian Regeneration
Problem
皆さん、「プラナリア」って知っていますか？
プラナリアとは、日本では川の上流の石や枯葉などの裏に張り付いて生息している水生生物です。
プラナリアの最も優れた能力はその「再生能力」です。プラナリアの再生能力は著しく、例えば、三等分するとそれぞれが再生し、数週間後には元の完全な状態のプラナリアが3匹できあがります。
この度、会津の山奥の上流にて発見された新種のプラナリアの姿は長方形をしていて、プラナリアはある法則により再生します。
このとき、プラナリアは下の図のように配置し、２つの手段でプラナリアの切断実験を行います。
まず１つ目の手段として、垂直方向に切ることを考えます。一度の切断では、すべての断片を水平方向の長さが(断片の頭に近い部分):(断片の頭に遠い部分)=
m
:
n
になるように切断します。この動作を
x
回繰り返します。
次に２つ目の手段として、水平方向に切ることを考えます。一度の切断では、すべての断片を垂直方向の長さが(断片の右端に近い部分):(断片の左端に近い部分)=
k
:
l
に切断します。この動作を
y
回繰り返します。これらの切断によって断片が移動することはありません。
数週間後に、各断片が元の完全なプラナリアの状態に再生している確率は以下の式により求まります。
上の図は、垂直方向に1:2で2回、水平方向に1:1で1回切断した状態です。
以上の操作で切断した時の、数週間後に元の姿に再生しているプラナリアの数の期待値を求めてください。元のプラナリアの垂直方向の長さと水平方向の長さはともに1とします。
Input
m
n
x
k
l
y
入力では、6つの整数
m
,
n
,
x
,
k
,
l
,
y
が上記の入力フォーマットで与えられます。
これら6つの整数は問題文中のものと対応しており、水平方向に
m
:
n
で切断する動作を
x
回、垂直方向に
k
:
l
で切断する動作を
y
回繰り返します。
1 ≤
m
,
n
,
k
,
l
≤ 100、 0 ≤
x
,
y
≤ 40 であり、
m
,
n
と
l
,
k
はそれぞれ互いに素です。
Output
一行に数週間後に元の姿に再生しているプラナリアの数の期待値を出力してください。
出力は 10
-6
以下の誤差ならば許容されます。
Sample Input 1
1 1 1
1 1 1
Sample Output 1
0.562500
Sample Input 2
1 2 2
1 1 1
Sample Output 2
0.490741
Sample Input 3
1 2 0
3 4 0
Sample Output 3
1.000000
Notes
この問題では、doubleよりも精度の高い浮動小数を使用することを推奨します。 | [
{
"submission_id": "aoj_1522_2102518",
"code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\nusing ld = long double;\nconst ld eps = 1e-7;\n\nld getans(ld l,ld r, int b,ld c) {\n\tif (b == 0||abs(r-l)<eps) {\n\t\treturn (1-l)*(r - l);\n\t}\n\tld aa = getans(l,(1-c)*l+c*r, b - 1, c);\n\tld ab = ... |
aoj_1515_cpp | Problem G: The Humans Braving the Invaders
Problem
現在、地球は宇宙からの侵略者であるインベーダーの攻撃を受け、人類で生き残った者は基地にいる我々だけとなった。
奴らに対抗できる戦力もほとんど残されていない。
だが、ここで我々は諦めるということはしない。
インベーダを全滅させることが、我々人類が生き残る最後の手段である。
今から最後になるであろう作戦の内容を説明する。
まず、インベーダーの戦力に比べ我々の戦力はあまりにも少ないので、この基地に立てこもり、籠城戦を行う。
この基地は高い山に囲まれていて、インベーダーが侵攻するには基地正面にある真っ直ぐな道を通る他無い。
この道をフィールドと呼ぶことにする。この特徴により、前方に集中してインベーダーを攻撃することが可能である。
基地にいる我々はインベーダーに対し2種類の武器で攻撃を行う。
1つはインベーダー1体を狙撃するスナイパーライフルである。もう1つは広範囲に攻撃ができるグレネードランチャーである。
人類でたった1人のプログラマーである君の仕事は、インベーダーと我々の行動記録を元に戦闘をシミュレーションすることだ。
行動記録はクエリー形式で与えられる。各クエリーは1つまたは複数の整数からなり、次のように与えられる。
0
インベーダーがフィールド上の、基地からの距離
L
の位置に出現する。
1
d
現在フィールド上にいるすべてのインベーダーが
d
だけ基地に近づく。
この動作の後、基地に到達したインベーダーからダメージを受け、また、それらの敵はフィールド上から消滅する。
ダメージを受けた場合は"damage (この時基地に到達したインベーダーの数)"を1行に出力する。
2
k
現在フィールド上にいるインベーダーの数が
k
体以上の場合、基地に近い方から
k
番目のインベーダーをスナイパーライフルで攻撃する。
そのインベーダーはフィールド上から消滅する。そして"hit"を1行に出力する。
フィールド上のインベーダーの数が
k
体未満の場合、"miss"を1行に出力する。
3
x
r
基地からの距離が
x
の位置に範囲
r
のグレネードランチャーで攻撃する。基地からの距離が
x
の位置に着弾し、そこからの距離が
r
以下の位置にいるすべてのインベーダーはフィールド上から消滅する。
そして"bomb (倒したインベーダーの数)"を1行に出力する。補足として、基地はグレネードランチャーのダメージを受けることはない。
4
k
フィールド上のインベーダーの数が
k
体以上の場合、"distance (基地に近い方からk番目のインベーダーと基地との距離)"を1行に出力する。
フィールド上のインベーダーの数が
k
体未満の場合、"distance -1"を1行に出力する。
作戦の説明は以上だ。総員、作戦開始！・・・幸運を祈る。
Input
入力は複数のデータセットからなる。
各データセットは以下で表される。
1行目は2つの整数
Q
,
L
がスペース区切りで与えられる。
続く
Q
行には、上記で説明したクエリーが
Q
個与えられる。
入力の終わりは2つのゼロからなる。
Constraints
入力は以下の条件を満たす。
入力に含まれる値はすべて整数
1 ≤
Q
≤ 100000
1 ≤
L
≤ 10
9
1 ≤
d
,
k
≤ 10
9
0 ≤
x
≤
L
0 ≤
r
≤ 10
9
同じ位置にインベーダーが2体以上存在することはない
データセットの数は3個以下
Output
各データセットにつき、出力の指示があるクエリーに対して出力せよ。各データセットの最後には"end"を出力せよ。
Sample Input
18 10
0
4 1
1 1
4 1
0
1 1
0
2 2
1 10
0
1 1
0
1 1
0
1 5
3 4 0
3 4 1
0
9 10
4 1
2 2
3 5 5
0
4 1
2 2
3 5 5
0
2 1
0 0
Sample Output
distance 10
distance 9
hit
damage 2
bomb 1
bomb 2
end
distance -1
miss
bomb 0
distance 10
miss
bomb 1
hit
end | [
{
"submission_id": "aoj_1515_8293599",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <set>\n#include <algorithm>\nusing namespace std;\n\nclass BIT {\npublic:\n\tint size_ = 1;\n\tvector<int> dat;\n\n\tvoid init(int sz) {\n\t\tsize_ = sz + 2;\n\t\tdat.resize(size_ + 2, 0);\n\t}\n\n\tvoid... |
aoj_1508_cpp | Problem I : RMQ
n
個の数字
a
0
,
a
1
, ... ,
a
n-1
と
q
が与えられる。
q
個のクエリーに対して適切な処理を行なって欲しい。
クエリーは以下の3種類の操作が存在する。
値のシフトを行う
l
と
r
のペアが与えられる。(
l
<
r
)
a
l
から
a
r
までの値を Circular Shiftさせる。
0 1 2 3 4 5 6 7 8 9
に対してl=2,r=5というクエリーが与えられたとする。
シフトを行った数字列は
0 1 5 2 3 4 6 7 8 9
となる。
最小値を求める
l
と
r
のペアが与えられる。(
l
≤
r
)
a
l
から
a
r
までの値の中で最小の値を求める。
値の更新
pos
と
val
のペアが与えられる。
a
pos
の値を
val
に更新する。
Input
入力は以下のフォーマットで与えられる。
n
q
a
0
a
1
.
.
.
a
n-1
x
1
y
1
z
1
x
2
y
2
z
2
.
.
.
x
q
y
q
z
q
x
i
= 0
なら、シフトのクエリーを表す。このとき、
l = y
i
,
r = z
i
とする。
x
i
= 1
なら、最小値を求めるクエリーを表す。このとき、
l = y
i
,
r = z
i
とする。
x
i
= 2
なら、値を更新するクエリーを表す。このとき、
pos = y
i
,
val = z
i
とする。
入力は以下の制約を満たす
1 ≤
n , q
≤ 200,000
0 ≤
a
i
≤ 10,000,000
値を更新するクエリーについて、0 ≤
val
≤ 10,000,000
Output
クエリーとして
x
i
= 1
が与えられたときに、答えの値を１行に出力せよ。
Sample Input 1
10 3
0
1
2
3
4
5
6
7
8
9
1 5 7
0 2 5
1 5 7
Sample Output 1
5
4
Sample Input 2
10 10
289383
930886
692777
636915
747793
238335
885386
760492
516649
641421
2 7 368690
1 3 6
0 2 6
1 1 8
0 2 9
2 2 665123
1 5 9
0 2 8
2 7 961393
1 1 2
Sample Output 2
238335
238335
238335
368690 | [
{
"submission_id": "aoj_1508_11059198",
"code_snippet": "// Begin include: \"../../template/template.hpp\"\nusing namespace std;\n\n// intrinstic\n#include <immintrin.h>\n\n#include <algorithm>\n#include <array>\n#include <bitset>\n#include <cassert>\n#include <cctype>\n#include <cfenv>\n#include <cfloat>\n... |
aoj_1513_cpp | Problem E: Doragoso Ball
Problem
L
個集めるとドラゴソが現れどんな願いでも一つだけ叶えてくれるというドラゴソボールがとある迷宮に散らばっている。入口からスタートし、途中で立ち止まることなくすべてのボールを回収し、それらを迷宮内にある祭壇に奉納し、そのまま呪文を唱えるとドラゴソが現れ願いを叶えてくれるという。ただし、呪文を唱え始める時間は入口からボールを奉納するまでのルートのうち、移動時間が
K
番目に短いルートで移動したときの時間でなければならない。
この迷宮は部屋とわたり通路からなり、部屋と部屋はわたり通路を通る事によって行き来できる。ドラゴソボールはそれらの数ある部屋のどこかに落ちている。
なお、迷宮は入り口から祭壇へたどりつく道が存在しない可能性もあるようだ。また、移動時間はわたり通路の移動だけを考慮し、部屋の中を移動する時間、ボールを拾うときにかかる時間、祭壇に奉納する時間は考慮しなくてよい。
また、同じ通路や同じ部屋に何度も訪れてもよいが、ドラゴソボールがある部屋に初めて入った場合は、そのボールを拾うことにする。祭壇に到達したとき、必ずしもボールを納めなければならないわけではない。
迷宮の内部構造の情報と迷宮の入り口、祭壇の場所とボールの数
L
とボールの配置場所と求められている最短な経路の順位
K
が与えられるので、呪文を唱え始めるべき時間を求めよ。
また、異なる移動ルートでも、移動時間が同じである場合はそれらのルートは同じ順位として扱う。
例えば、
ルートA 時間 2
ルートB 時間 5
ルートC 時間 5
ルートD 時間 5
ルートE 時間 5
ルートF 時間 7
このようなとき、ルートB,C,D,Eは2位かつ3位かつ4位かつ5位として扱う。ルートFは6位として扱う。
Input
入力は複数のデータセットからなる。
各データセットは以下のフォーマットで表される。
N
M
L
K
u
1
v
1
c
1
…
u
M
v
M
c
M
S
G
B
1
B
2
…
B
L
最初に
N
,
M
,
L
,
K
が与えられる。
それぞれ、部屋の数、わたり通路の数、ボールの数、求められている最短な経路の順位を表す。それぞれの部屋は1〜
N
で番号付けされる。
次に
M
行にわたり通路の情報、
u
i
,
v
i
,
c
i
が与えられる。
部屋
u
i
,
v
i
間にわたり通路が存在し、通過するのに時間
c
i
がかかることを表す。
次に
S
,
G
が与えられる。
それぞれ、迷宮の入り口と祭壇がある部屋番号を表す。
次に
L
行にわたってドラゴソボールが落ちている部屋の番号
B
i
( 1 ≤
i
≤
L
)が与えられる。
入力の終わりは4つのゼロからなる。
Constraints
入力は以下の条件を満たす。
入力に含まれる値はすべて整数
2 ≤
N
≤ 50
0 ≤
M
≤ 1225
1 ≤
L
≤ 7
1 ≤
K
≤ 10
1 ≤
S
,
G
≤
N
1 ≤
B
i
≤
N
( 1 ≤
i
≤
L
)
B
i
≠
B
j
( 1 ≤
i
<
j
≤
L
)
1 ≤
u
i
,
v
i
≤
N
( 1 ≤
i
≤
M
)
1 ≤
c
i
≤ 1000 ( 1 ≤
i
≤
M
)
データセットは最大10個である
Output
各データセットに対し、呪文を唱え始めるべき時間を1行に出力せよ。
K
番目に短い経路が存在しない場合は"NA"を1行に出力せよ。
Sample Input
9 14 5 10
1 2 1
1 4 5
2 4 4
2 3 3
2 6 2
3 6 3
3 7 2
4 6 5
4 5 6
5 8 8
6 7 3
7 8 1
7 9 9
8 9 2
1 9
1
2
5
7
9
4 5 1 3
1 2 1
1 3 2
2 3 2
2 4 9
3 4 1
1 4
2
4 5 1 10
1 2 1
1 3 2
2 3 2
2 4 9
3 4 1
1 4
2
4 3 1 1
1 2 1
2 3 1
3 4 1
1 4
1
4 3 1 2
1 2 1
2 3 1
3 4 1
1 4
1
4 3 1 10
1 2 1
2 3 1
3 4 1
1 4
1
2 1 1 1
1 2 1
1 2
1
2 1 1 10
1 2 1
1 2
1
4 2 1 4
1 2 1
3 4 1
1 4
2
0 0 0 0
Sample Output
27
6
8
3
5
7
1
19
NA | [
{
"submission_id": "aoj_1513_10235149",
"code_snippet": "// AOJ #1513 Doragoso Ball\n// 2025.2.20\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n \nstruct Edge { int to, cost; };\n \nstruct State { ll cost; int room, mask; };\n \nstruct StateCompare {\n bool operator()(const St... |
aoj_1520_cpp | Problem E: Light Source
Problem
二次元平面上に
n
個の円状の光源が配置されている。ある光源が光を受けると、下図のようにその光源の中心点から扇状に光が放出される。
光源の中心点は(
x
,
y
)、半径は
r
で表される。
光となる扇形は角
β
を中心に-
θ
/2, +
θ
/2の方向へ対称に広がり、その半径は
α
である。
光源の円が扇型の光に完全に覆われるとき、光源はその光を受けたとみなされる。光源から放出される光の強さは、受けた光の強さの合計となる。ただし、放出される光の強さには上限があり、上限を超えた場合、光の強さは上限値と同じになる。なお、ある光や光源によって光が遮られることはない。
ある地点に存在する光源を目的光源とする。目的光源では光が放出されず、受ける光の強さに制限はない。
あなたは座標(0,0)から、ある強さの扇形の光を、任意の方向に１度だけ放出することができる。目的光源が受ける光の強さの合計の最大値を求めるプログラムを作成せよ。ただし、全ての光源において、放出された光が元の光源に戻るような入力データは与えられないと仮定してよい。また、この問題では、領域の境界からの距離が0.000001以内の場合、領域上とみなすことにする。
Input
n
θ
0
α
0
power
x
1
y
1
r
1
θ
1
α
1
β
1
maxpower
1
.
.
x
n
y
n
r
n
θ
n
α
n
β
n
maxpower
n
x
n+1
y
n+1
r
n+1
1行目には目的光源を除く光源の数
n
が与えられる。
2行目に最初に光を放出する座標(0,0)の情報、3行目からn+2行目に目的でない光源の情報、n+3行目に目的光源の情報がそれぞれ空白区切りで与えられる。
各情報に対して、
x
i
,
y
i
は光源の中心点の座標、
r
i
は光源の半径、
θ
i
は光が広がる角度、
α
i
は光の半径、
β
i
は光が向かう方向を表す。2行目の
power
は最初に放出される光の強さ、3行目からn+2行目の
maxpower
i
は放出される光の上限を表す。
光の方向
β
i
はx軸の正の向きから反時計回りに回転し、各角度の単位は度とする。
Constraints
入力は以下の条件を満たす。
入力は全て整数からなる
1 ≤
n
≤ 100
-1000 ≤
x
i
,
y
i
≤ 1000
1 ≤
r
i
≤ 1000
1 ≤
θ
i
≤ 180
1 ≤
α
i
≤ 1000
0 ≤
β
i
< 360
0 ≤
power
,
maxpower
i
≤ 1000
Output
目的光源を全て囲うような光の強さの合計の最大値を1行に出力せよ。
Sample Input 1
1
90 10 20
3 3 1 90 10 315 10
6 0 1
Sample Output 1
30
Sample Input 2
2
90 10 10
-3 0 1 45 10 90 10
-6 0 2 30 3 180 10
-9 0 1
Sample Output 2
10 | [
{
"submission_id": "aoj_1520_2964704",
"code_snippet": "#include <bits/stdc++.h>\n#define PI M_PI\n#define EPS 1e-10\nusing namespace std;\ntypedef long long ll;\ntypedef complex<double> P;\n\nstruct light {\n P pos;\n double r, t, a, b;\n ll p;\n};\n\ndouble cross(P a, P b) { return a.real() * b.imag() ... |
aoj_1518_cpp | Problem C: Last One
Problem
あなたは、集合好きな友人Aと一風変わったゲームをしてみる事にした。
n個の要素からなる重複が許される非負の整数の集合Sが与えられる。集合Sに含まれる各要素は非負の
p
i
進数である。集合Sに対して
以下のStep1~3を1つのターンとして、あなたと相手の二人が交互にターンを繰り返す。各ターンではこの番号の順に操作を行う。
Step 1: 集合Sに含まれる全ての要素を一度取り除き、その取り除いた各要素を2進数に変換して、0を消して1が1つ以上連続する部分に分割し、その分割された部分を全て集合Sに加える。
Step 2: このとき集合Sが空になっていたならば、現在このターンをプレイしているプレイヤーは負ける。
Step 3: 集合Sに含まれる要素aを1つ選び、そのaから 1 ≤ x ≤ a を満たす任意の整数xを引く。
下の図は次の入力が与えられたときの最初の1ターンの進行の仕方のうちの1つの例である。
4
10 3
2 11
16 5
16 AE
最初はあなたのターンだ。与えられた入力に対して両者が最善を尽くすとき、果たしてあなたに勝ち目はあるのだろうか。
Input
入力は次の形式で与えられる。
n
p
1
m
1
p
2
m
2
...
p
i
m
i
...
p
n
m
n
集合の要素である
p
i
進数
m
i
が
n
個与えられる。集合の要素の数
n
は10
5
を超えない。また、2≦
p
i
≦62を満たす。
p
i
進数
m
i
は通常の数字である0~9に加え、アルファベット52文字を使用する。
その順番は012...789ABC...XYZabc...xyzを昇順とし、
i
番目までの文字を使うものとする。また、
p
i
進数
m
i
は10進数で2
18
-1を超えない.
Output
与えられた入力に対しあなたが勝てるならwin、負けるならloseを出力せよ。
Sample Input 1
1
10 1
Sample Output 1
win
Sample Input 2
2
10 1
10 1
Sample Output 2
lose
Sample Input 3
3
25 53AI
43 3BI0
62 pn6
Sample Output 3
win | [
{
"submission_id": "aoj_1518_5003973",
"code_snippet": "#include<iostream>\n#include<vector>\n#include<string>\n#include<algorithm>\nusing namespace std;\n\nint ctoi(char c){\n if('A' <= c && c <= 'Z'){\n return c - 'A' + 10;\n }else if('a' <= c && c <= 'z'){\n return c - 'a' + 36;\n ... |
aoj_1525_cpp | Problem J: J's Final Problem
Problem
不思議なダンジョンとは構造の変化を伴うダンジョンである。不思議なダンジョンは階層が深いものから浅いものまで様々なものがあり、深い階層には凶悪なモンスターが生息していたり、財宝が眠っていたりする。ジェイは不思議なダンジョンを研究している研究者である。ある日、新しいダンジョンを掘っていたところ、とても大きく深いダンジョンに繋がってしまった。ジェイはこのダンジョンを「ジェイの最終問題」と名付けた。このダンジョンの調査が、優秀な冒険者であるあなたに依頼されることになった。冒険者の目的はできるだけ深い層のフロアに到達することである。このダンジョンの特徴を以下に述べる。
地上からダンジョンの地下1階の部屋への下りの階段は1つしか存在しない。
各部屋は1つの上りの階段と2つの下りの階段が存在する。
2つの下りの階段のうち片方を右の階段、もう片方を左の階段とする。
冒険者が階段を降りた際に、ダンジョンの構造が変化することがある。
階段を降りるとは、地下
i
階のある部屋から地下
i
+1階のある部屋へ降りることを示す。
階段を上った場合はダンジョンに対して何も変化を及ぼさない。
地下
n
階目には階段は存在しない。
最近、ジェイの最終問題に関する石碑が発見された。
どうやら、各階の階段を降りたときの変化がメモとして記されているようだ。
メモの形式は、
num1
direction1
:
num2
direction2
という形である。
地下
num1
階のすべての部屋について、direction1の階段を降りている途中で、地下num2階のすべての部屋について、 direction2の階段を降りた先の部屋が消滅し、さらにそこから階段を降りることによって到達できる部屋や階段がすべて消滅する。部屋や階段の消滅に冒険者が巻き込まれた場合、冒険は失敗する。地下
i
階から地下
i
+1階へ向かう階段の途中で冒険者が失敗した場合は地下
i
階まで到達したものとして扱う。
石碑において言及されていない階段は、その階段を降りてもダンジョンの構造に変化を及ぼさないことを示す。
冒険者はこの石碑をヒントにして探索を行うことにした。
ダンジョンの深さ
n
とメモの情報が
m
個与えられるので、最大地下何階まで到達できるかを答えなさい。
Input
入力は複数のデータセットからなる。
n
m
memo
1
memo
2
…
memo
m
最初に
n
,
m
が与えられる。
それぞれ、ダンジョンの変化前の最下層の階数、石碑のメモの数を表す。
次に
m
行にわたりメモの情報
num1
direction1
:
num2
direction2
が与えられる。
Constraints
入力は以下の条件を満たす。
入力に含まれる値はすべて整数
1 ≤
n
≤ 10000
0 ≤
m
≤ (
n
-1)×4
1 ≤
num1
,
num2
≤
n
-1
direction1,direction2は"left"と"right"のいずれかである。
Output
最大地下何階まで降りることができるか1行に出力して答えよ。
Sample Input1
10 2
9 left : 9 left
9 right : 9 right
Sample Output1
9
Sample Input2
4 5
1 left : 2 right
2 left : 3 right
2 left : 3 left
1 right : 3 left
2 right : 3 right
Sample Output2
3 | [
{
"submission_id": "aoj_1525_3086993",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\nstruct SCC{\n int n;\n vector<vector<int> > G,rG,T,C;\n vector<int> vs,used,belong;\n SCC(){}\n SCC(int sz):n(sz),G(sz),rG(sz),used(sz),belong(sz){}\n \n void add_edge(int f... |
aoj_1529_cpp | Problem D: Cheat Case
Problem
算数のテストを受けることになった俺達は、今から勉強しても赤点を取ってしまうことを確信し、カンニングで乗り切ることを決意した。
算数のテスト問題を作成するA先生はテスト用紙を手書きで作ることで知られている。彼がテスト問題を作成している時の筆跡情報を、近所の博士に作ってもらった筆跡盗聴鉛筆で盗み取る作戦だ。だが肝心の筆跡情報から問題を復元するプログラムは博士の技術では作ることができなかった。しかも、たとえ問題が復元できたとしても、俺達の頭脳では問題を解くことができない。どうすることもできなくなった俺達は、プログラマーであるあなたに、筆跡情報から問題を復元し、それを解くプログラムの作成を依頼することにした。
今回のテストでは、数式を解く問題が出題される。数式中の演算記号は＋（加算）,-（減算）,・（乗算）の3つのみで、乗算は加算、減算よりも優先して計算される。数式は必ず構文が正しいものが与えられる。また、0以外の数で、先頭が0であるものは与えられない。
問題が書かれる紙はグリッドで表される。筆跡情報は線分の集合で与えられ、各線分はX軸に水平または垂直、もしくは始点、終点が同じ（点）である。この線分は、始点から終点までにあるマスを黒く塗りつぶすことを表す。座標(0, 0)が紙の左上である。数式の各文字（0,1,2,3,4,5,6,7,8,9,＋,-,・）は以下で表される。
0
1
2
3
4
5
6
7
8
9
＋
-
・
A先生は印刷したかのような字を書くことで知られており、各文字は上記以外の書かれ方はしない。また、上記以外の文字が書かれることはない。2つ以上の文字がマスの辺を共有することはない。各文字の位置は、文字を構成するマス（黒いマス）の中で、最も左側にあるもののX座標で表される。数式の文字は、位置が小さい順に（左から右へ）解釈される。2つ以上の文字の位置が等しくなることはない。
Input
N
X
11
Y
11
X
12
Y
12
X
21
Y
21
X
22
Y
22
:
X
N1
Y
N1
X
N2
Y
N2
1行目に線分の数を表す1つの整数
N
が与えられる。次に線分の情報が
N
行で与えられる。線分の情報の
i
行目には4つの整数
X
i1
,
Y
i1
,
X
i2
,
Y
i2
が空白区切りで与えられる。それぞれ、線分の1つ目の端点のX座標、Y座標、2つ目の端点のX座標、Y座標を表す。
Constraints
入力は以下の条件を満たす。
1 ≤
N
≤ 150
0 ≤
X
i1
,
Y
i1
,
X
i2
,
Y
i2
≤ 200 (1 ≤
i
≤
N
)
X
i1
=
X
i2
または
Y
i1
=
Y
i2
(1 ≤
i
≤
N
)
計算の途中と結果に現れる数は符号付き32ビット整数に収まる
Output
各ケースの計算結果を一行に出力せよ。
Sample Input 1
4
1 1 1 5
3 3 5 3
4 2 4 4
7 1 7 5
Sample Output 1
2
Sample Input 2
23
1 1 3 1
3 1 3 3
3 3 1 3
1 3 1 5
1 5 3 5
5 2 7 2
7 2 7 4
7 4 5 4
5 4 5 6
5 6 7 6
11 4 13 4
13 0 15 0
15 0 15 4
18 2 18 2
21 5 23 5
21 5 21 7
21 7 23 7
23 7 23 9
23 9 21 9
24 0 26 0
24 0 24 4
24 4 26 4
26 0 26 4
Sample Output 2
-328
Hint
1つのグリッドを2度以上塗りつぶすことがある
'1'など、1つの線分で表すことが可能でも、2つ以上の線分で表す場合がある
Sample Input 1の数式。
Sample Input 2の数式。"-7"の部分のように、ある文字を覆う最小の長方形の内部に別の文字が入り込む場合がある。 | [
{
"submission_id": "aoj_1529_894238",
"code_snippet": "#include <iostream>\n#include <algorithm>\n#include <vector>\n#include <cassert>\nusing namespace std;\ntypedef pair<int,int> P;\n\nnamespace NS {\n string s;\n int p;\n int exp();\n int term();\n int fact();\n \n int exp() {\n int x = term();... |
aoj_1533_cpp | Problem H: Caterpillar
とある天空都市に住む大学生のGは、芋虫のいも太郎を飼っている。 彼は、いも太郎に最短歩数で全てのえさを順番に食べるように躾けをした。彼の友人であるあなたは、彼からいも太郎が本当に躾けられているかどうかを調べて欲しいと依頼されたので、プログラムを書くことにした。
Problem
複数の障害物とエサがグリッド状のエリア内に存在する。頭と 5 つの胴体を持つ芋虫がこのエリアを探索する。芋虫が順番に最後までエサを食べたときの最小の歩数を求めよ。
ただし全てのエサを食べることが不可能な場合は -1 を出力すること。なお、エサの上に芋虫の頭が重なったとき、エサを食べることができる。
エリアは以下の文字で構成される。
何もないマス -> ‘.’
障害物 -> ‘#’
エサ -> ‘1’, ‘2’, ..., ‘9’
芋虫の初期位置 -> 頭 ‘S’, 胴体 ‘a’, ‘b’, ‘c’, ‘d’, ‘e’
芋虫は頭 ’S’ から 5 つの胴体 ‘a’, ‘b’, ‘c’, ‘d’, ‘e’ と 順に上下左右の 4 方向に隣接して、それらが連なって構成される。
例えば、芋虫の構成を表したとき、以下の (1) は正しい芋虫の構成であるが、 (2) や (3) のような構成はありえない。
(1) 正しい
.bc
Sad
..e
(2) eが存在しない
Sab
.dc
(3) "Sab" と "cde" とで芋虫が切断されている
Sab
cde
(1) のような正しい芋虫の構成は、入力で与えられた状態から任意の回数の芋虫の移動の間、一貫して保たれる。
つまり、芋虫の頭が、隣接している 4 つのマスのうちのいずれかの空いているマスに一歩進むと、その後に続いて 1 番目の胴体は頭が元あったマスへ動き、2 番目の胴体は 1 番目の胴体が元あったマスへ、 3 番目は 2 番目の元へ‥… というように頭の軌跡をたどるように胴体が動く。以下は、１マス左へ動くときの例である。
移動前 移動後
...... ......
...bc. ...cd.
..Sad. .Sabe.
....e. ......
芋虫の移動できる場所は以下のように定められている。
芋虫は自分の胴体、障害物、エリア外を移動することは出来ない。ただしエサの上を、そのエサを食べずに移動することは出来る。
移動前に胴体が進む先にあった場合でも、移動後に頭と胴体が重ならないならば移動できる。
Input
H
W
N
area
入力は
H + 1
行で与えられる。1行目には 3つの整数
H
,
W
,
N
(
2 ≤ H ≤ 10, 2 ≤ W ≤ 10, 1 ≤ N ≤ 9
) が書かれている。
H
はエリアの高さ、
W
は幅、
N
がエサの個数を表す ( このとき
6 + N ≤ H × W
が必ず成立する ) 。
2 行目から
H + 1
行目までの各行には ´S´,´1´, 2´ , … ´9´,´a´,´b´,´c´,´d´,´e´,´#´,´.´ からなる
W
文字の文字列が書かれており，各々がエリアの各区画の状態を表している。また ´S´,´a´,´b´,´c´,´d´,´e´ は芋虫の初期状態を表している。初期状態の芋虫に覆われるようにしてエサや障害物は存在しない。また、芋虫の初期位置およびエサの位置は正しく入力されることが保証されている。
Output
芋虫がエサを順番通りに食べたときの最小の歩数、またそれが不可能なら -1 を出力せよ。
Sample Input1
5 8 3
#.......
#.####2#
#.#.3..#
#.######
.1Sabcde
Sample Output1
14
Sample Input2
2 6 2
.1.baS
.2.cde
Sample Output2
7
Sample Input3
2 6 2
.1#baS
.2.cde
Sample Output3
-1 | [
{
"submission_id": "aoj_1533_893191",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\ntypedef pair<int,int> pii;\n\nint H,W,N;\nchar field[51][51];\nconst int dy[]={-1,0,0,1};\nconst int dx[]={0,-1,1,0};\npii esas[11];\nint d[11][11][11][4][4][4][4][4];\n\nint getAng(int cy,int cx,int n... |
aoj_1528_cpp | Problem C: Warping Girl
Problem
会津魔法学校は, 魔法を使える者が集まる学校である. その学校の生徒の一人であるハルカは, 魔法陣の上でワープの魔法を使う事ができる.
彼女の家から学校には, 長さ
L
の一直線状の道がある. また, この道には所々魔法陣が描かれている.
彼女は毎日この道を使って学校に通っているため, できるだけ短い時間で学校に辿り着きたいと思っている.
そこでプログラマーであるあなたは, 彼女に学校まで行くときにかかる最小の時間を教えてあげることにした.
ハルカは,
1
分で距離
1
だけ歩いて先に進むことができる ( ＊戻ることはできない)．また, ワープの魔法陣が書いてある位置
P
i
で魔法を唱えることで,
P
i
からちょうど
D
i
だけ進んだ場所に
T
i
分で移動することができる. 移動先に魔法陣がある場合も, 連続してワープ魔法を使用することができる.
彼女の家の位置は
0
、学校の位置は
L
である.
Input
L
n
P
1
D
1
T
1
P
2
D
2
T
2
.
.
P
n
D
n
T
n
１行目に道の長さ
L
, 魔法陣の数
n
が与えられる.
次に
n
個の魔法陣の状態が与えられる.
P
i
は
i
番目の魔法陣がある位置,
D
i
は
i
番目の魔法陣からワープする距離,
T
i
は
i
番目の魔法陣を使ってワープしたときにかかる時間を表す.
Constraints
入力は以下の条件を満たす.
与えられる数は全て整数である
1 ≤
L
≤
10
9
0 ≤
n
≤
min(10
3
, L)
(
min
は
A, B
の小さい方を表す)
0 ≤
P
i
≤
L - 1
0 ≤
D
i
≤
L - P
i
0 ≤
T
i
≤
10
3
P
i
≠
P
j
Output
学校に辿り着くための最小の時間を一行に出力せよ.
Sample Input 1
10 3
2 2 1
4 2 1
8 1 1
Sample Output 1
8
Sample Input 2
10 2
2 3 1
3 5 1
Sample Output 2
6
Sample Input 3
1 0
Sample Output 3
1 | [
{
"submission_id": "aoj_1528_5851546",
"code_snippet": "#include<bits/stdc++.h>\n\nusing Int = long long;\nusing namespace std;\n\nconstexpr Int inf = 1e10;\n\nint main(){\n Int L,N;\n cin >> L >> N;\n vector<tuple<Int,Int,Int>>edge;\n for(int i = 0; i < N; ++i){\n Int p,d,t;\n cin... |
aoj_1519_cpp | Problem D: Room of Time and Spirit
Problem
20XX年、とある科学者がバイオテクノロジーによって強力な人造人間を開発してしまった。この人造人間はコンピュータにより、戦闘の達人たちの細胞を組み合わせて作られているため非常に強力である。
このままでは地球は人造人間に支配されてしまうので、
N
人の戦士たちは人造人間と戦うことにした。しかし今の戦士たちでは到底人造人間に敵わないため、修行をしなければならない。また、
N
人の戦士たちはそれぞれ 1 ~
N
の番号が付いている。
この時代、天空都市AIZUには SRLU室と呼ばれる修行のための特殊な部屋が存在した。この部屋での1年は外界の時間の1日と同じであるため、短期間で戦闘力を大幅に上昇することが出来る。同時に部屋に入れる人数の上限は2人である。また、その2人が部屋に入った時、それぞれ戦闘力が上昇する。
戦士たちは残された時間でどのように部屋に入るか検討するため、あなたに以下のクエリを処理するプログラムの作成を依頼した。
与えられるクエリは以下の通りである。
また以下の説明で出てくる
A
,
B
はそれぞれ戦士の番号を表す。
A
と
B
が等しい事は無い。
IN
A
B
C
A
と
B
が部屋に入り、それぞれ
C
だけ戦闘力が上昇する。この時、(部屋に入る直前の
B
の戦闘力) - (部屋に入る直前の
A
の戦闘力) =
C
が成り立つ。また、この時
B
の戦闘力は
A
の戦闘力より高い事が保証される。
COMPARE
A
B
A
と
B
の戦闘力の差 (現在の
B
の戦闘力) - (現在の
A
の戦闘力)を出力する。もしその差が特定出来なければ、WARNING と出力せよ。
Input
N
Q
query
1
.
.
.
query
Q
最初に戦士の人数
N
, クエリの数
Q
が与えられる。
次に
Q
回だけクエリが与えられる。
Constraints
入力は以下の条件を満たす。
2 ≤
N
≤ 100000
1 ≤
Q
≤ 100000
1 ≤
A
,
B
≤
N
1 ≤
C
≤ 5000
Output
上記のように与えられたクエリを順番に処理していき、 COMPAREの入力が与えられた際に出力を行う。
Sample Input1
3 5
COMPARE 1 2
IN 1 2 5
IN 2 3 3
COMPARE 2 3
COMPARE 1 3
Sample Output1
WARNING
3
11
Sample Input2
4 3
IN 1 4 10
IN 2 3 20
COMPARE 1 2
Sample Output2
WARNING
Sample Input3
3 4
IN 2 1 2
IN 3 1 2
COMPARE 1 3
COMPARE 2 3
Sample Output3
-2
2
Sample Input4
10 4
IN 10 8 2328
IN 8 4 3765
IN 3 8 574
COMPARE 4 8
Sample Output4
-3191
Sample Input5
3 5
IN 1 2 5
IN 1 2 5
IN 2 3 10
COMPARE 1 2
COMPARE 2 3
Sample Output5
15
10 | [
{
"submission_id": "aoj_1519_9725871",
"code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\nint par[100001], D[100001], sum[100001];\n\nint find(int x) {\n if (par[x] != x) {\n int px = par[x];\n par[x] = find(par[x]);\n D[x] += D[px];\n return par[x];\n }\n ... |
aoj_1537_cpp | Problem L: WW
Problem
19XX年、nつの国で連合国軍が結成された。連合国軍に属する各国では、敵軍の侵略から自国を守るために国内に１つ以上の拠点を作り、周囲を警戒している。図１は連合国の例を示し、長方形が各国を、その中にある円がその国の拠点を表す。
図1
敵軍が侵略してきた場合、それを一番最初に発見した拠点からその情報を連合国軍に属する他国または自国の拠点に発信することになっている。
情報を他の拠点に伝えるには正の整数のコストがかかる。
また、各国では自国の拠点のうち、連合国軍翻訳通信部(ATIS : Allied Translator and Interpreter Section)に属する兵士が配属されている拠点をちょうど１つだけ持っている。
この兵士だけが連合国軍に属する全ての国の言語を話すことができ、その他の兵士は自分の国の言語しか話せない。
その為、情報を受け取った拠点が他国に情報を伝えようとした際にその拠点がATISに属する兵士をもたない場合、そこから自国のATISに属する兵士をもつ拠点に情報を伝え他国に情報を発信してもらう必要がある。
国毎で各拠点に０から順に[その国がもつ拠点の数-1]までの番号が割り振られており、０番目の拠点にATISに属する兵士がいる。
つまり、他国の拠点に情報を伝達できるのは０番目の拠点だけであり、その他の拠点から他国へは通信できない。
また、その国の０番目の拠点に情報が伝わればその国全体に情報が伝わったものとする。
様々な理由から、全ての拠点の間で通信ができるとは限らない。
ある拠点から別の拠点に情報を伝える事ができたとしても、その逆が成り立つとは限らない。
また、ある拠点から別の拠点に情報を伝えた際のコストとその逆でかかるコストが同じとも限らない。
これらのことを踏まえて、ある拠点が敵軍を発見した際に、連合国軍全体に情報が行き渡るコストの総和が最も少ない伝達方法を知りたい。
連合国軍に属する全ての国の０番目の拠点に対して最初に敵軍を見つけた拠点から情報が伝達された時、連合国軍全体に情報が行き渡ったものとする。
敵軍を発見した拠点が質問として与えられるので、最も少ないコストでその情報が連合国軍全体に行き渡る伝達方法とそのコストを出力せよ。
例えば、以下のケースについて考える ( Sample Input 4、１つめの質問 )
国neepalの1番目の拠点が敵軍を発見したとする。
この場合、１番目の拠点から他国へは通信できないため、まず自国の０番目の拠点へ情報を伝える。
次に、０番目の拠点から国luxenbourg,nowayに情報を伝える。
neepalからluxenbourgの０番目の拠点へ直接通信することはできるが、３番目の拠点に情報を伝え、そこから０番目の拠点へ伝えたほうがコストが少なく済む。
この場合、全ての国の０番目の国へ情報を伝えるためにかかる最小のコストは１２となる。
コストが１２で済む伝達方法は複数存在するが、そのうちのどれか一つを答えとして出力すれば良い。
以下の図２の赤い矢印はその答えのうちの１つである。
図2
Input
n
countryname
0
m
0
countryname
1
m
1
…
countryname
n-1
m
n-1
e
c1
0
v1
0
c2
0
v2
0
cost
0
c1
1
v1
1
c2
1
v2
1
cost
1
…
c1
e-1
v1
e-1
c2
e-1
v2
e-1
cost
e-1
q
c3
0
v3
0
c3
1
v3
1
…
c3
q-1
v3
q-1
n
は連合国軍に属する国の数を表す
countryname
i
は連合国軍に属する
i
番目の国名を,
m
i
は
i
番目の国の拠点の数を表す
e
は通信可能な拠点のペアの数を表す
続く
e
行には国
c1
i
の拠点
v1
i
から国
c2
i
の拠点
v2
i
に情報を伝えるのにかかるコスト
cost
i
が与えられる
q
は質問の数を表す
続く
q
行には敵軍を発見した国の名前
c3
i
とその拠点
v3
i
が与えられる
c1
i
,
c2
i
,
c3
i
は連合国軍に属する国のいずれかである
v1
i
,
v2
i
,
v3
i
はその国の拠点の数以上である事は無い
Constraints
1 ≤
n
≤ 26
1 ≤
m
i
≤ 100
0 ≤
e
≤ 322400
0 ≤
cost
i
≤ 100
1 ≤
q
≤ 10
countryname
は小文字のアルファベット ‘a’ から’z’までで構成される長さ１以上２０以下の文字列である
同じ名前の国が2つ以上与えられる事はない
通信可能な拠点のペアの
c1
i
と
c2
i
が同じ時、
v1
i
と
v2
i
は異なる
通信可能な拠点のペアの
c1
i
と
c2
i
が異なる時、
v1
i
は必ず0である
Output
各質問に対して以下の形式で答えを出力する。
各質問に対する答えの最後の行には、５つの '-’ からなる"-----” ( “ は除く ) という1行を出力すること。
答えが存在する場合
1行目に質問で与えられた国の拠点から連合国軍全体に情報が行き渡るために必要なコストの最小値を出力する。
2行目以降にはその時の伝達方法を出力する。
伝達方法は以下の形式で表現される。
c4
0
v4
0
c5
0
v5
0
c4
1
v4
1
c5
1
v5
1
...
国
c4
i
の拠点
v4
i
から国
c5
i
の拠点
v5
i
に情報を伝えたことを表す。
以下の事に気をつける事。
通信が行われた順番通りに出力する必要はない
コストの総和が最小となる伝達方法が1つ以上存在する場合、そのうちのいずれか１つを出力すれば良い
同じ通信可能なペアを２回以上出力してはいけない
c4
i
,
c5
i
は入力で与えられた国のいずれかでなければならない
v4
i
,
v5
i
はその国の拠点の数未満でなければならない
答えが存在しない場合
1行に ”Impossible” ( “ は除く ) と出力すること。
Sample Input 1
3
frence 1
usi 1
powland 1
2
usi 0 frence 0 10
frence 0 powland 0 10
2
usi 0
powland 0
Sample Output 1
20
usi 0 frence 0
frence 0 powland 0
-----
Impossible
-----
Sample Input 2
2
usso 2
caneda 2
4
usso 1 usso 0 1
usso 0 caneda 0 10
usso 0 caneda 1 2
caneda 1 caneda 0 2
1
usso 1
Sample Output 2
5
usso 1 usso 0
usso 0 caneda 1
caneda 1 caneda 0
-----
Sample Input 3
3
chinax 1
ok 1
austraria 2
6
chinax 0 austra
...(truncated) | [
{
"submission_id": "aoj_1537_893213",
"code_snippet": "#include <iostream>\n#include <iomanip>\n#include <cstdio>\n#include <vector>\n#include <algorithm>\n#include <complex>\n#include <cstring>\n#include <cstdlib>\n#include <string>\n#include <cmath>\n#include <cassert>\n#include <queue>\n#include <set>\n#... |
aoj_1535_cpp | Problem J: Hanimon
ハニカムモンスターはハニカム模様の六角形状の不思議な生き物である。
ハニカムモンスターには様々なサイズのものがあり、一辺が
N
個の正六角形のマスから成るハニカムモンスターをサイズ
N
のハニカムモンスターとする。
一方、聖なる模様はハニカムモンスターと同じく、六角形として定義され1辺が
P
個の正六角形のマスから成る聖なる模様をサイズ
P
の聖なる模様とする。
ハニカムモンスターと聖なる模様の形の例を以下に示す。サイズは1辺の正六角形のマスの数に対応する。
図1:
サイズの例
図2:
ハニカムモンスターと聖なる模様の例 (Sample Input 1)
ハニカムモンスターと聖なる模様の各マスには色が着いており0と1によって表される。
サイズ
P
の
Q
個の聖なる模様のすべてを含むハニカムモンスターは伝説のハニモンと呼ばれている。
サイズ
N
のハニカムモンスターとその模様、
Q
個のサイズ
P
の聖なる模様が与えられるので、
そのハニカムモンスターが伝説のハニモンであるかどうかを判定するプログラムを作成せよ。
Input
入力は次の形式で表される。
N
P
Q
(空行)
ハニカムモンスターの模様の情報
(空行)
1つ目の聖なる模様の情報
(空行)
2つ目の聖なる模様の情報
(空行)
...
Q
つ目の聖なる模様の情報
N
,
P
,
Q
はそれぞれハニカムモンスターのサイズ,聖なる模様のサイズ,聖なる模様の個数を表す。
サイズ
N
のハニカムモンスターの模様の情報は以下の様に2×
N
-1行で与えられる。
N
個のマス
N
+1個のマス
N
+2個のマス
.
.
2×
N
-2個のマス
2×
N
-1個のマス
2×
N
-2個のマス
.
.
N
+2個のマス
N
+1個のマス
N
個のマス
サイズ
P
の聖なる模様の情報は以下の様に2×
P
-1行で与えられる。
P
個のマス
P
+1個のマス
P
+2個のマス
.
.
2×
P
-2個のマス
2×
P
-1個のマス
2×
P
-2個のマス
.
.
P
+2個のマス
P
+1個のマス
P
個のマス
それぞれのマスの間には１つの空白が入り、マスには０か1が入る。
Constraints
1 ≤
N
≤ 1000
1 ≤
P
≤ 50
1 ≤
Q
≤ 100
同じ模様の聖なる模様が複数個与えられることは無い。
ハニカムモンスターのあるマスについて、2つ以上の聖なる模様の一部分であることがある。
ハニカムモンスターと聖なる模様は回転できない。
Output
伝説のハニモンなら YES を、そうでなければ NO を一行に出力せよ。
Sample Input 1
6 2 2
1 1 1 1 1 1
1 0 0 0 0 1 0
1 0 1 0 0 1 0 1
1 1 1 1 1 1 1 0 0
0 0 1 0 0 0 1 0 1 1
1 1 1 0 1 0 0 1 1 0 1
0 1 0 1 0 0 1 1 1 0
0 1 1 1 1 0 0 1 1
0 0 0 0 1 0 1 0
1 1 1 0 1 1 0
0 1 1 0 0 1
0 1
1 1 1
1 0
0 0
0 1 0
1 1
Sample Output 1
YES
Sample Input 2
6 2 2
0 0 0 1 0 0
1 0 1 1 0 0 1
1 0 1 0 0 1 1 0
0 1 0 1 0 0 0 0 0
0 0 1 1 1 1 0 0 1 1
0 0 0 1 0 0 1 1 0 0 0
0 0 1 0 0 1 1 0 1 1
1 0 0 1 1 1 1 1 1
0 1 0 0 1 0 0 0
0 0 1 0 1 0 0
0 1 1 0 1 0
1 0
1 0 0
1 1
0 1
0 0 1
0 1
Sample Output 2
NO | [
{
"submission_id": "aoj_1535_890620",
"code_snippet": "#include<bits/stdc++.h>\n\n#define rep(i,n) for(int i=0;i<(int)n;i++)\n#define all(c) (c).begin(),(c).end()\n#define mp make_pair\n#define pb push_back\n#define each(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++)\n#define dbg(x) cerr<<__... |
aoj_1541_cpp | Problem A: Yu-kun Likes an Integer
Background
会津大学付属幼稚園はプログラミングが大好きな子供が集まる幼稚園である。園児の一人であるゆう君は、プログラミングと同じくらい数字が大好きだ。そんなゆう君は最近、表に0から9までのいずれかの数字の書かかれたプレートを
n
枚購入して
n
桁の数を作る遊びに熱中している。
今月もゆう君は貰ったお小遣いで
n
枚のプレートを買いに行こうと考えていた。
Problem
プレートは表に書かれている数字によって値段が異なる。
それらを使って作れる
n
桁の数をできる限り小さくしたい。
ゆう君の所持金額と各プレートの値段、購入するプレートの枚数が与えられるので、そこから作ることのできる数の最小値を求めよ。
購入するプレートの値段の総和が所持金額を超えなければ自由にプレートを購入できる。
同じ数字の書かれたプレートを複数枚購入しても良い。
プレートは必ず
n
枚購入しなければならない。
n
枚購入できない場合は "NA" と出力すること。
購入後は
n
枚のプレートを任意の順番で一直線上に並べる。
そうしてできる数字の列を10進数の数とし、その値が最小になるようにしたい。
先頭に1つ以上の0が連続していても良い。 ( 例えば 0019 なら 19 となり, 0000 なら 0 として考える )
図１は０、１、９のプレートを購入した場合についての説明である。
図1 : 0,1,9のプレートを購入した場合
Hint
この問題を解くに当たって、以下のことを参考にしても良い。
整数値を文字列に変換する方法を示す。
value を文字列として str に代入する。
Cの場合
#include<stdio.h>
int main(){
int value = 123; // この値を文字列に変換する
char str[6]; // この変数に value を文字列にしたものが入る
sprintf(str,"%d",value);
return 0;
}
C++の場合
#include<sstream>
using namespace std;
int main(){
int value = 123; // この値を文字列に変換する
string str; // この変数に value を文字列にしたものが入る
stringstream ss;
ss << value;
ss >> str;
return 0;
}
JAVAの場合
class Main {
public static void main(String args[]){
int value = 123; // この値を文字列に変換する
String str = new Integer(value).toString(); // この変数に value を文字列にしたものが入る
}
}
Input
n
m
c
0
c
1
c
2
...
c
9
１行目に２つの整数
n
,
m
が空白区切りで与えられる。
n
は購入するプレートの枚数,
m
はゆう君の所持金額を表す。
２行目には10個の整数が空白区切りで与えられる。
c
i
(
i
は0以上9以下 ) は表に
i
が書かれたプレートの値段を表す。
Constraints
入力は以下の条件を満たす。
1 ≤
n
≤ 5
0 ≤
m
≤ 500
1 ≤
c
i
≤ 1000 ( 0 ≤
i
≤ 9 )
Output
n
枚のプレートを購入し、それらを任意の順番で並べることでできる数の値の最小値を出力せよ。
先頭にいくつかの０を含む場合はそのまま出力すること。 ( 例えば答えが 0019 の場合は先頭の０を取り除いて 19 とするのではなく、そのまま 0019 と出力すること )
所持金額では
n
枚プレートを購入できない場合は "NA" と出力すること。
Sample Input 1
1 10
1 2 3 4 5 6 7 8 9 10
Sample Output 1
0
Sample Input 2
3 10
8 4 5 3 5 6 9 10 11 2
Sample Output 2
119
Sample Input 3
5 30
25 51 32 9 2 1 10 2 5 10
Sample Output 3
04555
Sample Input 4
5 100
101 101 101 101 101 101 101 101 101 101
Sample Output 4
NA | [
{
"submission_id": "aoj_1541_9659771",
"code_snippet": "#include<bits/stdc++.h>\n\nusing namespace std;\n\nvector<vector<int> > combinations;\n\nvoid gen(int idx, vector<int> &comb) {\n if (idx == 0) {\n combinations.push_back(comb);\n return;\n }\n for (int i = 0; i < 10; i++) {\n ... |
aoj_1531_cpp | Problem F: Remainder Zero
Problem
整数の集合A,Bについて,次の条件を満たす整数
x
がいくつ存在するか答えよ。
A
i
mod
x
= 0 かつ
x
mod
B
j
= 0 がすべての
i
(1 ≤
i
≤ N),
j
(1 ≤
j
≤ M) について成り立つ。
(
a
mod
b
は
a
を
b
で割ったときの余りを意味する)
Input
N
M
A
1
A
2
...
A
N
B
1
B
2
...
B
M
Constraints
入力は以下の条件を満たす。
1 ≤
N
,
M
≤ 5
1 ≤
A
i
,
B
j
≤ 10
14
(1 ≤
i
≤
N
, 1 ≤
j
≤
M
)
Output
条件を満たす整数
x
がいくつ存在するか一行で出力せよ。
Sample Input 1
1 2
18
6 9
Sample Output 1
1
Sample Input 2
1 2
256
2 4
Sample Output 2
7 | [
{
"submission_id": "aoj_1531_10314507",
"code_snippet": "#include<bits/stdc++.h> \nusing namespace std;\n\nusing ll=long long;\n\nll modpow(ll a,ll n,ll p){\n\tll r=1;\n\twhile(n>0){\n\t\tif(n%2)r=(r*a)%p;\n\t\tn/=2;\n\t\ta=(a*a)%p;\n\t}\n\treturn r;\n}\n\nint main(){\n\t\n\tcin.tie(nullptr);\n\tios::sync_w... |
aoj_1543_cpp | Problem C: Changing Grids
Background
A君とB君は、『Changing Grids』というゲームに熱中している。このゲームは2人用で、プレイヤー1がステージを構成し、プレイヤー2がそのステージに挑戦しゴールを目指すというものである。
今、A君とB君はこのゲームを何度かプレイしているが、A君の連勝でB君は1度も勝つことができていない。そこであなたは、B君にこのゲームを攻略するためのヒントを教えてあげることにした。
Problem
時刻
T
0
= 0における縦
H
×横
W
の大きさの二次元グリッドの状態が
Area
0
として与えられる。次に、このグリッドの状態は時刻
T
i
において、状態
Area
i
に切り替わる。この切り替わる過程は
N
回繰り返される。初期状態のグリッドにはスタートの位置'S'とゴールの位置'G'が与えられる。いずれかのグリッドにおいてゴールへ辿り着ける場合は、そのときの最小歩数を出力し、ゴールへ辿り着けない場合は、'-1'を出力せよ。なお、以下の条件も満たす必要がある。
Area
i
は以下の要素で構成されている。
‘.’は何もなく移動可能なマス
’#’は障害物であり、移動不可能なマス
'S'はスタート位置を表すマス
'G'はゴール位置を表すマス
プレイヤーは現在いるマスの隣接している上下左右のいずれか1マスに移動する、または現在いるマスに留まるのに1秒かかる。ただし、障害物のマスやグリッドの範囲外には移動できない。
歩数は、現在プレイヤーがいるマスから上下左右のマスへ1マス進むと1増加する。その場に留まる場合には増加しない。
全てのグリッドの大きさは縦
H
×横
W
である。
1マス移動、またはその場に留まった後にグリッドが切り替わる際、次のグリッドにおいて障害物が存在しないマスであれば今のグリッドの状態に関わらず移動が可能である。
全てのグリッドにおいて、初期のグリッドに与えられたゴール位置に到達した場合ゴールとみなす。
Input
入力は以下の形式で与えられる。
H
W
Area
0
N
T
1
Area
1
T
2
Area
2
.
.
T
N
Area
N
1行目に2つの整数
H,W
が空白区切りで与えられる。これは、それぞれ二次元グリッドの縦と横の大きさを表す。2行目から
H
+1行目までの各行に初期状態の二次元グリッドの状態が与えられる。
H
+2行目に整数
N
が与えられる。これは、二次元グリッドの変化する回数を表す。
H
+3行目以降に
N
個の二次元グリッドの切り替わる時刻
T
i
とその状態が与えられる。ただし、
T
i
は全て整数である。
Constraints
入力は以下の条件を満たす。
2 ≤
H,W
≤ 20
1 ≤
N
≤ 15
1 ≤
T
i
≤ 200 (
T
1
<
T
2
< ... <
T
N
)
スタート位置'S'とゴール位置'G'はそれぞれ初期の二次元グリッドに1つだけ存在する。
Output
スタートからゴールへ到達するための最小の歩数を出力せよ。ただし、ゴールに到達できない場合は'-1'を出力せよ。
Sample Input 1
2 2
S.
.G
1
3
##
##
Sample Output 1
2
1番目のグリッドに切り替わる時刻
T
1
は3であり、時間内にプレイヤーはスタートからゴールまでの最短歩数が2歩で辿り着くことが可能なので2を出力する。
Sample Input 2
2 2
S.
.G
1
2
##
##
Sample Output 2
-1
Sample Input 3
2 3
S##
##G
4
2
###
.##
3
###
#.#
5
###
##.
7
###
###
Sample Output 3
3
Sample Input 4
4 3
S..
...
.G.
...
4
2
###
#.#
###
#.#
4
###
#..
#..
###
6
###
#.#
###
#..
8
###
#..
#..
###
Sample Output 4
3
Sample Input 5
3 3
S##
###
##G
1
1
...
...
...
Sample Output 5
4 | [
{
"submission_id": "aoj_1543_3577848",
"code_snippet": "#include <bits/stdc++.h>\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 dbg(x) cout<<#x<<\"=\"<<x<<endl\n\n#define INF INT_MAX/3\n\nstruct state{\n int i,j,t,d;\n};\nbool operator... |
aoj_1545_cpp | Problem E: Rooted Tree Game
Problem
初期状態として複数の根付き木が与えられる。これに対しAliceとBobはゲームを行う。ゲームは2人交互に行い、先手がAliceで後手がBobである。ターンが回ってきたプレイヤーは以下の行動を取る。
根(親を持たない頂点)を1つ選択する。この頂点を
S
とする。
S
を根とする根付き木に含まれる頂点を選択する(ここでは
S
も選択可能)。この頂点を
T
とする。
S
から
T
への経路上にある頂点を、
S
と
T
も含めすべて削除する。また、削除された頂点が端点であるような辺もすべて削除する。
ターンが回ってきた時点で頂点がすべて削除されていた場合、そのプレイヤーの負けとなる。
AliceとBobが常に最適な行動を取る時、与えられた初期状態に対し、勝利するプレイヤーを判定せよ。
以下の図は、プレイヤーの行動の例を示す。
Input
入力は以下の形式で与えられる。
N
M
p
1
p
2
:
p
M
1行目に、初期状態の頂点数
N
と辺の数
M
が空白区切りで与えられる。この時、各頂点を表す番号は1~
N
である。次の
M
行では、辺の情報が与えられる。このうち
i
行目では1つの整数
p
i
が与えられる。これは、頂点
p
i
から頂点
i
への辺があることを表す。言い換えると、頂点
i
の親が頂点
p
i
であることを表す。
Constraints
入力は以下の制約を満たす。
1 ≤
N
≤ 1000
0 ≤
M
< N
i
<
p
i
≤ N ( 1 ≤
i
≤
M
)
Output
勝利するプレイヤーの名前(AliceまたはBob)を1行に出力せよ。
Sample Input1
6 3
4
4
5
Sample Output1
Alice
Sample Input2
6 4
2
5
4
5
Sample Output2
Bob | [
{
"submission_id": "aoj_1545_8295647",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\nint N, P[1 << 18];\nint M;\nint Answer[1 << 18];\nvector<int> Cand;\nvector<int> G[1 << 18];\n\nint FindMex(vector<int> vec) {\n\tvec.push_back(-1);\n\tvec.push_back(... |
aoj_1546_cpp | Problem F: Coupling
Problem
愛津大学では毎年大規模な合コンが行われています。
今年は
N
人の男性と
M
人の女性が参加します。
それぞれ男性は0から順に
N
−1までIDが割り振られおり、女性は0から順に
M
−1までIDが割り振られています。
この合コンでは自分の「大好きな人」と「そこそこ好きな人」のIDを提示します。
男性はそれぞれ女性のIDを、女性はそれぞれ男性のIDを提示します。
その後、以下のルールに従ってカップルが成立します。
男性は複数の女性、女性は複数の男性とカップルになってはいけない。
互いに「大好きな人」と提示した男性と女性でペアができる。
そこから、任意のペアを選びカップルを作ることができる。
片方が「大好きな人」、もう片方が「そこそこ好きな人」と提示した男性と女性でペアができる。
そこから、任意のペアを選びカップルを作ることができる。
互いに「そこそこ好きな人」と提示した男性と女性でペアができる。
そこから、任意のペアを選びカップルを作ることができる。
ルール2で出来たカップル、ルール3で出来たカップル、ルール4で出来たカップルの順にカップルの数が最大になるようにカップルが成立する。
サジ君はこの合コンの主催者です。
近年では参加者の数が多くなり手動でカップルの数を把握するのが大変になってきました。そこでプログラマーであるあなたは、サジ君の手伝いをすることにしました。上記のルールに従ってカップルを作った時の「大好きな人」同士のカップルの数と「大好きな人」と「そこそこ好きな人」によるカップルの数と「そこそこ好きな人」同士のカップルの数を出力するプログラムを作成してください。
Input
入力は以下の形式で与えられる。
N
M
L1
a
1
b
1
a
2
b
2
:
a
L1
b
L1
L2
c
1
d
1
c
2
d
2
:
c
L2
d
L2
L3
e
1
f
1
e
2
f
2
:
e
L3
f
L3
L4
g
1
h
1
g
2
h
2
:
g
L4
h
L4
1行目にそれぞれ男性の参加者の数と女性の参加者の数を表す2つの整数
N
,
M
が与えられる。次に男性側の大好きな人を表すデータの数
L1
が与えられる。続くL1行に
a
i
と
b
i
が空白区切りで与えられる。それぞれ、ID
a
i
の男性がID
b
i
の女性を「大好き」であることを示す。
続く行に男性側のそこそこ好きな人を表すデータの数
L2
が与えられる。続くL2行に
c
i
と
d
i
が空白区切りで与えられる。それぞれ、ID
c
i
の男性がID
d
i
の女性を「そこそこ好き」であることを示す。次に女性側の大好きな人を表すデータの数
L3
が与えられる。続くL3行に
e
i
と
f
i
が空白区切りで与えられる。それぞれ、ID
e
i
の女性がIDの
f
i
の男性を「大好き」であることを示す。
続く行に女性側のそこそこ好きな人を表すデータの数
L4
が与えられる。続くL4行に
g
i
と
h
i
が空白区切りで与えられる。それぞれ、ID
g
i
の女性がID
h
i
の男性を「そこそこ好き」であることを示す。
Constraints
入力は以下の条件を満たす。
1 ≤
N
,
M
≤ 100
0 ≤
a
i
,
c
i
,
f
i
,
h
i
≤
N
−1
0 ≤
b
i
,
d
i
,
e
i
,
g
i
≤
M
−1
0 ≤
L1
,
L2
,
L3
,
L4
≤ 2000
L1
> 0,
L2
> 0 において (
a
i
,
b
i
) ≠ (
c
j
,
d
j
) ( 0 ≤
i
<
L1
, 0 ≤
j
<
L2
)
L3
> 0,
L4
> 0 において (
e
i
,
f
i
) ≠ (
g
j
,
h
j
) ( 0 ≤
i
<
L3
, 0 ≤
j
<
L4
)
(
a
i
,
b
i
) ≠ (
a
j
,
b
j
) (
i
≠
j
) ( 0 ≤
i
<
L1
, 0 ≤
j
<
L1
)
(
c
i
,
d
i
) ≠ (
c
j
,
d
j
) (
i
≠
j
) ( 0 ≤
i
<
L2
, 0 ≤
j
<
L2
)
(
e
i
,
f
i
) ≠ (
e
j
,
f
j
) (
i
≠
j
) ( 0 ≤
i
<
L3
, 0 ≤
j
<
L3
)
(
g
i
,
h
i
) ≠ (
g
j
,
h
j
) (
i
≠
j
) ( 0 ≤
i
<
L4
, 0 ≤
j
<
L4
)
Output
問題文のルールに従ってカップルが成立した時の、「大好きな人」同士のペアの数と「大好きな人」と「そこそこ好きな人」のペアの数と「そこそこ好き」同士のペアの数を空白区切りで1行に出力せよ。
Sample Input 1
3 3
3
0 0
1 1
2 2
2
1 0
2 1
3
1 1
2 2
0 1
2
1 0
2 0
Sample Output 1
2 0 0
この場合男性1と女性1、男性2と女性2が大好き同士でカップルとなり「大好き同士」のペア数が2になる。
すると、男性0のことが「大好き」な女性も「そこそこ好き」な女性もいなくなってしまいます。
また、女性0のことが「大好き」な男性も「そこそこ好き」な男性もいなくなってしまうため以降カップルは成立しなくなります。
Sample input 2
5 5
5
4 1
2 2
1 4
1 3
4 2
5
1 1
1 2
3 3
3 0
3 4
5
2 3
2 2
0 3
0 2
4 1
5
2 0
4 0
1 0
4 3
2 1
Sample Output2
2 1 0 | [
{
"submission_id": "aoj_1546_3578210",
"code_snippet": "#include <bits/stdc++.h>\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 dbg(x) cout<<#x<<\"=\"<<x<<endl\n#define all(x) (x).begin(),(x).end()\n\ntypedef pair<int,int> P;\ntypedef p... |
aoj_1550_cpp | Problem J: Yu-kun Likes To Play Darts
Background
会津大学付属幼稚園はプログラミングが大好きな子供が集まる幼稚園である。園児の一人であるゆう君は、プログラミングと同じくらいダーツが大好きだ。
そんなゆう君は最近ダーツにはまっていたが、普通のダーツに飽きてしまったため独自のダーツボードを作ることにした。
ダーツについては
ダーツ
を参照。
Problem
ゆう君が考えたダーツの内容は以下の通りだ。
無限に広いダーツボードには得点の書かれた多角形が幾つかある。
プレイヤーはダーツの矢を1本だけ持っている。
プレイヤーは矢を投げ、いずれかの多角形に矢を刺すことでそこに書かれている得点を得る。
それ以外に刺さった場合は得点は得られない。
ゆう君は矢を投げる位置を決めたのだが、正確に刺さるとは限らない。
ダーツボードを2次元平面とし、ゆう君が狙う位置を点(
cx
,
cy
)とする。
ゆう君の投げた矢が刺さる場所は、点(
cx
,
cy
)を中心とする半径
r
の円に含まれる任意の点から一様な確率で選ばれる。
ばれる点の座標は整数である必要はない。
ダーツボードの情報とゆう君が狙う位置(
cx
,
cy
)、半径
r
が与えれるので、ゆう君が獲得することの出来る得点の期待値を答えよ。
Input
n
cx
cy
r
0番目の多角形の情報
1番目の多角形の情報
...
(n-1)
番目の多角形の情報
n
はダーツボード上にある多角形の数である。
多角形の情報は以下の形式で与えられる。
p
score
x
0
y
0
x
1
y
1
...
x
(p-1)
y
(p-1)
p
は多角形の頂点数を表し、
score
は多角形に書かれている得点を表す。
多角形の各線分は(
x
i
,
y
i
)と(
x
i+1
,
y
i+1
) (
i
<
p
-1 )の頂点を繋いだ線分と、(
x
p-1
,
y
p-1
)と(
x
0
,
y
0
)の頂点を繋いだ線分である。
Constraints
入力は以下の条件を満たす。
入力は全て整数で与えられる
1 ≤
n
≤ 50
0 ≤
cx
,
cy
,
x
,
y
≤ 1000
1 ≤
r
≤ 100
3 ≤
p
≤ 10
1 ≤
score
≤ 100
多角形の頂点は、隣り合った頂点を時計回り、または反時計回りに訪問するような順番で与えられる
多角形の辺が別の多角形の辺と共通な点をもつことはない
多角形が別の多角形を内包することはない
矢が多角形の辺上に刺さった場合、得点は得られないものとする
Output
ゆう君が獲得することの出来る得点の期待値を1行で出力せよ。小数点以下は何桁数字を出力しても構わない。ただし、解答の誤差は0.000001(10
-6
)を超えてはならない。
Sample Input 1
1 2 2 1
4 1
0 0
2 0
2 2
0 2
Sample Output 1
0.2500000000
Sample Input 2
1 2 2 1
4 1
0 0
5 0
5 5
0 5
Sample Output 2
1.0000000000
Sample Input 3
4 3 3 2
3 1
1 1
3 3
1 5
4 2
2 0
5 0
4 2
3 2
3 3
4 3
6 1
6 5
4 4
3 4
4 4
5 6
2 6
Sample Output 3
1.0574955319
Sample Input 4
1 10 10 1
4 10
0 0
1 0
1 1
0 1
Sample Output 4
0.0000000000 | [
{
"submission_id": "aoj_1550_8296263",
"code_snippet": "#include <iostream>\n#include <cmath>\n#include <vector>\n#include <algorithm>\nusing namespace std;\n\n// ==================================================================== Geometry Library ===========================================================... |
aoj_1547_cpp | Problem G: Yu-kun Likes People Watching
Background
会津大学付属幼稚園はプログラミングが大好きな子供が集まる幼稚園である。園児の一人であるゆう君は、プログラミングと同じくらい人を観察することが大好きだ。
そんなゆう君は、去年の夏休みに作成した人の移動経路のデータと建物の位置情報を観察してあることを疑問に思った。
全ての人が建物内にいる時間の長さのうち、最長のものはどのくらいなのだろうか？
Problem
建物と人の移動経路の情報が与えられる。
全ての人が連続して建物内にいるような時間のうち、最も長いものの長さを出力せよ。
そのような時間が存在しない場合は長さは０とする。
建物と人はそれぞれ2次元平面上の多角形と点として表される。
人は単位時間あたり
x
軸方向と
y
軸方向にそれぞれ速度
vx
と
vy
で移動する。
人を表す点が建物を表す多角形内にある場合、その人は建物内にいるものとする。
( 多角形の辺上に人がいる場合も建物内にいるものとする )
図1は、Sample Input 2 における建物と人の移動経路を表している。多角形は建物、黒い丸は人の初期位置、矢印はその人の移動経路を表す。
時刻2から時刻4、時刻9から時刻12の間に人は建物内にいるため、建物内に全ての人がいる時間の最長は3となる。
図１: Sample Input 2
Input
n
m
T
建物0の情報
建物1の情報
...
建物
n-1
の情報
人0の移動経路
人1の移動経路
...
人
m-1
の移動経路
n
,
m
,
T
はそれぞれ建物を表す多角形の数、人の数、人が移動する時間の上限を表す。
建物の情報は以下のような形式で与えられる。
(
x
i
,
y
i
)と(
x
i+1
,
y
i+1
)の頂点を繋いだ線分が多角形の一辺である。ただし、
p-1
番目の頂点とは、0番目の頂点が繋がる。
p
x
0
y
0
x
1
y
1
...
x
p-1
y
p-1
人の経路情報は以下のような形式で与えられる。
t
0
sx
0
sy
0
(
t
0
= 0 )
t
1
vx
1
vy
1
t
2
vx
2
vy
2
...
t
k
vx
k
vy
k
(
t
k
=
T
)
人は2次元平面上を移動する。 (
sx
0
,
sy
0
) は人が時刻0にいる位置である。
時刻
t
i-1
から
t
i
の間( 0 <
i
≤
k
),
x
軸方向と
y
軸方向にそれぞれ速度
vx
i
と
vy
i
で移動する。
Constraints
入力は以下の条件を満たす。
入力は全て整数として与えられる
1 ≤
n
,
m
≤ 10
3 ≤
p
≤ 10
1 ≤
T
≤ 3600
0 ≤
x
,
y
,
sx
,
sy
≤ 1000
0 =
t
0
<
t
1
< ... <
t
k
=
T
-10 ≤
vx
1
,
vy
1
,...,
vx
k
,
vy
k
≤ 10
建物を表す多角形は時計回りまたは反時計周りで与えられる
多角形の連続する３つの頂点は、一直線上に並ばないものとする
人の位置は常に0以上1000以下である
同じ時刻に2人以上の人が同じ座標にいても良い
建物が別の建物を内包するようなことはない
建物を表す多角形の辺が別の建物を表す多角形の辺と共通な部分をもつことはない
Output
全ての人が建物内にいるような時間のうち、その長さが最長のものの長さを1行で出力せよ。
そのような時間がない場合、長さは０とする。
小数点以下は何桁数字を出力しても構わない。ただし、解答の誤差は0.000001(10
-6
)を超えてはならない。
Sample Input 1
1 1 10
4 3 0 7 0 7 10 3 10
0 0 5
10 1 0
Sample Output 1
4.0000000000
Sample Input 2
1 1 14
4 2 3 6 3 6 6 2 6
0 0 4
3 1 0
6 0 -1
7 1 0
10 0 1
14 1 0
Sample Output 2
3.0000000000
Sample Input 3
2 2 7
4 2 2 5 2 5 5 2 5
4 7 2 10 2 10 5 7 5
0 0 4
3 1 0
7 0 -1
0 7 7
2 1 0
5 0 -1
7 1 0
Sample Output 3
1.0000000000
Sample Input 4
1 3 10
9 2 3 3 6 4 3 5 6 6 3 7 6 8 3 8 7 2 7
0 1 5
10 1 0
0 11 4
10 -1 0
0 4 8
6 0 -1
8 1 0
10 0 1
Sample Output 4
0.3333333333
Sample Input 5
1 2 7
4 2 1 6 1 6 5 2 5
0 1 4
7 1 0
0 9 3
7 0 1
Sample Output 5
0.0000000000 | [
{
"submission_id": "aoj_1547_10334747",
"code_snippet": "// AOJ #1547 Yu-kun Likes People Watching\n// 2025.3.29\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nconst double EPS = 1e-9;\n\nbool inPoly(double x, double y, const vector<pair<double,double>> &poly) {\n int cnt = 0... |
aoj_1544_cpp | Problem D: Smell Searcher
Problem
廃津大学では強烈な香りを放つ
N
個の廃材が一列に並んでいます。
廃材には1から
N
の番号が順番にふられていて、
i
番目の廃材は強さ
a
i
の香りを放っています。
リヒト君は仕事で、すべての廃材の放つ香りの総和を求めるよう依頼されました。
香りの総和が
M
以上になると「大変きつい仕事」とみなされ特別支給金がもらえます。
この仕事を行うために、リヒト君は精度
R
の香り検出器を使います。
精度
R
の香り検出器を使うと
i
番目の廃材の香りを測ろうとすると同時に
i
−
R
,
i
−
R
+1,...,
i
−1,
i
,
i
+1,...,
i
+
R
−1,
i
+
R
番目の廃材の香りも検出されます。言い換えると、閉区間[ max(
i
−
R
,1), min(
i
+
R
,
N
) ] の廃材の香りを検出します。ここで、max(
a
,
b
)は
a
と
b
の最大値、min(
a
,
b
)は
a
と
b
の最小値を表します。
ただし、測った廃材の1つ隣の廃材の香りの強さは本来の香りの強さより
C
減らされ、2つ隣の廃材の強さ香りは本来の香りの強さより2*
C
減らされて検出されます。つまり、
j
(0≤
j
≤
R
)個隣にある廃材の香りの強さは
a
i
−
j
*
C
として検出されます。結果的に、
i
番目の廃材に精度
R
の検出器を使うことで検出された香りの強さの最大値が
i
番目の廃材の香りの強さとして認識されます。
精度の高い検出器を使うとその分費用がかかるため、リヒト君は検出器が認識した1から
N
番目の廃材の香りの総和が
M
以上になる最低の精度
R
の値を知りたいと思っています。
Input
入力は以下の形式で与えられる。
N
M
C
a
1
a
2
...
a
N
1行目に、1つの整数
N
,
M
,
C
が空白区切りで与えられる。2行目に
N
つの整数が空白区切りで与えられる。
a
i
は
i
番目の廃材の香りの強さを表す。
Constraints
入力は以下の制約を満たす。
1 ≤
N
≤ 10
5
1 ≤
M
≤ 10
14
1 ≤
C
≤ 10
9
0 ≤
a
i
≤ 10
9
(1 ≤
i
≤
N
)
Output
精度
R
の検出器を使って認識される廃材の香りの総和を
M
以上にしたときの
R
の最小値を出力せよ。
それが不可能な場合は−1を出力せよ。
R
は必ず0以上であり、負の値の精度は存在しない。
Sample Input1
6 25 3
8 5 1 1 2 6
Sample Output1
1
このとき、精度0の検出器を使うと
8 + 5 + 1 + 1 + 2 + 6 = 23 で25以上になりません。
精度1の検出器を使うと
max(8,5-3) + max(8-3,5,1-3) + max(5-3,1,1-3) + max(1-3,1,2-3) + max(1-3,2,6-3) + max(2-3,6)
= 8 + 5 + 2 + 1 + 3 + 6 = 25 で25以上になるので1が正解です。
Sample Input2
4 10 1
1 2 3 4
Sample Output2
0
Sample Input3
4 11 1
1 2 3 4
Sample Output3
-1 | [
{
"submission_id": "aoj_1544_10071527",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nlong long computeSum(const vector<long long>& a, long long C, int R, long long M) {\n int N = (int)a.size();\n vector<long long> L(N), Rv(N);\n for(int j = 0; j < N; j++){\n L[j] = a[j... |
aoj_1536_cpp | Problem K: Witch Craft Moves
Problem
会津魔法学校は、魔法を使える者が集る学校である。
会津魔法学校には1~
N
までの番号がついた教室と教室同士をつなぐ廊下がある。教室や廊下は何度でも通ることができる。また、会津魔法学校には任意の教室
u
,
v
間を0個以上の教室と廊下を一度ずつ通って移動することができるような経路がただ1つある。
各教室には魔法陣が設置してある。この魔方陣によって、教室に入る度に入った者の魔力が増減させられてしまうのだ。生徒の移動を助けるために以下の二つの質問に応えてほしい。
質問1
0 A B
教室
A
から
B
へ移動したときの魔力の残量を出力してほしい。教室
A
と
B
での増減も含む。また、この質問開始時点での魔力の量は毎回0である。
質問2
1 A C
教室
A
の魔力の増減量が
C
だけ変動させる。
Input
N
cost
1
:
cost
N
a
1
b
1
:
a
N-1
b
N-1
Q
query
1
:
query
Q
入力の最初に教室の数
N
が与えられる。続く
N
行に各教室に入ったときの魔力が増減する量が与えられる。
i
行目の値が
i
番の教室の情報に対応する。続く
N-1
行に廊下の情報が与えられる。
j
行目の廊下は
a
j
番目と
b
j
番目の教室をつなぐことを表す。次に質問の数
Q
が与えられる。続く
Q
行に上記の形式で質問が与えられる。
Output
各質問1について、答えを１行に出力せよ。
Constraints
入力は以下の条件を満たす。
1 ≤
N
≤ 2000
1 ≤
A
i
≤ 2000
1 ≤
B
i
≤ 2000
1 ≤
a
j
,
b
j
≤ N
1 ≤
Q
≤ 1000000
-10000 ≤
C
i
≤ 10000
Sample Input 1
7
1
2
3
4
5
6
7
1 2
1 3
3 4
3 5
5 6
5 7
10
0 1 7
0 2 7
1 1 15
0 1 7
0 2 7
0 1 1
1 1 -15
0 1 7
0 2 7
0 1 1
Sample Output 1
16
18
31
33
16
16
18
1 | [
{
"submission_id": "aoj_1536_10238012",
"code_snippet": "// AOJ #1536 Witch Craft Moves\n// 2025.2.21\n\n#include <bits/stdc++.h>\nusing namespace std;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() { // 整数の入力\n\tint n = 0, c = gc();\n\tif (c == '-') {\tc = gc();\n\t\tdo... |
aoj_1542_cpp | Problem B: Yu-kun Likes Letters in the English Alphabet
Background
会津大学付属幼稚園はプログラミングが大好きな子供が集まる幼稚園である。園児の一人であるゆう君は、プログラミングと同じくらい英小文字が大好きだ。
そんなゆう君は紙と丸と線、そして英小文字を使う新しい遊びを考え、その採点用プログラムを書くことにした。
Problem
初期状態として、紙に
V
個の丸と
E
本の線が書かれている。丸には0から昇順に番号がつけられており、各丸の中には英小文字が1つ書かれているか、何も書かれていない。 各線は異なる２つの丸を結んでいる。1つの丸が26本以上の線で結ばれることはない。
遊びの手順は以下の通りである。
何も書かれていない丸を１つ選ぶ。 そのような丸が存在しない場合はこの処理を終了する。
丸の中に英小文字を１つ書く。 ただし丸が既に英小文字の書かれている丸と線で結ばれている場合、その英小文字と同じ英小文字は書くことはできない。
1. に戻る。
上記の手順に従って全ての丸に英小文字を書いた後、丸の番号が小さい順に丸の中の英小文字を並べ文字列を作る。
こうしてできる文字列を辞書順で最小となるようにしたい。
２つの同じ長さの文字列
s
,
t
があり、
s
が
t
より辞書順で小さいとは次のような場合を言う。
s
i
は文字列
s
の
i
番目の英小文字を、
t
i
は文字列
t
の
i
番目の英小文字を表す。
s
i
が
t
i
と異なるような最小の
i
について、
s
i
が
t
i
より小さい。
紙の初期状態が与えられるので、そこから上記の手順にしたがって作成できる文字列のうち辞書順最小のものを出力せよ。
Input
V
E
a
0
a
1
...
a
(V-1)
s
0
t
0
s
1
t
1
...
s
(E-1)
t
(E-1)
１行目に丸の数
V
と線の数
E
が空白区切りで与えられる。
２行目に丸の初期状態が空白区切りで与えられる。
a
i
が英小文字の場合は
i
番目の丸にその英小文字が書かれており、'?'の場合は
i
番目の丸には何も書かれていないことを表す。
続く
E
行に線の情報が
s
i
t
i
として与えられ、これは
s
i
番の丸と
t
i
番の丸が線で結ばれていることを表す。
Constraints
入力は以下の条件を満たす。
1 ≤
V
≤ 100,000
0 ≤
E
≤ 200,000
a
i
は英小文字, または '?' のいずれか ( 0 ≤
i
≤
V-1
)
0 ≤
s
i
,
t
i
≤
V-1
(
s
i
<
t
i
, 0 ≤
i
≤
E-1
)
１つの丸が26本以上の線で結ばれることはない
Output
問題文中の手順に従って作成可能な文字列のうち、辞書順で最も小さいものを1行に出力せよ
Sample Input 1
3 3
c ? ?
0 1
0 2
1 2
Sample Output 1
cab
Sample Input 2
3 2
c ? ?
0 1
0 2
Sample Output 2
caa
Sample Input 3
7 6
? a ? ? z a ?
0 1
0 2
3 4
4 5
4 6
5 6
Sample Output 3
baaazab
Sample Input 4
5 0
? ? ? ? ?
Sample Output 4
aaaaa | [
{
"submission_id": "aoj_1542_8295587",
"code_snippet": "#include <iostream>\n#include <vector>\nusing namespace std;\n\nint N;\nint M, A[1 << 18], B[1 << 18];\nchar C[1 << 18];\nvector<int> G[1 << 18];\n\nint main() {\n\t// Step 1. Input\n\tcin >> N >> M;\n\tfor (int i = 1; i <= N; i++) cin >> C[i];\n\tfor ... |
aoj_1554_cpp | Problem D: Friday the 13th
Problem
今年も「立命館大学競技プログラミング合宿」が開催されることとなった。僕は毎年開催されるこの合宿をとても楽しみにしている。しかし、欲望に耐え切れず合宿前に散財してしまい、お金に余裕が無くなってしまった。そこで僕は、立命館大学の最寄り駅である南草津まで移動するのに最も安く済む青春18きっぷを使うことにした。この切符は安く済む代わりに乗り換えが多く発生し、移動に丸1日使わなければならないのでとても疲れる。そんな移動をする日が13日の金曜日であることに気づいたのは会津若松駅を出発した後だった。僕は12時間、不安を感じながら電車に揺られるはめになった。
今日は合宿2日目、2015年3月15日、日曜日である。13日は特に何事もなく南草津に到着したが、僕はもうこのような不安を味わいたくないと思った。そこで2日目のジャッジである僕は、指定された期間内に存在する13日の金曜日の数を求める問題を出題し、プログラムを作成してもらうことにした。
閏(うるう)年の定義は以下の通りである。
西暦年が4で割り切れる年は閏年である。
ただし、100で割り切れる年は閏年でない。
ただし、400で割り切れる年は閏年である。
Input
空白で区切られた6つの整数
Y
1
,
M
1
,
D
1
,
Y
2
,
M
2
,
D
2
が1行で与えられる。
Constraints
入力は以下の制約を満たす。
1 ≤
Y
1
≤
Y
2
≤ 10
18
1 ≤
M
i
≤ 12
1 ≤
D
i
≤ 31 (
M
i
= 1, 3, 5, 7, 8, 10, 12)
1 ≤
D
i
≤ 30 (
M
i
= 4, 6, 9, 11)
1 ≤
D
i
≤ 28 (
M
i
= 2 かつ
Y
i
年は閏年でない)
1 ≤
D
i
≤ 29 (
M
i
= 2 かつ
Y
i
年は閏年である)
Y
1
年
M
1
月
D
1
日は
Y
2
年
M
2
月
D
2
日より0日以上前の日付である
Output
Y
1
年
M
1
月
D
1
日から
Y
2
年
M
2
月
D
2
日までの間に存在する13日の金曜日の数を1行に出力せよ。
Sample Input1
2015 3 13 2015 3 13
Sample Output1
1
Sample Input2
2015 2 14 2015 3 15
Sample Output2
1
Sample Input3
1234 5 6 789012345678901234 5 6
Sample Output3
1357101234567708000 | [
{
"submission_id": "aoj_1554_5550660",
"code_snippet": "#include<bits/stdc++.h>\n#define rep(i,a,...) for(int i = (a)*(strlen(#__VA_ARGS__)!=0);i<(int)(strlen(#__VA_ARGS__)?__VA_ARGS__:(a));++i)\n#define per(i,a,...) for(int i = (strlen(#__VA_ARGS__)?__VA_ARGS__:(a))-1;i>=(int)(strlen(#__VA_ARGS__)?(a):0);-... |
aoj_1557_cpp | Problem G: Yu-kun Likes a Treasure
Background
会津大学付属幼稚園はプログラミングが大好きな子供が集まる幼稚園である。園児の一人であるゆう君は、プログラミングと同じくらい財宝が大好きだ。ゆう君は今日も財宝を探すため洞窟を探索する予定だ。そこでゆう君は洞窟の地図から、洞窟を全て見て回る際に歩く距離を求めるプログラムを書くことにした。
Problem
洞窟の情報とゆう君の初期位置が与えられる。Fig.1のように、 洞窟は2次元平面上の多角形で表される部屋が、１つ以上繋がった集合で構成される。部屋が別の部屋と接する場合は必ず点で接し、その接点が洞窟の道となり、接点に訪れるとその道を通ったことになる。
道は扉で閉ざされており、扉が閉まっている状態でその道を通ることはできない。扉を開くためには部屋の中にちょうど１つだけ存在するボタンを押す必要がある。ボタンは2次元平面上の点として表される。
ゆう君はボタンが存在する点を訪れることでボタンを押すことができる。ボタンを押すと部屋にある全ての扉が開く。Fig.1では部屋の中にある丸がボタンを表し、顔のマークがゆう君を、そして矢印が指しているボタンがゆう君のいる場所を表す。ボタンを押して扉を開いた後、道を通るとすぐに全ての扉は閉まる。そのため、そこから別の部屋へと移動するためには再度その部屋の中にあるボタンを押す必要がある。ゆう君は最初、いずれかの部屋の中にあるボタンと同じ場所にいる。
Fig. 1
Fig. 2 に移動の例を示す。番号の付いている矢印はゆう君の移動経路を表す。
次の順番で移動することは可能である。
1 -> 2 -> 3 -> 4
次の順番で移動することは不可能である。
1 -> 4
これは、1の経路で移動し部屋同士の接点を訪れるとその瞬間に扉が閉まるからである。
Fig. 2
ゆう君が洞窟内の全ての道を通り、再度初期位置に戻ってくるまでにかかる移動距離の最小値を出力せよ。ただし、同じ道を何度通っても良い。
Input
入力は以下の形式で与えられる。
n
m
部屋1の情報
部屋2の情報
…
部屋
n
の情報
n
,
m
はそれぞれ洞窟を構成する部屋を表す多角形の数、ゆう君が最初にいる部屋の番号を表す。
部屋の情報は次の形式で与えられる。
p
x
1
y
1
x
2
y
2
…
x
p
y
p
bx
by
p
は多角形の頂点数を表す。(
x
i
,
y
i
) と (
x
i+1
,
y
i+1
) の頂点を繋いだ線分が多角形の一辺である。ただし、
p
番目の頂点は１番目の頂点と繋がる。 (
bx
,
by
) は多角形の内部にあるボタンの位置を表す。多角形は反時計回りで与えられる。
Constraints
入力は以下の制約を満たす。
1 ≤
n
≤ 15
1 ≤
m
≤
n
3 ≤
p
≤ 20
0 ≤
x
,
y
,
bx
,
by
≤ 1000
多角形は反時計回りで与えられる
多角形が別の多角形を内包するようなことはない
多角形はその内部 ( 多角形の辺は含まない ) にちょうど１つだけボタンを持つ
任意の異なる２つの多角形は共通な面積を持たない
任意の異なる２つの多角形
a
,
b
において、
a
と
b
の接点は高々１つしかない
任意の異なる２つの多角形
a
,
b
において、直接または１つ以上の多角形を経由することで
a
から
b
へ移動することができる
Output
ゆう君が初期位置から全ての道を通って再度初期位置に戻ってくるまでにかかる移動の距離の総和の最小値を出力せよ。小数点以下は何桁数字を出力しても構わない。ただし、解答の誤差は0.00001(10
-5
)を超えてはならない。
Sample Input1
3 1
4
0 4
2 4
2 7
0 7
1 6
5
1 0
6 0
4 5
2 2
1 4
4 2
3
2 6
6 4
6 7
5 6
Sample Output1
14.6502815399
Sample Input2
3 2
3
0 2
3 5
0 5
1 4
3
1 0
4 0
1 3
2 1
3
2 2
4 3
2 4
3 3
Sample Output2
8.0644951022
Sample Input2
4 4
3
0 5
3 8
0 8
1 7
3
1 3
4 3
1 6
2 4
5
2 0
7 0
7 2
3 2
2 3
6 1
3
6 2
7 7
2 7
6 6
Sample Output2
18.9356648257 | [
{
"submission_id": "aoj_1557_3561159",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n#define fi first\n#define se second\n#define dbg(x) cout<<#x\" = \"<<... |
aoj_1549_cpp | Problem I: Hard Beans
Problem
大津大学では豆が盛んです。
N
個の豆が一直線上に並んでいます。
それぞれ0から順に
N
−1まで番号がふられており、
i
番目の豆の硬さを
a
i
とします。
シアン君は理想の豆の硬さを
D
だと考えています。しかし、シアン君は面倒くさがりなのであまり遠くにある豆を取りに行きたくありません。したがって、シアン君は
l
番目の豆から
r
番目の豆の中で硬さが
D
に最も近い豆を知りたいと思っています。
シアン君は
Q
個の質問をしてくるので、それぞれの質問に対し閉区間[
l
,
r
]番目にある |
豆の硬さ
−
D
| の最小値を求めるプログラムを作成してください。(ただし、|
a
| は
a
の絶対値を表します。)
Input
入力は以下の形式で与えられる。
N
a
0
a
1
...
a
N−1
Q
l
0
r
0
D
0
l
1
r
1
D
1
.
.
.
l
Q−1
r
Q−1
D
Q−1
1行目に、1つの整数
N
が与えられる。2行目に、
N
つの整数が空白区切りで与えられる。3行目に、クエリの数が１つの整数
Q
として与えられる。続く4行から3+
Q
行までにクエリの値
l
,
r
,
D
が与えられる。
Constraints
入力は以下の制約を満たす。
1 ≤
N
≤ 10
5
0 ≤
|a
i
|
≤ 10
6
(0 ≤
i
≤
N
−1)
1 ≤
Q
≤ 10
5
0 ≤
D
i
≤ 10
6
0 ≤
l
i
≤
r
i
≤
N
−1
Output
各クエリに対し、
D
と[
l
,
r
]番目の豆の中で硬さ
D
に最も近い豆の硬さとの差の絶対値を1行に出力せよ。
Sample Input1
3
1 2 3
3
0 2 2
0 2 4
0 0 2
Sample Output1
0
1
1
Sample Input2
10
4 5 0 21 9 100 12 9 0 8
5
0 3 20
2 5 100
8 9 9
5 5 10
0 9 20
Sample Output2
1
0
1
90
1 | [
{
"submission_id": "aoj_1549_10848513",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nenum {\n NOTFOUND = 1000000000000000000LL\n};\n\nclass SuccinctBitVector {\nprivate:\n const uint64_t size; // ビットベクトルのサイズ\n static const uint64_t blockBitNum = 16;\n static const uint64_... |
aoj_1552_cpp | Problem B: Mountain Climbing
Problem
なりよし君は山登りの計画を立てています。計画はとても大切です。高原・盆地が多いのか、峰・窪地が多いのか、山腹があるのか、状況によって用意する荷物も変わってきます。
なりよし君が持っている登山ガイドブックには、今回登山に利用する道の一定の距離毎の標高がスタート地点からゴール地点まで順に書かれています。
ガイドブックに書かれている標高をスタート地点からゴール地点まで順に
a
1
,
a
2
,
a
3
, ...,
a
N
とし、高原、盆地、山腹、峰、窪地を次のように定義します:
高原
a
i-1
<
a
i
=
a
i+1
= ... =
a
j
>
a
j+1
(
1
<
i
<
j
<
N
)
盆地
a
i-1
>
a
i
=
a
i+1
= ... =
a
j
<
a
j+1
(
1
<
i
<
j
<
N
)
山腹
a
i-1
<
a
i
=
a
i+1
= ... =
a
j
<
a
j+1
(
1
<
i
<
j
<
N
)
もしくは
a
i-1
>
a
i
=
a
i+1
= ... =
a
j
>
a
j+1
(
1
<
i
<
j
<
N
)
峰
a
i-1
<
a
i
>
a
i+1
(
1
<
i
<
N
)
窪地
a
i-1
>
a
i
<
a
i+1
(
1
<
i
<
N
)
高原
盆地
山腹
山腹
峰
窪地
あなたは、なりよし君の為に、高原・盆地・山腹・峰・窪地、それぞれの数を計算するプログラムを書くことにしました。
Input
入力は次のような形式で与えられる:
N
a
1
a
2
a
3
...
a
N
N
は与えられる標高の数を表す整数である。
a
i
は標高を表す整数である( 1 ≤ i ≤
N
)。それぞれ空白区切りで与えられる。
Constraints
入力は以下の条件を満たす。
1 ≤
N
≤ 100000
-100000 ≤
a
i
≤ 100000
Output
高原の数、盆地の数、山腹、峰、窪地の数を順番に空白区切りで一行に出力せよ。
Sample Input 1
5 1 2 3 4 3
Sample Output 1
0 0 0 1 0
Sample Input 2
12 10 5 15 15 20 20 12 12 8 3 3 5
Sample Output 2
1 1 2 0 1 | [
{
"submission_id": "aoj_1552_5550112",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nvector<pair<char,int>> runlength(vector<char> vs){\n\tvector<pair<char,int>> res;\n\tfor(auto v:vs){\n\t\tif(res.empty() || res.back().first!=v) res.emplace_back(v,0);\n\t\tres.back().second++;\n\t}\n\tr... |
aoj_1553_cpp | Problem C: Manhattan Warp Machine 1
Problem
とある宇宙では、1次元の整数座標点上に星が存在し、宇宙人達はマンハッタンワープ装置を使い、星間を移動している。
このワープ装置には、
N
個のボタンが付いており、ボタン
i
を押すと、現在いる星からのマンハッタン距離が
d
i
である任意の星にコスト
c
i
でワープすることができる。
今、点0の星にいるある宇宙人が点
x
の星に行きたいと考えている。
点
x
の星に辿り着くまでの最小のコストを答えよ。
辿り着けない場合は-1を出力せよ。
1次元上の整数座標点には必ず星が存在する。
点
x
1
と点
x
2
間のマンハッタン距離は|
x
1
-
x
2
|で表される。
Input
N
x
d
1
c
1
...
d
N
c
N
入力は全て整数で与えられる。
1行目に
N
と行きたい星の座標
x
が空白区切りで与えられる。
続く
N
行に、移動可能なマンハッタン距離
d
i
とコスト
c
i
が1行ずつ空白区切りで与えられる。
Constraints
入力は以下の条件を満たす。
1 ≤
N
≤ 15
0 ≤
x
≤ 10
5
1 ≤
d
i
≤ 10
5
1 ≤
c
i
≤ 100
与えられるマンハッタン距離
d
i
は全て異なる。
Output
点
x
の星に辿り着くまでにかかる最小コストを1行に出力せよ。辿り着くことが不可能な場合は-1を出力せよ。
Sample Input 1
2 5
1 1
2 1
Sample Output 1
3
Sample Input 2
2 12
9 1
3 2
Sample Output 2
3
Sample Input 3
1 3
4 1
Sample Output 3
-1 | [
{
"submission_id": "aoj_1553_10025912",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long ll;\n\nconst int inf = 1e9;\nconst double INF = 1e12, EPS = 1e-9;\n\nint d[20], c[20];\nbool v[300000];\n\nint main(){\n\n ios::sync_with_stdio(false);\n cin.tie(NULL);\n \n ... |
aoj_1548_cpp | Problem H: Yu-kun Likes a Directed Graph
Background
会津大学付属幼稚園はプログラミングが大好きな子供が集まる幼稚園である。園児の一人であるゆう君は、プログラミングと同じくらいお絵描きが大好きだ。
これまでゆう君は、丸と矢印で沢山絵を書いてきた。矢印は必ず丸と丸を結ぶようにして描いてある。ある日ゆう君はこれらの絵がグラフであることを知る。
丸は頂点と呼ばれ、矢印は辺と呼ばれているらしい。更にゆう君は、矢印を描く際に、必ずその上に１つ正の整数を書いていた。このように、辺に重みがあり有向な辺からなるグラフは重み付き有向グラフと呼ばれる。
今日ゆう君は、新たに閉路という言葉を知った。閉路とは、連結した辺の列であり、それに含まれるどの頂点も高々1度しか現れないもので、最初の頂点と最後の頂点が同じであるようなものをいう。閉路の辺の重みの総和が負になる場合、そのような閉路は負の閉路と呼ばれる。
新たな言葉を沢山知ったゆう君は一つの問題を思いついた。
Problem
閉路を持たない重み付き有向グラフが与えられる。
異なる２つの頂点
i
,
j
を選び、
i
から
j
に重み
w
(
w
< 0 ) の有向な辺を1本追加する。
これによってグラフ内に負の閉路ができるような
i
、
j
をみつけ、その負の閉路に属する辺の重みの総和の最大値を求めよ。
そのような
i
,
j
が存在しない場合は"NA"と出力すること。
Input
V
E
w
s
0
t
0
c
0
s
1
t
1
c
1
...
s
(E-1)
t
(E-1)
c
(E-1)
１行目に頂点の数
V
, 辺の数
E
, 追加する辺の重み
w
が空白区切りで与えられる。
続く
E
行に有向な辺の情報が
s
i
t
i
c
i
として与えられる。 ( 0 ≤
i
≤
E-1
)
これは、
s
i
から
t
i
に向けて重み
c
i
の有向な辺が存在することを表す。
Constraints
入力は以下の条件を満たす。
2 ≤
V
≤ 100000
1 ≤
E
≤ 500000
-100 ≤
w
< 0
0 ≤
c
i
≤ 100 ( 0 ≤
i
≤
E-1
)
0 ≤
s
i
,
t
i
≤
V-1
( 0 ≤
i
≤
E-1
)
入力中に同じ
s
i
と
t
i
のペアが現れることはない
s
i
と
t
i
は異なる
Output
重み
w
の有向な辺を追加することで出来る負の閉路に属する辺の重みの総和の最大値を１行に出力せよ。
どこに辺を追加しても負の閉路が作れない場合は"NA"と出力すること。
Sample Input 1
3 2 -3
0 1 1
0 2 5
Sample Output 1
-2
Sample Input 2
3 2 -1
0 1 1
0 2 5
Sample Output 2
NA
Sample Input 3
7 8 -8
0 1 5
0 4 3
1 2 10
1 3 1
3 6 6
4 3 1
4 5 2
4 6 2
Sample Output 3
-1
Sample Input 4
5 4 -30
0 1 1
1 3 15
1 4 4
2 1 3
Sample Output 4
-12 | [
{
"submission_id": "aoj_1548_8295743",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <queue>\nusing namespace std;\n\nint N, W;\nint M, A[1 << 19], B[1 << 19], C[1 << 19];\nbool dp[100009][109];\nvector<pair<int, int>> G[100009];\nqueue<pair<int, int>> Q;\n\nint main() {\n\t// Step 1. In... |
aoj_1556_cpp | Problem F: Sum of Numbers
Problem
a
以上
b
以下の整数が書かれたカードがそれぞれ
c
枚ずつあります。
これら
c(b-a+1)
枚のカードの中から
d
枚のカードを選択したとき、それらのカードに書かれている整数の合計が
e
になる場合の数を1,000,000,007で割った余りを求めてください。
Input
入力は以下の形式で与えられる。
a
b
c
d
e
1行目に、5つの整数
a
b
c
d
e
が空白区切りで与えられる。
Constraints
入力は以下の制約を満たす。
1 ≤
a
≤ 1000
a
≤
b
≤ 1000
1 ≤
c
≤ 100
1 ≤
d
≤ 1000
c
≤
d
≤
c(b-a+1)
1 ≤
e
≤ 20000
Output
場合の数を1,000,000,007で割った余りを出力せよ。
Sample Input1
2 5 3 3 11
Sample Output1
3
{2,2,2,3,3,3,4,4,4,5,5,5}の中から3枚選び合計が11になるのは、
{2,4,5},{3,3,5},{3,4,4}の３通りである。
Sample Input2
1 2 3 4 100
Sample Output2
0
{1,1,1,2,2,2}の中から4枚選び合計が100になるのは0通りである。 | [
{
"submission_id": "aoj_1556_10431881",
"code_snippet": "// AOJ #1556 Sum of Numbers\n// 2025.4.29\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nconst int MOD = 1000000007;\n\nconst int M_SIZE = 108;\nconst int J_SIZE = 21600;\nll dp[M_SIZE][J_SIZE];\nll dp1_arr[M_SIZE][J_SIZE];\... |
aoj_1560_cpp | Problem J: Yu-kun Likes a lot of Money
Background
会津大学付属幼稚園はプログラミングが大好きな子供が集まる幼稚園である。園児の一人であるゆう君は、プログラミングと同じくらいお金が大好きだ。ゆう君は、今日もお金を稼ぐために財宝の眠る島を訪れた。ゆう君は事前に財宝のありかの描かれた地図を手に入れている。その地図をもとに出来るだけ多くのお金を稼ぎたい。ゆう君は最大でどのくらいお金を手に入れることができるだろうか？
Problem
地図、ゆう君の初期位置、財宝の種類とそれらから得られるお金、そして小さい岩を破壊するために必要な費用の情報が与えられる。地図の情報は
h
マス ×
w
マスのフィールドとして与えられる。地図の各マスに書かれている文字とその意味は次の通りである。
'@' : ゆう君が最初にいる位置を表す。ゆう君が移動した後は道と同じように扱う。
'.' : 道を表す。このマスは自由に通ることができ費用もかからない。
'#' : 大きな岩を表す。このマスは通ることができない。
'*' : 小さな岩を表す。一定の金額を支払うことで壊すことができる。壊した後は道になる。
'0','1',...,'9','a','b',...,'z','A','B',...,'Z' : 財宝があるマスを表す。このマスを訪れることでそこに書かれている文字に対応する財宝の金額分のお金を得る。ただしお金を得ることが出来るのは最初に訪れた時のみである。
ゆう君は１回の移動で隣接する上下左右のいずれかのマスに移動することができる。
ただし、地図の外へ出るような移動はできない。
後払いをすることができるため、小さな岩を壊す際にそれに必要な金額をその時に所持している必要はない。そのため、ゆう君は最終的に小さな岩を壊す際にかかった金額の総和以上のお金を得ている必要がある。
ゆう君が得られる最大の金額を出力せよ。
Input
入力は以下の形式で与えられる。
h
w
n
r
c
1,1
c
1,2
…
c
1,w
c
2,1
c
2,2
…
c
2,w
…
c
h,1
c
h,2
…
c
h,w
m
1
v
1
m
2
v
2
…
m
n
v
n
１行目に地図の縦の長さ
h
,横の長さ
w
,地図に含まれる財宝の数
n
,小さな岩を破壊するためにかかる費用
r
が空白区切りで与えられる。
続く
h
行に地図を表す各マスの情報
c
i,j
が
w
個与えられる。 ( 1 ≤
i
≤
h
, 1 ≤
j
≤
w
)
続く
n
行に財宝の種類
m
k
とその財宝の金額
v
k
が空白区切りで与えられる。 ( 1 ≤
k
≤
n
)
Constraints
入力は以下の制約を満たす。
1 ≤
h
,
w
≤ 8
0 ≤
n
≤ min(
h
×
w
-1,62) ただし、min(
a
,
b
)は
a
,
b
の最小値を表す
1 ≤
v
i
≤ 10
5
( 1 ≤
i
≤
n
)
1 ≤
r
≤ 10
5
c
j,k
,
m
l
を除く全ての入力は整数として与えられる ( 1 ≤
j
≤
h
, 1 ≤
k
≤
w
, 1 ≤
l
≤
n
)
地図にはちょうどひとつ'@'が書かれている
地図にはちょうど
n
個の財宝が書かれている
地図に書かれている財宝の種類は入力で与えられた
m
l
のいずれかである
地図に同じ種類の財宝が２つ以上現れることはない
Output
ゆう君が得られる最大のお金の金額を1行に出力せよ。
Sample Input1
3 3 1 10
@0.
...
...
0 100
Sample Output1
100
Sample Input2
3 3 1 10
@#b
.#.
.#.
b 100
Sample Output2
0
Sample Input3
3 3 1 20
@*C
..*
...
C 10
Sample Output3
0 | [
{
"submission_id": "aoj_1560_6075206",
"code_snippet": "#include <bits/stdc++.h>\n#define INF 1000000007\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int,int> P;\n\nstruct uftree{\n\tint par[25];\n\tint rank[25];\n\tuftree(){\n\t}\n\tvoid init(int n){\n\t\tfor(int i=0;i<n;i++){\n\t\t\tpar[i]=i... |
aoj_1558_cpp | Problem H： Puzzle and Hexagons
Backgorund
超大人気ゲーム「パズル&ヘキサゴンズ」がついにリリースされた。このゲームは超面白すぎてドハマりする人が続出。あまりの熱中度に医師から中毒認定を受ける者も続出した。世界各国の有志達はこのゲームの中毒者達を助けるために「パズル&ヘキサゴンズ」のシミュレータを作り、危険な実機でのプレイを避けるよう促そうとした。あなたにはシミュレータ作りに協力して欲しい。
Problem
正六角形のマスを縦に
H
個、横に
W
個敷き詰めた盤面が与えられる。
Fig.1は
H
=4,
W
=7の時の盤面とそれに対応するマスの座標(
x
,
y
)を示す。
Fig.1
初期状態で各マスには色のついたブロックが存在する。
ブロックの色は以下のようにアルファベット一文字で表現される。
'R' ・・・赤
'G' ・・・緑
'B' ・・・青
'P' ・・・紫
'Y' ・・・黄
'E' ・・・水
次に操作の数
Q
が与えられる。
各操作では回転の中心座標(
x
,
y
)が与えられ、そのマスの周囲にある6つのブロックを時計回りに一つ回転させることを示す。(Fig.2 参照)。
このとき、ブロックが存在しないマスも空のブロックが存在すると考えて時計回りに一つ回転させる。
ただし、指定された座標とその周辺の６つのマスの内いずれか一つでも
H
×
W
の盤面の中に存在していない場合は回転を行わない。
Fig.2
次に以下の処理ができなくなるまで繰り返す。
Fig.3において、ブロックAの位置からB, C, Dの位置のいずれのマスにもブロックが存在しないとき、ブロックAはCの位置に落下する。マスB, Dが存在しない場合はブロックも存在しないと考え、マスCが存在しない場合は落下の処理を行わない。
1の処理が可能なブロックが存在する場合は1に戻る。
同じ色のブロックが3つ以上繋がっている場合、そのブロックは全て消滅する。
2つのブロックが繋がるとはマスの一辺を共有することである。
注意：この一連の処理は、操作が一つも与えられていない状態（初期状態）でも行われる。
Fig.3
全ての操作を実行した後の最終的な盤面を出力せよ。
Input
入力は以下の形式で与えられる。
H
W
F
0,
H−1
F
1,
H−1
…
F
W−1,
H−1
F
0,
H−2
F
1,
H−2
…
F
W−1,
H−2
.
.
.
F
0,
0
F
1,
0
…
F
W−1,
0
Q
x
0
y
0
x
1
y
1
.
.
.
x
Q−1
y
Q−1
1行目に、盤面の縦と横のサイズを表す2つの整数
H
と
W
が与えられる。
2行目から
H
+1行目に、各添字に対応する盤面の色を表す文字列が与えられる。
H
+2行目に、操作の数
Q
が与えられる。
続く
Q
行に回転の中心のマスの座標を表す
x
と
y
が与えられる。
Constraints
3 ≤
H
≤ 50
3 ≤
W
≤ 50
0 ≤
x
<
W
0 ≤
y
<
H
1 ≤
Q
≤ 100
F
i,
j
( 0 ≤
i
< W , 0 ≤
j
< H ) は'R','G','B','P','Y','E'のいずれかである。
Output
全ての操作を行った後の盤面を
H
行で出力せよ。
ただし、ブロックが無いマスは'.'で表すこと。
Sample Input1
3 3
RGR
RBP
YEB
1
1 1
Sample Output1
…
YBG
EBP
Fig.4はSample Input1における状態の遷移を表したものである。
Fig.4
Sample Input2
4 5
BYYGG
RRRRR
RRBRR
YYGGB
2
3 1
3 1
Sample Output2
.....
.....
.....
B.BGB
Sample Input3
4 4
BEEP
ERYY
BBRP
RBYP
1
1 2
Sample Output3
....
....
....
.B..
盤面の初期状態ですでに消えるブロックがあること注意。
両端にあるブロックの落下処理に注意。 | [
{
"submission_id": "aoj_1558_9166437",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\ntypedef long long int ll;\ntypedef unsigned long long int ull;\n#define chmin(x,y) x = min(x,y)\n#define chmax(x,y) x = max(x,y)\n#define BIG_NUM 2000000000\n#define HUGE_NUM 4000000000000000000 //オーバーフローに... |
aoj_1562_cpp | Divisor
Problem
12以下の自然数
N
が与えられるので、約数の個数がちょうど
N
個であるような最小の自然数を求めよ。
Input
1つの自然数
N
が 1 行で与えられる。
Constraints
1 ≤
N
≤ 12
Output
約数の個数がちょうど
N
個であるような最小の自然数を1行に出力せよ。
Sample Input 1
1
Sample Output 1
1
Sample Input 2
2
Sample Output 2
2
Sample Input 3
3
Sample Output 3
4 | [
{
"submission_id": "aoj_1562_2884395",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nint main(){\n\tint n;\n\tcin>>n;\n\tint ans=0;\n\tint count[10000]={};\n\tfor(int i=1;i<=10000;i++){\n\t\tfor(int j=1;j<=10000;j++){\n\t\t\tif(i % j == 0) count[i]++;\n\t\t}\n\t\tif(count[i] == n){\n\t\t\t... |
aoj_1559_cpp | Problem I: Hopping Mind
Problem
チエノとカカオは同じ喫茶店で働く姉妹である。2人はとても仲が良く、ある日、とあるテーブルゲームで遊ぶことになった。
ゲームは
R
マス×
C
マスの盤面と、駒としてうさぎのTPを用いる。盤面の各マスは白か黒の色が塗られている。最初にTPを盤面の右下(
R
,
C
)におき、2人で次の行動を交互に行う。TPの現在の位置を(
a
,
b
)とすると、そこからジャンプ可能な位置(
i
,
j
)を1つ選び、TPをそこにジャンプさせる。TPがジャンプ可能な位置(
i
,
j
)は以下をすべて満たす。
1 ≤
i
≤
R
かつ 1 ≤
j
≤
C
かつ
i
≤
a
かつ
j
≤
b
かつ 1 ≤ (
a
-
i
) + (
b
-
j
) ≤
K
(
i
,
j
)は白いマスである
自分のターンにTPをジャンプさせることができなくなった場合、負けとなる。
チエノが先手、カカオが後手でこのゲームを行う。カカオは頭の中でゲームを最後まで先読みすることができ、常に最適な行動をとる。この時、チエノが勝つ方法が存在するかどうかを判定せよ。
Input
入力は以下の形式で与えられる。
R
C
K
G
1,1
G
1,2
...
G
1,C
G
2,1
G
2,2
...
G
2,C
:
G
R,1
G
R,2
...
G
R,C
1行目に3つの整数
R
,
C
,
K
が空白区切りで与えられる。次の
R
行に盤面の情報として
C
個の".”または"#”が与えられる。
G
i,j
は盤面の位置(
i
,
j
)の色を表し、”.”が白、"#”が黒を表す。
Constraints
1 ≤
R
,
C
≤ 1000
1 ≤
K
≤ 2000
G
R,C
は“.”である
Output
チエノが勝つ方法が存在する場合は”Chieno”を、存在しない場合は”Cacao”を1行に出力せよ。
Sample Input1
3 3 2
...
...
...
Sample Output1
Chieno
Sample Input2
3 3 2
#.#
.#.
#..
Sample Output2
Cacao | [
{
"submission_id": "aoj_1559_10760662",
"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 SIZE 1005\n\nin... |
aoj_1555_cpp | Problem E: Distinct Dictionary
Background
辞書をこよなく愛する者がいた。彼らは自分だけの辞書を作ることが大好きである。
そこであなたは彼らの辞書に、自由にカスタマイズする機能を付け加えてあげることにした。
Problem
初めに、何の単語も入っていない空の辞書が存在する。
N
個の文字列
S
id
と
Q
個のクエリが与えられる。
各クエリはクエリの種類
k
と文字列を指す
id
で与えられる。
クエリの種類は以下の3つである。
k
=1のとき
S
id
を辞書に追加する。
k
=2のとき
S
id
を辞書から削除する。
k
=3のとき辞書に追加された文字列の中で
S
id
を先頭からの部分文字列に含み且つ辞書順最小の文字列の
id
を出力する。無い場合は-1を出力する。
各クエリに答えるプログラムを書いてほしい。
注意：
入力のサイズが大きいので高速な入力に対応する形式を推奨する。
Input
入力は以下の形式で与えられる。
N
S
1
S
2
.
.
.
S
N
Q
k
1
id
1
k
2
id
2
.
.
.
k
Q
id
Q
1行目に、1つの整数
N
が与えられる。2行目から
N
+1行に、
N
個の文字列
S
id
が与えられる。
N
+2行目にクエリの数
Q
が与えられ、続く
Q
行に各クエリの種類を表す
k
と文字列を指す
id
が与えれる。
Constraints
文字列は全て異なる。
N
個の文字列
S
id
の長さの合計は10
6
を超えない。
既に辞書に追加されている文字列が再び追加されるような入力は存在しない。
辞書に追加されていない文字列を削除するような入力は存在しない。
与えられる文字列に含まれる文字は英小文字のみである。
1 ≤
N
≤ 10
5
1 ≤
id
≤
N
1 ≤
Q
≤ 10
5
1 ≤ |
S
id
| ≤ 10
5
(ただし、|
s
|は文字列
s
の長さを表す。)
Output
クエリごとに解答を一行に出力せよ。
Sample Input1
3
apple
app
banana
9
1 1
3 1
3 2
3 3
2 1
1 2
3 1
3 2
3 3
Sample Output1
1
1
-1
-1
2
-1
Sample Input2
7
aaaab
aaa
aaaa
aaaaaabc
abbbbbc
ab
abbb
13
1 1
3 2
1 4
3 2
1 3
3 2
2 3
3 3
1 5
1 7
3 6
2 5
3 6
Sample Output2
1
4
3
4
7
7 | [
{
"submission_id": "aoj_1555_5550778",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nnamespace atcoder {\n\nnamespace internal {\n\n// @param n `0 <= n`\n// @return minimum non-negative `x` s.t. `n <= 2**x`\nint ceil_pow2(int n) {\n int x = 0;\n while ((1U <... |
aoj_1570_cpp | Lights of Apartment
Problem
エーちゃんとリカちゃんとハルトくんはマンションに遊びに来た。
3人は全ての部屋の電気を管理できる部屋に忍び込みいたずらをすることにした。
このマンションは
n
個の立方体が1列に並んでいる形をしている。
各立方体は西から順に1辺の長さが1ずつ増えていて(1,2,3,...,
n
)、
i
番目の立方体は
i
階あり、各階に縦
i
×横
i
個の部屋がある。
2番目以降の立方体の西側は1つ西の立方体の東側と接していて、全ての立方体の南側は真っ直ぐな道路に面している。
初め全ての部屋に電気がついている。
3人はそれぞれ次の行動をした。
エーちゃんは西から
k
番目の全ての部屋の電気を消した。
リカちゃんは南から
k
番目の全ての部屋の電気を消した。
ハルトくんは
k
階の全ての部屋の電気を消した。
このようないたずらが
m
回行われた後に電気がついている部屋の数を求めよ。
Input
n
m
q
1
k
1
...
q
m
k
m
入力は全て整数で与えられる。
1行目に立方体の数
n
、行動の数
m
が与えられる。
2行目以降
m
行に行動した人の番号
q
と
k
が与えられる。
q
i
が0の場合エーちゃん、 1の場合リカちゃん、2の場合ハルトくんが行動したことを表す。
3人は部屋がない場所の電気を消そうとすることもある。
Constraints
1 ≤
n
,
m
≤ 50000
0 ≤
q
i
≤ 2
1 ≤
k
i
≤ 2×10
9
同じ行動は一度しか与えられない
Output
電気がついている部屋の数を1行に出力せよ。
Sample Input 1
3 1
0 4
Sample Output 1
27
Sample Input 2
3 2
2 2
2 3
Sample Output 2
14 | [
{
"submission_id": "aoj_1570_3089072",
"code_snippet": "#include <cstdio>\n#include <iostream>\n#include <sstream>\n#include <fstream>\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#incl... |
aoj_1568_cpp | String Conversion
Problem
ジェニファーとマリアンはカーラに文字列
S
をプレゼントしました。
しかし、カーラは文字列
S
をもらっても嬉しくありません。
文字列
T
が欲しかったのです。
3人は協力して文字列
S
を文字列
T
に変えることにしました。
最初にジェニファーが文字を任意の順番に並び替えます。
次にマリアンが２種類のアルファベットの小文字を交換することを任意の回数行います。
この操作では、例えば以下のように、文字列中の同じ文字が全て交換されます。
aab
→
a
と
b
を交換 →
bba
aab
→
a
と
c
を交換 →
ccb
最後にカーラがある1文字を別の1文字に置換することを
T
になるまで繰り返します。
ジェニファーとマリアンはカーラの置換回数が少なくなるようにしてあげることにしました。
カーラが行う置換の回数の最小値を求めてください。
Input
n
S
T
1行目に文字列の長さ
n
が与えられる。
2行目に文字列
S
、3行目に文字列
T
が与えられる。
Constraints
1 ≤
n
≤ 10
5
S
,
T
は
'a'~'z'
のみを含む
|
S
| = |
T
| =
n
Output
カーラの最少の置換回数を1行に出力せよ。
Sample Input 1
3
abc
xyz
Sample Output 1
0
Sample Input 2
5
aaabb
xyxyz
Sample Output 2
1 | [
{
"submission_id": "aoj_1568_2576345",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nint a[26],b[26],n,ans;\nstring s,t;\n\nint main() {\n cin >> n >> s >> t;\n for(int i=0; i<n; i++) {\n a[s[i]-'a']++;\n b[t[i]-'a']++;\n }\n sort(a,a+26);\n sort(b,b+26);\n for(int i=0; i<26; ... |
aoj_1567_cpp | Lucky Number
Problem
0 から
N
-1 までの数字があります。
M
+1日間のラッキーナンバーを以下の方法で選びたいと思います。 最初の日にラッキーナンバーをランダムに決めます。
i
日後のラッキーナンバーを
A
、（
i
+1）日後のラッキーナンバーを
B
とすると、
B
= (
A
+
j
) %
N
（ただし
j
は 0 ≤
j
<
N
かつ （
j
/
K
） が偶数となる全ての整数である )
で求められる
B
のうちのいずれかからランダムに決めます。ただし、
a
/
b
の結果は小数点以下を切り捨てた整数とし、
a
%
b
は
a
を
b
で割った余りとします。
また
K
は
N
/
K
が割り切れて、
N
/
K
が偶数となる数字であることが保証されます。
例えば 0,1,2,3 と数字があり、
K
= 1 のとき
0 の次のラッキーナンバーは 0 or 2
1 の次のラッキーナンバーは 1 or 3
2 の次のラッキーナンバーは 0 or 2
3 の次のラッキーナンバーは 1 or 3
となります。
次に
Q
個の質問が与えられます。 各質問の内容は以下のとおりです。
最初の日のラッキーナンバーが
a
のとき
b
日後のラッキーナンバーが
c
になるような
b
日後までのラッキーナンバーの選び方は何通りでしょうか？
選び方は膨大な数になると思われるので 1,000,000,007 で割った余りを求めてください。
例えば、
N
=4
K
=1 で、最初のラッキーナンバーが 0 で 3 日後のラッキーナンバーが 2 になるような組み合わせは
0 → 0 → 0 → 2
0 → 0 → 2 → 2
0 → 2 → 0 → 2
0 → 2 → 2 → 2
の４通りです。
Input
入力は以下の形式で与えられる。
N
M
K
Q
a
1
b
1
c
1
a
2
b
2
c
2
.
.
.
a
Q
b
Q
c
Q
Constraints
1 ≤
N
≤ 5000
1 ≤
M
≤ 5000
1 ≤
K
≤ 5000
N
/
K
が割り切れる
N
/
K
は偶数
1 ≤
Q
≤ 100000
0 ≤
a
i
<
N
( 1 ≤
i
≤
Q
)
0 ≤
b
i
≤
M
( 1 ≤
i
≤
Q
)
0 ≤
c
i
<
N
( 1 ≤
i
≤
Q
)
Output
各質問に対し、答えを求め 1,000,000,007 で割った余りを一行ずつ順番に出力してください。
Sample Input1
6 3 1 10
0 1 0
0 2 0
0 3 0
1 3 3
0 2 1
2 2 2
2 3 2
2 2 0
1 1 1
2 2 1
Sample Output1
1
3
9
9
0
3
9
3
1
0 | [
{
"submission_id": "aoj_1567_3079308",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\ntypedef long long ll;\ntypedef unsigned long long ull;\ntypedef pair<ll, ll> P;\n\n#define fi first\n#define se second\n#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)\n#define rep(i,n) repl(i,0,n)\... |
aoj_1571_cpp | String Crossing
Problem
N
個の文字列{
S
1
,
S
2
, ...,
S
N
} が与えられる。
続いて
Q
個のクエリが与えられる。
クエリの種類は以下の2つである。
a
,
b
,
c
,
d
が入力され
S
a
の
b
文字目からの substring を
S
c
の
d
-1文字までの substring の後に繋げる。これを新しい
S
c
とする。
元の
S
c
の
d
文字目からの substring を
S
a
の
b
-1文字までの substring の後に繋げる。これを新しい
S
a
とする。
a
,
b
,
c
が入力され
S
a
の
b
文字目を
c
に変更する。
例えば
S
1
="abcd",
S
2
="efgh"があり
クエリの種類が1で
a
=1,
b
=2,
c
=2,
d
=3のとき
a - -> bcd
X
ef - -> gh
S
1
="agh",
S
2
="efbcd"となる。
全てのクエリを処理した後の文字列
S
1
から
S
N
を全て出力せよ。
Input
入力は以下の形式で与えられる。
N
Q
S
1
S
2
...
S
N
query
1
query
2
...
query
Q
各
query
は次のいずれかである。
1
a
b
c
d
or
2
a
b
c
Constraints
1 ≤
N
≤ 10
5
1 ≤
Q
≤ 10
5
N
個の文字列の長さの合計は2×10
6
を越えない。
文字列
S
i
は全て英小文字であることが保証される。
クエリの種類が1のとき
a
≠
c
1 ≤
b
≤ |
S
a
|
1 ≤
d
≤ |
S
c
|
クエリの種類が2のとき
1 ≤
b
≤ |
S
a
|
c
は英小文字であることが保証される。
高速な入出力を推奨する。
Output
各クエリを処理した後の文字列を
S
1
から
S
N
まで1行ずつ出力せよ。
S
1
S
2
...
S
N
Sample Input 1
2 1
abcd
efgh
1 1 2 2 3
Sample Output 1
agh
efbcd
Sample Input 2
2 3
abcd
efgh
1 1 2 2 3
2 1 3 x
2 2 4 x
Sample Output 2
agx
efbxd
Sample Input 3
10 10
sjcvpauokb
fmeaowomscy
sepeqqfcosrjmonfsv
zapc
aromazjzqoeiqswvcaf
clifpa
dusudcz
qeqdzdtdzlkhc
gkpsjvdvadmf
xrtyxnkolluagwxp
1 4 4 6 3
1 7 1 8 1
2 2 6 o
1 4 4 3 7
2 1 2 i
1 6 3 3 2
1 6 5 1 9
2 10 9 j
1 2 2 7 3
2 3 2 b
Sample Output 3
sicvpauoeqqifpa
fqdzdtdzlkhc
sb
zapfcosrjmonfsv
aromazjzqoeiqswvcaf
clepkb
qemeaooomscy
dusudcz
gkpsjvdvadmf
xrtyxnkojluagwxp | [
{
"submission_id": "aoj_1571_10349818",
"code_snippet": "// AOJ #1571 String Crossing\n// 2025.4.5\n\n#include <bits/stdc++.h>\nusing namespace std;\n#include <ext/rope>\nusing namespace __gnu_cxx;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() { // 整数の入力\n\tint n = 0; i... |
aoj_1578_cpp | Rubik Dungeon
Problem
あなたは
n
×
n
×
n
の立方体のルービックキューブ型のダンジョンにやってきた。
あなたは現在(
x
1
,
y
1
,
z
1
)の部屋にいる。
目標の宝は(
x
2
,
y
2
,
z
2
)の部屋にある。
あなたは隣接している前後左右上下の部屋に単位時間で移動することができる。
各部屋には6つのボタンがあり、それぞれのボタンを押すことにより、単位時間で、ルービックキューブのように以下の操作を行うことができる：
現在いる部屋と
x
座標の値が同じ全ての部屋を時計または反時計周りに90度回転することができる
現在いる部屋と
y
座標の値が同じ全ての部屋を時計または反時計周りに90度回転することができる
現在いる部屋と
z
座標の値が同じ全ての部屋を時計または反時計周りに90度回転することができる
回転している途中で他の部屋に移動することはできない。
宝のある部屋まで最短で移動した場合の時間を求めよ。
Input
n
x
1
y
1
z
1
x
2
y
2
z
2
入力は全て整数で与えられる。
1行目に
n
が与えられる。
2行目に現在地の座標(
x
1
,
y
1
,
z
1
)、3行目に宝のある部屋の座標(
x
2
,
y
2
,
z
2
)が空白区切りで与えられる。
Constraints
2 ≤ n ≤ 10
5
0 ≤
x
1
,
y
1
,
z
1
,
x
2
,
y
2
,
z
2
≤
n
−1
(
x
1
,
y
1
,
z
1
) ≠ (
x
2
,
y
2
,
z
2
)
Output
最短の時間を出力せよ。
Sample Input 1
3
0 0 0
1 2 2
Sample Output 1
3
Sample Input 2
3
0 0 0
0 0 2
Sample Output 2
2
回転させると宝も移動してしまうので、回転させずに移動する。 | [
{
"submission_id": "aoj_1578_3090330",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))\n#define all(x) (x).begin(),(x).end()\n#define pb push_back\n#define fi first\n#define se second\n#define dbg(x) cout<<#x\" = \"<<... |
aoj_1561_cpp | Problem K: Manhattan Warp Machine 2
Problem
とある宇宙では、3次元の格子点上に星が存在し、宇宙人達はマンハッタンワープ装置という装置を使い、星間を移動している。
このワープ装置には、
N
個のボタンが付いており、ボタン
i
を押すと、現在いる星からのマンハッタン距離が
d
i
である任意の星にワープすることができる。
ワープ装置は改良され、コストがかからずに移動出来る。
今、(0, 0, 0)の星にいるある宇宙人がある
M
個の星を訪れたいと考えている。
M
個の星を全て訪れるのに最短で何回ワープをする必要があるか答えよ。
もし、1つでも訪れることが不可能な星がある場合は-1を出力せよ。
M
個の星は好きな順番に訪れることが出来、全て訪れた後に(0, 0, 0)に戻って来る必要は無い。
3次元上の全ての格子点には必ず星が存在する。
点(
x
1
,
y
1
,
z
1
)と点(
x
2
,
y
2
,
z
2
)間のマンハッタン距離は|
x
1
-
x
2
| + |
y
1
-
y
2
| + |
z
1
-
z
2
|で表される。
Input
N
M
d
1
...
d
N
x
1
y
1
z
1
...
x
M
y
M
z
M
入力は全て整数で与えられる。
1行目に
N
,
M
が与えられる。
2行目に移動可能なマンハッタン距離
d
i
が空白区切りで与えられる。
3行目以降の
M
行に、
M
個の訪れたい星の格子点の座標(
x
i
,
y
i
,
z
i
)が1行ずつ空白区切りで与えられる。
Constraints
入力は以下の条件を満たす。
1 ≤
N
≤ 15
1 ≤
M
≤ 15
1 ≤
d
i
≤ 3×10
5
-10
5
≤
x
i
,
y
i
,
z
i
≤ 10
5
与えられるマンハッタン距離
d
i
は全て異なる。
与えられる格子点の座標は全て異なる。
Output
M
個の星全てを訪れるのにかかる最短ワープ回数を1行に出力せよ。
訪れることが不可能な星がある場合は-1を出力せよ。
Sample Input 1
2 1
1 2
5 0 0
Sample Output 1
3
Sample Input 2
2 2
9 3
3 0 0
3 9 0
Sample Output 2
2
Sample Input 3
1 1
4
3 0 0
Sample Output 3
-1 | [
{
"submission_id": "aoj_1561_5550709",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\n// template {{{\nusing i32 = int;\nusing u32 = unsigned int;\nusing i64 = long long;\nusing u64 = unsigned long long;\n\n#define range(i, l, r) for (i64 i = (i64)(l); i < (i64)(r); (i) += 1)\n#define r... |
aoj_1569_cpp | Bomb Removal
Problem
縦
H
×横
W
のグリッド上に
N
個の点火された導火線とそれぞれに対する1つの爆弾が配置されている。それぞれの導火線と爆弾は、
L
i
個のマスからなる
path
i
上に配置され、
path
i
の
j
番目のマスを(
px
ij
,
py
ij
)とする。各爆弾は
path
i
の最後のマス(
px
iL
i
,
py
iL
i
)に存在する。導火線の火は初期状態(0秒時点)でマス(
px
i1
,
py
i1
)にあり、1秒間に1マス進む((
px
i1
,
py
i1
),(
px
i2
,
py
i2
),...,(
px
iL
i
,
py
iL
i
)の順に進む)。
最初、ロボットがマス(
sx
,
sy
) にいる。このロボットは今いるマスの隣接する8方向のマスに1進む、または、そのマスに留まるのに1秒かかる。ただし、グリッドの外や爆弾のあるマスには移動することができない。ロボットは導火線の火があるマス上にいるとき消火することができる(同じマスに2つ以上の導火線の火がある場合はそれら全てを消すことができる)。
爆弾は導火線の火がマス(
px
iL
i
,
py
iL
i
)に到達したときに爆発する(
path
i
の途中で導火線の火がマス(
px
iL
i
,
py
iL
i
)を通過したときは爆弾は爆発しない)。
全ての爆弾を爆発させずに全ての導火線の火を消火させるための最短の時間を出力せよ。ただし、どのように移動しても爆弾を爆発させてしまう場合は-1を出力せよ。なお、初期状態(0秒時点)でロボットが導火線の火の上にいる場合、消火することができる。
Input
入力は以下の形式で与えられる。
W
H
N
sx
sy
L
1
path
1
L
2
path
2
...
L
N
path
N
1行目に3つの整数
W
,
H
,
N
が空白区切りで与えられる。2行目に2つの整数
sx
,
sy
が空白区切りで与えられる。3行目から
N
+2行目に
L
i
と
path
i
が与えられる。
path
i
は以下の形式で与えられる。
px
i1
py
i1
px
i2
py
i2
...
px
iL
i
py
iL
i
Constraints
2 ≤
H
,
W
≤ 20
1 ≤
N
≤ 5
1 ≤
sx
≤
W
1 ≤
sy
≤
H
2 ≤
L
i
≤
H
+
W
1 ≤
px
ij
≤
W
1 ≤
py
ij
≤
H
path
i
の隣り合うマスは上下左右に隣接している。
導火線は互いに独立している(他の導火線に影響しない)。
爆弾はマス(
sx
,
sy
)には置かれない。
Output
ロボットが全ての導火線の火を消火させるための最短時間または -1 を出力せよ。
Sample Input 1
2 2 1
2 1
3 1 1 1 2 2 2
Sample Output 1
1
サンプル1に対応する図は以下の通りである。
ロボットは1秒後に左下の(1, 2)のマスに移動することにより消火することができる。
Sample Input 2
2 2 1
2 1
2 1 1 1 2
Sample Output 2
-1
サンプル2に対応する図は以下の通りである。
ロボットは、(1, 1)または(2, 2)のマスに移動する、または今いるマス(2, 1)に留まることができるがいずれにせよ1秒後に爆弾が爆発してしまう。
Sample Input 3
3 3 2
1 3
3 2 3 2 2 2 1
5 2 1 1 1 1 2 2 2 3 2
Sample Output 3
2
サンプル3に対応する図は以下の通りである。
ロボットは、(2, 2)のマスに移動し、(1, 2)のマスに移動することにより2秒で全ての導火線の火を消火することができる。
Sample Input 4
3 3 1
2 2
2 2 2 2 1
Sample Output 4
0
ロボットは、初期状態(0秒時点)で(2, 2)のマスにいて、導火線の火も(2, 2)のマスにあるので0秒で消火することができる。 | [
{
"submission_id": "aoj_1569_10946142",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nusing VI = vector<int>;\nusing VVI = vector<VI>;\nusing PII = pair<int, int>;\nusing LL = long long;\nusing VL = vector<LL>;\nusing VVL = vector<VL>;\nusing PLL = pair<LL, LL>;\nusing VS = vector<strin... |
aoj_1574_cpp | Gossip
Problem
1から
n
までの番号が順番に割り当てられている
n
人のアイドルが横一列に並んでいる。
アイドル
i
は単位時間でアイドル
i
-1とアイドル
i
+1に情報を伝達することができる。ただし、アイドル1はアイドル2にしか情報を伝達できず、アイドル
n
はアイドル
n
-1にしか情報を伝達できない。
時刻0の時点で、番号が
a
1
,
a
2
, ...,
a
m
である
m
人のアイドルが秘密の情報を持っている。すべてのアイドルが秘密の情報を得ることのできる最小の時間を求めよ。
Input
入力は以下の形式で与えられる。
n
m
a
1
a
2
...
a
m
1行目に2つの整数
n
と
m
が空白区切りで与えられる。
2行目に
m
個の整数
a
1
,
a
2
, ...,
a
m
が空白区切りで与えられる。
Constraints
2 ≤
n
≤ 10
5
1 ≤
m
≤
n
1 ≤
a
i
≤
n
a
i
の値は全て異なる
a
i
は昇順で与えられる
Output
すべてのアイドルに情報が伝わる最小の時間を1行に出力する。
Sample Input 1
3 2
1 3
Sample Output 1
1
Sample Input 2
10 3
2 5 7
Sample Output 2
3
Sample Input 3
10 5
2 5 6 8 10
Sample Output 3
1
Sample Input 4
100000 1
1
Sample Output 4
99999 | [
{
"submission_id": "aoj_1574_2747836",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define _MACRO(_1, _2, _3, NAME, ...) NAME\n#define _repl(i,a,b) for(int i=(int)(a);i<(int)(b);i++)\n#define _rep(i,n) _repl(i,0,n)\n#define rep(...) _MACRO(__VA_ARGS__, _repl, _rep)(__VA_ARGS__)\n#define... |
aoj_1577_cpp | Courage Test
P「今日は肝試し企画の番組の収録だ。」
O型智絵里「き、きもだめし……」
四村かな子「智絵里ちゃん大丈夫？」
月野茜「さすがPさん！一行で状況が明晰判明にわかる素晴らしい解説です！さあ！火の玉に向かって走りましょう！」
P「ルールは簡単、みんなで協力してこのエリアのすべての神社にお参りしてくるだけだ。」
茜「オーソドックスですね！早速神社に向かって走りましょう！」
かな子「でもここ、日本有数の神社密度で行かなくちゃいけない神社がたくさんあるんじゃなかったっけ……」
かな子「でも茜ちゃんがいれば心強いよ！」
P「ちなみにスタートは全員違う神社からスタート、合流も禁止だ。それじゃあ智絵里とかな子は初期位置についてくれ」
智絵里「うぅ……」
かな子「お、お菓子を持っていけば大丈夫！」
智絵里「頑張る……」
茜「プロデューサー！私はどうすれば！」
P「お前は賑やかしだ」
茜「えっ」
P「座ってろ」
茜「」
Problem
それぞれ1~
n
の番号が付けられた
n
個の神社と
n
-1本の道がある。各道は神社
a
i
と神社
b
i
を繋ぎ、双方向に移動することができる。それぞれの神社は、任意の神社から1本以上の道を経由して到達することができる。また、任意の2つの神社の間の(迂回しない)経路は一意に定まる。
O型智絵里ちゃんと四村かな子ちゃんがそれぞれ神社
u
と神社
v
にいる。
今、2人を任意に移動させることを考える。移動とは、ある神社から1本の道を経由して別の神社に進むことである。
その際、以下のルールを満たしたい。
2人合わせて全ての神社を訪問する。
2人の移動数を同じにする。
1つの神社, 道は1人しか通れず、さらに1度しか通ることができない。
神社
u
,
v
は既に訪れているものとし、通ることはできない。
これらのルールを満たすことができるかどうかを判定し、できる場合は"Yes"を、できない場合は"No"を出力せよ。
Input
入力は以下の形式で与えられる。
n
u
v
a
1
b
1
a
2
b
2
...
a
n−1
b
n−1
1行目に3つの整数
n
,
u
,
v
が空白区切りで与えられる。
2行目から
n
行目までに、2つの整数
a
i
,
b
i
が空白区切りで与えられる。
Constraints
2 ≤
n
≤ 10
5
1 ≤
a
i
,
b
i
,
u
,
v
≤
n
u
≠
v
a
i
<
b
i
(
a
i
,
b
i
) ≠ (
a
j
,
b
j
) (
i
≠
j
)
Output
ルールを満たすことができる場合は"Yes"を、できない場合は"No"を1行に出力する。
Sample Input 1
4 1 4
1 2
2 3
3 4
Sample Output 1
Yes
Sample Input 2
8 3 6
1 2
2 4
3 4
4 5
5 6
6 7
7 8
Sample Output 2
No
Sample Input 3
4 2 3
1 2
2 3
3 4
Sample Output 3
Yes
Sample Input 4
6 1 5
1 2
1 4
2 3
4 5
3 6
Sample Output 4
No | [
{
"submission_id": "aoj_1577_10239296",
"code_snippet": "// AOJ #1577 Courage Test\n// 2025.2.22\n\n#include <bits/stdc++.h>\nusing namespace std;\nconst int INF = 1e9;\n\n#define gc() getchar_unlocked()\n#define pc(c) putchar_unlocked(c)\n\nint Cin() { // 整数の入力\n\tint n = 0, c = gc();\n\tif (c == '-') {\t... |
aoj_1583_cpp | Equivalent Vertices
Background
会津大学付属幼稚園はプログラミングが大好きな子供が集まる幼稚園である。
園児の一人であるゆう君は,プログラミングと同じくらいお絵描きが大好きだ。
これまでゆう君は丸と六角形と矢印で沢山絵を書いてきた。
ある日ゆう君はこれらの絵がグラフであることを知る。
丸と六角形は頂点と呼ばれ,矢印は辺と呼ばれているらしい。
ゆう君は2つの頂点間を結ぶようにして矢印を描き、更にその上に0か1を書く。
このように,辺に重み(0または1)があり有向な辺からなるグラフは重み付き有向グラフと呼ばれる。
また,頂点と数字
x
(0または1)が与えられた時,その頂点から出ている矢印のうち,
x
と同じ重みを持つ矢印に従って別の頂点に移動することを
x
に従って遷移する
と言う。
今日ゆう君は0と1からなるどのような数列に従って遷移しても最終的に到達する頂点の種類(丸または六角形)が一緒であるような頂点の対が存在することに気がついた。
これについてゆう君は一つの問題を思いついた。
Problem
重み付き有向グラフが与えられる。
このグラフの各頂点は0から順番に
n
-1まで番号が割り振られている。
また,各頂点はそこから重みが0の辺と1の辺の合計2本の辺が出て行く。
さらに,頂点には丸い頂点か六角形の頂点の2種類が存在し,各頂点はそれらのいずれかである。
以下にSample Input 2で与えられる重み付き有向グラフを示す。
図1. Sample Input 2
以下の形式で
m
個の質問が与えられるので、それぞれについて答えを出力せよ。
頂点の番号
q
が与えられるので,この頂点と
等価
な頂点の数を出力せよ
2つの頂点
a
,
b
が以下の2つの条件を満たすとき,
a
と
b
は等価である。
a
と
b
は同じ種類の頂点である
0と1からなる長さ1以上の任意の数列について,それに従って
a
と
b
のそれぞれから遷移を開始したとき最終的に到達する頂点の種類が同じである
例えば,図1の頂点3から数列0,0,1,0に従って遷移を開始すると,
3→2→1→1→1の順番で遷移し最終的に到達する頂点は1である。
Sample Input 2 において,頂点0と頂点2,頂点0と頂点4は等価である。
頂点0と頂点4について考える。
これらは両方とも丸い頂点であるため1つめの条件を満たす。
また,これらの頂点から0または1で遷移した結果到達する頂点は1か5である。
頂点1,5はそれぞれどのような数列に従って遷移してもその頂点に止まり続ける。
また,両方とも六角形の頂点である。
これより,頂点0と頂点4はどのような数列に従って遷移しても最終的に到達する頂点は六角形の頂点であるため2つめの条件も満たす。
条件を2つとも満たすので頂点0と頂点4は等価である。
最終的に到達する頂点は種類が同じであれば良いため,頂点の番号が同じである必要はないことに注意せよ。
また,頂点0と頂点1は等価でない。
頂点0は丸い頂点で頂点1は六角形頂点なので,1つめの条件を満たさない。
Input
n
m
v
0
s
0
t
0
v
1
s
1
t
1
…
v
n−1
s
n−1
t
n−1
q
0
q
1
…
q
m−1
v
i
,
s
i
,
t
i
はそれぞれ
i
番の頂点の種類,0による遷移先の頂点番号,1による遷移先の頂点番号
v
i
が0のとき,
i
番の頂点は丸い頂点であり,1のとき六角形の頂点
q
j
は
j
番目の質問で与えられる頂点の番号
Constraints
入力は全て整数として与えられる
1 ≤
n
≤ 3000
1 ≤
m
≤ n
0 ≤
s
i
,
t
i
,
q
j
≤
n
-1
0 ≤
v
i
≤ 1
与えられるグラフの辺が双方向に移動できるものとしたとき,任意の2点を結ぶような辺の集合が存在する, つまり与えられるグラフは連結である
Output
各質問で与えられる頂点の番号
q
j
に対して,それと等価な頂点の数をそれぞれ一行に出力せよ。
Sample Input 1
2 1
0 0 1
0 1 0
0
Sample Output 1
2
Sample Input 2
6 6
0 1 5
1 1 1
0 1 5
0 2 1
0 5 1
1 5 5
0
1
2
3
4
5
Sample Output 2
3
2
3
1
3
2 | [
{
"submission_id": "aoj_1583_10240168",
"code_snippet": "// AOJ #1583 Equivalent Vertices\n// 2025.2.23\n\n#include <bits/stdc++.h>\nusing namespace std;\n\nint main(){\n ios::sync_with_stdio(0);\n cin.tie(0);\n\n int n, m;\n cin >> n >> m;\n\n vector<int> typ(n), nxt0(n), nxt1(n), grp(n);\n ... |
aoj_1579_cpp | Array Update 2
Problem
項数
N
、初項
a
、公差
d
の等差数列
A
がある。
以下の形式で、数列を書き換える
M
個の命令文が与えられるので、与えられた順序で
M
回
数列
A
を書き換えたときの数列
A
の
K
項目の値を求めなさい。
i
番目の命令文は3つの整数
x
i
, y
i
, z
i
で与えられる。(1 ≤
i
≤
M
)
x
i
が0だった場合、
y
i
項目から
z
i
項目までの区間において、値の順序を反転する。
x
i
が1だった場合、
y
i
項目から
z
i
項目までの区間において、それぞれの値を1増加させる。
x
i
が2だった場合、
y
i
項目から
z
i
項目までの区間において、それぞれの値を半分にする（小数点以下は切り捨てる）。
Input
N
a
d
M
x
1
y
1
z
1
x
2
y
2
z
2
...
x
M
y
M
z
M
K
1行目に、1つの整数
N
が与えられる。
2行目に、2つの整数
a
と
d
が空白区切りで与えられる。
3行目に、1つの整数
M
が与えられる。
4行目からの
M
行のうち
i
行目には
i
番目の命令文を表す 3 つの整数
x
i
, y
i
, z
i
が空白区切りで与えられる。
最後の行に、1つの整数
K
が与えられる。
Constraints
2 ≤
N
≤ 200000
1 ≤
a
≤ 5
1 ≤
d
≤ 5
1 ≤
M
≤ 200000
0 ≤
x
i
≤ 2 (1 ≤
i
≤
M
)
1 ≤
y
i
≤
N
(1 ≤
i
≤
M
)
1 ≤
z
i
≤
N
(1 ≤
i
≤
M
)
y
i
<
z
i
(1 ≤
i
≤
M
)
1 ≤
K
≤
N
Output
入力で与えられた順番で数列
A
を
M
回更新したときの
K
項目を出力せよ。
Sample Input 1
4
2 1
3
0 1 2
1 1 4
2 2 4
3
Sample Output 1
2
{ 2 , 3 , 4 , 5 }
↓ 0 1 2 ... 1項目から2項目までの区間の値の順序を反転する
{ 3 , 2 , 4 , 5 }
↓ 1 1 4 ... 1項目から4項目までの区間の値をそれぞれ1増やす
{ 4 , 3 , 5 , 6 }
↓ 2 2 4 ... 2項目から4項目までの区間の値をそれぞれ半分にする（小数点以下切り捨てる）
{ 3 , 1 , 2 , 3 }
よって3項目の値は2である。
Sample Input 2
5
1 2
3
1 2 3
2 3 5
0 1 5
1
Sample Output 2
4
{ 1 , 3 , 5 , 7 , 9 }
↓ 1 2 3 ... 2項目から3項目までの区間の値をそれぞれ1増やす
{ 1 , 4 , 6 , 7 , 9 }
↓ 2 3 5 ... 3項目から5項目までの区間の値をそれぞれ半分にする（小数点以下切り捨てる）
{ 1 , 4 , 3 , 3 , 4 }
↓ 0 1 5 ... 1項目から5項目までの区間の値の順序を反転する
{ 4 , 3 , 3 , 4 , 1 }
よって1項目の値は4である。 | [
{
"submission_id": "aoj_1579_5995535",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define int long long\ntypedef long long ll;\nusing namespace std;\n#define inf 0x3f3f3f3f\nconst int N = 2E5+1000;\nint n;\nint a,d;\nint m;\nint k;\nint x[N],y[N],z[N];\n//一切从简单的地方出发\nint sp[N],p = 0;\n... |
aoj_1582_cpp | Circles and Ray
Problem
2次元平面上にそれぞれ互いに共通部分をもたない
N
個の円が与えられる。
また、円にはそれぞれ1から
N
までの番号が割り振られている。
あなたは、端点が1番目の円の円周上にあるような半直線を任意の数だけ設置することができる。
どの円も1本以上の半直線との共通部分を持っているようにするためには、最低何本の半直線を設置しなければならないかを求めなさい。
Input
入力は以下の形式で与えられる。
N
x
1
y
1
r
1
x
2
y
2
r
2
...
x
N
y
N
r
N
1行目に、1つの整数
N
が与えられる。
2行目からの
N
行のうち
i
行目には
i
番目の円のx座標、y座標、半径を表す3つの整数
x
i
, y
i
, r
i
が空白区切りで与えられる。
Constraints
2 ≤
N
≤ 16
-100 ≤
x
i
≤ 100 (1 ≤
i
≤
N
)
-100 ≤
y
i
≤ 100 (1 ≤
i
≤
N
)
1 ≤
r
i
≤ 100 (1 ≤
i
≤
N
)
Output
どの円も1本以上の半直線との共通部分を持っているようにするためには最低何本の半直線を設置しなければならないかを出力せよ。
Sample Input 1
3
0 0 2
3 3 1
6 1 1
Sample Output 1
1
Sample Input 2
4
1 2 3
12 2 2
7 6 2
1 9 3
Sample Output 2
2
Sample Input 3
5
0 0 5
0 10 1
10 0 1
-10 0 1
0 -10 1
Sample Output 3
4 | [
{
"submission_id": "aoj_1582_10240155",
"code_snippet": "// AOJ #1582 Circles and Ray\n// 2025.2.23\n\n#include <bits/stdc++.h>\nusing namespace std;\n\nconst double EPS = 1e-9;\nconst double PI = acos(-1.0);\n\nstruct Circle { int x, y, r; };\n\nstruct RayCandidate {\n double px, py;\n double dx, dy;... |
aoj_1580_cpp | Barter
Problem
ナナツ君は、うまか棒を
x
本、ふがしを
y
本持っている。
n
人のお菓子交換人がいる。
それぞれの交換人
i
は、
ナナツ君のうまか棒
a
i
本と交換人のふがし
b
i
本
ナナツ君のふがし
c
i
本と交換人のブタメソ
d
i
個
のどちらか1つの方法で1回だけ交換してくれる。
この制約の下で、最終的に所持しているブタメソの個数を最大化せよ。
Input
入力は以下の形式で与えられる。
n
x
y
a
1
b
1
c
1
d
1
a
2
b
2
c
2
d
2
...
a
n
b
n
c
n
d
n
1行目に整数
n
が与えられる。
2行目に整数
x
,
y
が空白区切りで与えられる。
3行目から
n
+2行目に整数
a
i
,
b
i
,
c
i
,
d
i
が空白区切りで与えられる。
Constraints
1 ≤
n
≤ 100
0 ≤
x
,
y
≤ 300
1 ≤
a
i
,
b
i
,
c
i
,
d
i
≤ 300
\(\sum_{i=1}^na_i\) ≤ 300, \(\sum_{i=1}^nb_i\) ≤ 300, \(\sum_{i=1}^nc_i\) ≤ 300, \(\sum_{i=1}^nd_i\) ≤ 300
Output
最終的にナナツ君が所持しているブタメソの個数の最大値を1行に出力する
Sample Input 1
3
3 3
3 2 4 1
5 1 2 1
3 1 3 2
Sample Output 1
3
Sample Input 2
3
3 4
3 1 3 1
3 1 4 1
3 1 2 1
Sample Output 2
2
Sample Input 3
4
5 0
5 1 1 1
2 1 2 1
4 1 1 1
3 1 3 1
Sample Output 3
2
Sample Input 4
4
0 0
1 10 1 10
2 5 2 5
3 25 5 6
1 15 2 20
Sample Output 4
0 | [
{
"submission_id": "aoj_1580_5998864",
"code_snippet": "#include <bits/stdc++.h>\n#define pt(x) cout << x << endl;\n#define Mid ((l + r) / 2)\n#define lson (rt << 1)\n#define rson (rt << 1 | 1)\nusing namespace std;\nconst int N = 609;\nint t[2][N * 2][N * 2], n, x, y;\nint ans = 0;\nsigned main()\n{\n\tmem... |
aoj_1581_cpp | Reflection Warp Machine
Problem
とある宇宙では、2次元の格子点上に
n
個の星が存在し、宇宙人達はReflection Warp Machineを使い、星間を移動している。
この装置は、任意の位置、角度で直線を引くことができる。
この直線を対称軸として、現在いる座標から線対称の座標に移動することができる。
ただし、星が存在しない座標に移動することはできない。
一度引いた直線は何度でも利用できる。
現在、(
x
0
,
y
0
)の星にいるある宇宙人はすべての星を訪れたいと考えている。
星は好きな順番に訪れることができる。
すべての星を訪れるのに最小で何本の直線を引く必要があるか求めよ。
Input
n
x
0
y
0
...
x
n−1
y
n−1
入力は全て整数で与えられる。
1行目に
n
が与えられる。
2行目以降
n
行に
i
番目の星の座標(
x
i
,
y
i
)が空白区切りで与えられる。
Constraints
2 ≤
n
≤ 8
−100 ≤
x
i
,
y
i
≤ 100
(
x
i
,
y
i
) ≠ (
x
j
,
y
j
) (
i
≠
j
)
Output
すべての星を訪れるために必要な最小の直線の数を1行に出力せよ。
Sample Input 1
3
0 0
0 1
1 0
Sample Output 1
2
Sample Input 2
4
0 0
0 1
0 2
0 3
Sample Output 2
2 | [
{
"submission_id": "aoj_1581_3806524",
"code_snippet": "/* -*- coding: utf-8 -*-\n *\n * 1581.cc: Reflection Warp Machine\n */\n\n#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\n#include<iostream>\n#include<string>\n#include<vector>\n#include<map>\n#include<set>\n#include<stack>\n#... |
aoj_1589_cpp | Problem C: Unhappy Class
Problem
山之御船学園の1年G組は、不幸を背負った女子生徒たちが集まるクラスである。 彼女たちは、幸福になることを目標に、日々様々な試練に立ち向かう。
彼女たちのクラスでは、幸福になるための試練の一環として、幸福実技科目を受講することができる。
月曜から金曜のそれぞれ1限から
N
限までに授業科目の枠があり、
M
個の受講可能な科目がある。
科目
i
は、曜日
d
i
(
d
i
= 0, 1, 2, 3, 4がそれぞれ、月曜、火曜、水曜、木曜、金曜に対応する)の
a
i
限目から始まり、連続する
k
i
コマで行われ、それを受講したときに得られる幸福度は
t
i
である。
各生徒は、最大
L
個の科目を互いに重ならないように自由に選ぶことができる。どのように科目を選べば、最も高い幸福度を得られるだろうか。与えられた科目の情報から、得られる幸福度の最大値を求めてほしい。
Input
入力は以下の形式で与えられる。
N
M
L
d
1
a
1
k
1
t
1
d
2
a
2
k
2
t
2
...
d
M
a
M
k
M
t
M
1行目に3つの整数
N
,
M
,
L
が空白区切りで与えられる。
2行目から
M
+1行目に4つの整数
d
i
,
a
i
,
k
i
,
t
i
が空白区切りで与えられる。
Constraints
2 ≤
N
≤ 8
0 ≤
M
≤ 300
0 ≤
L
≤ min(
N
×5,
M
)
0 ≤
d
i
≤ 4
1 ≤
a
i
≤
N
1 ≤
k
i
a
i
+
k
i
- 1 ≤
N
1 ≤
t
i
≤ 100
Output
幸福度の和の最大値を1行に出力せよ。
Sample Input 1
3 7 3
0 1 1 1
0 1 1 2
1 1 3 4
1 1 1 1
1 2 1 2
2 1 1 3
2 2 2 1
Sample Output 1
9
Sample Input 2
5 10 5
0 1 1 2
0 2 1 2
0 1 2 3
1 2 1 2
1 4 2 3
2 1 1 1
2 1 1 2
3 3 2 3
4 1 1 2
4 2 1 2
Sample Output 2
13 | [
{
"submission_id": "aoj_1589_3865197",
"code_snippet": "#include <iostream>\n#include <vector>\n#include <array>\n#include <string>\n#include <stack>\n#include <queue>\n#include <deque>\n#include <map>\n#include <set>\n#include <tuple>\n#include <bitset>\n#include <memory>\n#include <cmath>\n#include <algor... |
aoj_1588_cpp | Problem B: Potatoes
Problem
がっちょ君は
N
面の畑と
M
個の芋を所有している。各畑にはそれぞれ1から
N
までの番号が付けられている。がっちょ君は畑に芋を植え収穫することで、芋の数を増やしたいと考えている。
がっちょ君は一人暮らしであり、1人では
K
面までの畑しか管理することができない。また、各畑の土の状態や面積は様々で、芋の収穫数や植えることのできる芋の数も様々である。芋を畑
i
に植えた場合、1年後には畑
i
に植えた芋1つにつき
a
i
個の芋を収穫することができる。ただし、畑
i
には最大でも
b
i
個の芋しか植えることができない。
がっちょ君が
K
面以内の畑に
M
個以内の芋を植えた時、1年後に所有することができる芋の数の最大値を求めてほしい。
Input
入力は以下の形式で与えられる。
N
M
K
a
1
a
2
...
a
N
b
1
b
2
...
b
N
1行目に3個の整数
N
,
M
,
K
が空白区切りで与えられる。
2行目に
N
個の整数
a
i
が空白区切りで与えられる。
3行目に
N
個の整数
b
i
が空白区切りで与えられる。
Constraints
1 ≤
N
≤ 15
1 ≤
M
≤ 10
4
1 ≤
K
≤ min(
N
,3)
1 ≤
a
i
≤ 10
3
1 ≤
b
i
≤ 10
4
Output
芋の数の最大値を1行で出力せよ。
Sample Input 1
5 100 3
2 3 4 5 6
50 40 20 10 5
Sample Output 1
280
畑1に40個、畑2に40個、畑3に20個植えることで収穫後に280個の芋を所有することができる。
Sample Input 2
5 100 3
2 3 4 5 100
50 40 20 10 1
Sample Output 2
339
畑2に40個、畑3に20個、畑5に1個植えることで300個の芋を収穫することができ、植えなかった芋と合わせて答えは339になる。 | [
{
"submission_id": "aoj_1588_3807608",
"code_snippet": "/* -*- coding: utf-8 -*-\n *\n * 1588.cc: Potatoes\n */\n\n#include<cstdio>\n#include<cstdlib>\n#include<cstring>\n#include<cmath>\n#include<iostream>\n#include<string>\n#include<vector>\n#include<map>\n#include<set>\n#include<stack>\n#include<list>\n... |
aoj_1593_cpp | Problem G: Star
Problem
半径1の円に内接する正
N
/
K
角形の面積を求めよ。
ただし、正
N
/
K
角形を
「円周上に等間隔に
N
個の点を取り、
K
-1個おきにそれぞれの点を結んだ一番外側の図形」
と定義する。
例えば、5/2角形は次のように描くことができる。
まず、半径1の円周上に等間隔に5つの点を取る。
次に、それぞれの点を2-1=1つおきに結ぶ。
一番外側の図形が正5/2角形になる。
Input
入力は以下の形式で与えられる。
N
K
2つの整数
N
,
K
が1行に与えられる。
Constraints
入力は以下の制約を満たす。
5 ≤
N
≤ 10
6
1 <
K
<
N
/2
N
,
K
は互いに素である整数
Output
半径1の円に内接する正
N
/
K
角形の面積を1行に出力せよ。10
-5
以下の誤差が許容される。
Sample Input 1
5 2
Sample Output 1
1.12256994
正5/2角形は上記の図形である。
Sample Input 2
20 3
Sample Output 2
2.93114293
正20/3角形は下のような図形である。
Sample Input 3
7 3
Sample Output 3
1.08395920
Sample Input 4
100000 3
Sample Output 4
3.14159265 | [
{
"submission_id": "aoj_1593_10848492",
"code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\nconst int INF = 1e9;\nconst ll LINF = 1e18;\ntemplate<class S,class T> ostream& operator << (ostream& out,const pair<S,T>&... |
aoj_1584_cpp | Sum of Sequences
Problem
n
個の要素を持つ数列
A
、
m
個の要素を持つ数列
B
、
それぞれが整数
c
からなる
q
個のクエリが与えられる。
各クエリについて、
数列
A
の[
l
a
,
r
a
]を全て足した数と数列
B
の[
l
b
,
r
b
]を全て足した数の差の絶対値が
c
になる
l
a
,
r
a
,
l
b
,
r
b
(0 ≤
l
a
≤
r
a
≤
n
−1, 0 ≤
l
b
≤
r
b
≤
m
−1, 配列の番号は0番から始まる) の組み合わせの数を求めよ。
Input
n
m
q
a
0
a
1
...
a
n−1
b
0
b
1
...
b
m−1
c
0
c
1
...
c
q−1
入力は全て整数で与えられる。
1行目に数列の要素数
n
と
m
、クエリ数
q
が与えられる。
2行目に数列
A
の要素、3行目に数列
B
の要素が空白区切りで与えられる。
4行目から
q
行に各クエリの値
c
i
が与えられる。
Constraints
1 ≤
n
,
m
≤ 4×10
4
1 ≤
q
≤ 10
5
1 ≤
a
i
,
b
i
≤ 5
0 ≤
c
i
≤ 2×10
5
Output
出力は
q
行からなる。各クエリの組み合わせの数を順番に一行に出力せよ。
Sample Input 1
3 3 1
1 2 3
3 1 2
3
Sample Output 1
6
Sample Input 2
5 4 2
1 2 3 4 5
2 2 2 2
11
12
Sample Output 2
3
4 | [
{
"submission_id": "aoj_1584_5312473",
"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_1585_cpp | String in String
Problem
文字列
S
と
Q
個のクエリが与えられる。
i
番目のクエリ(0 ≤
i
≤
Q
-1)には閉区間[
l
i
,
r
i
]と文字列
M
i
が与えられる。
S
の
l
i
文字目から
r
i
文字目までの部分文字列の中に文字列
M
i
はいくつ存在するか出力せよ。
Input
入力は以下の形式で与えられる。
S
Q
l
0
r
0
M
0
l
1
r
1
M
1
.
.
.
l
Q−1
r
Q−1
M
Q−1
1行目に文字列
S
とクエリの数
Q
が空白区切りで与えられる。
続く
Q
行に整数
l
i
,
r
i
,
M
i
が空白区切りで与えられる。
Constraints
1 ≤|
S
| ≤ 100000
1 ≤
Q
≤ 100000
1 ≤ |
M
i
| ≤ 100000 (0 ≤
i
≤
Q
-1)
0 ≤
l
i
≤
r
i
< |
S
| (0 ≤
i
≤
Q
-1)
文字はすべて英小文字である
文字列
M
の合計文字数は2000000を越えない
Output
出力は
Q
行からなる。各クエリに対する答えを順番に1行に出力せよ。
Sample Input 1
rupcrupc 5
0 3 rupc
0 7 rupc
2 7 ru
2 7 pc
1 5 u
Sample Output 1
1
2
1
2
2
Sample Input 2
abatagaadbura 8
0 6 a
6 12 a
0 6 aa
0 3 a
3 5 a
5 9 a
1 8 b
1 12 b
Sample Output 2
4
3
0
2
1
2
1
2
Sample Input 3
aaaaaaaaaa 5
0 9 aaa
0 9 aa
5 9 aaaa
2 8 aa
1 2 a
Sample Output 3
8
9
2
6
2 | [
{
"submission_id": "aoj_1585_10072703",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n\nstruct Node {\n int next[26];\n int fail;\n vector<int> out;\n Node() : fail(0) {\n for(int i=0;i<26;i++) next[i]=-1;\n }\n};\n\nint main(){\n ios::sync_with_stdio(false);\n ... |
aoj_1597_cpp | Problem K: Escape of Lappin the Phantom Thief
Problem
怪盗ラッパンは宝石を盗みにやってきた。簡単に宝石を手にすることができたが、宝石にはセンサーが仕込まれており、警備ロボットに囲まれてしまった。
警備ロボットは宝石に向かって移動するように仕組まれている。センサーは簡単に外せそうになかったので、宝石を置いて逃走することにした。宝石をできるだけ警備ロボットから遠くに置いて、逃げるための時間稼ぎをすることにした。
敷地は
n
×
m
のマスからなる長方形の形をしていて、障害物はない。
k
体の警備ロボットは、それぞれマス(
x
i
,
y
i
)(0 ≤
x
i
≤
n
−1, 0 ≤
y
i
≤
m
−1)に配置されており、上下左右のマスに単位時間で移動できる。
警備ロボットは宝石があるマスに最短経路で移動する。
敷地内に自由に宝石を置けるとき、1台以上の警備ロボットが宝石のあるマスに到達するまでにかかる移動時間の最大値を求めよ。
Input
n
m
k
x
1
y
1
x
2
y
2
...
x
k
y
k
入力はすべて整数で与えられる。
1行目に
n
,
m
,
k
が空白区切りで与えられる。
2行目以降
k
行に警備ロボットのいるマスの座標(
x
i
,
y
i
)が空白区切りで与えられる。
Constraints
1 ≤
n
,
m
≤ 5 × 10
4
1 ≤
k
≤ min(10
5
,
n
×
m
)
0 ≤
x
i
≤
n
−1
0 ≤
y
i
≤
m
−1
与えられる座標はすべて異なる
Output
警備ロボットが到達するまでに、最も時間がかかる場所への移動時間を1行に出力せよ。
Sample Input 1
20 10 1
0 0
Sample Output 1
28
Sample Input 2
20 10 2
0 0
17 5
Sample Output 2
15
Sample Input 3
20 10 3
0 0
17 5
6 9
Sample Output 3
11 | [
{
"submission_id": "aoj_1597_10240229",
"code_snippet": "// AOJ #1597 Escape of Lappin the Phantom Thief\n// 2025.2.23\n\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nstruct Robot { int x, y, u, v; };\n\nstruct Event { int v, L, R, delta; };\n\nstruct SegTree {\n int n;\n v... |
aoj_1594_cpp | Problem H: Hogemon Get
Problem
がっちょ君は人気のゲームHogemon Getに熱中している。がっちょ君が住んでいる会津国はそれぞれ1から
N
の番号がついている
N
個の町からなる。また、会津国には
M
本の道があり、すべての道は異なる2つの町を結んでいる。がっちょ君は道を双方向に移動することができるが、道以外を通って、ある町から別の町に行くことはできない。
Hogemon Getでは、町
i
でボールを
d
i
個入手することができる。ただし、ある町で再びボールを入手するためには、最後にその町でボールを入手してから15分以上経過している必要がある。なお、がっちょ君は町1、町
N
を含むすべての町を何度でも訪れることができる。
がっちょ君は最初、町1にいて、町
N
に
R
分以内で移動しなければならない。つまり、
R
分後に町
N
にいる必要がある。がっちょ君は移動の際に、最大でいくつのボールを入手することができるだろうか。
Input
入力は以下の形式で与えられる。
N
M
R
d
1
d
2
...
d
N
a
1
b
1
c
1
a
2
b
2
c
2
...
a
M
b
M
c
M
入力はすべて整数である。
1行目に町の個数
N
,道の本数
M
,制限時間
R
が空白区切りで与えられる。
2行目に町
i
(
i
=1,2,...,
N
)に訪れることで入手することができるボールの個数
d
i
が空白区切りで与えられる。
3行目から
M
+2行目に道
j
(
j
=1,2,...,
M
)の情報
a
j
,
b
j
,
c
j
が空白区切りで与えられる。
j
番目の道は町
a
j
と町
b
j
の間を
c
j
分で移動できることを表す。
Constraints
3 ≤
N
≤ 30
N
-1 ≤
M
≤ min(
N
×(
N
-1)/2, 300)
10 ≤
R
≤ 1000
0 ≤
d
i
≤ 10
d
1
=
d
N
= 0
1 ≤
a
j
<
b
j
≤
N
5 ≤
c
j
≤ 100
町1から町
N
へは
R
分以内で移動できることが保証されている
ある2つの町の組に対して2本以上の道があることはない
Output
町1から町
N
へ
R
分以内に移動するまでに入手することができる最大のボールの個数を1行で出力せよ。
Sample Input 1
5 4 40
0 1 1 1 0
1 2 5
2 3 5
3 4 5
4 5 5
Sample Output 1
6
経過時間(分)
町の番号
ボールの数(個)
0
1
0
5
2
1
10
3
2
15
4
3
20
3
3
25
2
4
30
3
5
35
4
6
40
5
6
※経過時間20分の町3では最後に町3でボールを入手してから15分経過していないのでボールを入手することができない。
Sample Input 2
4 3 100
0 3 1 0
1 2 5
2 3 30
3 4 5
Sample Output 2
16
経過時間(分)
町の番号
ボールの数(個)
0
1
0
5
2
3
20
2
6
35
2
9
50
2
12
65
2
15
95
3
16
100
4
16
Sample Input 3
5 4 50
0 1 1 10 0
1 2 10
2 3 10
2 4 10
4 5 10
Sample Output 3
22 | [
{
"submission_id": "aoj_1594_10501828",
"code_snippet": "#include <bits/stdc++.h>\n\nusing namespace std;\n\nconst int inf = 1e9;\n\nint main() {\n\n ios_base::sync_with_stdio(0);\n cin.tie(0), cout.tie(0); \n\n int n, m, R;\n cin >> n >> m >> R;\n\n vector<int> d(n);\n for (auto& x : d... |
aoj_1595_cpp | Problem I: Traffic Tree
Problem
それぞれ1から
N
までの番号が付いた
N
個の頂点が、
N
-1本の無向辺によって繋がれたグラフが与えられる。各頂点について、その頂点からスタートしてすべての頂点を訪れるための最短のステップ数を出力せよ。
ただし、ある頂点から1本の辺をたどって別の頂点に移動することを1ステップとする。
Input
入力は以下の形式で与えられる。
N
u
1
v
1
.
.
.
u
N−1
v
N−1
1行目に、1つの整数
N
が与えられる。
続く
N
-1行のうち
i
行目には
i
番目の辺の両端の頂点番号を表す整数
u
i
,
v
i
が空白区切りで与えられる。
Constraints
2 ≤
N
≤ 10
5
1 ≤
u
i
,
v
i
≤
N
(1 ≤
i
≤
N
-1)
u
i
≠
v
i
与えられるグラフは連結である
Output
頂点1から頂点
N
について
i
行目に頂点
i
からスタートしてすべての頂点を訪れるための最短のステップ数を出力せよ。
Sample Input 1
2
1 2
Sample Output 1
1
1
Sample Input 2
6
1 2
1 3
3 4
3 5
5 6
Sample Output 2
7
6
8
7
7
6
Sample Input2の図 | [
{
"submission_id": "aoj_1595_10965798",
"code_snippet": "#include <algorithm>\n#include <iostream>\n#include <iomanip>\n#include <limits.h>\n#include <map>\n#include <math.h>\n#include <numeric>\n#include <queue>\n#include <set>\n#include <sstream>\n#include <string>\n#include <utility>\n#include <vector>\n... |
aoj_1596_cpp | Problem J: Char Swap
Problem
長さが偶数の文字列
S
が与えられる。
あなたは、文字列
S
の隣り合った2つの文字を入れ替える操作を何回でも行うことができる。
文字列
S
を回文にするためには、最小で何回の操作を行う必要があるだろうか?
回文にすることが不可能な場合は-1を出力せよ。
Input
入力は以下の形式で与えられる。
S
1行に文字列
S
が与えられる。
Constraints
2 ≤ |
S
| ≤ 4 × 10
5
文字列はすべて英小文字で構成されている
文字列の長さは偶数である
Output
文字列
S
を回文にするための最小の操作回数を1行に出力する。回文にすることが不可能な場合は代わりに-1を1行に出力をする。
Sample Input 1
acca
Sample Output 1
0
Sample Input 2
acpcacpc
Sample Output 2
3
Sample Input 3
aizu
Sample Output 3
-1 | [
{
"submission_id": "aoj_1596_10702848",
"code_snippet": "#include <bits/stdc++.h>\n#include <ext/pb_ds/assoc_container.hpp>\n#include <ext/pb_ds/tree_policy.hpp>\nusing namespace std;\nusing namespace __gnu_pbds;\n\n// Ordered Set (PBDS)\ntemplate<typename T>\nusing ordered_set = tree<T, null_type, less<T>,... |
aoj_1590_cpp | Problem D: One-Time Path
Problem
N
個の島と
M
本の橋がある。
N
個の島にはそれぞれ1から
N
までの番号が割り振られている。
M
本の橋にもそれぞれ1から
M
までの番号が割り振られている。
がっちょ君は現在(時刻0の時点で)、1番目の島にいる。
がっちょ君は
i
番目の橋を利用することにより、
a
i
番目の島から
b
i
番目の島へと単方向に移動することができる。
しかし、時刻0の時点では、すべての橋は潮が満ちていて海の中に沈んでしまっている。
i
番目の橋は、時刻
c
i
になると潮が引いて渡れるようになる。
そして、時刻
c
i
を過ぎると、すぐにまた潮が満ちて
i
番目の橋は再び沈んでしまう。
再び沈んでしまうと、またいつ潮が引いて渡れるようになるかはわからない。
そこで、がっちょ君はそうなった橋は永遠に渡れなくなると考えるようにした。
がっちょ君は、できるだけ長い間、1から
N
-1番目の島の景色を眺めていたいのだが、
N
番目の島に船を泊めてあるので、最終的には
N
番目の島に到着していなければならない。また、船の中で両親を待たせているため、がっちょ君は
N
番目の島についたらすぐに船で出発して家へと帰らなければならない。
がっちょ君が橋を渡ったり島の中を移動する時間はとても短いので、0と仮定してよい。がっちょ君が1から
N
-1番目のいずれかの島にいることのできる時間の最大値を求めよ。ただし、どのように移動してもがっちょ君が
N
番目の島へと移動できない場合は代わりに-1を出力せよ。
Input
入力は以下の形式で与えられる。
N
M
a
1
b
1
c
1
a
2
b
2
c
2
…
a
M
b
M
c
M
1行目には、2つの整数
N
,
M
が空白区切りで与えられる。
2行目から
M
+1行目のそれぞれの行
i
には、3つの整数
a
i
,
b
i
,
c
i
が空白区切りで与えられる。
Constraints
2 ≤
N
≤ 10
5
1 ≤
M
≤ 2 × 10
5
1 ≤
a
i
<
N
1 ≤
b
i
≤
N
1 ≤
c
i
≤ 10
9
a
i
≠
b
i
Output
がっちょ君が
N
番目の島へと移動できる場合は、がっちょ君が1から
N
-1番目のいずれかの島にいることのできる時間の最大値を出力する。
N
番目の島へと移動できない場合は、代わりに-1を出力する。
Sample Input 1
3 2
1 2 10
2 3 20
Sample Output 1
20
まず、1番目の島で時刻が10になるまで待ってから、2番目の島へと移動する。
次に、2番目の島で時刻が20になるまで待ってから、3番目の島へと移動する。
以上より、1から2番目のいずれかの島にいる時間は20となる。
Sample Input 2
4 4
1 2 27
1 3 37
2 3 47
3 1 57
Sample Output 2
-1
4番目の島に繋がる橋がないため、4番目の島へ移動することができない。
Sample Input 3
3 3
1 2 13
2 3 17
2 3 15
Sample Output 3
17
Sample Input 4
3 2
1 2 20
2 3 10
Sample Output 4
-1
Sample Input 5
3 2
1 2 10
2 3 10
Sample Output 5
10 | [
{
"submission_id": "aoj_1590_10853810",
"code_snippet": "#include \"bits/stdc++.h\"\nusing namespace std;\ntypedef long long ll;\ntypedef pair<int, int> pii;\ntypedef pair<ll, ll> pll;\nconst int INF = 1e9;\nconst ll LINF = 1e18;\ntemplate<class S,class T> ostream& operator << (ostream& out,const pair<S,T>&... |
aoj_1599_cpp | Problem M: Dial
Problem
ダイヤル式の南京錠がある。この南京錠には、5つのダイヤルと、決定ボタンが用意されている。
5つあるダイヤルを回転させて16進数で5ケタの整数を作り、決定ボタンを押して入力すると、入力した値とパスワードが一致していれば開く仕組みになっている。5つのダイヤルそれぞれには
0,1,2,3,4,5,6,7,8,9,a,b,c,d,e,f,0,1,2,3,4,5,6,7,8,9,a,b,c,d,e,f,0,1,2, ...
の順で文字が現れるように書かれている。
持ち主はパスワードを忘れてしまった。しかし、パスワードの5ケタのうち、1つのケタだけが偶数で残り4つは奇数であったことは覚えている。
ただし、偶数とは0,2,4,6,8,a,c,eであり、奇数とは1,3,5,7,9,b,d,fである。
またこの鍵は不良品で、以下の条件でパスワードと異なる数字を入力しても開いてしまうことが分かっている。本来、入力した整数とパスワードが5つのケタすべてについて一致していなければ鍵は開かない。しかし、パスワードの偶数となっているケタが
i
ケタ目だった場合、
i
ケタ目の一致判定を行うとき、その偶数の前後にある奇数が入力されていた場合でも
i
ケタ目は一致していると誤判定されてしまうのだ。
例えば、パスワードが"57677"の南京錠ならば、'6'の前後には'5'と'7'の奇数があるため"57677"のほかに、"57577"や"57777"を入力したときでも開いてしまう。
同様に、パスワードが"130bd"の南京錠ならば、'0'の前後には'1'と'f'の奇数があるため"130bd"のほかに、"13fbd"や"131bd"を入力したときでも開いてしまう。
今、パスワードの候補が
N
個あり、それらのうちどれか1つが正解のパスワードであることが分かっている。しかたがないので持ち主は、鍵が開くまで何度も整数を入力して試し続けることにした。持ち主はできるだけ決定ボタンを押す回数を少なくしたい。
持ち主が最適な戦略をとったとき、最大で何回決定ボタンを押さなければならないだろうか?
その回数を出力せよ。
また、実際に最大となるときに入力する整数の集合を昇順に出力せよ。
答えが一意に定まらない場合は、辞書順で最小となるものを出力せよ。
Input
入力は以下の形式で与えられる。
N
password
1
password
2
...
password
N
1行目に
N
が与えられる。
2行目から
N
+1行目の
i
行目には、パスワードの候補を表す5ケタの16進数を表す文字列
password
i
が与えられる。
Constraints
1 ≤
N
≤ 6000
password
i
≠
password
j
(
i
<
j
)
文字列は、0から9の数字または英小文字aからfの5文字で構成され、そのうち1文字は偶数であり、他の4文字は奇数である
Output
鍵が開くまでに最適な戦略をとったときの決定ボタンを押す回数の最大値を1行に出力せよ。
続いて、最大となるときに入力する整数の集合を昇順に出力せよ。
もし、答えが一意に定まらない場合は、辞書順で最小となるものを出力せよ。
Sample Input 1
1
0111f
Sample Output 1
1
0111f
Sample Input 2
3
57567
57587
0d351
Sample Output 2
2
0d351
57577
Sample Input 3
6
1811b
1a11b
f3b1e
f3b1c
b0df3
bedf3
Sample Output 3
3
1911b
bfdf3
f3b1d | [
{
"submission_id": "aoj_1599_3663954",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nusing Int = long long;\n//BEGIN CUT HERE\ntemplate<typename T,bool directed>\nstruct Dinic{\n struct edge {\n int to;\n T cap;\n int rev;\n edge(){}\n edge(int to,T cap,int rev):to(to),cap(... |
aoj_1598_cpp | Problem L: RedBlue
Story
天空都市AIZUのUZIA高校では、競技プログラミングの部活動がとても盛んである。
この部活には、
n
人のRed Coderと
n
人のBlue Coderが所属している。
ある日の部活の時間に、Red CoderとBlue Coderでペアを組み、この部活から
n
組、KCPというコンテストに参加することとなった。この高校では、ペアを組む学生同士は握手するという習わしがあるので、部員たちは今すぐ自分のパートナーを見つけることにした。
部員たちは全速力で走るため、まっすぐにしか進めない。また、部員たちは、それぞれの部員が移動する距離の総和をできるだけ小さくしたいと思っている。
なお、部室には2つの円形のテーブルが置いてある。
Problem
二次元平面上に2つの円、
n
個の赤色の点、
n
個の青色の点がある。
2つの円の中心座標はそれぞれ(
x
1
,
y
1
), (
x
2
,
y
2
)であり、半径はそれぞれ
r
1
,
r
2
である。
赤い点
i
は、座標(
rx
i
,
ry
i
)にあり、青い点
j
は、座標(
bx
j
,
by
j
)にある。
あなたは、以下の操作を
n
回繰り返す必要がある。
まだ選ばれていない点の中から、赤色の点と青色の点を１つずつ選んで、2点の共通の目的地を設定し、その目的地に向かって2点をそれぞれまっすぐ移動させる。
目的地は二次元平面上であれば、どこに設定しても構わない。ただし、選んだ2点は移動の際に円の内部を通過することはできないので、そのような移動が発生する目的地を設定することはできない。
n
回の操作をしたときの移動距離の総和を最小化せよ。
n
回の操作を行えない場合は、代わりに"Impossible" (""は除く) と出力せよ。
Input
入力は以下の形式で与えられる。
n
x
1
y
1
r
1
x
2
y
2
r
2
rx
1
ry
1
rx
2
ry
2
...
rx
n
ry
n
bx
1
by
1
bx
2
by
2
...
bx
n
by
n
入力は全て整数で与えられる。
1行目に
n
が与えられる。
2行目に
x
1
,
y
1
,
r
1
が空白区切りで与えられる。
3行目に
x
2
,
y
2
,
r
2
が空白区切りで与えられる。
4から3+
n
行に赤い点の座標(
rx
i
,
ry
i
)が空白区切りで与えられる。
4+
n
から3+2×
n
行に青い点の座標(
bx
j
,
by
j
)が空白区切りで与えられる。
Constraints
入力は以下の条件を満たす。
1 ≤
n
≤ 100
-1000 ≤
x
i
,
y
i
≤ 1000
1 ≤
r
i
≤ 50
-1000 ≤
rx
i
,
ry
i
,
bx
i
,
by
i
≤ 1000
同じ座標に複数の点が存在していることはない
任意の円の半径を絶対値10
-9
以内で変化させても、高々絶対値10
-3
しか変化しない
任意の円の半径を絶対値10
-9
以内で変化させても、"Impossible"なケースは"Impossible"のままである
解は10000を超えない
どの点も、円から10
-3
以上離れていて、点が円周上に存在したり、点が円に内包されることはない
2つの円は共通面積を持たず、10
-3
以上離れていることが保証される
Output
n
回の操作をしたときの移動距離の総和の最小値を1行に出力せよ。なお、出力はジャッジ解の出力との絶対誤差が10
-2
以内であれば許容される。
n
回の操作を行えない場合は、代わりに"Impossible" (""は除く) と出力せよ。
Sample Input 1
2
3 3 2
8 3 2
0 3
3 7
8 0
8 7
Sample Output 1
13.8190642862
Sample Input 2
2
3 3 2
8 3 2
3 0
3 7
8 0
8 7
Sample Output 2
10.0000000000
Sample Input 3
2
3 3 2
8 3 2
0 0
0 5
11 0
11 5
Sample Output 3
22.0000000000
Sample Input 4
1
10 10 10
31 10 10
15 19
26 1
Sample Output 4
Impossible
点同士をつなぐことはできません。 | [
{
"submission_id": "aoj_1598_8305781",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef long long LL;\ntypedef long double LD;\nconst int N = 205;\nconst int M = 100005;\nconst LD INF = 1e18;\nconst LD eps = 1e-10;\n\ninline int sgn(LD x) {\n return x > eps? 1 : x < -eps? -1 : 0;\... |
aoj_1604_cpp | Deadlock Detection
In concurrent processing environments, a deadlock is an undesirable
situation where two or more threads are mutually waiting for others to
finish using some resources and cannot proceed further.
Your task is to detect whether there is any possibility of deadlocks
when multiple threads try to execute a given instruction sequence concurrently.
The instruction sequence consists of characters '
u
' or digits from
'
0
' to '
9
', and each of them represents one instruction.
10 threads are trying to execute the same single instruction sequence.
Each thread starts its execution from the beginning of the sequence and
continues in the given order, until all the instructions are
executed.
There are 10 shared resources called
locks
from
L
0
to
L
9
.
A digit
k
is the instruction for
acquiring
the lock
L
k
.
After one of the threads acquires a lock
L
k
,
it is kept by the thread until it is
released
by the instruction '
u
'.
While a lock is kept, none of the threads, including one already acquired it,
cannot newly acquire the same lock
L
k
.
Precisely speaking, the following steps are repeated until all threads
finish.
One thread that has not finished yet is chosen arbitrarily.
The chosen thread tries to execute the next instruction that is not executed yet.
If the next instruction is a digit
k
and
the lock
L
k
is not kept by any thread,
the thread executes the instruction
k
and acquires
L
k
.
If the next instruction is a digit
k
and
the lock
L
k
is already kept by some thread,
the instruction
k
is not executed.
If the next instruction is '
u
',
the instruction is executed and
all
the locks currently kept by the thread
are released.
After executing several steps, sometimes, it falls into the situation
that the next instructions
of all unfinished threads are for acquiring already kept locks.
Once such a situation happens, no instruction will ever be executed no
matter which thread is chosen. This situation is called a
deadlock
.
There are instruction sequences for which threads can never reach a
deadlock regardless of the execution order.
Such instruction sequences are called
safe
.
Otherwise, in other words, if there exists one or more execution orders
that lead to a deadlock, the execution sequence is called
unsafe
.
Your task is to write a program that tells whether the given instruction sequence is safe or unsafe.
Input
The input consists of at most 50 datasets, each in the following format.
n
s
n
is the length of the instruction sequence and
s
is a string representing the sequence.
n
is a positive integer not exceeding 10,000.
Each character of
s
is either a digit ('
0
' to '
9
') or '
u
',
and
s
always ends with '
u
'.
The end of the input is indicated by a line with a zero.
Output
For each dataset, if the given instruction sequence is safe, then print
"SAFE"
in a line.
If it is unsafe, then print
"UNSAFE"
in a line.
Sample Input
11
01u12u0123u
6
01u10u
8
201u210u
9
01u12u20u
3
77u
12
9u8u845u954u
0
Output for the Sampl
...(truncated) | [
{
"submission_id": "aoj_1604_10851564",
"code_snippet": "#include <iostream>\n#include <string>\n#include <cstring>\nusing namespace std;\n#define rep(i,n) for(int i = 0; i < n; i++)\nbool dp[1024][10];\nvoid solve(int n){\n string s;\n cin >> s;\n int state = 0;\n memset(dp,0,sizeof(dp));\n ... |
aoj_1607_cpp | Development of Small Flying Robots
You are developing small flying robots in your laboratory.
The laboratory is a box-shaped building with
K
levels, each numbered 1 through
K
from bottom to top.
The floors of all levels are square-shaped with their edges precisely aligned east-west and north-south.
Each floor is divided into
R
×
R
cells.
We denote the cell on the
z
-th level in the
x
-th column from the west and the
y
-th row from the south as (
x
,
y
,
z
).
(Here,
x
and
y
are one-based.)
For each
x
,
y
, and
z
(
z
> 1),
the cell (
x
,
y
,
z
) is located immediately above the cell (
x
,
y
,
z
− 1).
There are
N
robots flying in the laboratory,
each numbered from 1 through
N
.
Initially, the
i
-th robot is located at the cell (
x
i
,
y
i
,
z
i
).
By your effort so far,
you successfully implemented the feature to move each flying robot to any place that you planned.
As the next step, you want to implement a new feature that gathers all
the robots in some single cell with the lowest energy consumption,
based on their current locations and the surrounding environment.
Floors of the level two and above have several holes.
Holes are rectangular and their edges align with edges of the
cells on the floors.
There are
M
holes in the laboratory building, each numbered 1 through
M
.
The
j
-th hole can be described by five integers
u
1
j
,
v
1
j
,
u
2
j
,
v
2
j
, and
w
j
.
The
j
-th hole extends over the cells (
x
,
y
,
w
j
)
where
u
1
j
≤
x
≤
u
2
j
and
v
1
j
≤
y
≤
v
2
j
.
Possible movements of robots and energy consumption involved are as follows.
You can move a robot from one cell to an adjacent cell, toward one of north, south, east, or west.
The robot consumes its energy by 1 for this move.
If there is a hole to go through immediately above,
you can move the robot upward by a single level.
The robot consumes its energy by 100 for this move.
The robots never fall down even if there is a hole below.
Note that you can move two or more robots to the same cell.
Now, you want to gather all the flying robots at a single cell in the
K
-th level where there is no hole on the floor, with the least energy consumption.
Compute and output the minimum total energy required by the robots.
Input
The input consists of at most 32 datasets, each in the following format.
Every value in the input is an integer.
N
M
K
R
x
1
y
1
z
1
...
x
N
y
N
z
N
u
11
v
11
u
21
v
21
w
1
...
u
1
M
v
1
M
u
2
M
v
2
M
w
M
N
is the number of robots in the laboratory (1 ≤
N
≤ 100).
M
is the number of holes (1 ≤
M
≤ 50),
K
is the number of levels (2 ≤
K
≤ 10),
and
R
is the number of cells in one row and also one column on a single floor (3 ≤
R
≤ 1,000,000).
For each
i
,
integers
x
i
,
y
i
, and
z
i
represent the cell that the
i
-th robot initially located at
(1 ≤
x
i
≤
R
,
1 ≤
y
i
≤
R
,
1 ≤
z
i
≤
K
).
Further,
for each
j
,
integers
u
1
j
,
v
1
j
,
u
2
j
,
v
2
j
, and
w
j
describe the position and the extent of the
j
-th hole
(1 ≤
u
1
j
≤
u
2
j
≤
R
,
1 ≤
v
1
j
≤
v
2
j
≤
R
,
2 ≤
w
j
≤
K
).
Th
...(truncated) | [
{
"submission_id": "aoj_1607_9405300",
"code_snippet": "#line 2 \"cp-library/src/cp-template.hpp\"\n#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing uint = unsigned int;\nusing ull = unsigned long long;\nusing i32 = int;\nusing u32 = unsigned int;\nusing... |
aoj_1606_cpp | Complex Paper Folding
Dr. G, an authority in paper folding and one of the directors of
Intercultural Consortium on Paper Crafts,
believes complexity gives figures beauty.
As one of his assistants, your job is to find the way to fold a paper
to obtain the most complex figure.
Dr. G defines the complexity of a figure by the number of vertices.
With the same number of vertices, one with longer perimeter is more
complex.
To simplify the problem, we consider papers with convex polygon in
their shapes and folding them only once.
Each paper should be folded so that one of its vertices exactly lies
on top of another vertex.
Write a program that, for each given convex polygon, outputs the
perimeter of the most complex polygon obtained by folding it once.
Figure 1 (left) illustrates the polygon given in the first dataset of
Sample Input. This happens to be a rectangle.
Folding this rectangle can yield three different polygons illustrated in the Figures 1-a to c by solid
lines.
For this dataset, you should answer the perimeter of the pentagon
shown in Figure 1-a. Though the rectangle in Figure 1-b has longer
perimeter, the number of vertices takes priority.
(a)
(b)
(c)
Figure 1: The case of the first sample input
Figure 2 (left) illustrates the polygon given in the second
dataset of Sample Input, which is a triangle. Whichever pair of its vertices are
chosen, quadrangles are obtained as shown in Figures 2-a to c. Among
these, you should answer the longest perimeter, which is that of the
quadrangle shown in Figure 2-a.
(a)
(b)
(c)
Figure 2: The case of the second sample input
Although we start with a convex polygon, folding it may result a
concave polygon.
Figure 3 (left) illustrates the polygon given in the third dataset in Sample Input.
A concave hexagon shown in Figure 3 (right) can be obtained
by folding it, which has the largest number of vertices.
Figure 3: The case of the third sample input
Figure 4 (left) illustrates the polygon given in the fifth dataset in
Sample
Input.
Although the perimeter of the polygon in Figure 4-b is longer than that
of the polygon in Figure 4-a, because the polygon in Figure 4-b is a
quadrangle, the answer should be the perimeter of the pentagon in Figure
4-a.
(a)
(b)
Figure 4: The case of the fifth sample input
Input
The input consists of multiple datasets, each in the following format.
n
x
1
y
1
...
x
n
y
n
n
is the number of vertices of the given polygon.
n
is a positive integer satisfying 3 ≤
n
≤ 20.
(
x
i
,
y
i
) gives the coordinates of
the
i
-th vertex.
x
i
and
y
i
are integers
satisfying 0 ≤
x
i
,
y
i
< 1000.
The vertices (
x
1
,
y
1
), ..., (
x
n
,
y
n
)
are given in the counterclockwise order on the
xy
-plane with
y
axis oriented upwards.
You can assume that all the given polygons are convex.
All the possible polygons obtained by folding the given polygon
satisfy the following conditions.
Distance between any two vertices is greater than or equal to 0.00001.
For any three consecutive vertices P, Q, and R,
...(truncated) | [
{
"submission_id": "aoj_1606_10853765",
"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>\n#include <deque>\ntypedef long long ll;\ntypedef long double ld;\n//typedef double ld;\nconst ld I... |
aoj_1603_cpp | 500-yen Saving
"500-yen Saving" is one of Japanese famous methods to save money. The
method is quite simple; whenever you receive a 500-yen coin in your
change of shopping, put the coin to your 500-yen saving box.
Typically, you will find more than one million yen in your saving box
in ten years.
Some Japanese people are addicted to the 500-yen saving. They try
their best to collect 500-yen coins efficiently by using 1000-yen bills
and some coins effectively in their purchasing. For example, you will give
1320 yen (one 1000-yen bill, three 100-yen coins and two 10-yen coins)
to pay 817 yen, to receive one 500-yen coin (and three 1-yen coins)
in the change.
A friend of yours is one of these 500-yen saving addicts. He is
planning a sightseeing trip and wants to visit a number of souvenir
shops along his way. He will visit souvenir shops one by one
according to the trip plan. Every souvenir shop sells only one kind of
souvenir goods, and he has the complete list of their prices. He
wants to collect as many 500-yen coins as possible through buying
at most one souvenir from a shop. On his departure,
he will start with sufficiently many 1000-yen bills and no coins at
all. The order of shops to visit cannot be changed. As far as he can
collect the same number of 500-yen coins, he wants to cut his expenses
as much as possible.
Let's say that he is visiting shops with their souvenir prices of 800
yen, 700 yen, 1600 yen, and 600 yen, in this order. He can collect at
most two 500-yen coins spending 2900 yen, the least expenses to collect
two 500-yen coins, in this case. After skipping the first shop, the
way of spending 700-yen at the second shop is by handing over a
1000-yen bill and receiving three 100-yen coins. In the next shop,
handing over one of these 100-yen coins and two 1000-yen bills for
buying a 1600-yen souvenir will make him receive one 500-yen coin. In
almost the same way, he can obtain another 500-yen coin at the last
shop. He can also collect two 500-yen coins buying at the first shop,
but his total expenditure will be at least 3000 yen because he needs
to buy both the 1600-yen and 600-yen souvenirs in this case.
You are asked to make a program to help his collecting 500-yen coins
during the trip. Receiving souvenirs' prices listed in the order
of visiting the shops, your program is to find the maximum number of
500-yen coins that he can collect during his trip, and the minimum
expenses needed for that number of 500-yen coins.
For shopping, he can use an arbitrary number of 1-yen, 5-yen, 10-yen,
50-yen, and 100-yen coins he has, and arbitrarily many 1000-yen bills.
The shop always returns the exact change, i.e., the difference between
the amount he hands over and the price of the souvenir. The shop has
sufficient stock of coins and the change is always composed of the
smallest possible number of 1-yen, 5-yen, 10-yen, 50-yen, 100-yen, and
500-yen coins and 1000-yen bills. He may use more money than the
price of the souvenir, eve
...(truncated) | [
{
"submission_id": "aoj_1603_11044339",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\ntypedef int ll;\ntypedef unsigned long long ull;\ntypedef long double ld;\n#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)\n#define rrep(i,start,end) for (ll i = start;i >= (ll)(end);i--)\n#define rep... |
aoj_1609_cpp | Look for the Winner!
The citizens of TKB City are famous for their deep love in elections and vote counting.
Today they hold an election for the next chairperson of the electoral commission.
Now the voting has just been closed and the counting is going to start.
The TKB citizens have strong desire to know the winner as early as possible during vote counting.
The election candidate receiving the most votes shall be the next chairperson.
Suppose for instance that we have three candidates
A
,
B
, and
C
and ten votes.
Suppose also that we have already counted six of the ten votes and the vote counts of
A
,
B
, and
C
are four, one, and one, respectively.
At this moment, every candidate has a chance to receive four more votes and so everyone can still be the winner.
However, if the next vote counted is cast for
A
,
A
is ensured to be the winner since
A
already has five votes and
B
or
C
can have at most four votes at the end.
In this example, therefore, the TKB citizens can know the winner just when the seventh vote is counted.
Your mission is to write a program that receives every vote counted, one by one, identifies the winner, and determines when the winner gets ensured.
Input
The input consists of at most 1500 datasets, each consisting of two lines in the following format.
n
c
1
c
2
…
c
n
n
in the first line represents the number of votes, and is a positive integer no greater than 100.
The second line represents the
n
votes, separated by a space.
Each
c
i
(1 ≤
i
≤
n
) is a single uppercase letter,
i.e.
one of 'A' through 'Z'.
This represents the election candidate for which the
i
-th vote was cast.
Counting shall be done in the given order from
c
1
to
c
n
.
You should assume that at least two stand as candidates even when all the votes are cast for one candidate.
The end of the input is indicated by a line containing a zero.
Output
For each dataset, unless the election ends in a tie, output a single line containing an uppercase letter
c
and an integer
d
separated by a space:
c
should represent the election winner and
d
should represent after counting how many votes the winner is identified.
Otherwise, that is, if the election ends in a tie, output a single line containing `TIE'.
Sample Input
1
A
4
A A B B
5
L M N L N
6
K K K K K K
6
X X X Y Z X
10
A A A B A C A C C B
10
U U U U U V V W W W
0
Output for the Sample Input
A 1
TIE
TIE
K 4
X 5
A 7
U 8 | [
{
"submission_id": "aoj_1609_10810381",
"code_snippet": "#include <iostream>\n#include <string>\n#include <algorithm>\nusing namespace std;\n\nint N;\nchar S[100009];\n\nvoid Testcase() {\n pair<int, char> votes[26], votes2[256];\n for (int i = 0; i < 26; i++) votes[i] = make_pair(0, 'A' + i);\n\n ... |
aoj_1610_cpp | Bamboo Blossoms
The bamboos live for decades, and at the end of their lives,
they flower to make their seeds. Dr. ACM, a biologist, was fascinated
by the bamboos in blossom in his travel to Tsukuba. He liked
the flower so much that he was tempted to make a garden where
the bamboos bloom annually. Dr. ACM started research of
improving breed of the bamboos, and finally, he established
a method to develop bamboo breeds with controlled lifetimes.
With this method, he can develop bamboo breeds that flower
after arbitrarily specified years.
Let us call bamboos that flower
k
years after sowing
"
k
-year-bamboos."
k
years after being sowed,
k
-year-bamboos make
their seeds and then die,
hence their next generation flowers after another
k
years.
In this way, if he sows seeds of
k
-year-bamboos, he can
see bamboo blossoms every
k
years. For example,
assuming that he sows seeds of 15-year-bamboos,
he can see bamboo blossoms every 15 years;
15 years, 30 years, 45 years, and so on, after sowing.
Dr. ACM asked you for designing his garden. His garden is partitioned
into blocks, in each of which only a single breed of bamboo can grow.
Dr. ACM requested you to decide which breeds of bamboos
should he sow in the blocks in order to see bamboo blossoms
in at least one block for as many years as possible.
You immediately suggested to sow seeds of one-year-bamboos in all blocks.
Dr. ACM, however, said that it was difficult to develop a bamboo breed
with short lifetime, and would like a plan using only those breeds with
long lifetimes. He also said that, although he could wait for some years
until he would see the first bloom, he would like to see it in
every following year.
Then, you suggested a plan
to sow seeds of 10-year-bamboos, for example, in different blocks each year,
that is, to sow in a block this year and in another block next year, and so on,
for 10 years. Following this plan, he could see
bamboo blossoms in one block every year except for the first 10 years.
Dr. ACM objected again saying he had determined to sow in all
blocks this year.
After all, you made up your mind to make a sowing plan where the bamboos
bloom in at least one block for as many consecutive years as possible
after the first
m
years (including this year)
under the following conditions:
the plan should use only those bamboo breeds whose
lifetimes are
m
years or longer, and
Dr. ACM should sow the seeds in all the blocks only this year.
Input
The input consists of at most 50 datasets, each in the following format.
m
n
An integer
m
(2 ≤
m
≤ 100) represents the lifetime
(in years)
of the bamboos with the shortest lifetime that Dr. ACM can use for
gardening.
An integer
n
(1 ≤
n
≤ 500,000) represents the number of blocks.
The end of the input is indicated by a line containing two zeros.
Output
No matter how good your plan is, a "dull-year" would
eventually come, in which the bamboos do not flower in an
...(truncated) | [
{
"submission_id": "aoj_1610_10848308",
"code_snippet": "#include \"bits/stdc++.h\"\n\nusing namespace std;\nusing ll = long long;\nconst double pi = acos(-1);\n#define FOR(i,a,b) for (ll i=(a),__last_##i=(b);i<__last_##i;i++)\n#define RFOR(i,a,b) for (ll i=(b)-1,__last_##i=(a);i>=__last_##i;i--)\n#define R... |
aoj_1614_cpp | Warp Drive
The
warp drive
technology is reforming air travel, making the travel times drastically shorter.
Aircraft reaching above the
warp fields
built on the ground surface can be transferred to any desired destination in a twinkling.
With the current immature technology, however, building warp fields is quite expensive.
Our budget allows building only two of them.
Fortunately, the cost does not depend on the locations of the warp fields,
and we can build them anywhere on the ground surface, even at an airport.
Your task is, given locations of airports and a list of one way flights among them, find the best locations to build the two warp fields that give the minimal
average cost
.
The average cost is the root mean square of travel times of all the flights, defined as follows.
Here,
m
is the number of flights and
t
j
is the shortest possible travel time of the
j
-th flight.
Note that the value of
t
j
depends on the locations of the warp fields.
For simplicity, we approximate the surface of the ground by a flat two dimensional plane, and approximate airports, aircraft, and warp fields by points on the plane.
Different flights use different aircraft with possibly different cruising speeds.
Times required for climb, acceleration, deceleration and descent are negligible.
Further, when an aircraft reaches above a warp field, time required after that to its destination is zero.
As is explained below, the airports have integral coordinates. Note, however, that the warp fields can have non-integer coordinates.
Input
The input consists of at most 35 datasets, each in the following format.
n
m
x
1
y
1
...
x
n
y
n
a
1
b
1
v
1
...
a
m
b
m
v
m
n
is the number of airports, and
m
is the number of flights (2 ≤
n
≤ 20, 2 ≤
m
≤ 40).
For each
i
,
x
i
and
y
i
are the coordinates of the
i
-th airport.
x
i
and
y
i
are integers with absolute values at most 1000.
For each
j
,
a
j
and
b
j
are integers between 1 and
n
inclusive, and are the indices of the departure and arrival airports for the
j
-th flight, respectively.
v
j
is the cruising speed for the
j
-th flight, that is, the distance that the aircraft of the flight moves in one time unit.
v
j
is a decimal fraction with two digits after the decimal point (1 ≤
v
j
≤ 10).
The following are guaranteed.
Two different airports have different coordinates.
The departure and arrival airports of any of the flights are different.
Two different flights have different departure airport and/or arrival airport.
The end of the input is indicated by a line containing two zeros.
Output
For each dataset, output the average cost when you place the two warp fields optimally.
The output should not contain an absolute error greater than 10
-6
.
Sample Input
3 4
100 4
100 0
0 0
1 2 1.00
2 1 1.00
3 1 9.99
3 2 9.99
7 6
0 0
1 0
2 0
0 10
1 10
2 10
20 5
1 7 1.00
2 7 1.00
3 7 1.00
4 7 1.00
5 7 1.00
6 7 1.00
4 4
-1 -1
1 -1
-1 1
1 1
1 4 1.10
4 2 2.10
2 3 3.10
3 1 4.10
8 12
-91 0
-62 0
-18 0
2 0
23 0
55 0
63 0
80 0
2 7 3.96
3 2 2.25
2 4 5.48
8 7
...(truncated) | [
{
"submission_id": "aoj_1614_10579461",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\nusing ld = long double;\nusing ull = unsigned long long;\n\n#define rep(i,n) for(ll i=0;i<n;++i)\n#define all(a) (a).begin(),(a).end()\nll intpow(ll a, ll b){ ll ans = 1; while(b){... |
aoj_1612_cpp | 3D Printing
We are designing an installation art piece consisting of
a number of cubes with 3D printing technology for submitting one to
Installation art Contest with Printed Cubes (ICPC).
At this time, we are trying to model a piece consisting of exactly
k
cubes
of the same size facing the same direction.
First, using a CAD system,
we prepare
n
(
n
≥
k
) positions as candidates
in the 3D space where cubes can be placed.
When cubes would be placed at all the candidate positions,
the following three conditions are satisfied.
Each cube may overlap zero, one or two other cubes, but not three or more.
When a cube overlap two other cubes, those two cubes do not overlap.
Two non-overlapping cubes do not touch at their surfaces, edges or corners.
Second, choosing appropriate
k
different positions from
n
candidates
and placing cubes there,
we obtain a connected polyhedron as a union of the
k
cubes.
When we use a 3D printer,
we usually print only the thin surface of a 3D object.
In order to save the amount of filament material for the 3D printer,
we want to find the polyhedron with the minimal surface area.
Your job is to find the polyhedron with the minimal surface area
consisting of
k
connected
cubes placed at
k
selected positions among
n
given ones.
Figure E1. A polyhedron formed with connected identical cubes.
Input
The input consists of multiple datasets.
The number of datasets is at most 100.
Each dataset is in the following format.
n
k
s
x
1
y
1
z
1
...
x
n
y
n
z
n
In the first line of a dataset,
n
is the number of the candidate positions,
k
is the number of the cubes to form the connected polyhedron,
and
s
is the edge length of cubes.
n, k
and
s
are integers separated by a space.
The following
n
lines specify the
n
candidate positions.
In the
i
-th line, there are three integers
x
i
,
y
i
and
z
i
that specify the coordinates of a position,
where the corner of the cube with the smallest coordinate values
may be placed.
Edges of the cubes are to be aligned with either of three axes.
All the values of coordinates are integers separated by a space.
The three conditions on the candidate positions mentioned above are satisfied.
The parameters satisfy the following conditions:
1 ≤
k
≤
n
≤ 2000, 3 ≤
s
≤ 100, and
-4×10
7
≤
x
i
,
y
i
,
z
i
≤ 4×10
7
.
The end of the input is indicated by a line containing three zeros
separated by a space.
Output
For each dataset, output a single line containing one integer
indicating the surface area of the connected polyhedron with
the minimal surface area.
When no
k
cubes form a connected polyhedron, output -1.
Sample Input
1 1 100
100 100 100
6 4 10
100 100 100
106 102 102
112 110 104
104 116 102
100 114 104
92 107 100
10 4 10
-100 101 100
-108 102 120
-116 103 100
-124 100 100
-132 99 100
-92 98 100
-84 100 140
-76 103 100
-68 102 100
-60 101 100
10 4 10
100 100 100
108 101 100
116 102 100
124 100 100
132 102 100
200 100 103
192 100 102
184 100 101
176 100 100
168 100 103
4 4 10
100 100 100
108 94 100
1
...(truncated) | [
{
"submission_id": "aoj_1612_10578406",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nnamespace atcoder {\n\n// Implement (union by size) + (path compression)\n// Reference:\n// Zvi Galil and Giuseppe F. Italiano,\n// Data structures and algorithms for disjoint set union problems\nstruct... |
aoj_1611_cpp | Daruma Otoshi
You are playing a variant of a game called "Daruma Otoshi (Dharma Block Striking)".
At the start of a game, several wooden blocks of the same size but with varying weights
are stacked on top of each other, forming a tower.
Another block symbolizing Dharma is placed atop.
You have a wooden hammer with its head thicker than the height of a block,
but not twice that.
You can choose any two adjacent blocks, except Dharma on the top,
differing at most 1 in their weight,
and push both of them out of the stack with a single blow of your hammer.
The blocks above the removed ones then fall straight down,
without collapsing the tower.
You cannot hit a block pair with weight difference of 2 or more,
for that makes too hard to push out blocks while keeping the balance of the tower.
There is no chance in hitting three blocks out at a time,
for that would require superhuman accuracy.
The goal of the game is to remove as many blocks as you can.
Your task is to decide the number of blocks that can be removed
by repeating the blows in an optimal order.
Figure D1. Striking out two blocks at a time
In the above figure, with a stack of four blocks weighing 1, 2, 3, and
1, in this order from the bottom, you can hit middle
two blocks, weighing 2 and 3, out from the stack. The blocks above will
then fall down, and two blocks weighing 1 and the Dharma block will remain.
You can then push out the remaining pair of weight-1 blocks after that.
Input
The input consists of multiple datasets.
The number of datasets is at most 50.
Each dataset is in the following format.
n
w
1
w
2
…
w
n
n
is the number of blocks, except Dharma on the top.
n
is a positive integer not exceeding 300.
w
i
gives the weight of the
i
-th block counted from the bottom.
w
i
is an integer between 1 and 1000, inclusive.
The end of the input is indicated by a line containing a zero.
Output
For each dataset, output in a line the maximum number of blocks you can remove.
Sample Input
4
1 2 3 4
4
1 2 3 1
5
5 1 2 3 6
14
8 7 1 4 3 5 4 1 6 8 10 4 6 5
5
1 3 5 1 3
0
Output for the Sample Input
4
4
2
12
0 | [
{
"submission_id": "aoj_1611_11035458",
"code_snippet": "#include <iostream>\n#include <vector>\n\nusing namespace std;\n\n\nint main(){\n\n while(1){\n int n;\n cin >> n;\n if (n == 0) break;\n vector<int> w(n);\n for (int i=0; i<n; i++) cin >> w[i];\n\n vector<... |
aoj_1605_cpp | Bridge Construction Planning
There is a city consisting of many small islands, and the citizens live in these islands.
Citizens feel inconvenience in requiring ferry rides between these islands.
The city mayor decided to build bridges connecting all the islands.
The city has two construction companies, A and B.
The mayor requested these companies for proposals, and obtained proposals in the form:
"Company A (or B) can build a bridge between islands
u
and
v
in
w
hundred million yen."
The mayor wants to accept some of these proposals to make a plan with the lowest budget.
However, if the mayor accepts too many proposals of one company,
the other may go bankrupt, which is not desirable for the city with only two construction companies.
However, on the other hand, to avoid criticism on wasteful construction,
the mayor can only accept the minimum number (i.e.,
n
− 1) of bridges for connecting all the islands.
Thus, the mayor made a decision that exactly
k
proposals by the company A
and exactly
n
− 1 −
k
proposals by the company B should be accepted.
Your task is to write a program that computes the cost of the plan with the lowest budget that satisfies the constraints.
Here, the cost of a plan means the sum of all the costs mentioned in the accepted proposals.
Input
The input consists of multiple datasets.
The number of datasets is at most 30.
Each dataset is in the following format.
n
m
k
u
1
v
1
w
1
l
1
...
u
m
v
m
w
m
l
m
The first line contains three integers
n
,
m
, and
k
, where
n
is the number of islands,
m
is the total number of proposals,
and
k
is the number of proposals that are to be ordered to company A
(2 ≤
n
≤ 200, 1 ≤
m
≤ 600, and 0 ≤
k
≤
n
−1).
Islands are identified by integers, 1 through
n
.
The following
m
lines denote the proposals each of which is described with three integers
u
i
,
v
i
,
w
i
and one character
l
i
,
where
u
i
and
v
i
denote two bridged islands,
w
i
is the cost of the bridge (in hundred million yen),
and
l
i
is the name of the company that submits this proposal
(1 ≤
u
i
≤
n
, 1 ≤
v
i
≤
n
, 1 ≤
w
i
≤ 100, and
l
i
= 'A' or 'B').
You can assume that each bridge connects distinct islands, i.e.,
u
i
≠
v
i
,
and each company gives at most one proposal for each pair of islands, i.e., {
u
i
,
v
i
} ≠ {
u
j
,
v
j
} if
i
≠
j
and
l
i
=
l
j
.
The end of the input is indicated by a line with three zeros separated by single spaces.
Output
For each dataset, output a single line containing a single integer that
denotes the cost (in hundred million yen) of the plan with the lowest
budget.
If there are no plans that satisfy the constraints, output −1.
Sample Input
4 5 2
1 2 2 A
1 3 2 A
1 4 2 A
2 3 1 B
3 4 1 B
5 8 2
1 2 1 A
2 3 1 A
3 4 3 A
4 5 3 A
1 2 5 B
2 3 5 B
3 4 8 B
4 5 8 B
5 5 1
1 2 1 A
2 3 1 A
3 4 1 A
4 5 1 B
3 5 1 B
4 5 3
1 2 2 A
2 4 3 B
3 4 4 B
2 3 5 A
3 1 6 A
0 0 0
Output for the Sample Input
5
16
-1
-1 | [
{
"submission_id": "aoj_1605_10719736",
"code_snippet": "/*\n\nhttps://hitonanode.github.io/cplib-cpp/combinatorial_opt/test/matroid_intersection_dijkstra.aoj1605.test.cpp\n\nedit by noya2\n\n*/\n\n#line 1 \"combinatorial_opt/test/matroid_intersection_dijkstra.aoj1605.test.cpp\"\n#define PROBLEM \"https://j... |
aoj_1615_cpp | Gift Exchange Party
A gift exchange party will be held at a school in TKB City.
For every pair of students who are close friends, one gift must be given from one to the other at this party, but not the other way around.
It is decided in advance the gift directions, that is, which student of each pair receives a gift.
No other gift exchanges are made.
If each pair randomly decided the gift direction,
some might receive countless gifts, while some might receive only few or even none.
You'd like to decide the gift directions for all the friend pairs
that minimize the difference between the smallest and the largest numbers of gifts received by a student.
Find the smallest and the largest numbers of gifts received
when the difference between them is minimized.
When there is more than one way to realize that,
find the way that maximizes the smallest number of received gifts.
Input
The input consists of at most 10 datasets, each in the following format.
n
m
u
1
v
1
...
u
m
v
m
n
is the number of students, and
m
is the number of friendship relations (2 ≤
n
≤ 100, 1 ≤
m
≤
n
(
n
-1)/2).
Students are denoted by integers between 1 and
n
, inclusive.
The following
m
lines describe the friendship relations: for each
i
, student
u
i
and
v
i
are close friends (
u
i
<
v
i
).
The same friendship relations do not appear more than once.
The end of the input is indicated by a line containing two zeros.
Output
For each dataset, output a single line containing two integers
l
and
h
separated by a single space.
Here,
l
and
h
are the smallest and the largest numbers, respectively, of gifts received by a student.
Sample Input
3 3
1 2
2 3
1 3
4 3
1 2
1 3
1 4
4 6
1 2
1 3
1 4
2 3
3 4
2 4
0 0
Output for the Sample Input
1 1
0 1
1 2 | [
{
"submission_id": "aoj_1615_10945981",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\n#define FOR(i,k,n) for(int i = (int)(k); i < (int)(n); i++)\n#define REP(i,n) FOR(i,0,n)\n#define ALL(a) a.begin(), a.end()\n#define MS(m,v) memset(m,v,sizeof(m))\ntypedef long long ll;\ntypedef long dou... |
aoj_1613_cpp | Deciphering Characters
Image data which are left by a mysterious syndicate were discovered.
You are requested to analyze the data.
The syndicate members used characters invented independently.
A binary image corresponds to one character written in black ink on white paper.
Although you found many variant images that represent the same character,
you discovered that you can judge whether or not two images represent the same character with the surrounding relation of connected components. We present some definitions as follows. Here, we assume that white pixels fill outside of the given image.
White connected component
: A set of white pixels connected to each other horizontally or vertically (see below).
Black connected component
: A set of black pixels connected to each other horizontally, vertically, or diagonally (see below).
Connected component
: A white or a black connected component.
Background component
: The connected component including pixels outside of the image. Any white pixels on the periphery of the image are thus included in the background component.
connected
disconnected
connected
connected
Connectedness of white pixels
Connectedness of black pixels
Let
C
1
be a connected component in an image and
C
2
be another connected component in the same image with the opposite color.
Let's think of a modified image in which colors of all pixels not included in
C
1
nor
C
2
are changed to that of
C
2
. If neither
C
1
nor
C
2
is the background component, the color of the background component is changed to that of
C
2
. We say that
C
1
surrounds
C
2
in the original image when pixels in
C
2
are not included in the background component in the modified image. (see below)
Two images represent the same character if both of the following conditions are satisfied.
The two images have the same number of connected components.
Let
S
and
S'
be the sets of connected components of the two images. A bijective function
f
:
S → S'
satisfying the following conditions exists.
For each connected component
C
that belongs to
S
,
f
(
C
) has the same color as
C
.
For each of
C
1
and
C
2
belonging to
S
,
f
(
C
1
) surrounds
f
(
C
2
) if and only if
C
1
surrounds
C
2
.
Let's see an example. Connected components in the images of the figure below has the following surrounding relations.
C
1
surrounds
C
2
.
C
2
surrounds
C
3
.
C
2
surrounds
C
4
.
C'
1
surrounds
C'
2
.
C'
2
surrounds
C'
3
.
C'
2
surrounds
C'
4
.
A bijective function defined as
f
(
C
i
) =
C'
i
for each connected component satisfies the conditions stated above. Therefore, we can conclude that the two images represent the same character.
Make a program judging whether given two images represent the same character.
Input
The input consists of at most 200 datasets. The end of the input is represented by a line containing two zeros. Each dataset is formatted as follows.
image 1
image 2
Each image has the following format.
h
w
p
(1,1)
...
p
(1,
w
)
...
p
(
h
,1)
...
p
(
h
,
w
)
h
and
w
are the height an
...(truncated) | [
{
"submission_id": "aoj_1613_10867681",
"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_1618_cpp | A Garden with Ponds
Mr. Gardiner is a modern garden designer who is excellent at utilizing the terrain features.
His design method is unique: he first decides the location of ponds and design them with the terrain features intact.
According to his unique design procedure, all of his ponds are rectangular with simple aspect ratios.
First, Mr. Gardiner draws a regular grid on the map of the garden site so that the land is divided into cells of unit square, and annotates every cell with its elevation.
In his design method, a pond occupies a rectangular area consisting of a number of cells.
Each of its outermost cells has to be higher than all of its inner cells.
For instance, in the following grid map, in which numbers are elevations of cells, a pond can occupy the shaded area, where the outermost cells are shaded darker and the inner cells are shaded lighter.
You can easily see that the elevations of the outermost cells are at least three and those of the inner ones are at most two.
A rectangular area on which a pond is built must have at least one inner cell.
Therefore, both its width and depth are at least three.
When you pour water at an inner cell of a pond, the water can be kept in the pond until its level reaches that of the lowest outermost cells.
If you continue pouring, the water inevitably spills over.
Mr. Gardiner considers the larger
capacity
the pond has, the better it is.
Here, the capacity of a pond is the maximum amount of water it can keep.
For instance, when a pond is built on the shaded area in the above map, its capacity is (3 − 1) + (3 − 0) + (3 − 2) = 6, where 3 is the lowest elevation of the outermost cells and 1, 0, 2 are the elevations of the inner cells.
Your mission is to write a computer program that, given a grid map describing the elevation of each unit square cell, calculates the largest possible capacity of a pond built in the site.
Note that neither of the following rectangular areas can be a pond.
In the left one, the cell at the bottom right corner is not higher than the inner cell.
In the right one, the central cell is as high as the outermost cells.
Input
The input consists of at most 100 datasets, each in the following format.
d w
e
1, 1
...
e
1,
w
...
e
d
, 1
...
e
d, w
The first line contains
d
and
w
, representing the depth and the width, respectively, of the garden site described in the map.
They are positive integers between 3 and 10, inclusive.
Each of the following
d
lines contains
w
integers between 0 and 9, inclusive, separated by a space.
The
x
-th integer in the
y
-th line of the
d
lines is the elevation of the unit square cell with coordinates (
x, y
).
The end of the input is indicated by a line containing two zeros separated by a space.
Output
For each dataset, output a single line containing the largest possible capacity of a pond that can be built in the garden site described in the dataset.
If no ponds can be built, output a single line containing a zero.
Sample
...(truncated) | [
{
"submission_id": "aoj_1618_10542183",
"code_snippet": "#include<iostream>\n#include<cmath>\n#include<string>\n#include<vector>\n#include<algorithm>\n#include<tuple>\n#include<map>\n#include<queue>\n#include<set>\n#include<unordered_set>\n#include<stack>\n#include<deque>\n#include<bitset>\n#include<cassert... |
aoj_1624_cpp | Income Inequality
We often compute the average as the first step
in processing statistical data.
Yes, the average is a good tendency measure of data,
but it is not always the best.
In some cases, the average may hinder the understanding
of the data.
For example, consider the national income of a country.
As the term
income inequality
suggests,
a small number of people earn a good portion of the gross national income
in many countries.
In such cases, the average income computes much higher than the
income of the vast majority.
It is not appropriate to regard the average as the income of typical people.
Let us observe the above-mentioned phenomenon in some concrete data.
Incomes of
n
people,
a
1
, ... ,
a
n
, are given.
You are asked to write a program that reports the number of people
whose incomes are less than or equal to the average
(
a
1
+ ... +
a
n
) /
n
.
Input
The input consists of multiple datasets, each in the following format.
n
a
1
a
2
...
a
n
A dataset consists of two lines.
In the first line, the number of people
n
is given.
n
is an integer satisfying 2 ≤
n
≤ 10 000.
In the second line, incomes of
n
people are given.
a
i
(1 ≤
i
≤
n
) is the income
of the
i
-th person.
This value is an integer greater than or equal to 1 and
less than or equal to 100 000.
The end of the input is indicated by a line containing a zero.
The sum of
n
's of all the datasets does not exceed 50 000.
Output
For each dataset, output the number of people whose incomes are
less than or equal to the average.
Sample Input
7
15 15 15 15 15 15 15
4
10 20 30 60
10
1 1 1 1 1 1 1 1 1 100
7
90 90 90 90 90 90 10
7
2 7 1 8 2 8 4
0
Output for the Sample Input
7
3
9
1
4 | [
{
"submission_id": "aoj_1624_9210748",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\n\nint main(){\n vector<int>ans(0);\n while(true){\n double n;\n cin >> n;\n if(n==0){\n break;\n }\n vector<double>A(n);\n for(int i=0;i<n;i++){\n... |
aoj_1616_cpp | Taro's Shopping
Mammy decided to give Taro his first shopping experience.
Mammy tells him to choose any two items he wants from those
listed in the shopping catalogue,
but Taro cannot decide which two, as all the items look attractive.
Thus he plans to buy the pair of two items with
the highest price sum, not exceeding the amount Mammy allows.
As getting two of the same item is boring, he wants two different items.
You are asked to help Taro select the two items.
The price list for all of the items is given.
Among pairs of two items in the list,
find the pair with the highest price sum
not exceeding the allowed amount,
and report the sum.
Taro is buying two items, not one, nor three, nor more.
Note that, two or more items in the list may be priced equally.
Input
The input consists of multiple datasets, each in the following format.
n
m
a
1
a
2
...
a
n
A dataset consists of two lines.
In the first line, the number of items
n
and the maximum
payment allowed
m
are given.
n
is an integer satisfying 2 ≤
n
≤ 1000.
m
is an integer satisfying 2 ≤
m
≤ 2,000,000.
In the second line, prices of
n
items are given.
a
i
(1 ≤
i
≤
n
) is the price
of the
i
-th item.
This value is an integer greater than or equal to 1 and
less than or equal to 1,000,000.
The end of the input is indicated by a line containing two zeros.
The sum of
n
's of all the datasets does not exceed 50,000.
Output
For each dataset, find the pair with the highest price sum
not exceeding the allowed amount
m
and output the sum in a line.
If the price sum of every pair of items exceeds
m
,
output
NONE
instead.
Sample Input
3 45
10 20 30
6 10
1 2 5 8 9 11
7 100
11 34 83 47 59 29 70
4 100
80 70 60 50
4 20
10 5 10 16
0 0
Output for the Sample Input
40
10
99
NONE
20 | [
{
"submission_id": "aoj_1616_10840723",
"code_snippet": "#include <bits/stdc++.h>\nusing namespace std;\nusing ll = long long;\n\nint main(){\n while(true){\n int n, m;\n cin >> n >> m;\n if(!n) break;\n\n vector<int> price(n);\n for(auto& i:price) cin >> i;\n\n int ans = -1;\n\n for(i... |
aoj_1622_cpp | Go around the Labyrinth
Explorer Taro got a floor plan of a labyrinth.
The floor of this labyrinth is in the form of a two-dimensional grid.
Each of the cells on the floor plan corresponds to a room and is indicated whether it can be entered or not.
The labyrinth has only one entrance located at the northwest corner, which is upper left on the floor plan.
There is a treasure chest in each of the rooms at other three corners, southwest, southeast, and northeast.
To get a treasure chest, Taro must move onto the room where the treasure chest is placed.
Taro starts from the entrance room and repeats moving to one of the enterable adjacent rooms in the four directions, north, south, east, or west.
He wants to collect all the three treasure chests and come back to the entrance room.
A bad news for Taro is that, the labyrinth is quite dilapidated and even for its enterable rooms except for the entrance room, floors are so fragile that, once passed over, it will collapse and the room becomes not enterable.
Determine whether it is possible to collect all the treasure chests and return to the entrance.
Input
The input consists of at most 100 datasets, each in the following format.
N
M
c
1,1
...
c
1,
M
...
c
N
,1
...
c
N
,
M
The first line contains
N
, which is the number of rooms in the north-south direction, and
M
, which is the number of rooms in the east-west direction.
N
and
M
are integers satisfying 2 ≤
N
≤ 50 and 2 ≤
M
≤ 50.
Each of the following
N
lines contains a string of length
M
.
The
j
-th character
c
i,j
of the
i
-th string represents the state of the room (
i,j
),
i
-th from the northernmost and
j
-th from the westernmost;
the character is the period ('
.
') if the room is enterable and the number sign ('
#
') if the room is not enterable.
The entrance is located at (1,1), and the treasure chests are placed at (
N,
1), (
N,M
) and (1,
M
).
All of these four rooms are enterable.
Taro cannot go outside the given
N
×
M
rooms.
The end of the input is indicated by a line containing two zeros.
Output
For each dataset, output
YES
if it is possible to collect all the treasure chests and return to the entrance room, and otherwise, output
NO
in a single line.
Sample Input
3 3
...
.#.
...
5 5
..#..
.....
#....
.....
.....
3 8
..#.....
........
.....#..
3 5
..#..
.....
..#..
4 4
....
....
..##
..#.
0 0
Output for the Sample Input
YES
NO
YES
NO
NO | [
{
"submission_id": "aoj_1622_10703013",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std;\nconst int INF = 1e9;\n\ntemplate<typename flow>\nstruct max_flow {\n struct edge {\n int to;\n flow cap;\n int rev;\n };\n int V;\n vector<vector<edge> > G;\n vector<in... |
aoj_1619_cpp | Making Lunch Boxes
Taro has been hooked on making lunch boxes recently.
Taro has obtained a new lunch box recipe book today, and wants to try as many of the recipes listed in the book as possible.
Enough of the ingredients for all the recipes are at hand, but they all are in vacuum packs of two.
If only one of them is used leaving the other, the leftover will be rotten easily, but making two of the same recipe is not interesting.
Thus he decided to make a set of lunch boxes, each with different recipe, that wouldn't leave any unused ingredients.
Note that the book may include recipes for different lunch boxes made of the same set of ingredients.
How many lunch box recipes can Taro try today at most following his dogma?
Input
The input consists of at most 50 datasets, each in the following format.
n
m
b
1,1
...
b
1,
m
...
b
n,
1
...
b
n,m
The first line contains
n
, which is the number of recipes listed in the book, and
m
, which is the number of ingredients.
Both
n
and
m
are positive integers and satisfy 1 ≤
n
≤ 500, 1 ≤
m
≤ 500 and
1 ≤
n
×
m
≤ 500
.
The following
n
lines contain the information for each recipe with the string of length
m
consisting of 0 or 1.
b
i,j
implies whether the
i
-th recipe needs the
j
-th ingredient.
1 means the ingredient is needed for the recipe and 0 means not.
Each line contains at least one 1.
The end of the input is indicated by a line containing two zeros.
Output
For each dataset, output the maximum number of recipes Taro can try.
Sample Input
4 3
110
101
011
110
7 1
1
1
1
1
1
1
1
4 5
10000
01000
00100
00010
6 6
111111
011000
100000
000010
100001
100100
0 0
Output for the Sample Input
3
6
0
6 | [
{
"submission_id": "aoj_1619_10849110",
"code_snippet": "#include<cstdio>\n#include<iostream>\n#include<map>\n#include<vector>\n#include<string>\n#include<algorithm>\n\nusing namespace std;\n\nstring xx(string a, string b)\n{\n for(int i = 0; i < a.size(); i++)\n a[i] = (a[i]-'0')^(b[i]-'0')+'0';\... |
aoj_1620_cpp | Boolean Expression Compressor
You are asked to build a compressor for Boolean expressions
that transforms expressions to the shortest form keeping their meaning.
The grammar of the Boolean expressions has terminals
0
1
a
b
c
d
-
^
*
(
)
, start symbol <E> and the following production rule:
<E> ::=
0
|
1
|
a
|
b
|
c
|
d
|
-
<E> |
(
<E>
^
<E>
)
|
(
<E>
*
<E>
)
Letters
a
,
b
,
c
and
d
represent Boolean
variables that have values of either
0
or
1
.
Operators are evaluated as shown in the Table below.
In other words,
-
means negation (NOT),
^
means exclusive disjunction (XOR), and
*
means logical conjunction (AND).
Table: Evaluations of operators
Write a program that calculates the length of the shortest expression that
evaluates equal to the given expression with whatever values of the four variables.
For example,
0
, that is the first expression in the sample input,
cannot be shortened further.
Therefore the shortest length for this expression is 1.
For another example,
(a*(1*b))
, the second in the sample input,
always evaluates equal to
(a*b)
and
(b*a)
,
which are the shortest. The output for this expression, thus, should be
5
.
Input
The input consists of multiple datasets.
A dataset consists of one line, containing an expression
conforming to the grammar described above.
The length of the expression is less than or equal to 16 characters.
The end of the input is indicated by a line containing one
.
(period).
The number of datasets in the input is at most 200.
Output
For each dataset,
output a single line containing an integer which is the length of the
shortest expression that has the same value as the given expression for
all combinations of values in the variables.
Sample Input
0
(a*(1*b))
(1^a)
(-(-a*-b)*a)
(a^(b^(c^d)))
.
Output for the Sample Input
1
5
2
1
13 | [
{
"submission_id": "aoj_1620_10853829",
"code_snippet": "#include<cstdio>\n#include<algorithm>\n#include<vector>\n#include<queue>\n#include<map>\n#include<cstring>\nusing namespace std;\n\nconst int N = 16;\n\nchar S[N + 2];\nint T[N + 2], p;\nmap<char, int> M;\nconst char *al = \"abcd\";\nconst char *nu = ... |
aoj_1623_cpp | Equivalent Deformation
Two triangles
T
1
and
T
2
with the same area are on a plane.
Your task is to perform the following operation to
T
1
several times so that it is exactly superposed on
T
2
.
Here, vertices of
T
1
can be on any of the vertices of
T
2
.
Compute the minimum number of operations required to superpose
T
1
on
T
2
.
(Operation): Choose one vertex of the triangle and move it to an arbitrary point on a line passing through the vertex and parallel to the opposite side.
An operation example
The following figure shows a possible sequence of the operations for the first dataset of the sample input.
Input
The input consists of at most 2000 datasets, each in the following format.
x
11
y
11
x
12
y
12
x
13
y
13
x
21
y
21
x
22
y
22
x
23
y
23
x
ij
and
y
ij
are the
x-
and
y-
coordinate of the
j
-th vertex of
T
i
.
The following holds for the dataset.
All the coordinate values are integers with at most 1000 of absolute values.
T
1
and
T
2
have the same positive area size.
The given six vertices are all distinct points.
An empty line is placed between datasets.
The end of the input is indicated by EOF.
Output
For each dataset, output the minimum number of operations required in one line.
If five or more operations are required, output
Many
instead.
Note that, vertices may have non-integral values after they are moved.
You can prove that, for any input satisfying the above constraints, the number of operations required is bounded by some constant.
Sample Input
0 1
2 2
1 0
1 3
5 2
4 3
0 0
0 1
1 0
0 3
0 2
1 -1
-5 -4
0 1
0 15
-10 14
-5 10
0 -8
-110 221
-731 525
-555 -258
511 -83
-1000 -737
66 -562
533 -45
-525 -450
-282 -667
-439 823
-196 606
-768 -233
0 0
0 1
1 0
99 1
100 1
55 2
354 -289
89 -79
256 -166
131 -196
-774 -809
-519 -623
-990 688
-38 601
-360 712
384 759
-241 140
-59 196
629 -591
360 -847
936 -265
109 -990
-456 -913
-787 -884
-1000 -1000
-999 -999
-1000 -998
1000 1000
999 999
1000 998
-386 -83
404 -83
-408 -117
-162 -348
128 -88
296 -30
-521 -245
-613 -250
797 451
-642 239
646 309
-907 180
-909 -544
-394 10
-296 260
-833 268
-875 882
-907 -423
Output for the Sample Input
4
3
3
3
3
4
4
4
4
Many
Many
Many
Many | [
{
"submission_id": "aoj_1623_9769018",
"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)... |
aoj_1625_cpp | Origami, or the art of folding paper
Master Grus is a famous
origami
(paper folding) artist, who is
enthusiastic about exploring the possibility of origami art.
For future creation, he is now planning fundamental
experiments to establish the general theory of origami.
One rectangular piece of paper is used in each of his experiments.
He folds it horizontally and/or vertically several times and then
punches through holes in the folded paper.
The following figure illustrates the folding process of a simple experiment,
which corresponds to the third dataset of the Sample Input below.
Folding the 10 × 8 rectangular piece of paper shown at top left
three times results in the 6 × 6 square shape shown at
bottom left.
In the figure, dashed lines indicate the locations to fold the paper
and round arrows indicate the directions of folding.
Grid lines are shown as solid lines to tell the sizes of rectangular
shapes and the exact locations of folding.
Color densities represent the numbers of overlapping layers.
Punching through holes at A and B in the folded paper makes
nine holes in the paper, eight at A and another at B.
Your mission in this problem is to write a computer program to count
the number of holes in the paper, given the information on a rectangular
piece of paper and folding and punching instructions.
Input
The input consists of at most 1000 datasets, each in the following format.
n
m
t
p
d
1
c
1
...
d
t
c
t
x
1
y
1
...
x
p
y
p
n
and
m
are the width and the height, respectively, of
a rectangular piece of paper.
They are positive integers at most 32.
t
and
p
are the numbers of folding and punching
instructions, respectively.
They are positive integers at most 20.
The pair of
d
i
and
c
i
gives the
i
-th folding instruction as follows:
d
i
is either 1 or 2.
c
i
is a positive integer.
If
d
i
is 1, the left-hand side of the vertical folding line that passes at
c
i
right to the left boundary is folded onto the right-hand side.
If
d
i
is 2, the lower side of the horizontal folding line that passes at
c
i
above the lower boundary is folded onto the upper side.
After performing the first
i
−1 folding instructions, if
d
i
is 1, the width of the shape is greater than
c
i
.
Otherwise the height is greater than
c
i
.
(
x
i
+ 1/2,
y
i
+ 1/2) gives the coordinates of
the point where the
i
-th punching instruction is performed.
The origin (0, 0) is at the bottom left of the finally obtained shape.
x
i
and
y
i
are both non-negative integers and they are less than the width and the height, respectively, of the shape.
You can assume that no two punching instructions punch holes at the same location.
The end of the input is indicated by a line containing four zeros.
Output
For each dataset, output
p
lines, the
i
-th of which contains
the number of holes punched in the paper by the
i
-th punching instruction.
Sample Input
2 1 1 1
1 1
0 0
1 3 2 1
2 1
2 1
0 0
10 8 3 2
2 2
1 3
1 1
0 1
3 4
3 3 3 2
1 2
2 1
1 1
0 1
0 0
0 0 0 0
Output for the Sample Input
2
3
8
1
3
6 | [
{
"submission_id": "aoj_1625_10854025",
"code_snippet": "#include <iostream>\n#include <cstring>\n#define ll long long\n#define N 100000\n\nusing namespace std;\n\nint g[600][600], dx, dy;\n\nint main(void) {\n#ifdef _DEBUG\n\tfreopen(\"1.in\", \"r\", stdin);\n#else \n\tios::sync_with_stdio(0); cin.tie(0); ... |
aoj_1628_cpp | Floating-Point Numbers
In this problem, we consider floating-point number formats, data representation formats to approximate real numbers on computers.
Scientific notation is a method to express a number, frequently used for
numbers too large or too small to be written tersely in usual decimal form.
In scientific notation, all numbers are written in the form
m
× 10
e
.
Here,
m
(called
significand
) is a number
greater than or equal to 1 and less than 10,
and
e
(called
exponent
) is an integer.
For example, a number 13.5 is equal to 1.35 × 10
1
,
so we can express it in scientific notation with significand 1.35 and exponent 1.
As binary number representation is convenient on computers,
let's consider
binary scientific notation
with base two, instead of ten.
In binary scientific notation, all numbers are written in the form
m
× 2
e
.
Since the base is two,
m
is limited to be less than 2.
For example, 13.5 is equal to 1.6875 × 2
3
,
so we can express it in binary scientific notation
with significand 1.6875 and exponent 3.
The significand 1.6875 is equal to 1 + 1/2 + 1/8 + 1/16,
which is 1.1011
2
in binary notation.
Similarly, the exponent 3 can be expressed as 11
2
in binary notation.
A floating-point number expresses a number in binary scientific notation in finite number of bits.
Although the accuracy of the significand and the range of the exponent are limited by the number of bits, we can express numbers in a wide range with reasonably high accuracy.
In this problem, we consider a 64-bit floating-point number format,
simplified from one actually used widely,
in which only those numbers greater than or equal to 1 can be expressed.
Here, the first 12 bits are used for the exponent and the remaining 52 bits for the significand.
Let's denote the 64 bits of a floating-point number by
b
64
...
b
1
.
With
e
an unsigned binary integer
(
b
64
...
b
53
)
2
,
and with
m
a binary fraction represented by the remaining 52 bits
plus one (1.
b
52
...
b
1
)
2
,
the floating-point number represents the number
m
× 2
e
.
We show below the bit string of the representation of 13.5 in the format described above.
In floating-point addition operations, the results have to be approximated by numbers representable in floating-point format.
Here, we assume that the approximation is by truncation.
When the sum of two floating-point numbers
a
and
b
is expressed in binary scientific notation as
a
+
b
=
m
× 2
e
(1 ≤
m
< 2, 0 ≤
e
< 2
12
),
the result of addition operation on them will be a floating-point number with its first 12 bits representing
e
as an unsigned integer
and the remaining 52 bits representing the first 52 bits of the binary fraction of
m
.
A disadvantage of this approximation method is that the approximation error accumulates easily.
To verify this, let's make an experiment of adding a floating-point number many times, as in the pseudocode shown below.
Here,
s
and
a
are floating-point numbers, and the results of individual addition are approximated as describ
...(truncated) | [
{
"submission_id": "aoj_1628_10670479",
"code_snippet": "//#pragma GCC optimize(\"O3\")\n#include<bits/stdc++.h>\nusing namespace std;\n#define ll long long\n#define rep(i,n) for (ll i=0;i<(ll)n;i++)\n#define rrep(i,n) for (ll i=n-1;i>=(ll)0;i--)\n#define loop(i,m,n) for(ll i=m;i<=(ll)n;i++)\n#define rloop(... |
aoj_1627_cpp | Playoff by all the teams
The Minato Mirai Football Association hosts its annual championship
as a single round-robin tournament,
in which each team plays a single match against all the others.
Unlike many other round-robin tournaments of football,
matches never result in a draw in this tournament.
When the regular time match is a tie,
overtime is played, and, when it is a tie again,
a penalty shootout is played to decide the winner.
If two or more teams won the most number of matches in the round-robin,
a playoff is conducted among them to decide the champion.
However, if the number of teams is an odd number,
it is possible that all the teams may have
the same number of wins and losses,
in which case all the teams participate in the playoff,
called a "full playoff" here.
Now, some of the tournament matches have already been played and we know
their results.
Whether or not a full playoff will be required may
depend on the results of the remaining matches.
Write a program that computes the number of win/loss combination patterns
of the remaining matches that lead to a full playoff.
The first datatset of the Sample Input represents the results of the
first three matches in a round-robin tournament of five teams, shown
in the following table.
In the table, gray cells indicate the matches not played yet.
Team
1
Team
2
Team
3
Team
4
Team
5
Team
1
lost
lost
Team
2
lost
Team
3
won
Team
4
won
Team
5
won
In this case,
all the teams win the same number of matches
with only two win/loss combination patterns
of the remaining matches,
which lead to a full playoff,
as shown below.
In the two tables, the differences are indicated in light yellow.
Team
1
Team
2
Team
3
Team
4
Team
5
Team
1
won
won
lost
lost
Team
2
lost
lost
won
won
Team
3
lost
won
won
lost
Team
4
won
lost
lost
won
Team
5
won
lost
won
lost
Team
1
Team
2
Team
3
Team
4
Team
5
Team
1
won
won
lost
lost
Team
2
lost
lost
won
won
Team
3
lost
won
lost
won
Team
4
won
lost
won
lost
Team
5
won
lost
lost
won
Input
The input consists of multiple datasets, each in the following format.
n
m
x
1
y
1
...
x
m
y
m
n
is an odd integer, 3, 5, 7, or 9,
indicating the number of teams participating in the tournament.
m
is a positive integer less than
n
(
n
−1)/2,
which is the number of matches already finished.
x
i
and
y
i
give
the result of the
i
-th match that has already taken place,
indicating that team
x
i
defeated team
y
i
.
Each of
x
i
and
y
i
is an integer 1 through
n
which indicates the team number.
No team plays against itself, that is, for any
i
,
x
i
≠
y
i
.
The match result of the same team pair appears at most once.
That is, if
i
≠
j
,
then
(
x
i
,
y
i
) ≠
(
x
j
,
y
j
) and
(
x
i
,
y
i
) ≠
(
y
j
,
x
j
) hold.
The end of the input is indicated by a line containing a zero.
The number of datasets does not exceed 100.
Output
For each dataset, output a single line containing one integer
which indicates the number of possible future win/loss patterns
that a full playoff will be required.
Sample Input
5
...(truncated) | [
{
"submission_id": "aoj_1627_10848400",
"code_snippet": "#include<iostream>\n#include<cstring>\n#include<cstdio>\nusing namespace std;\nint n,m;\nint sum;\nint x,y;\nint a[100][100];\nint cnt[100];\nvoid show()\n{\n\tfor(int i=1;i<=n;i++)\n\t{\n\t\tfor(int j=1;j<=n;j++)\n\t\tif(a[i][j]==-1) cout<<\"* \";els... |
aoj_1626_cpp | Skyscraper "MinatoHarukas"
Mr. Port plans to start a new business renting one or more floors
of the new skyscraper with one giga floors, MinatoHarukas.
He wants to rent as many vertically adjacent floors as possible,
because he wants to show advertisement on as many vertically
adjacent windows as possible.
The rent for one floor is proportional to the floor number,
that is, the rent per month for the
n
-th floor is
n
times
that of the first floor.
Here, the ground floor is called the first floor in the American style,
and basement floors are out of consideration for the renting.
In order to help Mr. Port, you should write a program that computes
the vertically adjacent floors satisfying his requirement and
whose total rental cost per month is
exactly equal
to his budget.
For example, when his budget is 15 units,
with one unit being the rent of the first floor,
there are four possible rent plans,
1+2+3+4+5, 4+5+6, 7+8, and 15.
For all of them, the sums are equal to 15.
Of course in this example the rent of maximal number of the floors
is that of 1+2+3+4+5, that is, the rent from the first floor to the fifth floor.
Input
The input consists of multiple datasets,
each in the following format.
b
A dataset consists of one line,
the budget of Mr. Port
b
as multiples of the rent of the first floor.
b
is a positive integer satisfying 1 <
b
< 10
9
.
The end of the input is indicated by a line containing a zero.
The number of datasets does not exceed 1000.
Output
For each dataset, output a single line containing two positive integers
representing the plan with the maximal number of vertically adjacent floors
with its rent price exactly equal to the budget of Mr. Port.
The first should be the lowest floor number and
the second should be the number of floors.
Sample Input
15
16
2
3
9699690
223092870
847288609
900660121
987698769
999999999
0
Output for the Sample Input
1 5
16 1
2 1
1 2
16 4389
129 20995
4112949 206
15006 30011
46887 17718
163837 5994 | [
{
"submission_id": "aoj_1626_10867577",
"code_snippet": "#include<bits/stdc++.h>\nusing namespace std ;\nint ans , p , n ;\nvoid deal( int x ){\n if ( ( n / x ) % 2 == 1 ){\n int y = x - ( n / x ) / 2 ;\n if ( y > 0 ){\n if ( n / x > ans ){\n ans = n / x ;\n ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.